Proceedings ArticleDOI
Adaptive protocols for information dissemination in wireless sensor networks
Wendi Rabiner Heinzelman,Joanna Kulik,Hari Balakrishnan +2 more
- pp 174-185
Reads0
Chats0
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
Approximating sensor network queries using in-network summaries
TL;DR: This work uses a model-based approach that constructs and maintains a spanning tree within the network, rooted at the basestation, based on a formal model of the in-network tree construction task framed as an optimization problem.
Proceedings ArticleDOI
A protocol for data dissemination in frequently partitioned mobile ad hoc networks
TL;DR: A novel approach is presented which is based on a negotiation scheme enhanced by an adaptive repetition strategy which shows a reduction of data transfer volume compared to hyper-flooding by 30% to 40% even in the presence of frequent network partitions.
On the nature of Inter-Vehicle Communication
TL;DR: It is argued that applications for the communication between vehicles do not require the functionality typically offered by mobile ad-hoc-networks or wireless sensor networks, and the name Vehicular Ad-Hoc Network (VANET) is a misnomer leading practitioners and researchers astray.
Journal ArticleDOI
A Self-selection Technique for Flooding and Routing in Wireless Ad-hoc Networks
TL;DR: This paper describes an algorithm, called self-selection, which takes advantage of broadcast communication to efficiently implement the basic operation of selecting a node possessing some desired properties among all the neighbors of the requestor.
Proceedings ArticleDOI
Fault-Intrusion Tolerant Techniques in Wireless Sensor Networks
TL;DR: This paper studies state-of-the-art fault tolerance and intrusion tolerance techniques for WSN and proposes a new fault-intrusion tolerant routing mechanism called MVMP (multi-version multi-path) for W SN that will support highly reliable and secure sensor networks.
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.