Time Synchronized Node Localization Using Optimal H-Node Allocation in a Small World WSN
Om Jee Pandey, Ved Gautam, Saket Jha, Mahendra K. Shukla, Rajesh M. Hegde
Abstract
Time synchronization and node localization over a wireless sensor network (WSN) is a vital problem in applications such as Internet of Things (IoT) and context-aware pervasive systems. Addressing this problem leads to an efficient data fusion, power scheduling, bandwidth utilization, geographic routing, time-based channel sharing, and clustering among sensor nodes. In a WSN, sensor nodes utilize multi-hop data transmission model towards the data transfer. Utilization of large number of hops for the data transfer leads to poor time synchronization resulting in erroneous node location estimates. In this letter, we make use of a recent development in social networks termed as <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">small world characteristics</i> and propose a novel method of time synchronized node localization over a small world WSN (SW-WSN). The results are obtained via simulations over a medium scale WSN. The performance of the proposed method is evaluated by conducting detailed analysis of time synchronization and node localization errors over the SW-WSN. The results obtained illustrate that the proposed small world model yields improved localization results when compared to results obtained over a regular WSN.