Mobility management algorithms and applications for mobile sensor networks
Authors:
Open Access
- 28 December 2011
- journal article
- research article
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 12 (1) , 7-21
Abstract
Wireless sensor networks (WSNs) offer a convenient way to monitor physical environments. In the past, WSNs are all considered static to continuously collect information from the environment. Today, by introducing intentional mobility to WSNs, we can further improve the network capability on many aspects, such as automatic node deployment, flexible topology adjustment, and rapid event reaction. In this paper, we survey recent progress in mobile WSNs and compare works in this field in terms of their models and mobility management methodologies. The discussion includes three aspects. Firstly, we discuss mobility management of mobile sensors for the purposes of forming a better WSN, enhancing network coverage and connectivity, and relocating some sensors. Secondly, we introduce path‐planning methods for data ferries to relay data between isolated sensors and to extend a WSN's lifetime. Finally, we review some existing platforms and discuss several interesting applications of mobile WSNs. Copyright © 2010 John Wiley & Sons, Ltd.Keywords
This publication has 42 references indexed in Scilit:
- Deadlock Avoidance Policy in Mobile Wireless Sensor Networks with Free Choice Resource RoutingInternational Journal of Advanced Robotic Systems, 2008
- Two energy efficient algorithms for tracking objects in a sensor networkWireless Communications and Mobile Computing, 2006
- Energy-Efficient Deployment of Intelligent Mobile Sensor NetworksIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2004
- Movement control algorithms for realization of fault-tolerant ad hoc robot networksIEEE Network, 2004
- Sensor deployment and target localization in distributed sensor networksACM Transactions on Embedded Computing Systems, 2004
- Event-based motion control for mobile-sensor networksIEEE Pervasive Computing, 2003
- A survey on sensor networksIEEE Communications Magazine, 2002
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- The landmark hierarchy: a new hierarchy for routing in very large networksACM SIGCOMM Computer Communication Review, 1988
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955