Analysis of latency of stateless opportunistic forwarding in intermittently connected networks

IEEE/ACM Transactions on Networking

Volumn 19, Issue 4, 2011, Pages 1111-1124

  Chau, Chi Kin ^a,b   Basu, Prithwish ^c  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c BBN TECHNOLOGIES   (United States)

Author keywords

Intermittently connected networks; opportunistic forwarding; random walk in finite graphs; spectral graph theory

Indexed keywords

ANALYTICAL TOOL; DATA DELIVERY; DATA GATHERING; DELAY TOLERANT NETWORKS; DELIVERY TIME; DISTRIBUTED SCHEMES; END-TO-END LATENCY; FAULT-TOLERANT; FINITE GRAPHS; GEOGRAPHICAL LOCATIONS; GLOBAL NETWORKS; HITTING TIME; INTERMITTENTLY CONNECTED NETWORKS; NEXT-HOP; OPPORTUNISTIC FORWARDING; PACKET DELIVERY; PEER TO PEER; RANDOM WALK; RELAY NODE; RELAYING NODES; SIMPLIFIED MODELS; SPECTRAL GRAPH THEORY; TOPOLOGY AWARE; TRANSITION TIME;

DISTRIBUTED COMPUTER SYSTEMS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; RANDOM PROCESSES; SENSOR NETWORKS; TELECOMMUNICATION NETWORKS;

PEER TO PEER NETWORKS;

EID: 80051783055     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2010.2103321     Document Type: Article

References (35)

