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

Localized topology control for unicast and broadcast in wireless ad hoc networks

TL;DR: This work theoretically proves that the proposed topology is planar, which meets the requirement of certain localized routing methods to guarantee packet delivery; it is power-efficient for unicast and asymptotically optimum for broadcast; it has a constant bounded logical degree, which will potentially save the cost of updating routing tables if used.
Proceedings ArticleDOI

Energy saving routing algorithm based on SPIN protocol in WSN

TL;DR: The routing algorithm of SPIN is discussed, a new routing algorithm called SPIN-I is proposed, and the results show that not only the problems of blindly forwarding and data accessibility in SPIN have been solved, but also the whole network's energy consumption is more uniform, which can prolong the network's lifetime.
Journal ArticleDOI

A Novel Routing Algorithm for Wireless Sensor Network Using Particle Swarm Optimization.

TL;DR: This paper has proposed a Particle Swarm Optimization based Routing protocol (PSOR) where it has taken energy efficiency as major criteria for performing routing and deriving optimized path for data forwarding and processing to base node.
Proceedings ArticleDOI

Genetic algorithm based clustering approach for wireless sensor network to optimize routing techniques

TL;DR: A Genetic Algorithm (GA) based clustering algorithm which evaluates the fitness function by considering the two major parameters distance and energy has been proposed in this paper.

A Performance Analysis of : A Peer-to-Peer Data Dissemination and Prefetching Tool for Mobile Users

TL;DR: This paper evaluates via extensive simulations the effectiveness of the 7DS system in data dissemination and prefetching for mobile devices and investigates the effect of the wireless coverage range, network size, query mechanism, cooperation strategy among the mobile hosts and power conservation with a very large number user mobility scenarios.
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)