东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2010, Vol. 31 ›› Issue (6): 795-798.DOI: -

• 论著 • 上一篇    下一篇

基于MCLP的WSN定位参考点选择算法

徐久强;王成龙;张圆圆;刘伟;   

  1. 东北大学信息科学与工程学院;
  • 收稿日期:2013-06-20 修回日期:2013-06-20 出版日期:2010-06-15 发布日期:2013-06-20
  • 通讯作者: -
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(60973022)

On the reference node selection algorithm based on MCLP in WSN

Xu, Jiu-Qiang (1); Wang, Cheng-Long (1); Zhang, Yuan-Yuan (1); Liu, Wei (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-20 Revised:2013-06-20 Online:2010-06-15 Published:2013-06-20
  • Contact: Xu, J.-Q.
  • About author:-
  • Supported by:
    -

RichHTML

1

PDF (PC)

1036

摘要： 为了避免经验算法和SHARP算法的覆盖度低和可靠性差的缺点,采用最大覆盖布局模型(MCLP)对定位参考点的选择进行研究,并将贪婪随机自适应算法(GRASP)应用到该模型.在此基础上提出了以覆盖度为目标的基于覆盖理论的定位参考点选择算法(CRS).该算法从构造最大三角形布局开始,然后采用逐步扩散的方式为定位参考点选择位置.最后利用Matlab进行仿真实验.仿真实验结果显示在不需要增加额外硬件开销情况下,CRS算法以增加布局时间为代价增加了覆盖度.

关键词: 无线传感器网络, 定位参考点, 定位参考点选择算法, MCLP, GRASP

Abstract: To get rid of the shortcoming of low coverage/reliability of both empirical algorithm and SHARP algorithm, the reference location nodes selected with the Maximum Coverage of the Layout Problem (MCLP) were investigated introducing the Greedy Random Adaptive Search Procedure (GRASP) into MCLP. Then, the Coverage based Reference node Selection (CRS) algorithm was proposed where a maximum triangular coverage should be laid out then spread over step by step so as to select the locations of reference nodes. The result of the simulation tested with Matlab showed that the CRS algorithm can make the coverage bigger at the cost of prolonging the time for layout without increasing extra overheads for hardware.

中图分类号: