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

An Efficient Multi-Path Self-Organizing Strategy in Internet of Things

TL;DR: An approximate estimation algorithm to estimate the number of the nodes in the monitoring region with a certain size and regular shape is presented and shows that the improved protocol increases the fault tolerance of the network, reduces the paralysis rate ofThe network and achieves the effect of energy spreading out and saving, increases the lifetime of thenetwork through a multi-path strategy.

People-centric mobile sensing networks

TL;DR: This thesis contributes a new system in support of large scale people-centric sensing applications, which aims to address the sensor availability problem, and presents Quintet and Halo, a mobile sensing system for mapping the cyclist experience.
Proceedings ArticleDOI

On Improving the Reliability of Packet Delivery in Dense Wireless Sensor Networks

TL;DR: This study proposes a set of enhancements to well-known protocols that may help boost the performance of packet delivery in dense wireless sensor networks and shows that using Geographic routing in a WSN with 225 nodes spread over 150 feet times 150 feet, the proposed enhancements yield a 23-fold improvement over the baseline.
Proceedings ArticleDOI

PAGER: a distributed algorithm for the dead-end problem of location-based routing in sensor networks

TL;DR: A novel algorithm, named partial-partition avoiding geographic routing (PAGER), to solve the dead-end problem of location-based routing in sensor networks, and generates considerably shorter paths, higher delivery ratio and lower energy consumption than the greedy perimeter stateless routing protocol.
Dissertation

Energy Efficient Routing Algorithms for Wireless Sensor Networks and Performance Evaluation of Quality of Service for IEEE 802.15.4 Networks

TL;DR: Simulation results show improved performance of BFO based optimization in terms of total energy dissipation and no of alive nodes of the network system over LEACH, K-Means and direct methods.
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)