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
Distributed spatial data aggregation and dilution based on hashing and relational algebra in wireless sensor networks
E. Cayirci,T. Coplu +1 more
TL;DR: A data aggregation and dilution scheme is introduced for the wireless sensor network, which can be perceived as a distributed relational database and can reduce the number of transmitted packets 50% on average compared to the case where aggregation or dilution is not used.
Journal ArticleDOI
An Energy-Aware Multipath Routing Algorithm in Wireless Sensor Networks
Moonseong Kim,Eui-Hoon Jeong,Young-Cheol Bang,Soyoung Hwang,Chang-Sub Shin,Gwang-Ja Jin,Bong Soo Kim +6 more
TL;DR: The proposed algorithm, the Energy-aware Multipath Routing Algorithm (EMRA), adjusts traffic flows via a novel load balancing scheme and has a higher average node energy efficiency, lower control overhead, and a shorter average delay than those of well-known previous works.
Proceedings ArticleDOI
An Energy Efficient Chain-Based Clustering Routing Protocol for Wireless Sensor Networks
TL;DR: Simulation results show that the proposed routing scheme significantly reduces energy consumption and increases the lifetime of sensor network compared to other hierarchical routing schemes such as Low-Energy Adaptive Clustering Hierarchy (LEACH) and Power-Efficient Gathering in Sensor Information System (PEGASIS).
Journal ArticleDOI
Localization-free and energy-efficient hole bypassing techniques for fault-tolerant sensor networks
TL;DR: Two localization-free and energy-efficient algorithms are proposed for bypassing the holes formed by group collapse, realized that when holes are modeled with clusters, hole bypassing can be solved by cluster bypassing.
Journal ArticleDOI
A proposal of a wireless sensor network routing protocol
TL;DR: This paper presents a proposal of a routing protocol to Wireless Sensor Networks, called SHRP (Simple Hierarchical Routing Protocol), whose primary objective is to save battery energy and also provides both reliability and a load balance solution.
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.