欢迎访问中国科学院大学学报,今天是

中国科学院大学学报 ›› 2011, Vol. 28 ›› Issue (3): 382-388.DOI: 10.7523/j.issn.2095-6134.2011.3.016

• 论文 • 上一篇    下一篇

一个无需知道节点间距离的无线传感器网络定位方法

姜志鹏, 高随祥   

  1. 中国科学院研究生院数学科学学院, 北京 100049
  • 收稿日期:2010-06-14 修回日期:2010-08-10 发布日期:2011-05-15
  • 基金资助:

    Supported by the National Natural Science Foundation of China (10831006,10671024), Important Knowledge Innovation Project of Chinese Academy of Sciences ( kjcx-yw-s7) 

Localization algorithm without distance information for wireless sensor networks

JIANG Zhi-Peng, GAO Sui-Xiang   

  1. Department of Mathematical Sciences, Graduate University, Chinese Academy of Sciences, Beijing 100049, China
  • Received:2010-06-14 Revised:2010-08-10 Published:2011-05-15
  • Supported by:

    Supported by the National Natural Science Foundation of China (10831006,10671024), Important Knowledge Innovation Project of Chinese Academy of Sciences ( kjcx-yw-s7) 

摘要:

目前无线传感器网络中,大多数定位算法需要节点间的距离信息,这些方法有很多弊端.提出一种不需要节点间距离的定位方法,可以避免上述弊端.该方法只需要2个锚节点,且锚节点的位置任意.仿真结果显示该方法有较好的性能.

关键词: 无线传感器网络, 定位技术, 旋转信标

Abstract:

Most of existing localization algorithms of wireless sensor networks need the distance information between nodes and have many drawbacks. We propose a localization algorithm that does not need the distance information between nodes, and those drawbacks can be avoided. This algorithm only needs two anchors, and the locations of the anchors can be arbitrary. Simulation results show that this algorithm has good performance.

Key words: wireless sensor networks, localization approach, rotation beacon

中图分类号: