Dynamic Function Alternation to Realize Robust Wireless Sensor Network
- 1 July 2012
- journal article
- Published by IGI Global in International Journal of Handheld Computing Research
- Vol. 3 (3), 17-34
- https://doi.org/10.4018/jhcr.2012070102
Abstract
In this paper, a distributed algorithm to realize a dynamic function alternation is proposed. The algorithm enables sensor nodes to take over the damaged functions of their neighboring sensor nodes automatically in a wireless sensor network. After describing the concept of the function alternation, the algorithm is explained in detail with some evaluation results. Comparing the results obtained using the proposed algorithm with those obtained using non-function alternation methods shows that the proposed algorithm makes the initial functionality of each sensor function sustainable even if some sensor nodes are damaged. A wireless sensor network system dedicated to disaster monitoring is also introduced, as an application of the proposed function alternation algorithm.Keywords
This publication has 14 references indexed in Scilit:
- Decentralized Multi-sink Data Transfer Protocol for Wireless Sensor NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Cognitive sensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- An Adaptive Distributed Resource Allocation Scheme for Sensor NetworksLecture Notes in Computer Science, 2006
- Energy-efficient communication protocol for wireless microsensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- MNP: Multihop Network Reprogramming Service for Sensor NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Collaborative resource allocation in wireless sensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Aggregation in sensor networks: an energy-accuracy trade-offPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Efficient flooding with passive clustering - An overhead-free selective forward mechanism for ad hoc/sensor networksProceedings of the IEEE, 2003
- Ad hoc On-Demand Distance Vector (AODV) Routing2003
- Wireless sensor networks: a surveyComputer Networks, 2002