Skip to main content
SpringerLink
Log in

Fast flooding over Manhattan

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

We consider a Mobile Ad-hoc NETwork (MANET) formed by \(n\) agents that move at speed \(\text{ v}\) according to the Manhattan Random-Waypoint model over a square region of side length \(L\). This model has stationary properties that strongly depart from the well-studied Random-Walk model and that are typical in scenarios of vehicular traffic in urban zones. For instance, 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 and only if they are at (Euclidean) 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 \(\text{ v}\), and it is tight for a wide and relevant range of the network parameters (i.e. \(L, R\) and \(\text{ 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. This property holds even when \(R\) is exponentially below the connectivity threshold of the MANET and the speed \(\text{ v}\) is very low.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Notes

  1. It is not relevant whether \(b \) will visit the Suburb or not.

References

  1. Avin, C., Koucky, M., Lotker, Z.: How to explore a fast-changing world. In: Proceedings of 35th ICALP’08, LNCS, vol. 5125, pp. 121–132 (2008)

  2. Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocations. SIAM J. Comput. 29(1), 180–200 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. In: Proceedings of 28th ACM PODC, pp. 260–269 (2009)

  4. Bettstetter, C., Resta, G., Santi, P.: The node distribution of the random waypoint mobility model for wireless Ad Hoc networks. IEEE Trans. Mobile Comput. 2, 257–269 (2003)

    Article  Google Scholar 

  5. Camp, T., Boleng, J., Davies, V.: A survey of mobility models for ad hoc network research. Wirel. Commun. Mobile Comput. 2(5), 483–502 (2002)

    Article  Google Scholar 

  6. Camp, T., Navidi, W., Bauer, N.: Improving the accuracy of random waypoint simulations through steady-state initialization. In: Proceedings of 15th International Conference on Modelling and Simulation, pp. 319–326 (2004)

  7. Clementi, A., Pasquale, F., Silvestri, R.: MANETS: High mobility can make up for low transmission power. ArXive arXiv:0903.0520v1 (2009) (Ext. Abs. in Proc. of ICALP’09, LNCS 5556)

  8. Clementi, A., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time in edge-markovian dynamic graphs. SIAM J. Discret. Math. 24(4), 1694–1712 (2010). (Ext. Abs. in 27th ACM PODC’08)

    Article  MathSciNet  MATH  Google Scholar 

  9. Clementi, A., Monti, A., Pasquale, F., Silvestri, R.: Information spreading in stationary markovian evolving graphs. IEEE Trans. Parallel Distrib. Syst. 22(9), 1425–1432 (2011a). (Ext. Abs. in 23rd IEEE IPDPS’09)

    Article  Google Scholar 

  10. Clementi, A., Monti, A., Silvestri, R.: Modelling mobility: a discrete revolution. Ad Hoc Netw. 9(6), 998–1014 (2011b). (Ext. Abs. in Proc. of ICALP’10, LNCS 6199)

    Article  Google Scholar 

  11. Clementi, A., Silvestri, R., Trevisan, L.: Information Spreading in Dynamic Graphs. ArXiv: 1111.0583v1 (2011c)

  12. Crescenzi, P., Di Ianni, M., Marino, A., Rossi, G., Vocca, P.: Spatial node distribution of Manhattan path based random waypoint mobility models with applications. In: Proceedings of SIROCCO’09, LNCS, vol. 5869, pp. 154–166 (2009)

  13. Grossglauser, M., Tse, N.C.: Mobility increases the capacity of ad-hoc wireless networks. IEEE/ACM Trans. Netw. 10(4), 477–486 (2002)

    Article  Google Scholar 

  14. Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. Stoch. Anal. Control Optim. Appl. 547–566 (1998)

  15. Jain, S., Shaw, R., Brunette, W., Borriello, G., Roy, S.: Exploiting mobility for energy efficient data collection in wireless sensor networks. ACM/Kluwer MONET 11(3), 327–339 (2006)

    Google Scholar 

  16. Jacquet, P., Mans, B., Rodolakis, G.: Information propagation speed in mobile and delay tolerant networks. IEEE Trans. Inf. Theory 56, 5001–5015 (2010)

    Article  MathSciNet  Google Scholar 

  17. Kinalis, A., Nikoletseas, S.E.: Adaptive redundancy for data propagation exploiting dynamic sensory mobility. In: Proceedings of ACM MSWIM’08, pp. 149–156 (2008)

  18. Le Boudec, J.-Y., Vojnovic, M.: Perfect simulation and the stationarity of a class of mobility models. In: Proceedings of 24th IEEE INFOCOM, pp. 2743–2754 (2005)

  19. Le Boudec, J.-Y., Vojnovic, M.: The random trip model: stability, stationarity regime, and perfect simulation. IEEE/ACM Trans. Netw. 16(6), 1153–1166 (2006)

    Article  Google Scholar 

  20. Le Boudec, J.Y.: Understanding the simulation of mobility models with Palm calculus. Perform. Eval. 64(2), 126–147 (2007)

    Article  Google Scholar 

  21. Li, F., Wang, Y.: Routing in vehicular ad hoc networks: a survey. Vehicular Technol. Mag. IEEE 2(2), 12–22 (2007)

    Article  Google Scholar 

  22. Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)

    Book  MATH  Google Scholar 

  23. Pelusi, L., Passarella, A., Conti, M.: Beyond manets: dissertation on opportunistic networking. IIT-CNR Tech. Rep. (2006)

  24. Peres, Y., Sinclair, A., Sousi, P., Stauffer, A.: Mobile geometric graphs: detection, coverage and percolation. In: Proceedings of 22nd ACM-SIAM SODA, pp. 412–428 (2011)

  25. Pettarin, A., Pietracaprina, A., Pucci, G., Upfal, E.: Tight bounds on information dissemination in sparse mobile networks. In: Proceedings 30th ACM PODC, pp. 355–362 (2011)

  26. Zhao, W., Ammar, M., Zegura, E.: A message ferrying approach for data delivery in sparse mobile ad-hoc networks. In: Proceedings of 5th ACM MobiHoc’04 (2004)

Download references

Acknowledgments

We thank Francesco Pasquale for helpful comments on a preliminary version of this paper.

Author information

Authors and Affiliations

  1. Tor Vergata University of Rome, Rome, Italy

    Andrea Clementi

  2. Sapienza University of Rome, Rome, Italy

    Angelo Monti & Riccardo Silvestri

Authors
  1. Andrea Clementi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Angelo Monti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Riccardo Silvestri
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrea Clementi.

Additional information

An extended abstract of this work has been presented at the ACM PODC 2010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Clementi, A., Monti, A. & Silvestri, R. Fast flooding over Manhattan. Distrib. Comput. 26, 25–38 (2013). https://doi.org/10.1007/s00446-012-0182-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-012-0182-8

Keywords

Search

Navigation