research-article

Fast flooding over Manhattan

Authors:

Andrea Clementi,

Riccardo SilvestriAuthors Info & Claims

PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Pages 375 - 383

https://doi.org/10.1145/1835698.1835784

Published: 25 July 2010 Publication History

Abstract

We consider a Mobile Ad-hoc NETwork (MANET) 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 iff 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.

References

[1]

C. Avin and M. Koucky and Z. Lotker. How to explore a fast-changing world. In Proc. of 35th ICALP'08, LNCS 5125, 121--132, 2008.

Digital Library

[2]

H. Baumann, P. Crescenzi, P. Fraigniaud. Parsimonious flooding in dynamic graphs. In Proc. of 28th ACM PODC'09, 260--269, 2009.

Digital Library

[3]

Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. SIAM Journal on Computing, 29(1), 180--200, 1999.

Digital Library

[4]

C. Bettstetter, G. Resta, and P. Santi. The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks. IEEE Transactions onMobile Computing, 2, 257--269, 2003.

Digital Library

[5]

T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad hoc network research. Wireless Communication and Mobile Computing, 2(5), 483--502, 2002.

[6]

T. Camp, W. Navidi, and N. Bauer. Improving the accuracy of random waypoint simulations through steady-state initialization. In Proc. of 15th Int. Conf. on Modelling and Simulation, 319--326, 2004.

[7]

A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri. Flooding time in edge-markovian dynamic graphs. In Proc. of 27th ACM PODC'08, 213--222. 2008.

Digital Library

[8]

A. Clementi, A. Monti, F. Pasquale, and R. Silvestri. Information spreading in stationary markovian evolving graphs. In Proc. of 23rd IEEE IPDPS'09. 1--12, 2009.

Digital Library

[9]

A. Clementi, F. Pasquale, and R. Silvestri. MANETS: High mobility can make up for low transmission power. In Proc. of 36th ICALP'09, LNCS 5556, 387--398, 2009.

Digital Library

[10]

A. Clementi, A. Monti, and R. Silvestri. Modelling Mobility: A Discrete Revolution. In Proc. of 37th ICALP'10, to appear. Full version available at http://arxiv1.library.cornell.edu/abs/1002.1016v, 2010.

Digital Library

[11]

A. Clementi, A. Monti, and R. Silvestri. Fast Flooding over Manhattan. Full version available at http://arxiv1.library.cornell.edu/abs/1002.3757v1, 2010.

[12]

P. Crescenzi, M. Di Ianni, A. Marino, G. Rossi, and P. Vocca. Spatial Node Distribution ofManhattan Path Based Random Waypoint Mobility Models with Applications.In Proc. of SIROCCO'09, LNCS 5869, 154--166. 2009.

Digital Library

[13]

J. Diaz, D. Mitsche, and X. Perez-Gimenez. On the connectivity of dynamic random geometric graphs. In Proc. of 19th ACM-SIAM SODA'08, 601--610, 2008.

Digital Library

[14]

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

Digital Library

[15]

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

Digital Library

[16]

P. Gupta and P.R. Kumar. Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications, 547--566, 1998.

[17]

P. Jacquet, B. Mans, and G. Rodolakis. Information propagation speed in mobile and delay tolerant networks. In Proc. of 28th IEEE INFOCOM'09, 244--252, 2009.

[18]

A. Kinalis and S. E. Nikoletseas. Adaptive redundancy for data propagation exploiting dynamic sensory mobility. In Proc. of ACM MSWIM'08, 149--156, 2008.

Digital Library

[19]

J.-Y. Le Boudec and M. Vojnovic. Perfect simulation and the stationarity of a class of mobility models. In Proc. of 24th IEEE INFOCOM'05, 2743--2754, 2005.

[20]

J.-Y. Le Boudec and M. Vojnovic. The Random Trip Model: Stability, stationarity regime, and perfect simulation. IEEE/ACM Transactions on Networking, 16(6), 1153--1166, 2006.

Digital Library

[21]

J.-Y. Le Boudec. Understanding the simulation of mobility models with Palm calculus.Performance Evaluation, 64(2), 126--147, 2007.

Digital Library

[22]

L. Pelusi, A. Passarella, and M. Conti. Beyond manets: Dissertation on opportunistic networking. IIT-CNR Tech. Rep., 2006.

[23]

M. Penrose. Random Geometric Graphs. Oxford University Press, 2003.

[24]

P. Santi and D. M. Blough. The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Transactions on Mobile Computing, 2(1):25--39, 2003.

