Path selection in mobile ad-hoc networks and distribution of path duration

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Han, Yijie ^a   La, Richard J ^a   Zhang, Hongqiang ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPONENTIAL DISTRIBUTION; PATH DURATION; PATH SELECTION ALGORITHM;

ALGORITHMS; PARAMETER ESTIMATION; RANDOM PROCESSES;

AD HOC NETWORKS;

EID: 34948908544     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.11     Document Type: Conference Paper

References (20)

1. C. Bettstetter and C. Wagner, "The spatial node distribution of the random waypoint mobility model," Proceedings of German Workshop on Mobile Ad Hoc Networks (WMAN), Ulm (Germany), March 2002.
2. J. Chang and L. Tassiulas, "Energy Conserving Routing in Wireless Ad-hoc Networks," Proceedings of IEEE Infocom, March 2000.
3. M. Grossglauser and D. Tse "Mobility Increases the Capacity of Ad Hoc Wireless Networks," IEEE/ACM Transactions on Networking, Vol. 10(4), pp. 477-486, August 2002.
4. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. on Information Theory, Vol. 46(2), pp. 388-404, March 2000.
5. Y. Han, R. J. La, A. M. Makowski, and S. Lee "Distribution of path durations in mobile ad-hoc networks - Palm's theorem to the rescue," to appear in Computer Networks (Special Issue on Network Modeling and Simulation, edited by P. R. Kumar and J. Hou).
6. D. P. Heyman and M. J. Sobel, Stochastic Models in Operations Research, Volume I, McGraw-Hill, New York, New York, 1982.
7. D. Johnson and D. Maltz, "Dynamic source routing in ad hoc wireless networks," Mobile Computing, Imielinski T, Korth H (eds). vol. 353, Kluwer Academic, Norwell, MA, 1996, pp. 153-181.
8. J.-Y. Le Boudec, "Understanding the simulation of mobility models with Palm calculus," available at http://icapeople.epu.ch/leboudec
9. M. R. Leadbetter, "On extreme values in stationary sequences," Z. Wahrscheinlichkeitstheorie verw. Gebiete, Vol. 28, pp. 289-303, 1974.
10. M. R. Leadbetter, "Extremes and local dependence in stationary sequences," Z. Wahrscheinlichkeitstheorie verw. Gebiete, Vol. 65, pp. 291-306, 1983.
11. V. Park and M. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," Proceedings of IEEE Infocom, April 1997.
12. C. E. Perkins, Ad-noc Networking, Addison-Wesley Longman, Incorporated, 2000.
13. C. Perkins and P. Bhagwat, "Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers," Computer Communications Review, Vol. 24(4), pp. 234-244, October 1994.
14. C. Perkins and E. M. Royer, "Ad hoc on-demand distance vector routing," Proceedings of the second annual IEEE workshop on mobile computing systems and applications, pp. 90-100, February 1999.
15. S. Ramanathan and E. Lloyd, "Scheduling algorithms for multi-hop radio networks," IEEE/ACM Transactions on Networking, Vol. 1(2), pp. 166-177, April 1993.
16. V. Rodoplu and T. Meng "Minimum energy mobile wireless networks," IEEE Journal on Selected Areas in Communications, Vol. 17(8), pp. 1333-1344, August 1999.
17. N. Sadagopan, F. Bai, B. Krishnamachari, and A. Helmy, "PATHS: Analysis of path duration statistics and the impact on reactive MANET routing protocols," Proceedings of ACM MobiHoc, Annapolis (MD), June, 2003.
18. C.-K. Toh, Ad-hoc mobile wireless networks: protocols and systems. Prentice Hall PTR, 2001.
19. G. S. Watson, "Extreme values in samples from m-dependent stationary processes," Ann. Math. Statist. Vol. 25, pp. 798-800, 1954.
20. R. D. Yates and D. J. Goodman, Probability and stochastic processes, Wiley, 1999.