Randomized mobile agent based routing in wireless networks

International Journal of Foundations of Computer Science

Volumn 12, Issue 3, 2001, Pages 365-384

  Bui, Marc ^a   Das, Sajal K ^b   Datta, Ajoy K ^c   Nguyen, Dai Tho ^d  

^a UNIVERSITÉ PARIS 8   (France)

^b The University of Texas at Arlington   (United States)

^c University of Nevada Las Vegas   (United States)

^d UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Distributed algorithms; mobile agents; random walks; routing; wireless mobile networks

Indexed keywords

EID: 0012944195     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054101000539     Document Type: Conference Paper

References (17)

1. E. Anagnostou and R. El-Yaniv, "More on the power of random walks: Uniform self-stabilizing randomized algorithms (preliminary report)," in LNCS, Vol. 597, Proc. 5th WDAG, Delphi, Greece, Oct. 1991, eds. S. Toueg, P. G. Spirakis, and L. M. Kirousis (Springer, Berlin, 1991) pp. 31-51.
2. D. Bertsekas and R. Gallager, Data Networks (Prentice Hall, 2nd edition, 1992).
3. A. Boukerche, S. K. Das, and A. Fabbri, "Modeling and simulation of ad hoc wireless randomized routing protocol," in Proc. MASCOTS 2000, San Francisco, CA, Aug. 2000. Extended version to appear in J. Parallel Distrib. Comput.
4. A. Broder, "Generating random spanning trees," in Proc. 30th IEEE FOGS, Research Triangle Park, North Carolina, Oct. 1989, pp. 442-447.
5. G. D. Caro and M. Dorigo, "Mobile agents for adaptive routing," in Proc. 31st Hawaii Int. Conference on Systems Sciences, Jan. 1998, pp. 74-83.
6. M. Heusse, S. Guerin, D. Snyers, and P. Kuntz, "Adaptive agent-driven routing and load balancing in communication networks," in Advances in Complex Systems 1 (1999).
7. P. G. Hoel, S. C. Port, and C. J. Stone, Introduction to Stochastic Processes (Waveland Press, Prospect Heights, Illinois, second edition, 1987).
8. A. Israeli and M. Jalfon, "Token management schemes and random walks yield self stabilizing mutual exclusion," in Proc. 9th Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Quebec, Canada, Aug. 1990, pp. 119-132.
9. D. Kotz, R. Gray, S. Nog, D. Rus, S. Chawla, and G. Cybenko, "Mobile agents for mobile computing," in Mobility: Processes, Computers, and Agents, eds. D. Milojicic, F. Douglis, and R. Wheeler (Addison Wesley &ACM Press, 1999) pp. 513-523.
10. N. Minar, K. H. Kramer, and P. Maes, "Cooperating mobile agents for dynamic network routing," in Software Agents for Future Communications Systems, eds. A. Hayzelden and J. Bigham (Springer, Berlin, 1999) pp. 287-304.
11. R. Motwani and P. Raghavan, Randomized Algorithms (Cambridge University Press, 1995).
12. S. Murthy and J. J. Garcia-Luna-Aceves, "An efficient routing protocol for wireless networks," in Mobile Networks and Applications 1 (1996) 183-197.
13. C. E. Perkins and P. Bhagwat, "Highly dynamic destination-sequenced distancevector routing (DSDV) for mobile computers," in Proc. ACM SIGCOMM '94, London, UK, Aug. 1994, pp. 234-244.
14. R. Schoonderwoerd, O. Holland, J. Bruten, and L. Rothkrantz, "Ant-based load balancing in telecommunications networks," in Adaptive Behavior 5 (1996) 169-207.
15. P. Spirakis and B. Tampakas, "Efficient distributed protocols against mobile eavesdroppers," Apr. 1999, a preliminary version of this manuscript appeared in Proc. 9th WD AG, pp. 160-167.
16. M. Steenstrup, Routing in Communications Networks (Prentice Hall, Englewood Cliffs, 1995).
17. W. D. Tajibnapis, "A correctness proof of a topology information maintenance protocol for a distributed computer network," in Communications of the ACM 20 (1977) 477-485.