Information spreading in stationary Markovian evolving graphs

IEEE Transactions on Parallel and Distributed Systems

Volumn 22, Issue 9, 2011, Pages 1425-1432

  Clementi, Andrea ^a   Monti, Angelo ^b   Pasquale, Francesco ^c   Silvestri, Riccardo ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF SALERNO   (Italy)

Author keywords

flooding; Mobile ad hoc networks; random graphs

Indexed keywords

COMPLETION TIME; DYNAMIC GRAPH; EVOLVING GRAPHS; FLOODING MECHANISM; HIGH PROBABILITY; INPUT PARAMETER; MARKOVIAN; RANDOM GRAPHS; RANDOM WALK; STATIONARY PHASE; TRANSMISSION RADIUS; UPPER BOUND;

GRAPHIC METHODS; MOBILE AD HOC NETWORKS; RADIO BROADCASTING; RADIO STATIONS; RADIO TRANSMISSION; WIRELESS NETWORKS;

GRAPH THEORY;

EID: 79960838736     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2011.33     Document Type: Article

References (32)

1. D. Aldous and J. Fill, "Reversible Markov Chains and Random Walks on Graphs," http://stat-www.berkeley.edu/users/aldous/RWG/book.html, 2002.
2. C. Avin, M. Koucky, and Z. Lotker, "How to Explore a Fast-Changing World," Proc. 35th Int'l Colloquium on Automata, Languages and Programming (ICALP '08), pp. 121-132, 2008.
3. N. Bansal and Z. Liu, "Capacity, Delay, and Mobility in Wireless Ad Hoc Networks," Proc. 22nd IEEE INFOCOM, 2003.
4. H. Baumann, P. Crescenzi, and P. Fraigniaud, "Parsimonious Flooding in Dynamic Graphs," Proc. 28th ACM Symp. Principles of Distributed Computing (PODC '09), pp. 260-269, 2009.
5. Mathematical Epidemiology. F. Brauer, P. van den Driessche, and J. Wu, eds., Springer 2008.
6. T. Camp, J. Boleng, and V. Davies, "A Survey of Mobility Models for Ad Hoc Network Research," Wireless Communication and Mobile Computing, vol. 2, no. 5, pp. 483-502, 2002. (Pubitemid 135713186)
7. T. Camp, W. Navidi, and N. Bauer, "Improving the Accuracy of Random Waypoint Simulations through Steady-State Initialization," Proc. 15th Int'l Conf. Modelling and Simulation, pp. 319-326, 2004. (Pubitemid 40700448)
8. N.B. Chang and M. Liu, "Optimal Contolled Flooding Search in a Large Wireless Network," Proc. Third Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WIOPT '05), pp. 229-237, 2005. (Pubitemid 43803550)
9. A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri, "Flooding Time in Edge-Markovian Dynamic Graphs," Proc. 27th Ann. ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing (PODC '08), pp. 213-222, 2008.
10. A. Clementi, A. Monti, F. Pasquale, and R. Silvestri, "Communication in Dynamic Radio Networks," Proc. 26th Ann. ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing (PODC '07), pp. 205-214, 2007. (Pubitemid 350229317)
11. A. Clementi, A. Monti, F. Pasquale, and R. Silvestri, "Information Spreading in Stationary Markovian Evolving Graphs," Proc. IEEE Int'l Symp. Parallel and Distributed Processing (IPDPS '09), pp. 1-12, 2009.
12. A. Clementi, F. Pasquale, and R. Silvestri, "Manets: High Mobility Can Make Up for Low Transmission Power," Proc. 36th Int'l Colloquium on Automata, Languages and Programming (ICALP '09), pp. 387-398, 2009.
13. C. Cooper and A. Frieze, "The Cover Time of Sparse Random Graphs," 2008.
14. J. Diaz, D. Mitsche, and X. Perez-Gimenez, "On the Connectivity of Dynamic Random Geometric Graphs," Proc. 19th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '08), pp. 601-610, 2008.
15. J. Diaz, X. Perez, M.J. Serna, and N.C. Wormald, "Walkers on the Cycle and the Grid," SIAM J. Discrete Math., vol. 22, no. 2, pp. 747-775, 2008.
16. S.N. Dorogovtsev and J.F.F. Mendes, Evolution of Networks. Oxford Univ. Press, 2003.
17. M.M.C. Gkantsidis and A. Saberi, "Hybrid Search Schemes for Unstructured Peer-to-Peer Networks," Proc. 24th IEEE INFOCOM, pp. 1526-1537, 2005. (Pubitemid 41390670)
18. Gnutella. "Gnutella rfc," http://rfc-gnutella.sourceforge.net, 2002.
19. M. Grossglauser and N.C. Tse, "Mobility Increases the Capacity of Ad-Hoc Wireless Networks," IEEE/ACM Trans. Networking, vol. 10, no. 4, pp. 477-486, Aug. 2002. (Pubitemid 35000391)
20. R.A. Guerin, "Channel Occupancy Time Distribution in a Cellular Radio System," IEEE Trans. Veichular Technology, vol. VT-36, no. 3, pp. 89-99, Aug. 1987.
21. Z.J. Haas, "The Routing Algorithm for the Reconfigurable Wireless Networks," Proc. Sixth Int'l Conf. Universal Personal Communications (ICUPC), 1997.
22. S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, "A Survey of Gossiping and Broadcasting in Communication Networks," Networks, vol. 18, no. 4, pp. 319-349, 1988.
23. P. Jacquet, B. Mans, and G. Rodolakis, "Information Propagation Speed in Mobile and Delay Tolerant Networks," 2009.
24. D.B. Johnson and D.A. Maltz, "Dynamic Source Routing in Ad-Hoc Wireless Networks," Proc. Mobile Computing, pp. 153-181, 1996.
25. Z. Kong and E.M. Yeh, "On the Latency for Information Dissemination in Mobile Wireless Networks," Proc. ACM MobiHoc '08, pp. 139-148, 2008.
26. J.-Y. Leboudec and M. Vojnovic, "Perfect Simulation and the Stationarity of a Class of Mobility Models," Proc. 24th IEEE INFOCOM '05, pp. 2743-2754, 2005. (Pubitemid 41382387)
27. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, "Search and Replication in Unstructured Peer-to-Peer Networks," Proc. 16th Int'l Conf. Supercomputing (ICS '02), pp. 84-95, 2002. (Pubitemid 35039987)
28. P. Naine, D.F. Towsley, B. Liu, and Z. Liu, "Properties of Random Direction Models," Proc. 24th IEEE INFOCOM, pp. 1896-1907, 2005.
29. K. Oikonomou and I. Stavrakakis, "Performance Analysis of Probabilistic Flooding Using Random Graphs," Proc. First IEEE WoWMoM Workshop Autonomic and Opportunistic Communications (AOC), pp. 1-6, 2007.
30. B. Pittel, "On Spreading a Rumor," SIAM J. Applied Math., vol. 47, no. 1, pp. 213-223, 1987.
31. C. Scheideler, "Models and Techniques for Communication in Dynamic Networks," Proc. 19th Ann. Symp. Theoretical Aspects of Computer Science (STACS '02), pp. 27-49, 2002.
32. S. Wasserman, "Analyzing Social Networks as Stochastic Processes," J. Am. Statistical Assoc., vol. 75, pp. 280-294, 1980.