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

Overview on routing protocols in wireless sensor networks

TL;DR: This paper surveys recent routing protocols for wireless sensor networks and presents a classification for the various pursued approaches, with the two main categories explored in this paper are Aware Topology of Routing Protocols and Unaware Topology.
Proceedings ArticleDOI

A Wireless Sensor Network Application Requirements Taxonomy

TL;DR: This taxonomic work is designed to improve requirements capture for sensor network applications by facilitating solution to scenario matching and indicates some challenging aspects of wireless sensor networks in precision agriculture and wild fire management.
Proceedings ArticleDOI

A topology management protocol with bounded delay for Wireless Sensor Networks

TL;DR: The aim of this work is to provide bounded delay for data traffic while reducing the energy consumption of the nodes and results are presented that show the effects of the topology control protocol in terms of reduced energy consumption, increased network capacity and reduced packet loss rate.
Journal ArticleDOI

Diagnosis of Wireless Sensor Networks in Presence of Permanent and Intermittent Faults

TL;DR: Through extensive simulation and analysis, the proposed Fault Diagnosis Algorithm (FDA) is proved to be correct, complete, and efficient to handle intermittent faults and hence, well suited for WSNs.
Book ChapterDOI

Decentralized Movement Pattern Detection amongst Mobile Geosensor Nodes

TL;DR: This paper presents an algorithm for decentralized detection of the movement pattern flock, with applications to mobile wireless sensor networks.
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)