首页|Index Geographic Gossip Algorithm for Information Dissemination over Regular Graphs
Index Geographic Gossip Algorithm for Information Dissemination over Regular Graphs
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
万方数据
维普
An Index geographic gossip (IGG) algorithm is proposed. Relay nodes participate in infor-mation exchange and updating. The cumulative number of times these nodes participate is characterized by an index number, which can be used to accelerate information updating. The convergence property of the IGG algorithm is theoretically analyzed in ring and grid network topologies. The IGG algorithm improves the standard gossip algorithm by a gain of O(n) in both convergence time and communication cost. Compared to the geographic gossip algorithm, the IGG algorithm has a gain on the order of O(n) and O(n1/2) in the average hop count for information exchange and communication cost, respectively. Finally, the proposed IGG algorithm is compared with various baselines through simulations, and it is shown that significant performance gain can be achieved.
Information disseminationGossip algorithmNode mobilityGeography
WANG Gang、LIN Zun、WANG Fuxiang
展开 >
School of Electrical and Information Engineering, Beihang University, Beijing 100191, China
China Mobile Communications Group Co. Ltd, Beijing 100053, China
This work is supported by the National Natural Science Foundation of China
NETL
NSTL
万方数据
维普
