Efficient Deployment Algorithms for Ensuring Coverage and Connectivity ofWireless Sensor Networks
WICON '05 Proceedings of the First International Conference on Wireless Internet
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network
IEEE Transactions on Mobile Computing
An obstacle-free and power-efficient deployment algorithm for wireless sensor networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Coverage, exploration, and deployment by a mobile robot and communication network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Lifetime extension for surveillance wireless sensor networks with intelligent redeployment
Journal of Network and Computer Applications
Hi-index | 0.00 |
In wireless sensor networks (WSNs), the performance of robot deployment is highly determined by the obstacle-resistance capability which refers to how well the robot can overcome the Dead-End problem and deploy minimal number of sensors for achieving full coverage even though the environment contains multiple obstacles. This paper presents a Dead-End free robot deployment algorithm, called DFD, that efficiently deploys minimal number of sensors for achieving full coverage while the Dead-End problem raised by obstacles can be overcome. Performance results reveal that the proposed DFD outperforms existing robot deployment mechanisms in terms of coverage ratio, energy consumption as well as deployment time.