A Distributed Localization Scheme for Wireless Sensor Networks Based on Bounding Boz Algorithm
Node localization is a fundamental and important technology in wireless sensor networks (WSNs). With regard to the mechanisms used for estimating location, existing localization algorithms can be divided into two categories: range-based and rangefree. Compared with range-based schemes, range-free schemes do not need to measure or estimate distances or angles and are thus more suitable for WSNs. However, many of existing range-free schemes require a large amount of calculation and are thus difficult to run on sensor nodes. Enlightened by the distributed range-free localization scheme (DRLS) and its vector-based refinement algorithm, a distributed range-free localization scheme based on Bounding Box algorithm is proposed. The discrete communication model is adopted to simplify the centroid calculation of intersection of nodes communication region. Besides, the location information of anchors within two hops is collected to improve the accuracy of the estimated locations. Analysis and simulation show that this scheme requires small-amount of calculation and can satisfy cases in which sensor nodes have limited computing resources and moderate accuracy is tolerable.
wireless sensor networks localization range-free Bounding Boz
Peng Aiping Guo Xiaosong Cai Wei Li Haibin
Xian Research Inst.of Hi-Tech Hongqing Town,Xian 710025,China Xian Research Inst.of Hi-Tech Hongqing Town,Xian 710025,China
国际会议
2009 9th International Conference on Electronic Measurement & Instruments(第九届电子测量与仪器国际会议 ICEMI2009)
北京
英文
2061-2065
2009-08-16（万方平台首次上网日期，不代表论文的发表时间）