Weak state routing for large scale dynamic networks

Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Volumn , Issue , 2007, Pages 290-301

  Acer, Utku Gunay ^a   Kalyanaraman, Shivkumar ^a   Abouzeid, Alhussein A ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Dynamic networks; Routing algorithms; Unstructured distributed hashing; Weak states

Indexed keywords

CONFORMAL MAPPING; PACKET NETWORKS; RANDOM PROCESSES; ROUTING ALGORITHMS;

DYNAMIC NETWORKS; UNSTRUCTURED DISTRIBUTED HASHING; WEAK STATES;

WIRELESS NETWORKS;

EID: 37749019979     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1287853.1287888     Document Type: Conference Paper

References (27)

1. Hls patch for ns-2.29. http://www.cn.uni-duesseldorf.de/staff/kiess/ software/hls-ns2-patch.
2. Network simulator, ns-2. http://www.isi.edu/nsnam/ns.
3. BISNIK, N., AND ABOUZEID, A. A. Capacity deficit in mobile wireless ad hoc networks due to geographic routing overheads. In 26th IEEE International Conference on Computer Communications (INFOCOM'07). (2007), pp. 517-525.
4. BLOOM, B. H. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13, 7 (1970), 422-426.
5. CAESAR, M., CASTRO, M., NIGHTINGALE, E. B., O'SHEA, G., AND ROWSTRON, A. Virtual ring routing: Network routing inspired by dhts. Computer Communication Review 36, 4 (2006), 351-362.
6. CHAWATHE, Y., RATNASAMY, S., BRESLAU, L., LANHAM, N., AND SHENKER, S. Making gnutella-like p2p systems scalable. Computer Communication Review 33,4 (2003), 407-418.
7. CHENG, B.-N., YUKSEL, M., AND KALYANARAMAN, S. Orthogonal rendezvous routing protocol for wireless mesh networks. IEEE International Conference on Network Protocols (ICNP) (2006).
8. DUBOIS-FERRIERE, H., GROSSGLAUSER, M., AND VETTERLI, M. Age matters: Efficient route discovery in mobile ad hoc networks using encounter ages. Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (2003), 257-266.
9. GKANTSIDIS, C., MIHAIL, M., AND SABERI, A. Random walks in peer-to-peer networks. Proceedings - IEEE INFOCOM 1 (2004), 120-130.
10. GROSSGLAUSER, M., AND TSE, D. N. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Transactions on Networking 10, 4 (2002), 477-486.
11. GROSSGLAUSER, M., AND VETTERLI, M. Locating mobile nodes with ease: Learning efficient routes from encounter histories alone. IEEE/ACM Transactions on Networking 14, 3 (2006), 457-469.
12. JAIN, S., FALL, K., AND PATRA, R. Routing in a delay tolerant network. vol. 34, pp. 145-157.
13. JOHNSON, D. B., AND MALTZ, D. A. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, T. Imielinski and H. Korth, Eds., vol. 353. Kluwer Academic Publishers, 1996.
14. KARGER, D., LEHMAN, E., LEIGHTON, T., LEVINE, M., LEWIN, D., AND PANIGRAHY, R. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. Conference Proceedings of the Annual ACM Symposium on Theory of Computing (1997), 654-663.
15. KARP, B., AND KUNG, H. Gpsr: Greedy perimeter stateless routing for wireless networks. Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM (2000), 243-254.
16. KIESS, W., FÜSSLER, H., WIDMER, J., AND MAUVE, M. Hierarchical location service for mobile ad-hoc networks. ACM SIGMOBILE Mobile Computing and Communications Review (MC2R) 8, 4 (2004), 47-58.
17. KUMAR, A., XU, J., AND ZEGURA, E. W. Efficient and scalable query routing for unstructured peer-to-peer networks. Proceedings of IEEE INFOCOM 2 (2005), 1162-1173.
18. LI, J., JANNOTTI, J., DE COUTO, D., KARGER, D., AND MORRIS, R. A scalable location service for geographic ad hoc routing. Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking(Mobicom) (2000), 120-30.
19. LV, Q., CAO, P., COHEN, E., LI, K., AND SHENKER, S. Search and replication in unstructured peer-to-peer networks. Proceedings of the International Conference on Supercomputing, (2002), 84-95.
20. PERKINS, C. E., AND BHAGWAT, P. Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers. Computer Communications Review 24, 4 (1994), 234 -.
21. RATNASAMY, S., FRANCIS, P., HANDLEY, M., KARP, R., AND SHENKER, S. A scalable content-addressable network. Computer Communication Review 31, 4 (2001), 161-172.
22. RHEA, S. C., AND KUBIATOWICZ, J. Probabilistic location and routing. Proceedings - IEEE INFOCOM 3 (2002), 1248-1257.
23. SANTIVANEZ, C., AND RAMANATHAN, R. Hazy sighted link state (hsls) routing: A scalable link state algorithm. Tech. Rep. BBN-TM-1301, BBN Technologies, Cambridge, MA, 2001.
24. SPYROPOULOS, T., PSOUNIS, K., AND RAGHAVENDRA, C. S. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. pp. 252-259.
25. STOICA, I., MORRIS, R., KARGER, D., KAASHOEK, M., AND BALAKRISHNAN, H. Chord: A scalable peer-to-peer lookup service for internet applications. Computer Communication Review 31, 4 (2001), 149-160.
26. WANG, Y., JAIN, S., MARTONOSI, M., AND FALL, K. Erasure-coding based routing for opportunistic networks, pp. 229-236.
27. YOON, J., LIU, M., AND NOBLE, B. Random waypoint considered harmful. Proceedings - IEEE INFOCOM 2 (2003), 1312-1321.