scispace - formally typeset
Proceedings ArticleDOI

Adaptive protocols for information dissemination in wireless sensor networks

TLDR
It is found that the SPIN protocols can deliver 60% more data for a given amount of energy than conventional approaches, and that, in terms of dissemination rate and energy usage, the SPlN protocols perform close to the theoretical optimum.
Abstract
In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that efficiently disseminates information among sensors in an energy-constrained wireless sensor network. Nodes running a SPIN communication protocol name their data using high-level data descriptors, called meta-data. They use meta-data negotiations to eliminate the transmission of redundant data throughout the network. In addition, SPIN nodes can base their communication decisions both upon application-specific knowledge of the data and upon knowledge of the resources that are available to them. This allows the sensors to efficiently distribute data given a limited energy supply. We simulate and analyze the performance of two specific SPIN protocols, comparing them to other possible approaches and a theoretically optimal protocol. We find that the SPIN protocols can deliver 60% more data for a given amount of energy than conventional approaches. We also find that, in terms of dissemination rate and energy usage, the SPlN protocols perform close to the theoretical optimum.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Routing protocols for sensor networks

TL;DR: A comparison of MANETs and sensor networks reveals the important features that need to be taken into consideration while designing and evaluating new routing protocols for sensor networks.
Proceedings ArticleDOI

Region streams: functional macroprogramming for sensor networks

TL;DR: It is argued that sensor networks should be programmed at the global level, allowing the compiler to automatically generate nodal behaviors from a high-level specification of the network's global behavior.
Journal ArticleDOI

Routing Protocols in Wireless Sensor Networks

TL;DR: This paper presents a review of the main routing protocols proposed for wireless sensor networks and includes the efforts carried out by Spanish universities on developing optimization techniques in the area of routing protocols for wireless Sensor networks.
Proceedings ArticleDOI

When peer-to-peer comes face-to-face: collaborative peer-to-peer computing in mobile ad-hoc networks

TL;DR: This paper motivates and describes the notion of mobile ad-hoc information systems, a decentralized and self-organizing network of autonomous, mobile devices that interact as peers that has successfully been used as instructional tool in an advanced software engineering course on peer-to-peer computing.
Proceedings ArticleDOI

An epidemic model for information diffusion in MANETs

TL;DR: The analytical model allows the evaluation at runtime, even on devices with restricted resources, and thus enables mobile nodes to dynamically adapt their diffusion strategies depending on the local node density.
References
More filters
Proceedings ArticleDOI

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Proceedings ArticleDOI

A performance comparison of multi-hop wireless ad hoc network routing protocols

TL;DR: The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.
Proceedings ArticleDOI

A highly adaptive distributed routing algorithm for mobile wireless networks

TL;DR: The proposed protocol is a new distributed routing protocol for mobile, multihop, wireless networks that is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks.
Proceedings ArticleDOI

Epidemic algorithms for replicated database maintenance

TL;DR: This paper descrikrs several randomized algorit, hms for dist,rihut.ing updates and driving t,he replicas toward consist,c>nc,y.
Journal ArticleDOI

Multicast routing in datagram internetworks and extended LANs

TL;DR: In this paper, the authors specify extensions to two common internetwork routing algorithms (distancevector routing and link-state routing) to support low-delay datagram multicasting beyond a single LAN, and discuss how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up to large internetworks.
Related Papers (5)