中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 数学与系统科学研究院
  3. 中国科学院数学与系统科学研究院
Minimum Latency Gossiping in Radio Networks

文献类型：期刊论文

作者Huang, Scott C. -H.1; Wan, Peng-Jun2; Du, Hongwei2,3; Park, E. -K.4
刊名IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
出版日期2010-06-01
卷号21期号:6页码:790-800
关键词Gossip all-to-all broadcast latency
ISSN号1045-9219
DOI10.1109/TPDS.2009.123
英文摘要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.
资助项目Research Grants Council of Hong Kong[113807] ; US National Science Foundation[CNS-0831831]
WOS研究方向Computer Science ; Engineering
语种英语
WOS记录号WOS:000276899800005
出版者IEEE COMPUTER SOC
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/10004]  
专题中国科学院数学与系统科学研究院
通讯作者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.

入库方式： OAI收割

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

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

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