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

LOARP: A low overhead routing protocol for underwater acoustic sensor networks

TL;DR: A new low overhead ad hoc routing protocol designed for underwater acoustic sensor network that performs route discovery when needed in an on-demand manner and characterises a route maintenance phase which tries to recover a failed route.
Proceedings ArticleDOI

A Dynamic Cluster Formation Algorithm for Collaborative Information Processing in Wireless Sensor Networks

TL;DR: This paper proposes a dynamic cluster formation (DCF) algorithm that dynamically groups a set of sensor nodes into a logical cluster-based sensing and processing unit, collaborative agent sensor team (CAST), to detect and track localized phenomena.
Proceedings ArticleDOI

Towards composable and extensible network simulation

TL;DR: This paper gives an overview of the component-based software architecture, called the autonomous component architecture (ACA), that is used as the underlying architecture for J-Sim, and describes how to lay a generalized packet-based network simulation framework, called extensible internetworking framework (INET), on top of ACA.

Flexible-Schedule-Based TDMA Protocols for Supporting Fault-Tolerance, On-Demand TDMA Slot Transfer, and Peer-to-Peer Communication in Wireless Sensor Networks

TL;DR: An ondemand TDMA slot transfer method that leverages the flexible-slot structure algorithm of FlexiTP to transfer time slots from one part of the network to another part, which allows wireless sensor networks to be adaptive to dynamic traffic patterns in the channel.
Proceedings ArticleDOI

Application analysis of complex adaptive systems for WSN

TL;DR: This article bases on the view of complex adaptive systems theory to give the methodological analysis to the wireless sensor network (WSN)'s Self-configuration, Self-healing and Agent characteristics.
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)