Abstract
Wireless sensor networks (WSNs) localization is a key technology nowadays. Applications and protocols that need localization are called location-aware. One might think of equipping each node with a global position system (GPS) in WSN. In contrast, WSN constraints on power consumption and cost make it infeasible. The anchor nodes are one of the optimistic methods to limit unknown nodes, The anchor nodesequipped with GPS units to broadcast their current locations and used to find the unknown nodes with localization. Moreover, WSN nodes are non-uniformly distributed within the field with vacancies in different uses and different projects. Finally, Euclidean distance calculation between WSNs is giving wrong results with poor accuracy of node localization. Different topologies are possible in WSN localization problems. Concave shape, O shape, and concave shapes are important topologies. The proposed algorithm gives good results for all the topologies. Our results show that the error in the horizontal plane is less than 0.25 m while in the Z-axis is less than 0.5 m.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
