Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power

被引:24
作者
Clementi, Andrea [1 ]
Pasquale, Francesco [2 ]
Silvestri, Riccardo [3 ]
机构
[1] Univ Roma Tor Vergata, Dipartimento Ingn Impresa, I-00133 Rome, Italy
[2] Univ Roma Tor Vergata, I-00133 Rome, Italy
[3] Univ Roma La Sapienza, Dipartimento Informat, I-00198 Rome, Italy
关键词
Evolving graphs; flooding protocols; opportunistic mobile ad hoc networks; random processes; INFORMATION PROPAGATION SPEED; DATA-COLLECTION; DELAY; CAPACITY; MODEL;
D O I
10.1109/TNET.2012.2204407
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Opportunistic mobile ad hoc networks (MANETs) are a special class of sparse and disconnected MANETs where data communication exploits sporadic contact opportunities among nodes. We consider opportunistic MANETs where nodes move independently at random over a square of the plane. Nodes exchange data if they are at a distance at most r within each other, where r > 0 is the node transmission radius. The flooding time is the number of time-steps required to broadcast a message from a source node to every node of the network. Flooding time is an important measure of how fast information can spread in dynamic networks. We derive the first upper bound on the flooding time, which is a decreasing function of the maximal speed of the nodes. The bound holds with high probability, and it is nearly tight. Our bound shows that, thanks to node mobility, even when the network is sparse and disconnected, information spreading can be fast.
引用
收藏
页码:610 / 620
页数:11
相关论文
共 32 条
[21]  
Kinalis A, 2008, ACM S MODEL ANAL SIM, P149
[22]  
Kong ZN, 2008, MOBIHOC'08: PROCEEDINGS OF THE NINTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P139
[23]  
Lawler G.F., 1991, Intersections of Random Walks
[24]   The random trip model: Stability, stationary regime, and perfect simulation [J].
Le Boudec, Jean-Yves ;
Vojnovic, Milan .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2006, 14 (06) :1153-1166
[25]  
Martelli F., 2011, IIT1611 CNR
[26]  
McDiarmid C., 1989, SURVEYS COMBINATORIC, P148, DOI DOI 10.1017/CBO9781107359949.008
[27]   SWIM: A Simple Model to Generate Small Mobile Worlds [J].
Mei, Alessandro ;
Stefa, Julinda .
IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, :2106-2113
[28]  
Pelusi L., 2006, MANETS DISSERTATION
[29]  
PENROSE M., 2003, Random geometric graphs
[30]  
Peres Y, 2011, PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P412