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
Patent

Method for Adaptively Modifying the Observed Collective Behavior of Individual Sensor Nodes Based on Broadcasting of Parameters

TL;DR: In this article, a gateway node disseminates a specification request comprising of parameters to a set of computing devices and modifies its own behavior based on the values in the parameters of the specification request.
Proceedings ArticleDOI

Data gathering tours in sensor networks

TL;DR: It is shown that computing the optimal routing scheme to visit a specific set of nodes is NP-complete, but approximation algorithms that produce plans with costs within a constant factor of the optimum are developed.
Journal ArticleDOI

Developing a New Wireless Sensor Network Platform and Its Application in Precision Agriculture

TL;DR: This work evaluates a new wireless sensor network platform and its application in precision agriculture, including its embedded operating system and its routing algorithm, which incorporates a modified version of LORA-CBF, a wireless location-based routing algorithm that uses cluster-based flooding.
Journal ArticleDOI

Information sharing for distributed intrusion detection systems

TL;DR: This paper proposes a simple but robust scheme to monitor changes in the local statistics and presents a learning algorithm to decide when to share information so that both the communication overhead among the distributed detection systems and the detection delay are minimized.
Proceedings ArticleDOI

An improvement for LEACH algorithm in wireless sensor network

TL;DR: A new energy-efficient LEACH-based protocol that employs cluster member threshold to avoid the very big cluster and the very small cluster existing at the same time; use energy rating to avoid uneven energy distribution; and use energy estimate to avoid unnecessary energy consumption of cluster members is proposed.
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)