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
Journal ArticleDOI
Topology-Independent Distributed Adaptive Node-Specific Signal Estimation in Wireless Sensor Networks
TL;DR: A method is proposed for this in-network summation via a data-driven signal flow that takes place on a tree, where the topology of the tree may change in each iteration, which makes the algorithm less sensitive to link failures and applicable to WSNs with dynamic topologies.
Journal ArticleDOI
Self-organization in an agent network: A mechanism and a potential application
TL;DR: A composite self-organization mechanism in an agent network that enables agents to dynamically adapt relations with other agents, i.e., to change the underlying network structure, so as to achieve efficient task allocation is proposed.
Proceedings ArticleDOI
A New Approach for Energy-Balanced Data Aggregation in Wireless Sensor Networks
TL;DR: A new energy balanced and efficient data aggregation scheme for WSNs, called designated path (DP) scheme, which is more energy efficient and it can prolong the life time of the network than the existing schemes directed diffusion (DD) and hierarchical data aggregation (HDA).
Journal ArticleDOI
Dynamic multi-objective routing algorithm: a multi-objective routing algorithm for the simple hybrid routing protocol on wireless sensor networks
TL;DR: The performance of SHRP with DyMORA proved to have closed performance to the original SHRP protocol and in many cases superior performance, despite the use of a more complex election algorithm.
Journal ArticleDOI
A topology discovery algorithm for sensor network using smart antennas
Ahmed M. Khedr,Walid Osamy +1 more
TL;DR: This paper presents an on demand algorithm to discover the sensor network topology, where the node that receives the topology request collects all topology related information from each node in the network and constructs link information databases.
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.