Ad Hoc 网络中改善拓扑控制性能的移动控制算法
作者:
基金项目:

国家自然科学基金(61172069); 陕西省自然科学基础研究计划(2011JM8029); 中央高校基本科研业务费专项资金 (CHD2009JC); 高等学校学科创新引智计划(B08038)


Movement Control Algorithms for Improving Topology Control Performance in Ad Hoc Networks
Author:
  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [20]
  • |
  • 相似文献 [20]
  • |
  • 引证文献
  • | |
  • 文章评论
    摘要:

    在无线Ad Hoc 网络中,拓扑控制算法能够使节点的传输功率小于最大传输功率,从而可以节省网络能量,提高网络容量.由于节点分布的随机性,在节点较为稀疏的区域,拓扑控制算法存在着局限性,因而提出了移动控制算法来改善拓扑控制算法的性能.在保证网络连通性的前提下,算法首先根据收集到的信息,通过构造网络最小生成树确定较长的通信链路,并移动网络中的部分节点使这些链路缩短,从而显著减小网络中较大的通信半径,提高了拓扑控制的性能.仿真实现了PMST-P,PMST-UV和LMST-LUV 这3 种移动控制算法,并对它们的性能进行了讨论和相互比较.

    Abstract:

    In Ad Hoc networks, topology control is designed to save energy and increase network capacity by enabling nodes to use proper transmission power, which is usually much smaller than the maximal transmission power. However, the randomicity of network deployment and node movement results in a non-uniform distribution of nodes. In a region where nodes are sparse, the distance between two nodes may be much longer than that in a dense region, so the transmission power is not able decrease and does not depend on which topology control algorithm is adopted. For the first time, this paper proposes movement control algorithms to improve performance of topology control by moving a subset of nodes to desiring positions. Based on the minimum spanning tree of the network topology graph, addition links are determined. Moreover, addition links are shortened and large communication range may be reduced by moving some nodes. Three movement algorithms, PMST-P, PMST-UV and LMST-LUV, are realized, and their performance is compared with each other with respect to maximum communication range, total moving distance and etc. using simulations.

    参考文献
    [1] Li N, Hou JC, Sha L. Design and analysis of an MST-based topology control algorithm. In: Proc. of the IEEE INFOCOM. San Francisco: IEEE Press, 2003. 1702-1712. [doi: 10.1109/INFCOM.2003.1209193]
    [2] Li L, Halpern JY, Bahl P, Wang YM, Wattenhofer R. A cone-based distributed topology-control algorithm for wireless multi-hop networks. IEEE/ACM Trans. on Networking, 2005,13(1):147-159. [doi: 10.1109/TNET.2004.842229]
    [3] Wattenhofer R, Zollinger A. XTC: A practical topology control algorithm for ad-hoc networks. In: Proc. of the 4th Int’l Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN). New Mexico: IEEE Press, 2004. 216-223. [doi: 10.1109/IPDPS.2004.1303248]
    [4] Jones CE, Sivalingam KM, Agrawal P, Chen JC. A survey of energy efficient network protocols for wireless networks. Wireless Networks, 2001,7(4):343-358. [doi: 10.1023/A:1016627727877]
    [5] Li L, Halpern JY. A minimum-energy path-preserving topology-control algorithm. IEEE Trans. on Wireless Communications, 2004, 3(3):910-921. [doi: 10.1109/TWC.2004.826324]
    [6] Li N, Hou JC. Localized topology control algorithms for heterogeneous wireless networks. IEEE/ACM Trans. on Networking, 2005, 13(6):1313-1324. [doi: 10.1109/TNET.2005.860095]
    [7] Wattenhofer R, Li L, Bahl V, Wang YM. Distributed topology control for power efficient operation in multihop wireless ad hoc networks. In: Proc. of the IEEE INFOCOM. Alaska: IEEE Press, 2001. 1388-1397. [doi: 10.1109/INFCOM.2001.916634]
    [8] Cardei M, Du DZ. Improving wireless sensor network lifetime through power aware organization. Wireless Networks, 2005,11(3): 333-340. [doi: 10.1007/s11276-005-6615-6]
    [9] Tian D, Georganas ND. A node scheduling scheme for energy conservation in large wireless sensor networks. Wireless Communications and Mobile Computing, 2003,3(2):271-290. [doi: 10.1002/wcm.116]
    [10] Yan T, He T, Stankovic JA. Differentiated surveillance for sensor networks. In: Proc. of the ACM Int’l Conf. on Embedded Networked Sensor Systems. Los Angeles: IEEE Press, 2003. 51-62. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12. 2637 [doi: 10.1145/958491.958498]
    [11] Basu P, Redi J. Movement control algorithms for realization of fault-tolerant ad hoc robot networks. IEEE Networks, 2004,18(4): 36-44. [doi: 10.1109/MNET.2004.1316760]
    [12] Lin J. Distributed mobility control for fault-tolerant mobile networks. In: Proc. of the 2005 Systems Communications. New York: IEEE Press, 2005. 61-66. [doi: 10.1109/ICW.2005.42]
    [13] Kashyap A, Shayman M. Relay placement and movement control for realization of fault-tolerant ad hoc networks. In: Proc. of the 41st Annual Conf. on Information Sciences and Systems. Baltimore: IEEE Press, 2007. 783-788. [doi: 10.1109/CISS.2007. 4298415]
    [14] Frew EW, Brown TX, Dixon C, Henkel D. Establishment and maintenance of a delay tolerant network through decentralized mobility control. In: Proc. of the 2006 IEEE Int’l Conf. on Networking, Sensing and Control. 2006. 584-589.
    [15] Wang GL, Cao GH, La Porta TF. Movement-Assisted sensor deployment. IEEE Trans. on Mobile Computing, 2006,5(6):640-652.[doi: 10.1109/TMC.2006.80]
    [16] Zou Y, Chakrabarty K. Sensor deployment and target localization based on virtual forces. In: Proc. of the IEEE INFOCOM. San Francisco: IEEE Press, 2003. 1293-1303. [doi: 10.1109/INFCOM.2003.1208965]
    [17] Lloyd EL, Liu R, Marathe MV, Ramanathan R, Ravi SS. Algorithmic aspects of topology control problems for ad hoc networks. In: Proc. of the IEEE Mobile Ad Hoc Networking and Computing (MOBIHOC). Lausanne: IEEE Press, 2002. 123-134. [doi: 10.1145/ 1046430.1046433]
    [18] Shen Z, Chang YL, Cui C, Zhang X. Study of the minimum-energy path-preserving topology control algorithm for wireless Ad Hoc networks. Journal of Xidian University (Natrual Science), 2006,33(3):341-346 (in Chinese with English abstract).
    [19] Gong WB, Chang YL, Shen Z, Zhang Y. Mobile deployment based on minimum coverage overlap in wireless sensor networks. Journal of system simulation, 2008,20(13):3604-3609 (in Chinese with English abstract).
    [20] Gong WB. Study of the Node Mobility Techniques [Ph.D. Thesis]. Xi’an: Xidian University, 2009 (in Chinese)
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

公维宾,常义林,沈中. Ad Hoc 网络中改善拓扑控制性能的移动控制算法.软件学报,2011,22(10):2335-2345

复制
分享
文章指标
  • 点击次数:4718
  • 下载次数: 5532
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2008-05-07
  • 最后修改日期:2009-07-06
文章二维码
您是第20057087位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号