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 overview of data routing approaches for wireless sensor networks.

TL;DR: The main goals of data routing approach in sensor networks are described, and the best known and most recent data routing approaches in WSNs are classified and studied according to their specific goals.
Proceedings ArticleDOI

An Energy Aware Routing Protocol with Sleep Scheduling for Wireless Sensor Networks

TL;DR: A novel approach for sleep scheduling of sensor nodes using a tree and an energy aware routing protocol which is integrated with the proposed sleep scheduling scheme is proposed and its performance has been compared with that of a routing protocol, called GSP, which incorporates sleep scheduling using random approach.

A Hybrid Intrusion Detection System of Cluster-based Wireless Sensor Networks

TL;DR: A Hybrid Intrusion Detection System (HIDS) created in Cluster-based Wireless Sensor Networks (CWSNs) to detect intruders that not only decreases the consumption of energy, but also efficiently reduces the amount of information in the entire network.

Energy consumption in wireless sensor networks using gsp

TL;DR: The Gossip-Based Sleep Protocol (GSP) implements routing and some MAC functions in an energy conserving manner and was implemented on the Mica2 platform and measurements were conducted to determine the improvement in network lifetime.
Journal ArticleDOI

Building efficient wireless sensor networks with low-level naming

TL;DR: This paper investigates the naming of nodes for low-level communication in distributed systems that leverages topological location (such as node addresses) and is independent of any application.
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)