Using Linear Intersection for Node Location Computation in Wireless Sensor Networks
-
摘要: Knowing the locations of nodes in wireless sensor networks (WSN) is essential for many applications. Nodes in a WSN can have multiple capabilities and exploiting one or more of the capabilities can help to solve the localization problem. In this paper, we assume that each node in a WSN has the capability of distance measurement and present a location computation technique called linear intersection for node localization. We also propose an applied localization model using linear intersection and do some concerned experiments to estimate the location computation algorithm.Abstract: Knowing the locations of nodes in wireless sensor networks (WSN) is essential for many applications. Nodes in a WSN can have multiple capabilities and exploiting one or more of the capabilities can help to solve the localization problem. In this paper, we assume that each node in a WSN has the capability of distance measurement and present a location computation technique called linear intersection for node localization. We also propose an applied localization model using linear intersection and do some concerned experiments to estimate the location computation algorithm.
-
Key words:
- wirelell sensor network /
- localization /
- linear intersection /
- error
计量
- 文章访问数: 2667
- HTML全文浏览量: 63
- PDF下载量: 1899
- 被引次数: 0