AASCIT - Journal - All Issues

ISSN Print: 2381-1137 ISSN Online: 2381-1145

International Journal of Wireless Communications, Networking and Mobile Computing

The Journal

Manuscript Information

Determining the Optimum Number of Anchor Beacons while Localizing Wireless Sensor Network

International Journal of Wireless Communications, Networking and Mobile Computing
Vol.2 , No. 4, Publication Date: Nov. 27, 2015, Page: 37-41

1149 Views Since November 27, 2015, 856 Downloads Since Nov. 27, 2015

Paper in PDF (205K)

Follow on

Authors

[1]	Magy M. Kandil, Nuclear and Radiological Regularity Authority, Cairo, Egypt.
[2]	May A. Salama, Computer Engineering Dept., Faculty of Engineering at Shoubra, Benha University, Cairo, Egypt.

Abstract

Among the challenges that face wireless sensor network is minimizing the localization error and yet using minimum number of beacons. These two challenges are addressed in this pape by proposing a heuristic algorithm which is based on anchor based beacons and modified DV-Hop algorithm. The results give a recommended percentage of beacons that achieves a transmission accuracy of about 70%. The results are compared with similar algorithms and proven to be more general. The algorithm can be applied to detect the location of any anomalies inside the un-accessible rooms of the nuclear reactor which has high radiation levels, such as the mechanical control rods system room, while minimizing the power consumed.

Keywords

Anchor Beacon, Optimized Number, DV-Hop, WSNs

Reference

[01]	Kuriakose J, Amruth V, Nandhini S., A Survey on Localization of Wireless Sensor Nodes. ICICES, 2014.
[02]	Huang M, Chen S, Wang Y. Minimum cost localization problem in wireless sensor networks. Ad Hoc Networks, May 2011; vol 9; 387-399.
[03]	Assis A F, Vieira L F M,Rodrigues M T R, Pappa G P. A Genetic Algorithm for the Minimum Cost Localization Problem in Wireless Sensor Networks. IEEE Congress on Evolutionary Computation, 2013.
[04]	Kulkarni R V, Venayagamoorthy G K. Particle Swarm Optimization in Wireless Sensor Networks: A Brief Survey. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 2011. Volume:41; Issue: 2.
[05]	Bulusu N, Heidemann J, Bychkovskiy V, Estrin D. Density-adaptive beacon placement algorithms for localization in ad hoc wireless networks. IEEE Infocom June 2002.
[06]	Priyantha N B, Balakrishnan H, Demain E, Teller S. Poster Abstract: Anchor-Free Distributed Localization in Sensor Networks. Proc. 1st International Conference on Embedded Networked Sensor Systems (SenSys 2003); 340-341.
[07]	Langendoen K, Reijers N. Distributed Localization in Wireless Sensor Networks: A Quantitative Comparison. Computer Networks (Elsevier), special issue on Wireless Sensor Networks August 2003: 499-513.
[08]	Gao Y, Zhuang Y, Ni T, Yin K, Xue T. An improved genetic algorithm for wireless sensor networks localization. BIC-TA. IEEE 2010: 439-443.
[09]	Roy S, Mukherjee N. Integer linear programming formulation of optimal beacon placement problem in WSN. Applications and innovations in mobile computing 2014.
[10]	Yin M, Shu J, Liu L, Zhang H. The Influence of Beacon on DV-hop in Wireless Sensor Networks. Proceedings of the Fifth International Conference on Grid and Cooperative Computing Workshops (GCCW'06).
[11]	Zhang Y, Ben W. An improved DV-Distance Algorithm with Assistant Anchor for nodes Localization in WSNs. 11^th interneaional Loint conference on Computer science and software Engineering 2014.