scispace - formally typeset
Proceedings ArticleDOI

Adaptive protocols for information dissemination in wireless sensor networks

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

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

A Weighted Clustering Algorithm Based Routing Protocol in Wireless Sensor Networks

TL;DR: This paper entirely analyzes state clustering protocol and LEACH routing protocol, then presents a novel clustering routing protocol for wireless sensor networks, which elects clusters by using weighted clustering algorithm, and simulations are given.
Proceedings ArticleDOI

Energy Aware Reliable Routing Protocol for Mobile Ad Hoc Networks

TL;DR: Simulation results verified that EARR can improve the network performance in terms of average route discovery time, normalized routing load, as well distribution of energy consumption, and is more robust to energy estimation error than existing methods.
Journal ArticleDOI

The Sectoral Sweeper Scheme for Wireless Sensor Networks: Adaptive Antenna Array Based Sensor Node Management and Location Estimation

TL;DR: The proposed scheme is shown to reduce the number of sensing nodes and the amount of data traffic in the network, thus leading to considerable savings in energy consumption and prolonged sensor lifetime.
Proceedings ArticleDOI

Energy Aware Distance Vector Routing Scheme for Data Centric Low Power Wireless Sensor Networks

TL;DR: EADV is based on a simple algorithmic approach to cater for low memory space and low energy available on sensor nodes, inspired from a set of routing protocols including AODV, DSDV, and energy aware routing.
Journal ArticleDOI

A survey of adaptive services to cope with dynamics in wireless self-organizing networks

TL;DR: In this article, the authors consider different types of wireless networks that benefit from and, in certain cases, require self-organization and survey several adaptive services proposed to handle these challenges.
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

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

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.
Related Papers (5)