Proceedings ArticleDOI
Adaptive protocols for information dissemination in wireless sensor networks
Wendi Rabiner Heinzelman,Joanna Kulik,Hari Balakrishnan +2 more
- pp 174-185
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
Citations
More filters
Proceedings ArticleDOI
An energy-efficient diagonal-based directed diffusion for wireless sensor networks
TL;DR: In this paper, a new energy-efficient directed diffusion protocol was proposed by using the proposed diagonal-based hexagonal-mesh scheme for a wireless sensor network, where the directed diffusion is mainly operated on the diagonal-paths of the hexagonal mesh under the energyefficient consideration.
Journal ArticleDOI
CAPTURE: location-free contact-assisted power-efficient query resolution for sensor networks
TL;DR: This paper presents an architecture that is geared towards one-shot frequent queries in sensor networks, and introduces the novel notion of contacts that act as short cuts to reduce the degrees of separation between the request source and the target.
Proceedings ArticleDOI
Achieving Robustness through Caching and Retransmissions in IEEE 802.15.4-based WSNs
TL;DR: A network-layer protocol for wireless sensor networks based on the IEEE 802.15.4 MAC layer that acts as a routing module and a control entity for the MAC layer and provides reliable communication, while managing power saving and synchronization among nodes.
Performance evaluation of different logical topologies and their respective protocols for wireless sensor networks
Abstract: Wireless sensor networks (WSNs) have several constraints of the sensor nodes such as limited energy source, low
memory size and low processing speed, which are the principal obstacles to design efficient protocols for WSNs. Major
challenges of WSNs are to prolong the network lifetime and throughput. This paper explores performance of WSNs in
different logical topologies. Logical topologies play very significant role in the overall performances of the network, such
as network lifetime, throughput, , energy consumption and end-to-end delay. A number of logical topologies was
proposed for WSNs, including flat topology, cluster-distributed topology, cluster-centralized topology and chain
topology, along with their corresponding routing protocols. Simulation experiments were done by using NS-2.34 program
for the logical topologies. The topologies were cluster–distributed, chain-based, cluster–centralized and flat with its
corresponding protocols of LEACH, PEGASIS, LEACH-C and MTE respectively. MATLAB is used to plot the graphs.
Performance metrics measured are the network lifetime, energy consumption and total amount of aggregate data received
at the base station.
Proceedings ArticleDOI
A cooperative Hide and Seek discovery over In Network Management
TL;DR: Hide and Seek (H&S), a new algorithm for network discovery, and information propagation and synchronization, is proposed and the results show that H&S spends fewer cycles to discover all INM entities and records lower messages overhead for information synchronization compared to non-controlled and probabilistic (gossip) flooding dissemination.
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
V.D. Park,M.S. Corson +1 more
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
Alan J. Demers,Daniel H. Greene,Carl Hauser,Wes Irish,John Larson,Scott Shenker,Howard E. Sturgis,Dan Swinehart,Douglas B. Terry +8 more
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.