원문정보
초록
영어
Although localization has been widely studied for Wireless Sensor Networks (WSNs), the complex environments and the large network scale pose severe challenges and make it necessary to develop new reliable localization algorithms. In this paper, we propose a novel Multi-Hop Localization Algorithm for large-scale WSNs in complex environments. This work is based on the consideration that the localization process would encounter several kinds of adverse factors with different nature at the same time (e.g. anisotropic network characteristics, ranging uncertainty, link quality of multihop paths, etc.), which lead to obvious degradation of localization performance. Unlike most of the existing schemes, we transform the localization problem in complex environments into a hybrid constraint satisfaction problem (CSP) which is composed of three different kinds of constraints, i.e. spatial constraint, network situation constraint, and confidence constraint. Set-membership approach and interval analysis method have been utilized to deal with the CSP and determine the positions of sensor nodes. Simulation results show that our scheme is an effective and efficient approach to localization in large-scale WSNs.
목차
1. Introduction
2. Reliable Localization Algorithm
2.1. Network Initialization
2.2. Set-membership Localization Framework
2.3. Feasible Set and Constraint Problem
2.4. CSP and Location Estimation
3. Performance Evaluation
4. Conclusion
References
