首页 | 本学科首页   官方微博 | 高级检索  
     

基于最小覆盖的多点中继集及其选择算法
引用本文:陈明刚,张陆勇,刘贺,陈鹏.基于最小覆盖的多点中继集及其选择算法[J].无线电工程,2011,41(4):10-13,19.
作者姓名:陈明刚  张陆勇  刘贺  陈鹏
作者单位:北京邮电大学信息与通信工程学院,北京,100876
摘    要:多点中继广播机制是无线mesh网络中一种高效的广播方法.但由于不同1跳邻居节点对相同2跳邻居节点的重叠覆盖,当前基于图论最小控制集理论的多点中继集易造成无线资源的浪费.定义一种使网络中重叠覆盖数量最少的多点中继集,并提出选取这样的多点中继集的快速启发式算法.通过仿真结果证明使用重叠覆盖数量最少的多点中继集能够有效利用无...

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

A Novel Multipoint Relay Set and Its Selection Algorithm
CHEN Ming-gang,ZHANG Lu-yong,LIU He,CHEN Peng.A Novel Multipoint Relay Set and Its Selection Algorithm[J].Radio Engineering of China,2011,41(4):10-13,19.
Authors:CHEN Ming-gang  ZHANG Lu-yong  LIU He  CHEN Peng
Affiliation:CHEN Ming-gang,ZHANG Lu-yong,LIU He,CHEN Peng(School of Information and Communication Engineering,Beijing University of Post and Telecommunication,Beijing 100876,China)
Abstract: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 ...
Keywords:WMN  broadcast  multipoint relay  set covering  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号