We consider a Mobile Ad-hoc NETwork (MA NET) formed by n agents that move at speed v according to the Manhattan Random-Way Point model over a square region of side length L. The resulting stationary (agent) spatial probability distribution is far to be uniform: the average density over the "central zone" is asymptotically higher than that over the "suburb". Agents exchange data if they are at distance at most R within each other. We study the flooding time of this MANET: the number of time steps required to broadcast a message from one source agent to all agents of the network in the stationary phase. We prove the first asymptotical upper bound on the flooding time. This bound holds with high probability, it is a decreasing function of R and v, and it is tight for a wide and relevant range of the network parameters (i.e. L, R and v). A consequence of our result is that flooding over the sparse and highly-disconnected suburb can be as fast as flooding over the dense and connected central zone. Rather surprisingly, this property holds even when R is exponentially below the connectivity threshold of the MANET and the speed V is very low.
Fast Flooding over Manhattan / Andrea, Clementi; Monti, Angelo; Silvestri, Riccardo. - STAMPA. - (2010), pp. 375-383. (Intervento presentato al convegno 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing tenutosi a Zurich, SWITZERLAND nel JUL 25-28, 2010) [10.1145/1835698.1835784].
Fast Flooding over Manhattan
MONTI, Angelo;SILVESTRI, RICCARDO
2010
Abstract
We consider a Mobile Ad-hoc NETwork (MA NET) formed by n agents that move at speed v according to the Manhattan Random-Way Point model over a square region of side length L. The resulting stationary (agent) spatial probability distribution is far to be uniform: the average density over the "central zone" is asymptotically higher than that over the "suburb". Agents exchange data if they are at distance at most R within each other. We study the flooding time of this MANET: the number of time steps required to broadcast a message from one source agent to all agents of the network in the stationary phase. We prove the first asymptotical upper bound on the flooding time. This bound holds with high probability, it is a decreasing function of R and v, and it is tight for a wide and relevant range of the network parameters (i.e. L, R and v). A consequence of our result is that flooding over the sparse and highly-disconnected suburb can be as fast as flooding over the dense and connected central zone. Rather surprisingly, this property holds even when R is exponentially below the connectivity threshold of the MANET and the speed V is very low.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.