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

Data aggregation in wireless sensor networks - exact and approximate algorithms

TL;DR: This work presents exact and approximate algorithms to find the minimum number of aggregation points in order to maximize the network lifetime in WSNs and studies the tradeoffs between energy savings and the potential delay involved in the data aggregation process.
Proceedings ArticleDOI

Infrastructure tradeoffs for sensor networks

TL;DR: By exploring the criteria for effective infrastructure configurations, this paper opens the door for network optimizations that control the effective topology to better achieve the application requirements.
Journal ArticleDOI

A new evolutionary based routing protocol for clustered heterogeneous wireless sensor networks

TL;DR: Simulation over 20 random heterogeneous WSNs shows that the evolutionary based clustered routing protocol (ERP) always prolongs the network lifetime, preserves more energy as compared to the results obtained using the current heuristics such as LEACH, SEP, and HCR protocols.
Proceedings ArticleDOI

An architecture for building self-configurable systems

TL;DR: A generic architecture for a specific subclass of sensor applications which is defined as self-configurable systems where a large number of sensors coordinate amongst themselves to achieve a large sensing task.
Proceedings ArticleDOI

Route driven gossip: probabilistic reliable multicast in ad hoc networks

TL;DR: This work presents a protocol that is designed to meet a more practical specification of probabilistic reliability, called route driven gossip (RDG), which is custom-tailored to ad hoc networks, achieving a high level of reliability without relying on any inherent multicast primitive.
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)