Proceedings ArticleDOI
Adaptive protocols for information dissemination in wireless sensor networks
Wendi Rabiner Heinzelman,Joanna Kulik,Hari Balakrishnan +2 more
- pp 174-185
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
Citations
More filters
Proceedings ArticleDOI
uSense: A Unified Asymmetric Sensing Coverage Architecture for Wireless Sensor Networks
TL;DR: A unified sensing coverage architecture, called uSense, which features three novel ideas: asymmetric architecture, generic switching and global scheduling, which indicates that uSense is a promising architecture to support flexible and efficient coverage in sensor networks.
Proceedings ArticleDOI
A flat routing protocol for sensor networks
TL;DR: In this paper, a flat routing protocol for WSNs is proposed, where routes from the source to the destination are determined by using only the hop count and remaining energy of the neighbor nodes for each node.
Book ChapterDOI
Georouting and Delta-Gathering: Efficient Data Propagation Techniques for GeoSensor Networks
TL;DR: This work considers the issue of query and data propagation i the context of geosensor networks over geo-aware sensors, and presents sensor terrains as a preferable alternative to isoline-based visualization ( contour maps ) for this problem.
Journal ArticleDOI
Software agent-based directed diffusion in wireless sensor network
TL;DR: This work unmitigated its efforts to augment the node lifetime within a sensor network by introducing mobile agents and presents the experimental results.
Journal Article
The Reliability Performance of Wireless Sensor Networks Configured by Power-Law and Other Forms of Stochastic Node Placement
Mika Ishizuka,Masaki Aida +1 more
TL;DR: How fault tolerance can be improved by stochastic node place-ment that produces scale-free characteristics, that is, where the degree of the nodes follows a power law is examined.
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
V.D. Park,M.S. Corson +1 more
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
Alan J. Demers,Daniel H. Greene,Carl Hauser,Wes Irish,John Larson,Scott Shenker,Howard E. Sturgis,Dan Swinehart,Douglas B. Terry +8 more
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.