【摘要】 为解决Ad Hoc网络中节点的复杂性问题,提出一种基于MWMCDS(Maximal Weight Minimum ConnectedDominating Set)路由算法。该方法考虑到网络中节点的多样性和复杂性,将节点的功率大小或在线时间长短对应为每个节点的权值,在寻找尽可能小的CDS(Connected Dominating Set)的同时使其权值尽可能大,为更好地协调管理网络中其他节点提供一个高效可靠的通信路由。并对其中3种路由协议进行了网络仿真及性能分析比较。结果表明,在相同的仿真场景下,DSR(Dynamic Source Routing)和AODV(Ad Hoc On-DemandDistance Vector)协议的PDF(Packet Delivery Fraction)传输性能都能达到94%以上,好于DSDV(Destination-Sequenced Distance Vector)协议。更多还原

【Abstract】 Considering the complexity of the nodes in Ad hoc network in actual situation,we propose a routing algorithm based on MWMCDS(Maximal Weight Minimum Connected Dominating Set).This approach takes account of the diversity and complexity of the nodes in the network,so it weights each node on its power or online time.In this way,we will make the weights as large as possible while finding the CDS(Connected Dominating Set)as little as possible.So that we can find a highly efficient and reliable communication route to manage other nodes in the network.The network simulation and performance comparison has also been made for the 3 kinds of routing protocols.The result shows that in the same simulation scenarios,the PDF(Packet Delivery Fraction) in both DSR(Dynamic Source Routing)and AODV(Ad Hoc On-Demand Distance Vector)can reach up to 94%,better than DSDV(Destination-Sequenced Distance Vector).Only the route which uses higher PDF can cause the broadcasting routing algorism of Ad hoc network more effective.更多还原