Self-organization of Shortest Spanning Tree and Optimal Sink Node Position for Various Shapes of Large-scale Wireless Sensor Networks

The primary challenges with wireless sensor networks are how to construct the shortest spanning tree and how to determine the optimal sink node position in terms of minimizing the data transmission times and their variances for gathering data from all sensor nodes to a sink node. To solve these two problems, we previously proposed a basic algorithm that uses the polygonal affine shortening algorithm with flow aggregation in a fully distributed manner. In this paper, we proposed an algorithm that is more than 25% faster than the previously proposed algorithm and also proves that the proposed algorithm works in wireless sensor networks. The proposed algorithm was implemented on a well-known multi-agent simulator called Netlogo.