Open AccessAnchor Density Minimization for Localization in Wireless Sensor Network (WSN)
Author(s) -
Nour Zaarour,
Nadir Hakem,
NahiKandil
Publication year - 2021
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5121/csit.2021.112201
Subject(s) - wireless sensor network , software deployment , computer science , flexibility (engineering) , minification , network topology , computer network , a priori and a posteriori , position (finance) , reduction (mathematics) , key distribution in wireless sensor networks , real time computing , wireless , distributed computing , topology (electrical circuits) , wireless network , engineering , mathematics , telecommunications , philosophy , statistics , geometry , epistemology , finance , electrical engineering , economics , programming language , operating system
In wireless sensor networks (WSN) high-accuracy localization is crucial for both of WNS management and many other numerous location-based applications. Only a subset of nodes in a WSN is deployed as anchor nodes with their locations a priori known to localize unknown sensor nodes. The accuracy of the estimated position depends on the number of anchor nodes. Obviously, increasing the number or ratio of anchors will undoubtedly increase the localization accuracy. However, it severely constrains the flexibility of WSN deployment while impacting costs and energy. This paper aims to drastically reduce anchor number or ratio of anchor in WSN deployment and ensures a good trade-off for localization accuracy. Hence, this work presents an approach to decrease the number of anchor nodes without compromising localization accuracy. Assuming a random string WSN topology, the results in terms of anchor rates and localization accuracy are presented and show significant reduction in anchor deployment rates from 32% to 2%.