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
Energy Efficient and Reliable Routing Scheme for Wireless Sensor Networks
TL;DR: A new routing scheme for Wireless Sensor Networks is presented, in which routing is based on Radio-aware Metric, which contains radio information at the Medium Access Control (MAC) layer, which is almost 4.3 times more efficient in terms of energy consumption and 2.6 times more reliable interms of data delivery.
Proceedings ArticleDOI
An Energy-Aware Adaptive Clustering Protocol for Sensor Networks
Apoorv Garg,M. Hanmandlu +1 more
TL;DR: A new communication protocol for sensor networks is presented which is based on and is an enhancement over the LEACH protocol, based on adaptive clustering of the sensor nodes, the nodes with the maximum amount of residual energies being selected as the cluster-heads.
Book ChapterDOI
Survey on Data Routing in Wireless Sensor Networks
TL;DR: This chapter will explore goal and data-oriented routing mechanisms for sensor networks developed in recent years to help better understanding current routing protocols for wireless sensor networks and point out open issues that should be subject to further research.
Proceedings ArticleDOI
FOG: Fairness in mobile opportunistic networking
TL;DR: A real-trace driven approach to study and analyze the tradeoff between the efficiency and fairness of rank-based forwarding techniques in mobile opportunistic networks and proposes FOG, a real-time distributed framework to ensure efficiency-fairness tradeoff using local information.
Journal ArticleDOI
A route selection approach for variable data transmission in wireless sensor networks
TL;DR: The proposed route selection approach, VDR, (Variable Data rate Routing) has been simulated with both proactive and reactive route maintenance strategies and results show that the proposed algorithm is scalable and performs better than the compared algorithms both at low node density and high 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
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.