Study of range free centroid based localization algorithm and its improvement using particle swarm optimization for wire
- PDF / 944,048 Bytes
- 7 Pages / 595.276 x 790.866 pts Page_size
- 59 Downloads / 160 Views
ORIGINAL RESEARCH
Study of range free centroid based localization algorithm and its improvement using particle swarm optimization for wireless sensor networks under log normal shadowing Vikas Gupta1
•
Brahmjit Singh2
Received: 12 October 2017 / Accepted: 10 May 2018 Ó Bharati Vidyapeeth’s Institute of Computer Applications and Management 2018
Abstract Localization deals with the determination of coordinates of unknown nodes for proper routing of data in wireless sensor networks. The centroid based localization algorithm (CLA) has been explored to a great extent till date. Its basic and improved form suffers from large localization error. In the present work the basic range free centroid based localization algorithm is studied under log normal shadowing and evaluated in terms of localization error. Further the basic CLA is improved by using the particle swarm optimization (PSO) under the same environment. The localization error for basic and PSO based CLA is calculated by varying the anchor ratio, communication range, number of unknown nodes, and network area. In every condition the PSO based CLA performs well over basic CLA in terms of reduction in localization error. The localization error in the proposed work is smallest as compared to other known centroid based localization algorithms. Keywords Wireless sensor networks Centroid based localization algorithm Particle swarm optimization
& Vikas Gupta [email protected] 1
Department of Electronics and Communication Engineering, SJPMLIET, Radaur, Yamuna Nagar, Haryana, India
2
Department of Electronics and Communication Engineering, National Institute of Technology, Kurukshetra, Haryana, India
1 Introduction With the advancements in microcontroller based embedded systems and micro-electro-mechanical systems (MEMS) technology the wireless sensor networks have shown a remarkable growth. Due to small size, low-cost, lowpower, and distributed sensor nodes capable of local processing and communicating with each other has made the wireless sensor network (WSN) a suitable candidate for many applications in the field of military, agriculture, and disaster management etc. [1]. Localization in WSN deals with the physical determination of unknown coordinates of sensor nodes spread randomly in the area of interest. In the absence of location information, the raw data would not be useful at the base station. The localization also provides a large number of possibilities like geographical routing, target tracking etc. In general location determination algorithms can be divided in two broad categories, range based and range free. Range based algorithms use an absolute point to point estimates of distance or angle for location determination. Time of arrival (TOA) [2], angle of arrival (AOA) [3], time difference of arrival (TDOA) [4], and received signal strength measurement (RSSI) [5] are the most commonly used range based localization techniques. The main advantage of these techniques lies in high accuracy provided by them in location determination, but the hard
Data Loading...
