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

An Improved Version of LEACH: Three Levels Hierarchical Clustering LEACH Protocol (TLHCLP) for Homogeneous WSN

TL;DR: Simulations have been conducted to evaluate these protocols and favorable results are obtained, showing that TLHCLP improves network lifetime by an order of magnitude compared with LEACH.
Proceedings Article

Sensor networking

TL;DR: The kernel of the paper deals with the application of the discussed frameworks for a computer-based pressure measurement system as a real-world project, stressing both the intra-system and Internet connectivity issues.
Proceedings ArticleDOI

A modified RPL for Wireless Sensor Networks with Bayesian inference mobility prediction

TL;DR: A new approach, called BMP-RPL (Bayesian model Mobility Prediction RPL for wireless sensor networks), that aims to adapt native RPL to nodes' mobility scenarios, based on nodes' identification and velocity prediction as well as the estimation of the link duration is proposed.
Journal ArticleDOI

Self-Localized Packet Forwarding in Wireless Sensor Networks

TL;DR: A Self-Localized Packet Forwarding Algorithm (SLPFA) to control redundancy in WSNs is proposed and the end to end performance of the proposed algorithm is evaluated for different values of node densities in the same deployment area by means of simulations.
Proceedings ArticleDOI

Wireless Sensor Nodes Processor Architecture and Design

TL;DR: A specialized soft processing core for sensor nodes has been designed and implemented using Xilinx ISE 8.2i design tools and can process 10.78 MIPS.
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)