Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Localized sensor self-deployment with coverage guarantee
ACM SIGMOBILE Mobile Computing and Communications Review
Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Connectivity-Guaranteed and Obstacle-Adaptive Deployment Schemes for Mobile Sensor Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Wireless control of a multihop mobile robot squad
IEEE Wireless Communications
Localized mobility control routing in robotic sensor wireless networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Scan-Based Movement-Assisted Sensor Deployment Methods in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Movement control algorithms for realization of fault-tolerant ad hoc robot networks
IEEE Network: The Magazine of Global Internetworking
Optimizing movement and connectivity in mobile networks with partial cooperativeness
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Flocking based distributed self-deployment algorithms in mobile sensor networks
Journal of Parallel and Distributed Computing
Flocking based sensor deployment in mobile sensor networks
Computer Communications
Biconnecting a network of mobile robots using virtual angular forces
Computer Communications
Adoption of Vehicular Ad Hoc Networking Protocols by Networked Robots
Wireless Personal Communications: An International Journal
Connectivity restoration in delay-tolerant sensor networks using game theory
International Journal of Ad Hoc and Ubiquitous Computing
Handling large-scale node failures in mobile sensor/robot networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
Robotic sensor networks are more powerful than sensor networks because the sensors can be moved by the robots to adjust their sensing coverage. In robotic sensor networks, an important problem is movement control: how the robots can autonomously move to the desired locations for sensing and data collection. In this paper, we study a new movement control problem with the following essential requirements: i) an initial and possibly disconnected network is self-organized into a bi-connected network, ii) only I-hop information is used for movement control, iii) the coverage of the network is maximized while the total moving distance in the movement process is minimized. We propose a simple movement control algorithm for this problem. This algorithm emulates the attractive force (such as the force in a stretched spring) and the repulsive force (such as the electrostatic force between electric charges) in nature, such that each robot simply follows the resultant virtual force to move. We theoretically prove that this algorithm guarantees bi-connected networks under a mild condition and derive bounds on the maximum coverage and the minimum moving distance. We conduct extensive simulation experiments to demonstrate that the proposed algorithm is effective.