期刊文献+

无线自组网的拓扑控制策略研究进展 被引量:13

Research Development of Topology Control Strategies for Wireless Ad Hoc Networks
下载PDF
导出
摘要 拓扑控制是无线自组网中最重要的技术之一,主要用来降低能量消耗和无线干扰,其目标是在降低能量消耗和无线干扰的前提下,控制网络节点问的通信串路和节点的传输范围,以提高全网的生命周期和效率,如连通性和对称性等。本文首先介绍了拓扑控制模型;然后给出了拓扑控制策略的分类,回顾了无线自组网拓扑控制策略的研究进展,并对有关策略进行了分析;最后给出了该领域的一些研究方向。 Topology control is one of the most important technologies which are used in wireless Ad hoc networks to reduce energy consumption and radio interference. Its goal is to control the communication links between network nodes and transmitting range of the nodes in order to prolong the life cycle of the whole network and improve its network efficiency, such as connectivity, symmetry, while reducing energy consumption and radio interference which have a strict effect on the transmitting range of the nodes. Firstly, topology control models are introduced. Secondly, a taxonomy of topology control techniques is provided, the progress of the topology control technologies is surveyed, and various topology control strategies are described. Finally. several directions of further research are suggested.
出处 《计算机科学》 CSCD 北大核心 2007年第10期70-73,共4页 Computer Science
基金 国家863计划项目(2002AA143021) 河北省自然科学基金项目(F2006000177) 河北省教育厅科技基金(2004445)
关键词 无线自组网 拓扑控制 能量消耗 网络管理 Wireless Ad hoc networks, Topology control, Energy consumption, Network management
  • 相关文献

参考文献18

  • 1Macker J P, Corson M S. Mobile Ad Hoc Networking and the IETF[J].Mobile Computing and Communications Review, 1998, 2(4): 9-15
  • 2Rajaraman R. Topology control and routing in Ad hoc network: a survey [J]. SIGACT News, 2002, 33(2) : 60-73
  • 3Liu Rui. Topology control for Ad hoc networks: [Ph D dissertation].S. University of Delaware, 2004
  • 4Santi P. Topology control in wireless Ad hoc and sensor networks [J].ACM Computing Surveys, 2005, 37(2) : 164-194
  • 5Rappaport T. Wireless Communications: principles and practice. second edition [M]. 北京:电子工业出版社,2004
  • 6Sen A, Huson M. A new model for scheduling packet radio networks [A]. In: IEEE INFOCOM [C]. Philadelphia, PA, USA: IEEE Press, 1996. 1116-1124
  • 7Penrose M. On k-connectivity for a geometric random graph [J]. Rand Struct Algorithm, 1999, 15(2): 145-164
  • 8Penrose M. A strong law for the longest edge of the minimal spanning tree. The Annals of Probability, 1999, 27 (1) : 246- 260
  • 9Santi P. The critical transmitting range for connectivity in mobile ad hoc networks [J]. IEEE Transactions on Mobile Computing, 2005, 4(3): 310-317
  • 10Jennings E, Okino C. Topology control for efficient information dissemination in ad-hoc networks [A].In: SPECTS' 02 [C]. San Diego, California, 2002. 1-7

同被引文献91

引证文献13

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部