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

A new routing algorithm for energy reduction in wireless sensor networks

TL;DR: This paper proposes a new method for routing in wireless sensor networks that instead of using the traditional routing methods attempts to add nodes which have the minimum distances from each other, to reduce the total energy consumption.
Journal ArticleDOI

Stream engines meet wireless sensor networks: cost-based planning and processing of complex queries in AnduIN

TL;DR: This paper presents the query planning and execution strategies used in AnduIN, a system combining sensor-local in-network processing and a data stream engine, and employs a multi-dimensional cost model taking energy consumption into account.
Journal ArticleDOI

A theoretical inter-organizational trust-based security model

TL;DR: The inter-organizational trust-based security model proposed herein represents a soft security approach that affords several important benefits over traditional hard security mechanisms used in open systems — robustness, scalability, and adaptability.
Proceedings ArticleDOI

OPEGASIS: Opportunistic Power Efficient GAthering in Sensor Information Systems

TL;DR: OPEGASIS (Opportunistic Power Efficient GAthering in Sensor Information Systems) is introduced, by increasing the throughput by communicating the nodes with an opportunistic behavior, in order to reduce the amount of energy spent per round in PEGASis.

A Distributed Filtering Architecture for Multimedia Sensors

TL;DR: This paper presents how I RIS N ET, a software infrastructure for authoring wide-area sensor-enriched services, supports scalable data collection from such sensors by greatly reducing the bandwidth demands.
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)