Jozef Kenyeres

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 networks 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 networks 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 networks 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.

An algorithm for central point estimation in WSNs

Wireless sensor networks possess many challenges. One of the most significant is routing. In this paper, we focus on so-called Self-organizing Coordinate Systems, which are perceived as the current state of the art. Protocols included in this class are intended to create a virtual coordinate system within the network, applying principles of geographical routing. We aim to find a solid starting point for virtual coordinate assignment in a random network with no location data available. In our previous work, we presented a localized algorithm which is able to derive basic location information from the nodes connectivity. In this paper, we extend this algorithm to estimate the networks central point.