QQ客服 官方微博 反馈留言

	On approximation ratios of minimum-energy multicast routing in wireless networks
	Cai, HX ; Zhao, YC
	2010-05-06 ; 2010-05-06
关键词	ad hoc wireless networks broadcasting MST Computer Science, Interdisciplinary Applications Mathematics, Applied
中文摘要	In the broadcasting of ad hoc wireless networks, energy conservation is a critical issue. Three heuristic algorithms were proposed in Wieselthier et al.(2001) for finding approximate minimum-energy broadcast routings: MST(minimum spanning tree), SPT(shortest-path tree), and BIP(broadcasting incremental power). Wan et al.(2001) characterized their performance in terms of approximation ratios. This paper points out some mistakes in the result of Wan et al.(2001), and proves that the upper bound of sum of squares of lengths of the edges in Euclidean MST in unit disk can be improved to 10.86, thus improves the approximation ratios of MST and BIP algorithm.
语种	英语 ; 英语
出版者	SPRINGER ; DORDRECHT ; VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/9895]
专题	清华大学
推荐引用方式 GB/T 7714	Cai, HX,Zhao, YC. On approximation ratios of minimum-energy multicast routing in wireless networks[J],2010, 2010.
APA	Cai, HX,&Zhao, YC.(2010).On approximation ratios of minimum-energy multicast routing in wireless networks..
MLA	Cai, HX,et al."On approximation ratios of minimum-energy multicast routing in wireless networks".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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