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

东北大学学报(自然科学版) ›› 2012, Vol. 33 ›› Issue (9): 1257-1260.DOI: -

• 论著 • 上一篇    下一篇

基于定向天线的无线自组网拓扑控制算法

刘军;孙茜;李少华;郑重;   

  1. 东北大学信息科学与工程学院;空军装备研究院通信所;
  • 收稿日期:2013-06-19 修回日期:2013-06-19 出版日期:2012-09-15 发布日期:2013-04-04
  • 通讯作者: -
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(61151002,60939002)

Topology control algorithm based on directional antenna in wireless Ad Hoc networks

Liu, Jun (1); Sun, Qian (1); Li, Shao-Hua (2); Zheng, Zhong (2)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China; (2) Communication Institute, Equipment Academy of Air Force, Beijing 100096, China
  • Received:2013-06-19 Revised:2013-06-19 Online:2012-09-15 Published:2013-04-04
  • Contact: Liu, J.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

900

摘要： 为采用定向天线的特点解决无线自组网中节点异构、能量有限、带宽受限的问题,提出了一种基于定向天线的异构无线自组网拓扑控制算法K-DRNG.该算法包括三个阶段:信息收集阶段,节点控制发射功率,通过扇区转换机制收集邻域拓扑信息;拓扑构建阶段,节点根据链路权重和节点剩余能量构建定向邻近图;拓扑优化阶段,构建初始拓扑子图及添加或删除方向性链路,确保生成拓扑的双向连通性.仿真结果表明,算法能够降低网络中的节点平均能耗,提高无线资源空间复用性,改善网络性能.

关键词: 无线自组网, 拓扑控制, 定向天线, 异构, NS2

Abstract: In order to use directional antenna to solve the problems including heterogeneous nodes, limited resource and narrow bandwidth in wireless Ad Hoc network, a topology control algorithm named K-DRNG was proposed on the basis of directional antenna in heterogeneous wireless Ad Hoc network. The algorithm was mainly composed of three phases. The first stage was called information collection, in which each node collected the information of neighborhood by adjusting transmitting power and controlling sector conversion. The second stage was called topology construction, in which each node constructed directed relative neighborhood graph based on link weights and residual energy. The third stage was called topology optimization, in which each node constructed subgragh of initial topology and added or deleted additionally directional links with neighborhood to guarantee bidirectional connectivity of topology. Simulation results showed that the proposed algorithm can reduce the average energy consumption of nodes, increase the spatial reuse of radio resource, and thus improve integral network performance.

中图分类号: