scispace - formally typeset
Proceedings ArticleDOI

Adaptive protocols for information dissemination in wireless sensor networks

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

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Approximate distributed Kalman filtering in sensor networks with quantifiable performance

TL;DR: A frequency-domain characterization of the distributed estimator's steady-state performance is quantified in terms of a special matrix associated with the connection topology called the graph Laplacian, and also the rate of message exchange between immediate neighbors in the communication network.
Journal ArticleDOI

AIDA: Adaptive application-independent data aggregation in wireless sensor networks

TL;DR: This work takes advantage of queuing delay and the broadcast nature of wireless communication to concatenate network units into an aggregate using a novel adaptive feedback scheme to schedule the delivery of this aggregate to the MAC layer for transmission.

Wireless Sensor Networks

TL;DR: The architecture of wireless sensor network is briefly introduced, some valuable applications are explained and forecasted, and the hot spots including power-aware routing and media access control schemes are discussed and presented in detail.
Proceedings ArticleDOI

MR-LEACH: Multi-hop Routing with Low Energy Adaptive Clustering Hierarchy

TL;DR: Performance evaluation has shown that MR-LEACH achieves significant improvement in the LEACH protocol and provides energy efficient routing for WSN.
Journal ArticleDOI

Bidding Protocols for Deploying Mobile Sensors

TL;DR: Two bidding protocols are designed to guide the movement of mobile sensors in such sensor networks to increase the coverage to a desirable level and achieve suitable trade-off between coverage and sensor cost.
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)