Digital Library

[25]

W. Zhao, M. H. Ammar, and E. W. Zegura. A message ferrying approach for data delivery in sparse mobile ad-hoc networks. In Proc. of 5th ACM MobiHoc'04, 187--198, 2004.

Digital Library

Cited By

Yang ZWu W(2018)The (T, L)-Path Model and Algorithms for Information Dissemination in Dynamic NetworksInformation10.3390/info90902129:9(212)Online publication date: 24-Aug-2018
https://doi.org/10.3390/info9090212
Lam HLiu ZMitzenmacher MSun XWang Y(2012)Information dissemination via random walks in d-dimensional spaceProceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms10.5555/2095116.2095244(1612-1622)Online publication date: 17-Jan-2012
https://dl.acm.org/doi/10.5555/2095116.2095244
Clementi ASilvestri RTrevisan LKowalski DPanconesi A(2012)Information spreading in dynamic graphsProceedings of the 2012 ACM symposium on Principles of distributed computing10.1145/2332432.2332439(37-46)Online publication date: 16-Jul-2012
https://dl.acm.org/doi/10.1145/2332432.2332439
Show More Cited By

Index Terms

Fast flooding over Manhattan

Recommendations

Fast flooding over Manhattan

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 ...
Opportunistic MANETs: mobility can make up for low transmission power

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 ...
Efficient location-aided flooding scheme initiated by receiver for MANETs
ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication

Flooding is a fundamental, critical, and indispensable operation for supporting various applications and protocols in wireless ad hoc networks. The traditional flooding scheme generates excessive redundant packet retransmissions, however, causing ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

July 2010

494 pages

ISBN:9781605588889

DOI:10.1145/1835698

General Chairs:
Andrea Richa
Arizona State University, USA
,
Rachid Guerraoui
EPFL, Switzerland

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PODC '10

Sponsor:

PODC '10: ACM Symposium on Principles of Distributed Computing

July 25 - 28, 2010

Zurich, Switzerland

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
180
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)2

Reflects downloads up to 12 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Yang ZWu W(2018)The (T, L)-Path Model and Algorithms for Information Dissemination in Dynamic NetworksInformation10.3390/info90902129:9(212)Online publication date: 24-Aug-2018
https://doi.org/10.3390/info9090212
Lam HLiu ZMitzenmacher MSun XWang Y(2012)Information dissemination via random walks in d-dimensional spaceProceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms10.5555/2095116.2095244(1612-1622)Online publication date: 17-Jan-2012
https://dl.acm.org/doi/10.5555/2095116.2095244
Clementi ASilvestri RTrevisan LKowalski DPanconesi A(2012)Information spreading in dynamic graphsProceedings of the 2012 ACM symposium on Principles of distributed computing10.1145/2332432.2332439(37-46)Online publication date: 16-Jul-2012
https://dl.acm.org/doi/10.1145/2332432.2332439
Clementi ASilvestri R(2011)Parsimonious flooding in geometric random-walksProceedings of the 25th international conference on Distributed computing10.5555/2075029.2075066(298-310)Online publication date: 20-Sep-2011
https://dl.acm.org/doi/10.5555/2075029.2075066
Kuhn FOshman R(2011)Dynamic networksACM SIGACT News10.1145/1959045.195906442:1(82-96)Online publication date: 21-Mar-2011
https://dl.acm.org/doi/10.1145/1959045.1959064
Clementi AMonti ASilvestri R(2011)Modelling mobilityAd Hoc Networks10.1016/j.adhoc.2010.09.0029:6(998-1014)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1016/j.adhoc.2010.09.002
Clementi ASilvestri R(2011)Parsimonious Flooding in Geometric Random-WalksDistributed Computing10.1007/978-3-642-24100-0_28(298-310)Online publication date: 2011
https://doi.org/10.1007/978-3-642-24100-0_28
Clementi AMonti ASilvestri R(2010)Modelling mobilityProceedings of the 37th international colloquium conference on Automata, languages and programming: Part II10.5555/1880999.1881053(490-501)Online publication date: 6-Jul-2010
https://dl.acm.org/doi/10.5555/1880999.1881053
Clementi AMonti ASilvestri R(2010)Modelling Mobility: A Discrete RevolutionAutomata, Languages and Programming10.1007/978-3-642-14162-1_41(490-501)Online publication date: 2010
https://doi.org/10.1007/978-3-642-14162-1_41

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten