Hitting time analysis for a class of random packet forwarding schemes in ad hoc networks

Ad Hoc Networks

Volumn 7, Issue 3, 2009, Pages 500-513

  Hsin, Chih fan ^a   Liu, Mingyan ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Ad hoc networks; Query and search; Random forwarding; Random walk; Wireless sensor networks

Indexed keywords

RANDOM PROCESSES; ROUTING PROTOCOLS; TARGETS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

DESTINATION NODES; GREEDY FORWARDING; HITTING TIMES; LOCATION INFORMATIONS; MEAN HITTING TIMES; MEMORY REQUIREMENTS; PACKET FORWARDING; QUERY AND SEARCH; QUERY PACKETS; RANDOM FORWARDING; RANDOM WALK; RANDOM WALKS; SIMULATION RESULTS; STRAIGHT LINES; TARGET HITTING; TARGET LOCATIONS;

AD HOC NETWORKS;

EID: 56749098361     PISSN: 15708705     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.adhoc.2008.07.001     Document Type: Article

References (29)

1. J. Tchakarov, N. Vaidya, Efficient content location in wireless ad hoc networks, in: IEEE International Conference on Mobile Data Management (MDM), January 2004.
2. I. Aydin, C.C. Shen, Facilitating match-making service in ad hoc and sensor networks using pseudo quorum, in: 11th International Conference on Computer Communications and Networks (ICCCN), 2002.
3. D. Braginsky, D. Estrin, Rumor routing algorithm for sensor networks, in: First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), 2002.
4. Sadagopan N., Krishnamachari B., and Helmy A. Active query forwarding in sensor networks. Journal of Ad Hoc Networks 3 (2005) 91-113
5. C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), 2000.
6. Faruque J., Psounis K., and Helmy A. Analysis of gradient-based routing protocols in sensor networks. Lecture Notes in Computer Science (2005), Springer-Verlag
7. Johnson D.B., and Maltz D.A. Dynamic Source Routing in Ad Hoc Wireless Networks. In: Imielinski T., and Korth H. (Eds). Mobile Computing (1996), Kluwer Academic Publishers
8. B. Nath, D. Niculescu, Routing on a curve, in: First Workshop on Hot Topics in Networks (HotNets-I), October 2002, Princeton, NJ.
9. D. Liu, I. Stojmenovic, X. Jia, A scalable quorum based location service in ad hoc and sensor networks, in: IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), October 2006, Vancouver, Canada.
10. D. Kim, N. Maxemchuk, A comparison of flooding and random routing in mobile ad hoc networks, in: Third New York Metro Area Networking Workshop (NYMAN), 2003.
11. S. Shakkottai, Asymptotics of query strategies over a sensor network, in: Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2004.
12. Shen C., and Jaikaeo C. Ad hoc multicast routing algorithm with swarm intelligence. Mobile Networks and Applications 10 (2005)
13. J.S. Baras, H. Mehta, A probabilistic emergent routing algorithm for mobile ad hoc networks, in: International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2003.
14. Caro G.D., and Dorigo M. Antnet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research 9 (1998)
15. F. Kuhn, R. Wattenhofer, A. Zollinger, Worst-case optimal and average-case efficient geometric ad-hoc routing, in: ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC), 2003.
16. B. Karp, H.T. Kung, Gpsr: greedy perimeter stateless routing for wireless networks, in: ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), 2000.
17. P. Bose, P. Morin, I. Stojmenovic, J. Urrutia, Routing with guaranteed delivery in ad hoc wireless networks, in: ACM Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), August 1999, seattle, WA.
18. S. Subramanian, S. Shakkottai, Geographic routing with limited information, in: International Symposium on Information Processing in Sensor Networks (IPSN), 2005.
19. Gupta P., and Kumar P.R. The capacity of wireless networks. IEEE Transactions on Information Theory 46 2 (2000)
20. D.W. Gage, Many-robot MCM search systems, in: Autonomous Vehicles in Mine Countermeasures Symposium, April 1995.
21. Dynkin E., and Yushkevich A.A. Markov Processes: Theorems and Problems (1969), Prenum Press
22. Lally S., and Robbins H. Stochastic search in a convex region. Probability Theory and Related Fields 77 (1988) 99-116
23. Viswanathan G.M., Afanasyev V., Buldyrev S.V., and Havlin S. Statistical physics of random searches. Brazillian Journal of Physics 31 1 (2001)
24. Shlesinger M.F., Zaslavsky G.M., and Klafter J. Lévy flights and related topics in physics. Nature 363 31 (1993)
25. Steinhaus H. Mathematical Snapshots (1999), Dover
26. Gardner M. The Sixth Book of Mathematical Games from Scientific American (Chapter: Bouncing Balls in Polygons and Polyhedrons) (1984), University of Chicago Press
27. Alt H., Dembowski C., Gräf H.-D., Hofferbert R., Rehfeld H., Richter A., Schuhmann R., and Weiland T. Wave dynamical chaos in a superconducting three-dimensional sinai billiard. Physical Review Letters 79 6 (1997) 1026-1029
28. Sridhar S., and Lu W.T. Sinai billiards, ruelle zeta-functions and ruelle resonances: microwave experiments. Journal of Statistical Physics 108 5/6 (2002)
29. B. Hajek, Minimum mean hitting times of Brownian motion with constrained drift, in: 27th Conference on Stochastic Processes and their Applications (SPA), 2001.