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

A novel gossip-based sensing coverage algorithm for dense wireless sensor networks

TL;DR: This paper defines a maximum sensing coverage region (MSCR) problem and presents a novel gossip-based sensing-coverage-aware algorithm, which is applied to improve LEACH, a clustering routing protocol for WSNs, and develops a simulation to evaluate the performance of the algorithm.
Proceedings ArticleDOI

Using Hierarchical Agglomerative Clustering in Wireless Sensor Networks: An Energy-Efficient and Flexible Approach

TL;DR: The well-understood hierarchical agglomerative clustering algorithm is adapted by proposing a distributed HAC (DHAC) algorithm, which provides a bottom-up clustering approach by grouping similar nodes together before the cluster head is selected.
Proceedings ArticleDOI

A mobility gateway for small-device networks

TL;DR: This work introduces the mobility gateway which performs MIP processing on behalf of registered devices, and investigates the potential savings offered by this technique in terms of bandwidth and power.
Journal ArticleDOI

A hierarchical clustering-based routing protocol for wireless sensor networks supporting multiple data aggregation qualities

TL;DR: This paper proposes a routing protocol, called the Clustering-Based Expanding Ring Routing Protocol (CBERRP), which mainly focuses on the network layer while integrating factors from other layers to gain the preferred performance.
Proceedings ArticleDOI

A prototype for achieving digital forensic readiness on wireless sensor networks

TL;DR: Demonstrations of a working prototype are provided to show that a digital forensic readiness layer can be added to an existing wireless sensor network, if the prototype adheres to a list of requirements in order to achieve digital Forensic readiness in a wireless Sensor network environment.
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)