Wireless sensor node localization by multisequence processing

ACM Trans. Embedded Comput. Syst.(2012)

引用 9|浏览7
暂无评分
摘要
Wireless Sensor Networks have been proposed for use in many location-dependent applications. Most of these need to identify the locations of sensor nodes, a challenging task because of severe constraints on cost, energy and effective range of sensor devices. To overcome limitations in existing solutions, we present a Multi-Sequence Positioning (MSP) method for large-scale stationary sensor node localization in outdoor environments. The novel idea behind MSP is to reconstruct and estimate two-dimensional location information for each sensor node by processing multiple one-dimensional node sequences, easily obtained through loosely guided event distribution. Starting from a basic MSP design, we propose four optimizations that work together to increase localization accuracy. We address several interesting issues such as incomplete (partial) node sequences and sequence flip, found in the Mirage test-bed we built. We have evaluated the MSP system through theoretical analysis, extensive simulation as well as two physical systems (an indoor version with 46 MICAz motes and an outdoor version with 20 MICAz motes). Evaluation demonstrates that MSP can achieve an accuracy within one foot, requiring neither additional costly hardware on sensor nodes nor precise event distribution. In fact, it provides a nice tradeoff between physical cost (anchors) and soft cost (events) while maintaining localization accuracy.
更多
查看译文
关键词
multisequence processing,msp system,wireless sensor node localization,physical cost,localization accuracy,basic msp design,sensor node,large-scale stationary sensor node,sensor device,micaz mote,node sequence,multiple one-dimensional node sequence,localization,wireless sensor network,wireless sensor networks,test bed
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要