Analysis of shortest path routing for large multi-hop wireless networks

IEEE/ACM Transactions on Networking

Volumn 17, Issue 3, 2009, Pages 857-869

  Kwon, Sungoh ^a   Shroff, Ness B ^b  

^a SAMSUNG Electronics   (South Korea)

^b The Ohio State University   (United States)

Author keywords

Analysis; Geometric probability; Multi hop wireless network; Routing; Simulations

Indexed keywords

ANALYSIS; GEOMETRIC PROBABILITY; MULTI-HOP WIRELESS NETWORK; ROUTING; SIMULATIONS;

CELL MEMBRANES; PROBABILITY; PROBABILITY DENSITY FUNCTION;

WIRELESS NETWORKS;

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

References (40)

1. S. Kwon and N. Shroff, "Paradox of shortest path routing for large multi-hop wireless networks," in Proc. IEEE INFOCOM'07, May 2007, pp. 1001-1009.
2. J. M. Kahn, R. H. Katz, and K. S. J. Pister, "Mobile networking for smart dust," in Proc. ACM MobiCom'99, Aug. 1999, pp. 271-278.
3. I. F. Akyildiz, W. Sue, Y. Sankarasubarmaniam, and E. Cayirci, "A survey on sensor networks," IEEE Commun. Mag., vol. 40, no. 8, pp. 102-114, Aug. 2002.
4. I. F. Akyildiz, X. Wang, and W. Wang, "Wireless mesh networks: A survey," Comput. Netw., vol. 47, no. 4, pp. 445-487, Mar. 2005.
5. L. Lin, N. B. Shroff, and R. Srikant, "Power aware routingfor multi-hop networks with energy replenishment," in Proc. 38th Conf. Information Sciences and Systems (CISS), 2004, pp. 17-19.
6. K. Kar, M. Kodialam, T. V. Lakshman, and L. Tassiulas, "Routing for network capacity maximization in energy-constrained ad-hoc networks," in Proc. IEEE INFOCOM'03, Apr. 2003, pp. 673-681.
7. S. J. Lee and M. Gerla, "Aodv-br: Backup routing in ad hoc network," in Proc. IEEE WCNC'00, Sep. 2000, pp. 1311-1316.
8. A. Nasipuri, R. Castaneda, and S. R. Das, "Performance of multipath routing for on-demand protocols in mobile ad hoc networks," Mobile Networks and Applications (MONET), vol. 6, no. 4, pp. 339-349, 2001.
9. S. J. Lee and M. Gerla, "Split multi-path routing with maximally disjoint paths in ad hoc networks," in Proc. IEEE ICC'01, 2001, pp. 3201-3205.
10. A. Nasipuri and S. R. Das, "On-demand multi-path routing for mobile ad hoc networks," in Proc. IEEE ICCCN'99, 1999, pp. 64-70.
11. M. K. Marina and S. R. Das, "On-demand multipath distance vector routing in ad hoc networks," in Proc. IEEE Int. Conf. Network Protocols (ICNP'00), 2000, pp. 14-23.
12. M. K. Marina and S. R. Das, "Ad hoc on-demand multipath distance vector routing," ACM SIGMOBILE Mobile Comput. Commun. Rev., vol. 6, no. 3, pp. 92-93, 2002.
13. M. Dong, L. Zhang, L. Wang, Y. Shu, and O. W. W. Yang, "Multipath source routing in wireless ad hoc networks," in Proc. Canadian Conf. Electrical and Computer Engineering, 2000, vol. 1, pp. 479-483.
14. M. Dong, L. Zhang, L. Wang, Y. Shu, and O. W. W. Yang, "Adaptive multipath source routing in ad hoc networks," in IEEE Int. Conf. Communications (ICC'01), 2001, vol. 3, pp. 867-871.
15. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, 2000.
16. M. Franceschetti, O. Dousse, D. Tse, and P. Thiran, "On the throughput capacity of random wireless networks," Dept. ECE, Univ. California, San Diego, 2005, preprint [Online]. Available: http://www.fleece.ucsd.edu/~massimo/
17. J. Li, C. Blake, D. D. Couto, H. Lee, and R. Morris, "Capacity of ad hoc wireless networks," in Proc. ACM MobiCom'01, Jul. 2001, pp. 61-69.
18. H. Solomon, Geometric Probability. Philadelphia, PA: SIAM, 1978.
19. P. P. Pham and S. Perreau, "Increasing the network performance using multi-path routing mechanism with load balance," Ad Hoc Netw., vol. 2, no. 4, pp. 433-459, 2004.
20. Y. Ganjali and A. Keshavarzian, "Load balancing in ad hoc networks: Single-path routng vs. multi-paht routing," in Proc. IEEE INFOCOM'04 Mar. 2004, vol. 2, pp. 1120-1125.
21. 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-694, Jun. 2006.
22. R. Negi and A. Rajeswaran, "Capacity of power constrained ad-hoc networks," in Proc. IEEE INFOCOM'04, Mar. 2004, vol. 1, pp. 7-11.
23. D. P. Dobkin, S. J. Friedman, and K. J. Supowit, "Delaunay graphs are almost as good as complete graphs," Discrete and Computational Geometry, no. 5, pp. 399-407, 1990.
24. D. Stoyan, W. S. Kendall, and J. Mecke, Stochastic Geometry and Its Applications, 2nd ed. New York: Wiley, 1995.
25. A. Papoulis, Probability, Random Variables, and Stochastic Process 3rd ed. New York: McGraw-Hill, 1991.
26. S. Bandyopadhyay and E. J. Coyle, "An energy efficient hierarchical clustering algorithm for wireless sensor networks," in Proc. IEEE INFOCOM'03, Apr. 2003, vol. 3, pp. 1713-1723.
27. P. Jacquet, "Geometry of infromation propagation in massively dense ad hoc networks," in Proc. ACM MobiHoc'04, May 2004, vol. 1, pp. 157-162.
28. W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, "An application-specific protocol architecture for wireless microsensor networks," IEEE Trans. Wireless Commun., vol. 1, no. 4, pp. 660-670, 2002.
29. A. M. Mathai, An Introduction to Geometrical Probability: Distributional Aspects With Applications. Amsterdam, The Netherlands: Gordon and Breach Science Pub., 1978.
30. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
31. E. W. Weisstein, Disk Point Picking From MathWorld - A Wolfram Web Resource [Online]. Available: http://www.mathworld.wolfram.com/ DiskPointPicking.html
32. E. K. P. Chong and S. H. Zak, An Introduction to Optimization, 2nd ed. New York: Wiley, 2001.
33. S. Ross, Stochastic Process, 2nd ed. New York: Wiley, 1996.
34. A. L. Hinde and R. E. Miles, "Monte carlo estimates of the distributions of the random polygons of the Voronoi tessellation with respect to a Poisson process,", no. 10, pp. 205-223, 1980.
35. D. M. Blough and P. Santi, "Investigating upper bounds on networks lifetime extension for cell-based energy conservation tehniques in stationary ad hoc networks," in Proc. ACM MobiCom'02, Sep. 2002, vol. 1, pp. 183-192.
36. J. H. Chang and L. Tassiulas, "Energy conserving routing in wireless ad-hoc networks," in Proc. IEEE INFOCOM'00, Mar. 2000, vol. 1, pp. 22-31.
37. L. Lin, N. B. Shroff, and R. Srikant, "Asymptotically optimal power-aware routing for multihop wireless networks with renewable energy sources," in Proc. IEEE INFOCOM'05, Mar. 2005, vol. 2, pp. 1262-1272.
38. J. Gao and L. Zhang, "Load balanced shortest path routing in wireless networks," in Proc. IEEE INFOCOM'04, Mar. 2004, vol. 2, pp. 1098-1107.
39. S. Kwon and N. Shroff, "Energy-efficient interference based routing for multi-hop wireless networks," in Proc. IEEE INFOCOM'06, Barcelona, Spain, Apr. 2006, doi 10.1109/INFOCOM.2006.199.
40. S. Kwon and N. Shroff, "Unified energy-efficient routing for multi-hop wireless networks," in Proc. IEEE INFOCOM'08, Apr. 2008, pp. 430-438.