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.

Clementi, A., Pasquale, F., Silvestri, R. (2013). Opportunistic MANETs: mobility can make up for low transmission power. IEEE-ACM TRANSACTIONS ON NETWORKING, 21(2), 610-620 [10.1109/TNET.2012.2204407].

Opportunistic MANETs: mobility can make up for low transmission power

CLEMENTI, ANDREA;PASQUALE, FRANCESCO;
2013-04-01

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 > 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.
1-apr-2013
Pubblicato
Rilevanza internazionale
Articolo
Esperti anonimi
Settore INF/01 - INFORMATICA
Settore MAT/06 - PROBABILITA' E STATISTICA MATEMATICA
English
Con Impact Factor ISI
Mobile Ad-Hoc Networks; Information Spreading; Geometric Random Walks; Markov Chains
Clementi, A., Pasquale, F., Silvestri, R. (2013). Opportunistic MANETs: mobility can make up for low transmission power. IEEE-ACM TRANSACTIONS ON NETWORKING, 21(2), 610-620 [10.1109/TNET.2012.2204407].
Clementi, A; Pasquale, F; Silvestri, R
Articolo su rivista
File in questo prodotto:
File Dimensione Formato  
CPSToN-Final.pdf

solo utenti autorizzati

Descrizione: versione post peer review
Licenza: Copyright dell'editore
Dimensione 197.97 kB
Formato Adobe PDF
197.97 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2108/89807
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 29
  • ???jsp.display-item.citation.isi??? 24
social impact