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

Beyond Sensor Networks: ZUMA Middleware

TL;DR: This paper presents a solution where the Kilavi sensor network platform can be used as middleware to provide information for ZUMA, a centralized future smart-home platform that interconnects all kinds devices in the home environment.

Comparative Analysis of Data Centric Routing Protocols for Wireless Sensor Networks

TL;DR: This paper compares the three data centric routing protocols SPIN, SPIN-1,M-SPIN for energy efficiency and concludes that M- SPIN is a better approach for the application need quick and reliable response.
Proceedings ArticleDOI

A Geographic Routing Algorithm for Wireless Sensor Networks

TL;DR: This paper developed and simulated GERA in OPNET and evaluated it in terms of end to end delay and routing load, two of the most important variables concerning dense wireless sensor networks.
Journal ArticleDOI

Minimum-delay energy-efficient source to multisink routing in wireless sensor networks

TL;DR: A novel multi- path routing algorithm, called Hop-Count based routing (HCR) algorithm, which considers energy cost and transmission delay simultaneously simultaneously, and a hop count vector (HCV) is introduced to support routing decision.
Journal ArticleDOI

Cluster Head Energy Optimization in Wireless Sensor Networks

TL;DR: A modification of the Energy Efficient Credit-Based routing algorithm is proposed, which selects the most optimal Cluster Head based on the priority of relay nodes, which achieves a more efficient load-balancing, a better lifetime, and lower energy consumption.
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)