Localization in wireless sensor networks with cognitive small world characteristics

In this paper, a method for node localization in a novel small world - wireless sensor network (SW-WSN) is proposed. A SW-WSN is created by introducing small world characteristics into a conventional wireless sensor network (WSN). Introduction of long-ranged links between selected nodes in a WSN reduces average path length (APL) of the network without affecting the clustering coefficient (CC) significantly. Localization performance and anchor requirement is made more efficient by the introduction of newer links with an optimal probability of link addition (PLA). In this work a cognitive approach for computing the optimal PLA according to bandwidth availability is also developed. This helps in minimizing energy consumption and bandwidth requirement in the network during localization. Extensive localization experiments are conducted on U. of Michigan WSN repository. The proposed localization indicates significant improvements over conventional methods in terms of localization error and bandwidth utilization.

[1]  Ahmed Helmy,et al.  Small worlds in wireless networks , 2003, IEEE Communications Letters.

[2]  Ahmed Helmy,et al.  Analysis of Wired Short Cuts in Wireless Sensor Networks , 2004, The IEEE/ACS International Conference on Pervasive Services.

[3]  M. Newman,et al.  Renormalization Group Analysis of the Small-World Network Model , 1999, cond-mat/9903357.

[4]  M. Weigt,et al.  On the properties of small-world network models , 1999, cond-mat/9903411.

[5]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Ravi Mazumdar,et al.  A case for hybrid sensor networks , 2008, IEEE/ACM Trans. Netw..

[7]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[8]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[9]  Chien Chen,et al.  Construct Small Worlds in Wireless Networks Using Data Mules , 2008, 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008).

[10]  Arnab Chatterjee,et al.  Small-world properties of the Indian railway network. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[12]  Hüseyin Arslan,et al.  Cognitive Positioning Systems , 2007, IEEE Transactions on Wireless Communications.

[13]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[14]  Chen Huan,et al.  A Localization Scheme of Wireless Sensor Networks Based on Small World Effects , 2011 .

[15]  Brian D. O. Anderson,et al.  Wireless sensor network localization techniques , 2007, Comput. Networks.

[16]  Mohamed Ibnkahla,et al.  Cognition in Wireless Sensor Networks: A Perspective , 2011, IEEE Sensors Journal.

[17]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[18]  Peng Jiang,et al.  Connectivity and RSSI Based Localization Scheme for Wireless Sensor Networks , 2005, ICIC.

[19]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[20]  Alfred O. Hero,et al.  Relative location estimation in wireless sensor networks , 2003, IEEE Trans. Signal Process..

[21]  M. Jovanovi.  MODELING PEER-TO-PEER NETWORK TOPOLOGIES THROUGH “ SMALL-WORLD ” MODELS AND POWER LAWS , 2001 .

[22]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.