基于最小覆盖的多点中继集及其选择算法  

A Novel Multipoint Relay Set and Its Selection Algorithm

作　　者：陈明刚[1] 张陆勇[1] 刘贺[1] 陈鹏[1] 

机构地区：[1]北京邮电大学信息与通信工程学院,北京100876

出　　处：《无线电工程》2011年第4期10-13,19,共5页Radio Engineering

摘　　要：多点中继广播机制是无线mesh网络中一种高效的广播方法。但由于不同1跳邻居节点对相同2跳邻居节点的重叠覆盖,当前基于图论最小控制集理论的多点中继集易造成无线资源的浪费。定义一种使网络中重叠覆盖数量最少的多点中继集,并提出选取这样的多点中继集的快速启发式算法。通过仿真结果证明使用重叠覆盖数量最少的多点中继集能够有效利用无线资源,减小广播对网络的影响。Multipoint Relay（MPR） is an effective broadcast mechanism in Wireless Mesh Network（WMN）.The current minimum Dominating Set based MPR set has minimum number of nodes.However,due to the phenomenon of overlapping coverage,MPR set with minimum number of nodes is not the best solution.The optimal MPR set is a set with minimum coverage cost and the selection is a Set Covering Problem（SCP）.A fast selection algorithm is proposed and its performance is analyzed.The simulation shows the novel MPR set can effectively lower negative effects of the broadcast on the entire network.

关 键 词：WMN 广播 多点中继 集合覆盖 

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