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

Optimized broadcast protocol for sensor networks

TL;DR: This paper proposes an optimized broadcast protocol for sensor networks (BPS), its adaptive-geometric approach that enables considerable reduction of retransmissions by maximizing each hop length and shows that BPS is very scalable with respect to network density.
Journal ArticleDOI

Heterogeneous HEED Protocol for Wireless Sensor Networks

TL;DR: The simulation results show that as the level of heterogeneity increases in the network, the nodes remain alive for longer time and the rate of energy dissipation decreases and also, increasing the heterogeneity level helps sending more packets to the base station and increases the network lifetime.
Journal ArticleDOI

An Integrated Intrusion Detection System for Cluster-based Wireless Sensor Networks

TL;DR: A mechanism of Intrusion Detection System (IDS) created in a Cluster-based Wireless Sensor Network (CWSN) is proposed, which can provide the system to resist intrusions, and process in real-time by analyzing the attacks.
Journal Article

Preprocessing in a Tiered Sensor Network for Habitat Monitoring

TL;DR: Wang et al. as mentioned in this paper investigated task decomposition and collaboration in a two-tiered sensor network for habitat monitoring, where each macronode combines data collected by multiple micronodes for target classification and localization.
Proceedings ArticleDOI

An Energy Balancing LEACH Algorithm for Wireless Sensor Networks

TL;DR: An improved LEACH (LEACH-C) algorithm called partition-based LEACH, which firstly partitions the network into optimal number of sectors, and then selects the node with the highest energy as the head for each sector, using the centralized calculations is proposed.
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)