Optimal self boundary recognition with two-hop information for ad hoc networks

The ad hoc network is composed of multiple sensor nodes to serve various applications, such as data collection or environmental monitoring. In many applications, the sensor nodes near the boundary of the deployment region provide biased or low-quality information because they have limited number of neighboring nodes and only partial information is available. Hence, the boundary recognition is an important issue in the ad hoc networks. By the statistical approach in high node density networks, Fekete´s pioneer work identified the boundary node by number of neighboring nodes and using a specific threshold. By exploiting the number of nodes in the two-hop region, our proposed algorithm has significant improvement of boundary recognition contrasted with Fekete´s algorithm in the low-density network. Given the information topology and the cost function, the analyses provide a framework to obtain the optimal threshold for boundary recognition. Besides, the simulation results reveal the proposed algorithm has greater than 90% detection rate and lower than 10% false alarm rate.