Localized algorithm for border nodes detection in WSNs

The routing possesses a serious challenge in ad-hoc wireless sensor networks. In this paper, we focus on so-called self-organizing coordinate systems, which are perceived as the current state of the art in this area. More specifically, we focus on providing of a solid starting point by a detection of nodes located on a network´s border. Our intention is to limit the number of nodes involved in this process in order to decrease their energy consumption. Thus, every node requires only locally available data to detect whether it is located on the network´s border. We achieved this by fragmenting the network into smaller segments called packs. Then, an analysis of their mutual relations allows to identifying nodes on the network´s border. We study three significantly different scenarios, offering various applications in the routing process. Moreover, a slight modification of the algorithm allows to find the center node of the network.