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
Journal ArticleDOI
New Trends in Secure Routing Protocols for Wireless Sensor Networks
Aly Mohamed El-Semary,Aly Mohamed El-Semary,Mohamed Mostafa Abdel-Azim,Mohamed Mostafa Abdel-Azim +3 more
TL;DR: The state of the art on routing protocols related to WSNs is surveyed and the security issues or problems associated with the current protocols are presented as well as the future trends and open research issues on secure routing protocols of W SNs are discussed.
Distance-Sensitive Routing and Information Brokerage in Sensor Networks
TL;DR: The notion of distance-sensitive information brokerage is introduced and schemes for efficiently bringing together information producers and consumers at a cost proportional to the separation between them are provided—even though the consumers do not know the locations of the producers they seek.
Proceedings ArticleDOI
FTEP: A fault tolerant election protocol for multi-level clustering in homogeneous wireless sensor networks
TL;DR: This paper proposes a dynamic and distributed new cluster head election algorithm with fault tolerance capabilities based upon two-level clustering scheme and results show significant energy savings when compared with other clustering schemes like energy efficient multi- level clustering (EEMC).
Proceedings ArticleDOI
A Power Efficient Algorithm for Data Gathering from Wireless Water Meter Networks
A. Wesnarat,Y. Tipsuwan +1 more
TL;DR: This algorithm uses a new approach to generate trees in order to distribute loads of root nodes to achieve a longer network lifetime and could yield better performances than a classical minimum spanning tree algorithm used in some existing algorithms.
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.