The Analysis of Breach Path Problem in Wireless Sensor Networks with Blind Area

Wireless ad-hoc sensor networks have been used widely in the physical world. One of the fundamental problems in sensor networks is the coverage in some complicated situation. In this paper, we studied the breach path problem for target in sensor networks with blind area, and defined the blind area of polygon in sensor networks. The existence of breach path and definition of maximal break path were also discussed in this paper. Considering the geometric model of sensor networks, we proposed the distributed algorithm to calculate the maximal breach path based on Clifford geometric algebra in sensor networks with blind area. The experimental results and their analyses prove the efficiency of our theory.