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

Emergency Broadcast Protocol for Inter-Vehicle Communications

TL;DR: This paper presents an emergency broadcast protocol designed for sensor inter-vehicle communications and based in geographical routing, and shows that the proposed protocol is more effective compared to existing inter- vehicle protocols.
Journal ArticleDOI

Using hierarchical agglomerative clustering in wireless sensor networks: An energy-efficient and flexible approach

TL;DR: The well-understood hierarchical agglomerative clustering algorithm is adapted by proposing a distributed HAC (DHAC) algorithm, which provides a bottom-up clustering approach by grouping similar nodes together before the cluster head (CH) is selected.
Journal ArticleDOI

Congestion Avoidance Based on Lightweight Buffer Management in Sensor Networks

TL;DR: A congestion-avoidance scheme based on lightweight buffer management that prevents data packets from overflowing the buffer space of the intermediate sensors and how to maintain near-optimal throughput with a small buffer at each sensor is proposed.
Journal ArticleDOI

Active query forwarding in sensor networks

TL;DR: A mathematical modelling approach is taken in this paper to calculate the energy costs associated with ACQUIRE and compare the performance of ACQUIRE with respect to other schemes such as flooding-based querying (FBQ) and expanding ring search (ERS), in terms of energy usage, response latency and storage requirements.
Journal ArticleDOI

An Experimental Study of Hierarchical Intrusion Detection for Wireless Industrial Sensor Networks

TL;DR: This paper first study intrusion detection for wireless industrial sensor networks, through various experiments and design of a hierarchical framework, and proposes a new hierarchical framework for intrusion detection as well as data processing.
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)