移动自组网电力及负荷感知的构造最小连通支配集算法  

A Power and Load-Aware Algorithm for Constructing Minimal Connected Dominating Sets in Mobile Ad-Hoc Networks

作　　者：朱艺华[1] 沈毅俊[2] 吴小燕[2] 汪加才[3] 

机构地区：[1]浙江工业大学信息工程学院 [2]浙江工业大学经贸管理学院,浙江杭州310023 [3]南京审计学院计算机系,江苏南京210029

出　　处：《电子学报》2006年第11期2004-2007,共4页Acta Electronica Sinica

基　　金：国家自然科学基金(No.60473097;60673177);浙江省自然科学基金重点项目(No.Z105185);教育部留学回国人员科研启动基金;浙江省留学回国基金

摘　　要：在移动自组网络MANET(Mobile Ad-hoc Networks)中,移动节点之间的通信是多跳(Multi-hop)的,即需要网络中其他节点的参与得以进行,因此,节点之间的通信路径会因为节点的电力耗竭或节点的移动而中断.本文提出了根据移动节点当前电力及通信负荷来选择支配节点的最小连通支配集CDS(Connected Dominating Set)构造算法,这种算法可以减小由移动节点电力耗竭所致的通信路径失效的概率,也可以减少数据包通过各移动节点的延误时间,对设计MANET的高效稳定的路由策略有着重要的应用价值.Communication among mobile nodes in a MANET （ mnbile ad-hoc network） is multi-hop, i. e., it is performed via a chain of mobile nodes. It suffers from break due to power exhaustion or movement of the mobile nodes staying in the chain, An algorithm for constructing a minimal CDS （Connected Dominating Set） is proposed to solve the problem. Being aware of power and load of mobile nodes, the proposed algorithm can reduce both the probability of communication route breakage resulting from exhaustion of mobile nodes＇ power and the delay time of packets to be forwarded in intermediate nodes of a communication route. Additionally, it is significant for designing robust and effective routing strategies in MANETs.

关 键 词：移动自组网 支配集 路由策略 

分 类 号：TN92[电子电信—通信与信息系统]