Journal of South China University of Technology (Natural Science Edition) ›› 2011, Vol. 39 ›› Issue (7): 38-44.doi: 10.3969/j.issn.1000-565X.2011.07.007

• Electronics, Communication & Automation Technology • Previous Articles     Next Articles

Single-Node Moving Algorithm for Improving Connectivity of Ad hoc Network

Zhang Ying  Shen Zhong  Chang Yi-lin   

  1. State Key Laboratory of Integrated Service Networks,Xidian University,Xi’an 710071,Shaanxi,China
  • Received:2011-01-20 Revised:2011-03-28 Online:2011-07-25 Published:2011-06-03
  • Contact: 张颖(1982-) ，女，博士生，主要从事无线Ad hoc 网络管理研究． E-mail:yingzhang@mail.xidian.edu.cn
  • About author:张颖(1982-) ，女，博士生，主要从事无线Ad hoc 网络管理研究．
  • Supported by:

    国家自然科学基金资助项目( 60972047) ; 高等学校学科创新引智计划项目( B08038)

PDF

1046

Abstract:

Proposed in this paper is a node moving algorithm based on the receiving signal strength,which is used to reduce or eliminate the cut nodes through the node movement without disconnecting the existing links. In this algorithm,according to the receiving signal strength,the moving node,the target node that the moving node tries to connect to,and the moving target position are respectively determined in the presence of cut nodes. Also,the cost
function of links is defined,by which the movement of node is transformed into a process of minimizing the cost function value. Simulated results show that,with the help of the proposed algorithm,the connectivity of Ad hoc networks can be improved only by moving a single node even when the node information is unavailable,and the network coverage keeps unchanged.

Key words: Ad hoc network, connectivity, receiving signal strength, node moveme

CLC Number: