Minimum Latency Gossiping in Radio Networks

doi:10.1109/TPDS.2009.123

CSpace

	Minimum Latency Gossiping in Radio Networks
	Huang, Scott C. -H.1; Wan, Peng-Jun 2; Du, Hongwei 2,3; Park, E. -K.4
	2010-06-01
发表期刊	IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
ISSN	1045-9219
卷号	21 期号:6 页码:790-800
摘要	We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and the objective is to distribute each node's message to the entire network with minimum latency. We studied this problem in the unit-size message model and the unit disk graph model. The unit-size model means different messages cannot be combined as one message, and the unit disk graph model means a link exists between two nodes if and only if their euclidean distance is less than 1. The minimum latency gossiping problem is known to be NP-hard in these two models. In this work, we designed a gossiping scheme that significantly improved all current gossiping algorithms in terms of the approximation ratio. Our work has approximation ratio 27, a great improvement of the current state-of-the-art algorithm (which has ratio 1,947). We also discussed the single point of failure problem and its impact on our approximation ratio. We designed an amended gossiping algorithm with ratio 27 in case of a nonsource node failure. We also designed an amended gossiping algorithm with ratio 29 in case of source failure.
关键词	Gossip all-to-all broadcast latency
DOI	10.1109/TPDS.2009.123
语种	英语
资助项目	Research Grants Council of Hong Kong[113807] ; US National Science Foundation[CNS-0831831]
WOS研究方向	Computer Science ; Engineering
WOS类目	Computer Science, Theory & Methods ; Engineering, Electrical & Electronic
WOS记录号	WOS:000276899800005
出版者	IEEE COMPUTER SOC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/10005
专题	中国科学院数学与系统科学研究院
通讯作者	Huang, Scott C. -H.
作者单位	1.City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China 2.IIT, Dept Comp Sci, Chicago, IL 60616 USA 3.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100864, Peoples R China 4.Univ Missouri, Sch Comp & Engn, CSEE Dept, Kansas City, MO 64110 USA
推荐引用方式 GB/T 7714	Huang, Scott C. -H.,Wan, Peng-Jun,Du, Hongwei,et al. Minimum Latency Gossiping in Radio Networks[J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,2010,21(6):790-800.
APA	Huang, Scott C. -H.,Wan, Peng-Jun,Du, Hongwei,&Park, E. -K..(2010).Minimum Latency Gossiping in Radio Networks.IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,21(6),790-800.
MLA	Huang, Scott C. -H.,et al."Minimum Latency Gossiping in Radio Networks".IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 21.6(2010):790-800.