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

Modify LEACH Algorithm for Wireless Sensor Network

TL;DR: An energy efficient clustering algorithm for sensor networks based on the LEACH protocol, which has been widely proposed in wireless sensor networks, and shows a significant reduction in network energy consumption.
Proceedings ArticleDOI

Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks

TL;DR: This work shows that, once the statistics of the sample arrival and the availability of the channel satisfy certain conditions, there exist optimal control-limit type policies which are easy to implement in practice and can also achieve a desired energy-delay tradeoff.
Journal ArticleDOI

Protocols for Wireless Sensor Networks: A Survey

TL;DR: This paper presents a survey on the MAC and network layer of Wireless Sensor Networks, and a detailed discussion on design constraints and classification of routing protocols is presented.
Journal ArticleDOI

Adaptive Routing Protocol with Energy Efficiency and Event Clustering for Wireless Sensor Networks

TL;DR: This paper proposes a novel adaptive routing protocol for WSNs called ARPEES, which considers energy and distance as the parameters in the proposed function to select relay nodes and finally select the optimal path among cluster heads, relay node and the base station.
Proceedings ArticleDOI

Non-uniform information dissemination for sensor networks

TL;DR: In this article, the authors define a set of applications that require a new form of distributed knowledge about the environment, referred to as non-uniform information granularity, and describe the different protocols that achieve non uniform information dissemination and analyze these protocols based on complexity, energy consumption, and accuracy of information.
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)