1. P. Hui, A. Chaintreau, R. Gass, J. Scott, J. Crowcroft, and C. Diot, "Pocket switched networking: Challenges, feasibility, and implementation issues," in Proc. WAC, Greece, Oct. 2005, pp. 1-12.
2. S. Dolev, E. Schiller, and J. L. Welch, "Random walk for self-stabilizing group communication in ad hoc networks," IEEE Trans. Mobile Comput., vol. 5, no. 7, pp. 893-905, Jul. 2006. (Pubitemid 44143938)
3. C. Gkantsidis, M. Mihail, and A. Saberi, "Random walks in peer-topeer networks: Algorithms and evaluation," Perform. Eval., vol. 63, no. 3, pp. 241-263, Mar. 2006. (Pubitemid 41705255)
4. I. Mabrouki, X. Lagrange, and G. Froc, "Random walk based routing protocol for wireless sensor networks," in Proc. valueTools, 2007, Article no. 71.
5. V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, "Diversity of forwarding paths in pocket switched networks," in Proc. ACM IMC, 2007, pp. 161-174.
6. C. Avin, M. Koucky, and Z. Lotker, "How to explore a fast-changing world (cover time of a simple random walk on evolving graphs)," in Proc. ACM ICALP, 2008, pp. 121-132.
7. J. Redi, S. Kolek, K. Manning, C. Partridge, R. Rosales-Hain, R. Ramanathan, and I. Castineyra, "Javelen: An ultra-low energy ad hoc wireless network," Ad Hoc Netw. J., vol. 5, pp. 108-126, Jan. 2008. (Pubitemid 47446454)
8. S. Nath and P. B. Gibbons, "Communicating via fireflies: Geographic routing on duty-cycled sensors," in Proc. IPSN, Cambridge, MA, Apr. 2007, pp. 440-449. (Pubitemid 47582174)
9. P. Basu and C.-K. Chau, "Opportunistic forwarding in wireless networks with duty cycling," in Proc. ACM CHANTS, Sep. 2008, pp. 19-26.
10. C.-F. Hsin and M. Liu, "Hitting time analysis for a class of random packet forwarding schemes in ad hoc networks," Ad Hoc Netw., vol. 7, no. 3, pp. 500-515, May 2008.
11. R. Beraldi, "Random walk with long jumps for wireless ad hoc networks," Ad Hoc Netw., vol. 7, no. 2, pp. 294-306, Mar. 2009.
12. E. Gelenbe, "A diffusion model for packet travel time in a random multihop medium," Trans. Sensor Netw., vol. 3, no. 2, pp. 1550-4859, Jun. 2007.
13. L. Lovasz, "Random walk on graphs: A survey," in Combinatorics, Paul Erdos Is Eighty. Budapest, Hungary: János Bolyai Math. Soc., 1993, vol. 2, pp. 1-46.
14. D. Aldous and J. A. Fill, "Reversible Markov chains and random walks on graphs," 1999 [Online]. Available: http://www.stat.berkeley.edu/ ~aldous/RWG/book.html
15. D. A. Levin, Y. Peres, and E. L. Wilmer, Markov Chains and Mixing Times. Providence, RI: Amer. Math. Soc., 2009.
16. P. G. Doyle and J. L. Snell, Random Walks and Electrical Networks. Washington, DC: Math. Assoc. Amer., 1984.
17. P. Tetali, "Random walks and the effective resistance of networks," J. Theor. Probab., vol. 4, no. 1, pp. 1-46, 1991.
18. A. K. Chandra, P. Raghavan, R. Smolensky, and P. Tiwari, "The electrical resistance of a graph captures its commute and cover times," Comput. Complexity, vol. 6, no. 4, pp. 312-340, 1996. (Pubitemid 126313289)
19. F. Chung and S.-Y. Yau, "Discrete Green's functions," J. Combin. Theor. Ser., vol. 91, no. 1-2, pp. 191-214, Jul. 2000.
20. R. B. Ellis, "Discrete Green's functions for products of regular graphs," 2003 [Online]. Available: http://arxiv.org/abs/math/0309080
21. P. Basu and C.-K. Chau, "Latency of opportunistic forwarding in finite regular wireless networks," in Proc. ACM DIAL M-POMC, Aug. 2008, pp. 55-64.
22. C. Avin and G. Ercal, "On the cover time and mixing time of random geometric graphs," Theor. Comput. Sci., vol. 380, pp. 2-22, Jun. 2007. (Pubitemid 46754590)
23. I. Mabrouki, X. Lagrange, and G. Froc, "Analytical evaluation of unbiased random walks in wireless sensor networks," in Proc. Autonom. Spontaneous Netw. Symp., 2008.
24. I. Mabrouki, X. Lagrange, and G. Froc, "Design and performance of wireless data gathering networks based on unicast random walk routing," IEEE/ACM Trans. Netw., vol. 17, no. 4, pp. 1214-1227, Aug. 2009.
25. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Efficient routing in intermittently connected mobile networks: The single-copy case," IEEE/ACM Trans. Netw., vol. 16, no. 1, pp. 63-76, Feb. 2008. (Pubitemid 351386756)
26. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Efficient routing in intermittently connected mobile networks: The multiple-copy case," IEEE/ACM Trans. Netw., vol. 16, no. 1, pp. 77-90, Feb. 2008. (Pubitemid 351386757)
27. M. Sigelle, I. H. Jermyn, S. Perreau, and A. Jayasuriya, "Lattice Green functions and diffusion for modelling traffic routing in ad hoc networks," in Proc. PHYSCOMNET, 2009.
28. C.-K. Chau and P. Basu, "Analysis of latency of stateless opportunistic forwarding in intermittently connected networks," Comput. Lab., Univ. Cambridge, Cambridge, U.K., Tech. Rep., 2010.
29. Y. Li and Z.-L. Zhang, "Random walks on digraphs: A theoretical framework for estimating transmission costs in wireless routing," in Proc. IEEE INFOCOM, Mar. 2010, pp. 1-9.
30. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2508-2530, Jun. 2006. (Pubitemid 43898906)
31. C. Santivanez and R. Ramanathan, "Hazy sighted link state (HSLS) routing: A scalable link state algorithm," BBN Technologies, Cambridge, MA, Tech. Rep. BBN-TM-1301, 2001.
32. N. Alon, C. Avin, M. Koucky, G. Kozma, Z. Lotker, and M. Tuttle, "Many random walks are faster than one," in Proc. ACM SPAA, 2008, pp. 119-128.
33. C. Cooper, A. Frieze, and T. Radzik, "Multiple random walks in random regular graphs," SIAM J. Discrete Math., vol. 380, no. 4, pp. 1738-1761, 2009.
34. D. Geller, I. Kra, S. Popescu, and S. Simanca, "On circulant matrices," 2006 [Online]. Available: http://www.math.sunysb.edu/~sorin/
35. "List of trigonometric identities," Wikipedia 2010 [Online]. Available: http://en.wikipedia.org/wiki/Trigonometric-identity