无线Adhoc网络中的负载平衡广播路由算法  

Load-balanced broadcast routing in wireless Ad hoc networks

作　　者：胡甜[1] 周颢[1] 赵保华[1] 

机构地区：[1]中国科学技术大学计算机科学与技术系

出　　处：《通信学报》2008年第7期129-134,共6页Journal on Communications

基　　金：国家自然科学基金资助项目(60602016,60241004);国家重点基础研究发展计划(“973”计划)基金资助项目(2003CB314801);国家高技术研究发展计划“(863”计划)基金资助项目(2007AA01Z428);华为基金资助项目(YJCB2006044TS)~~

摘　　要：在无线Ad hoc网络中,由于节点的能量有限,如果过分消耗一部分节点的能量使这些节点退出,这样将会影响整个网络的连通性,因而能量的负载平衡成为了一个核心问题,针对该问题提出了一个时间复杂度是O(n2)的贪心算法--WMST(weighted minimum spanning tree),该改进算法综合考虑了节点初始能量和通信的能量消耗等因素,随后又提出了一个改进算法,最后通过模拟实验将这2个算法与BIP算法进行了比较,实验表明该算法有效的改善了网络的负载平衡以及网络的生命期,最后,还指出了进一步的研究方向。In Ad hoc networks, where mobile hosts are powered by batteries, if a small set of batteries are drained out too early, the entire network may be partitioned. So a crucial issue is to improve the energy efficiency with an objective of balanced energy consumption. A greedy algorithm called WMST was proposed, and its time complexity is O（n^2）. This algorithm considered initial energy of each node and energy consumption of each communication. Simulation experiments demonstrated that the performance of the proposed algorithm improves the load balance and lifetime. Finally, future extensions were discussed.

关 键 词：无线ADHOC网络 广播路由 负载平衡 生命期 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]