A localisation algorithm based on region partition of cellular network in wireless sensor networks

Abstract

In this paper, anchor nodes are deployed in the vertices and the centre of hexagon, which is the basic architecture of cellular network. Unknown nodes are distributed randomly in the hexagon. Because of inerratic cellular network, the geometrical characteristic is made full use of and the network is divided into several regions. The minimal connecting hop between nodes is different in different regions. According to corresponding relationship between unknown nodes hop information and divided regions, the unknown node is determined in a very small region. Through calculating centroid of the small region, the localisation based on range-free is well completed. On the basis of the simulation results, it is demonstrated that the localisation algorithm based on region partition of cellular network we proposed has better positioning performances, compared with the typical processing.