中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
improvedalgorithmforbroadcastschedulingofminimallatencyinwirelessadhocnetworks

文献类型:期刊论文

作者Shang Weiping2; Wan Pengjun3; Hu Xiaodong1
刊名actamathematicaeapplicataesinica
出版日期2010
卷号000期号:001页码:13
ISSN号0168-9673
英文摘要A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. One of the key communication operations is to broadcast a message from a source node. This paper studies the minimum latency broadcast scheduling problem in wireless ad hoc networks under collision-free transmission model. The previously best known algorithm for this NP-hard problem produces a broadcast schedule whose latency is at least 648(rmax/rmin)^2 times that of the optimal schedule, where rmax and rmin are the maximum and minimum transmission ranges of nodes in a network, respectively. We significantly improve this result by proposing a new scheduling algorithm whose approximation performance ratio is at most (1 + 2rmax/rmin)^2+32, Moreover, under the proposed scheduling each node just needs to forward a message at most once.
语种英语
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/46701]  
专题应用数学研究所
作者单位1.中国科学院数学与系统科学研究院
2.郑州大学
3.伊利诺理工学院
推荐引用方式
GB/T 7714
Shang Weiping,Wan Pengjun,Hu Xiaodong. improvedalgorithmforbroadcastschedulingofminimallatencyinwirelessadhocnetworks[J]. actamathematicaeapplicataesinica,2010,000(001):13.
APA Shang Weiping,Wan Pengjun,&Hu Xiaodong.(2010).improvedalgorithmforbroadcastschedulingofminimallatencyinwirelessadhocnetworks.actamathematicaeapplicataesinica,000(001),13.
MLA Shang Weiping,et al."improvedalgorithmforbroadcastschedulingofminimallatencyinwirelessadhocnetworks".actamathematicaeapplicataesinica 000.001(2010):13.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。