improvedalgorithmforbroadcastschedulingofminimallatencyinwirelessadhocnetworks

CSpace > 应用数学研究所

	improvedalgorithmforbroadcastschedulingofminimallatencyinwirelessadhocnetworks
	Shang Weiping 1; Wan Pengjun 2; Hu Xiaodong3
	2010
发表期刊	actamathematicaeapplicataesinica
ISSN	0168-9673
卷号	000 期号:001 页码:13
摘要	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.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/46702
专题	应用数学研究所
作者单位	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.