Autonomous Deployment of Self-Organizing Mobile Sensors for a Complete Coverage
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
Route in Mobile WSN and Get Self-deployment for Free
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Simple movement control algorithm for bi-connectivity in robotic sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
A moving algorithm for non-uniform deployment in mobile sensor networks
International Journal of Autonomous and Adaptive Communications Systems
Optimizing movement and connectivity in mobile networks with partial cooperativeness
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Self organization for area coverage maximization and energy conservation in mobile ad hoc networks
Transactions on Computational Science XV
Biconnecting a network of mobile robots using virtual angular forces
Computer Communications
A least-movement topology repair algorithm for partitioned wireless sensor-actor networks
International Journal of Sensor Networks
Node mobility and capacity in wireless controllable ad hoc networks
Computer Communications
Handling large-scale node failures in mobile sensor/robot networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Mobile sensors can move and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes mostly over-simplify the conditions for network connectivity: they either assume that the communication range is large enough for sensors in geometric neighborhoods to obtain each other's locationby local communications, or assume a dense network that remains connected. At the same time, an obstacle-free field or full knowledge of the field layout is often assumed. We present new schemes that are not restricted by these assumptions, and thus adapt to a much wider range of application scenarios. While maximizing sensing coverage, our schemes can achieve connectivity for a network with arbitrary sensor communication/sensing ranges or node densities, at the cost of a small moving distance; the schemes do not need any knowledge of the field layout, which can be irregular and have obstacles/holes of arbitrary shape. Simulations results show that the proposed schemes achieve the targeted properties.