Study on Useful Bacon Node Selection in Range Free Localization Algorithm in WSN

Abstract

Localization is important analysis subject in the area of wireless sensor network (WSN), which gives the required information about different occasion in a region. This paper is a study of localization techniques that proposes an idea to get more accurate distance between sensor nodes and bacon nodes. Wireless sensor network is structured with a huge number of small, less costly sensors which can communicate with each other via exchanging information with neighbors. In our proposed idea I can get more accuracy in determining the position of sensor nodes depending on the hop count information. The accuracy of the localization algorithm has a huge impact on the achievement of protocols that depends on location and other applications like routing. If the transmission path among bacon nodes and sensor nodes is curved, then the distance estimated by hop distance is always not close to Euclidean distance between a pair of sensor nodes. In this study I will offer to avoid those respected bacon nodes whose hop count distance to other bacon nodes is not proportional to the known distance between them.