Impact of scale-free topologies on gossiping in ad hoc networks

被引:7
作者
Garbinato, Benoit [1 ]
Rochat, Denis [1 ]
Tomassini, Marco [1 ]
机构
[1] Univ Lausanne, Inst Informat Syst, HEC, CH-1015 Lausanne, Switzerland
来源
SIXTH IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS, PROCEEDINGS | 2007年
关键词
D O I
10.1109/NCA.2007.29
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We show that scale-free topologies have a positive impact on the performance of gossiping algorithms in peer-to-peer overlay networks. This result is important in the context of ad hoc networks, where each node participates in controlling the network topology. Our study shows that, when combined with such topologies, typical gossiping algorithms tend to require fewer messages and experience smaller latency than when combined with other topologies, such as rings or grids. This suggests that the topology control scheme should aim at producing an overlay network that exhibits scale-free characteristics.
引用
收藏
页码:269 / +
页数:2
相关论文
共 5 条
[1]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[2]   Bimodal multicast [J].
Birman, KP ;
Hayden, M ;
Ozkasap, O ;
Xiao, Z ;
Budiu, M ;
Minsky, Y .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1999, 17 (02) :41-88
[3]  
Garbinato B, 2004, 2004 INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, P507
[4]  
LI XY, 2006, ACM T SENSOR NETWORK, V2, P129, DOI DOI 10.1007/S11355-006-0010-Z
[5]  
PEREIRA J, 2003, P 22 IEEE S REL DIST