A dead-end free deployment algorithm for wireless sensor networks with obstacles

Abstract

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.