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

Cluster Based Routing protocol for Mobile Nodes in Wireless Sensor Network

TL;DR: The performance of proposed CBR Mobile-WSN protocol is evaluated using MATLAB and it has been observed that the proposed protocol reduces the packet loss by 25% compared to LEACH-Mobile protocol.
Proceedings ArticleDOI

IrisNet: an internet-scale architecture for multimedia sensors

TL;DR: An overview of IRISNET, a sensor network architecture that enables the creation of a planetary-scale infrastructure of multimedia sensors that can be shared by a large number of applications and provides a number of multimedia processing primitives that enable the effective processing of sensor feeds in-network and at-sensor.
Journal ArticleDOI

Distributed clustering algorithms for data-gathering in wireless mobile sensor networks

TL;DR: This paper proposes two distributed algorithms for cluster-head election and provides distributed clustering algorithms for mobile sensor nodes which minimize the energy dissipation for data-gathering in a wireless mobile sensor network.
Journal ArticleDOI

Spatial gossip and resource location protocols

TL;DR: This work proposes distance-based propagation bounds as a performance measure for gossip mechanisms and presents natural gossip mechanisms, called spatial gossip, that satisfy such a guarantee: new information is spread to nodes at distance d, with high probability, in O(log1 + e d) time steps.
Proceedings ArticleDOI

Flash Flooding: Exploiting the Capture Effect for Rapid Flooding in Wireless Sensor Networks

TL;DR: The results indicate that the Flash flooding protocol can reduce latency by as much as 80%, achieving flooding latencies near the theoretical lower bound without sacrificing coverage, reliability or power consumption.
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)