Exact analysis of latency of stateless opportunistic forwarding

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 828-836

  Chau, Chi Kin ^a   Basu, Prithwish ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b BBN TECHNOLOGIES   (United States)

Author keywords

Delay tolerant networks; Opportunistic forwarding; Random walks on finite graphs; Spectral graph theory; Wireless sensor networks

Indexed keywords

CONSTRAINED DEVICES; DATA DELIVERY; DELAY TOLERANT NETWORKS; DELIVERY TIME; DISTRIBUTED APPROACHES; DUTY-CYCLING; END-TO-END LATENCY; EXACT ANALYSIS; FAULT-TOLERANT; FINITE GRAPHS; GEOGRAPHICAL LOCATIONS; HITTING TIME; OPPORTUNISTIC FORWARDING; RANDOM WALK; RANDOM WALKS ON FINITE GRAPHS; REGULAR NETWORKS; RELAYING NODES; SOJOURN TIME; SPECTRAL GRAPH THEORY;

AD HOC NETWORKS; BLOCK CODES; GRAPH THEORY; HETEROGENEOUS NETWORKS; SENSOR NETWORKS; WIRELESS AD HOC NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 70349658647     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5061992     Document Type: Conference Paper

References (18)

1. P. Hui, A. Chaintreau, R. Gass, J. Scott, J. Crowcroft, and C. Diot, "Pocket switched networking: Challenges, feasibility, and implementation issues," in Proc. of Workshop on Autonomic Communication (WAC), Greece, October 2005.
2. I. Mabrouki, X. Lagrange, and G. Froc, "Random walk based routing protocol for wireless sensor networks," in Proc. of Conf. on Performance Evaluation Methodologies and Tools (ValueTools), France, 2007.
3. P. Basu and C.-K. Chau, "Opportunistic forwarding in wireless networks with duty cycling," in Proc. of ACM Workshop on Challenged Networks (CHANTS), September 2008.
4. 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 Networks Journal, vol. 5, no. 8, 2008.
5. S. Nath and P. B. Gibbons, "Communicating via fireflies: Geographic routing on duty cycled sensors," in Proc. of Intl. Conf. on Information Processing in Sensor Networks (IPSN), Cambridge, MA, April 2007.
6. L. Lovasz, "Random walk on graphs: A survey," Combinatorics, Paul Erdos is Eighty, vol. 2, pp. 1-46, 1993.
7. D. Aldous and J. A. Fill, "Reversible Markov chains and random walks on graphs," http://www.stat.berkeley.edu/~aldous/RWG/book.html, 1999, lecture notes.
8. D. A. Levin, Y. Peres, and E. L. Wilmer, "Markov chains and mixing times," http://www.oberlin.edu/markov/, 2006, lecture notes.
9. P. G. Doyle and J. L. Snell, Random Walks and Electrical Networks. Mathematical Association of America, 1984.
10. P. Tetali, "Random walks and the effective resistance of networks," Journal of Theoretical Probability, vol. 4, no. 1, pp. 1-46, 1991.
11. A. K. Chandra, P. Raghavan, R. Smolensky, and P. Tiwari, "The electrical resistance of a graph captures its commute and cover times," Computational Complexity, vol. 6, no. 4, pp. 312-340, 1996.
12. F. Chung and S.-Y. Yau, "Discrete Green's functions," Journal of Combinatorial Theory, Series A, vol. 91, pp. 191-214, 2000.
13. R. B. Ellis, "Discrete Green's functions for products of regular graphs," 2003, arXiv:math/0309080v2.
14. P. Basu and C.-K. Chau, "Latency of opportunistic forwarding in finite regular wireless networks," in Proc. of ACM Intl. Workshop on Foundation of Mobile Computing (DIAL M-POMC), August 2008.
15. C. Avin and G. Ercal, "On the cover time and mixing time of random geometric graphs," Theoretical Computer Science, vol. 380, pp. 2-22, June 2007.
16. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Information Theory, vol. 52, no. 6, June 2006.
17. D. Geller, I. Kra, S. Popescu, and S. Simanca, "On circulant matrices," http://www.math.sunysb.edu/~sorin/, lecture notes.
18. "Wikipedia: Trigonometric identities," http://en.wikipedia.org/ wiki/-Trigonometric-identity.