Abstract | ||
---|---|---|
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 O 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. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1109/TNET.2012.2204407 | IEEE/ACM Trans. Netw. |
Keywords | Field | DocType |
Mobile computing,Upper bound,Protocols,Random processes,Random variables,Mobile ad hoc networks | Mobile ad hoc network,Broadcasting,Upper and lower bounds,Computer science,Computer network,Stochastic process,Ad hoc wireless distribution service,Optimized Link State Routing Protocol,Wireless ad hoc network,Vehicular ad hoc network,Distributed computing | Journal |
Volume | Issue | ISSN |
21 | 2 | 1063-6692 |
Citations | PageRank | References |
15 | 0.73 | 22 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Andrea Clementi | 1 | 59 | 3.54 |
Francesco Pasquale | 2 | 421 | 28.22 |
Riccardo Silvestri | 3 | 1324 | 90.84 |