Weak state routing for large-scale dynamic networks

IEEE/ACM Transactions on Networking

Volumn 18, Issue 5, 2010, Pages 1450-1463

  Acer, Utku Günay ^a,b   Kalyanaraman, Shivkumar ^a,c   Abouzeid, Alhussein A ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b INRIA   (France)

^c IBM INDIA RESEARCH LAB   (India)

Author keywords

Dynamic networks; unstructured routing; weak state

Indexed keywords

ASYMPTOTICALLY EFFICIENT; AVERAGE PATH LENGTH; CONTROL MESSAGES; CONTROL TRAFFIC; CORRESPONDING STATE; DATA TRAFFIC; DESTINATION NODES; DYNAMIC NETWORK; LARGE-SCALE DYNAMICS; PACKET DELIVERY; PACKET DELIVERY RATIO; PACKET REACHES; PROTOCOL OVERHEAD; ROUTING TABLE; SIMULATION RESULT; STATE COMPLEXITY; UNSTRUCTURED ROUTING; WEAK STATE;

ROUTING PROTOCOLS;

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

References (35)

1. U. G. Acer, S. Kalyanaraman, and A. A. Abouzeid, "Weak state routing for large scale dynamic networks," in Proc. ACM MobiCom, 2007, pp. 290-301.
2. P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Viennot, "Optimized link state routing protocol for ad hoc networks," in Proc. IEEE INMIC, 2001, pp. 62-68.
3. J. Li, J. Jannotti, D. De Couto, D.Karger, and R. Morris, "A scalable location service for geographic ad hoc routing," in Proc. ACM MobiCom, 2000, pp. 120-130.
4. B. Karp and H. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. ACM MobiCom, 2000, pp. 243-254.
5. N. Bisnik and A. A. Abouzeid, "Capacity deficit in mobile wireless ad hoc networks due to geographic routing overheads," in Proc. IEEE INFOCOM, 2007, pp. 517-525.
6. D. Wang and A. A. Abouzeid, "Link state routing overhead in mobile ad hoc networks: A rate-distortion formulation," in Proc. IEEE INFOCOM, 2008, pp. 2011-2019.
7. B.-N. Cheng, M. Yuksel, and S. Kalyanaraman, "Orthogonal rendezvous routing protocol for wireless mesh networks," IEEE/ACM Trans. Netw., vol. 17, no. 2, pp. 542-555, Apr. 2009.
8. D.D. Clark, "The design philosophy of the DARPA internet protocols," in Proc. ACM SIGCOMM, 1988, pp. 106-114.
9. S. Raman and S. McCanne, "Model, analysis, and protocol framework for soft state-based communication," Comput. Commun. Rev., vol. 29, no. 4, pp. 15-25, 1999.
10. P. Ji, Z. Ge, J. Kurose, and D. Towsley, "A comparison of hard-state and soft-state signaling protocols," IEEE/ACM Trans. Netw., vol. 15, no. 2, pp. 281-294, Apr. 2007.
11. U. G. Acer, A. Abouzeid, and S. Kalyanaraman, "An evaluation of weak state mechanism design for indirection in dynamic networks," in Proc. IEEE INFOCOM, 2009, pp. 1125-1133.
12. C. E. Perkins and P. Bhagwat, "Highly dynamic destination-se-quenced distance-vector routing (DSDV) for mobile computers," Comput. Commun. Rev., vol. 24, no. 4, p. 234, 1994.
13. D. B. Johnson and D. A. Maltz, "Dynamic source routing in ad hoc wireless networks," in Mobile Computing, T. Imielinski and H. Korth, Eds. Norwell, MA: Kluwer, 1996, vol. 353.
14. C. E. Perkins and E. Royer, "Ad-hoc on-demand distance vector routing," in Proc. IEEE WMCSA, 1999, pp. 90-100.
15. H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, "Age matters: Efficient route discovery in mobile ad hoc networks using encounter ages," in Proc. ACM MobiHoc, 2003, pp. 257-266.
16. M. Grossglauser and M. Vetterli, "Locating mobile nodes with EASE: Learning efficient routes from encounter histories alone," IEEE/ACM Trans. Netw., vol. 14, no. 3, pp. 457-469, Jun. 2006.
17. 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.
18. S. Jain, K. Fall, and R. Patra, "Routing in a delay tolerant network," Comput. Commun. Rev., vol. 34, no. 4, pp. 145-157, 2004.
19. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and wait: An efficient routing scheme for intermittently connected mobile networks," in Proc. ACM SIGCOMM, 2005, pp. 252-259.
20. Y. Wang, S. Jain, M. Martonosi, and K. Fall, "Erasure-coding based routing for opportunistic networks," in Proc. ACM SIGCOMM, 2005, pp. 229-236.
21. M. Grossglauser and D. N. Tse, "Mobility increases the capacity of ad hoc wireless networks," IEEE/ACM Trans. Netw., vol. 10, no. 4, pp. 477-486, Aug. 2002. (Pubitemid 35000391)
22. A. Lindgren, A. Doria, and O. Schelen, "Probabilistic routing in intermittently connected networks," in Proc. SAPIR, 2004, Lecture Notes in Comput. Sci. 3126, pp. 239-254.
23. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, "Search and replication in unstructured peer-to-peer networks," in Proc. Int. Conf. Super-comput., 2002, pp. 84-95. (Pubitemid 35039987)
24. C. Gkantsidis, M. Mihail, and A. Saberi, "Random walks in peer-to-peer networks," in Proc. IEEE INFOCOM, 2004, vol. 1, pp. 120-130.
25. S. C. Rhea and J. Kubiatowicz, "Probabilistic location and routing," in Proc. IEEE INFOCOM, 2002, vol. 3, pp. 1248-1257.
26. A. Kumar, J. Xu, and E. W. Zegura, "Efficient and scalable query routing for unstructured peer-to-peer networks," in Proc. IEEE IN-FOCOM, 2005, vol. 2, pp. 1162-1173.
27. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup protocol for Internet applications," IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 17-32, Feb. 2003.
28. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Pani-grahy, "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web," in Proc. ACM Symp. Theory Comput., 1997, pp. 654-663.
29. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making gnutella-like P2P systems scalable," Comput. Commun. Rev., vol. 33, no. 4, pp. 407-418, 2003.
30. M. Caesar, M. Castro, E. B. Nightingale, G. O'Shea, and A. Rowstron, "Virtual ring routing: Network routing inspired by DHTs," Comput. Commun. Rev., vol. 36, no. 4, pp. 351-362, 2006.
31. W. W. Terpstra, J. Kangasharju, C. Leng, and A. P. Buchmann, "Bub-blestorm: Resilient, probabilistic, and exhaustive peer-to-peer search," in Proc. ACM SIGCOMM, New York, Aug. 2007, pp. 49-60.
32. B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors," Commun. ACM, vol. 13, no. 7, pp. 422-426, 1970.
33. U. G. Acer, S. Kalyanaraman, and A. A. Abouzeid, "Weak state routing for large scale dynamic networks (extended paper)," Elect., Comput., Syst. Eng. Dept., Rensselaer Polytechnic Institute, 2009 [Online]. Available: http://networks.ecse.rpi.edu/~acer/wsr-extended.pdf Tech. Rep.
34. C. Bettstetter, H. Hartenstein, and X. Perez-Costa, "Stochastic properties of the random waypoint mobility model," Wireless Netw., vol. 10, no. 5, pp. 555-567, 2004.
35. E. Hyytia, P. Lassila, and J. Virtamo, "Spatial node distribution of the random waypoint mobility model with applications," IEEE Trans. Mobile Comput., vol. 5, no. 6, pp. 680-693, Jun. 2006.