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

CBA: A cluster-based client/server data aggregation routing protocol

TL;DR: Cluster-Based client/server data aggregation routing protocol, which dynamically partitions the network into a set of data-centric clusters using a lightweight clustering approach based on the Hamming distance, reduces energy consumption and data collection delay and increases accuracy.
Journal Article

Prolonging Network Lifetime and Data Accumulation in Heterogeneous Sensor Networks

TL;DR: A heterogeneous network with three types of nodes having different initial energy levels is analyzed and a single hop clustering topology has been assumed and the network performance in terms of lifetime is analyzed.
Proceedings ArticleDOI

Development and implementation of optimized energy-delay sub-network routing protocol for wireless sensor networks

TL;DR: In this article, the authors proposed an optimized energy-delay sub-network routing (OEDSR) protocol for wireless sensor networks (WSNs) which minimizes a novel link cost factor which is defined using available energy, end-to-end (E2E) delay and distance from a node to the base station, along with clustering, to effectively route information to the BS.
Journal ArticleDOI

UDC: a self-adaptive uneven clustering protocol for dynamic sensor networks

TL;DR: This paper presents a novel clustering protocol, named Uneven Density Clustering (UDC) spatially), to support aggregation queries aiming to prolong the lifetime of sensor networks.
Proceedings ArticleDOI

A comparative study of routing protocols in WSN

TL;DR: This work proposed a new approach based on multiple criteria analysis in which protocols are used as actions and directed by decision maker's preferences to classify routing protocols.
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)