QQ客服 官方微博 反馈留言

	Distributed low redundancy broadcast for uncoordinated duty-cycled WANETs
	Tang, Bin; Ye, Baoliu; Hong, Jue; You, Kun; Lu, Sanglu
	2011
会议名称	54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
会议地点	Houston, Texas, USA
英文摘要	Broadcast is a fundamental operation in wireless ad hoc networks (WANETs). To design efficient broadcast protocols, one of the most important concerns is to reduce broadcast redundancy. In conventional WANETs where nodes are always active, due to the broadcast nature of wireless medium, minimizingbroadcast redundancy is equivalent to finding a Minimum Connected Dominating Set (MCDS). However, this is not true for uncoordinated duty-cycledWANETs, where each node periodically switches between active and sleep states, and can only hear messages when it is active. In this paper, we investigate the minimum redundancy broadcast problem in uncoordinated duty-cycled WANETs. We first show that by modifying the conventional CDS-based approaches properly, a constant-approximation broadcast algorithm (MCA) can be obtained. We then propose a hierarchical CDS-based algorithm (HCA), improving the best known approximation ratio from 20 to 13.67. Both algorithms are distributed, and with low time and message complexities. Simulation results show that our algorithms achieve about 5%-30% performance improvement over the state-of-the art scheme.
收录类别	EI
语种	英语
内容类型	会议论文
源URL	[http://ir.siat.ac.cn:8080/handle/172644/3668]
专题	深圳先进技术研究院_其他
作者单位	2011
推荐引用方式 GB/T 7714	Tang, Bin,Ye, Baoliu,Hong, Jue,et al. Distributed low redundancy broadcast for uncoordinated duty-cycled WANETs[C]. 见:54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011. Houston, Texas, USA.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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