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
Journal ArticleDOI

Optimal information extraction in energy-limited wireless sensor networks

TL;DR: The need for a complementary formal methodology is addressed by developing nonlinear optimization models of static WSN that yield fundamental performance bounds and optimal designs that can handle data aggregation, interference, and even node mobility.
Journal ArticleDOI

Energy‐efficient wireless networking for multimedia applications

TL;DR: This paper identifies the most prominent problems of wireless multimedia networking and presents several state-of-the-art solutions with a focus on energy efficiency and identifies two main principles to solve these problems.
Proceedings ArticleDOI

Exploring the Energy-Latency Trade-Off for Broadcasts in Energy-Saving Sensor Networks

TL;DR: This paper explores the energy-latency-reliability trade-off for broadcast in multi-hop WSNs, by presenting a new protocol called PBBF (probability-based broadcast forwarding), which works at the MAC layer and can be integrated into any sleep scheduling protocol.
Journal ArticleDOI

Adaptive data aggregation scheme in clustered wireless sensor networks

TL;DR: An adaptive data aggregation (ADA) scheme for clustered WSNs is proposed and performance results show that the scheme state converges to the desired reliability starting from any initial state.
Proceedings ArticleDOI

SAFE: a data dissemination protocol for periodic updates in sensor networks

TL;DR: This paper proposes a protocol called SAFE (sinks accessing data from environments) which attempts to save energy through data dissemination path sharing among multiple data sinks, and simulation results show that the proposed protocol is energy-efficient as well as scalable to a large data sink population.
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)