Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network

  • Kyoung-Sook Kim
  • So-Young Hwang
  • Ki-Joune Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3428)


Arrival time dependent shortest path finding is an important function in the field of traffic information systems or telematics. However large number of mobile objects on the road network results in a scalability problem for frequently updating and handling their real-time location. In this paper, we propose a query processing method in MANET(Mobile Ad-hoc Network) environment to find an arrival time dependent shortest path with a consideration of both traffic and location in real time. Since our method does not need a centralized server, time dependent shortest path query is processed by in-network way. In order to reduce the number of messages to forward and nodes to relay, we introduce an on-road routing, where messages are forwarded to neighboring nodes on the same or adjacent road segments. This routing method allows to collect traffic information in real time and to reduce the number of routing messages. Experiments show that the number of forwarded messages is reduced in an order of magnitude with our on-road routing method compared to LAR-like method. At best, our method reduces about 57 times less messages.


Mobile Node Road Network Relay Node Query Processing Road Segment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Johnson, D.B., Maltz, D.A.: Dynamic Source Routing in Ad Hoc Networks. In: Mobile Computing, vol. 353, pp. 152–181. Kluwer Academic Publishers, Dordrecht (1996)Google Scholar
  2. 2.
    Perkins, C.E., Royer, E.M.: Ad hoc On-Demand Distance Vector Routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100 (1999)Google Scholar
  3. 3.
    Haas, Z.J., Pearlman, M.R.: The performance of query control schemes for the zone routing protocol. IEEE/ACM Transactions on Networking 9(4), 427–438 (2001)CrossRefGoogle Scholar
  4. 4.
    Ko, Y.-B., Vaidya, N.H.: Using location information in wireless ad hoc networks. In: IEEE 49th Vehicular Technology Conference, vol. 3, pp. 1952–1956 (1999)Google Scholar
  5. 5.
    Ko, Y.-B., Vaidya, N.H.: Location-aided routing (LAR) in mobile ad hoc networks. Wireless Networks 6(4), 307–321 (2000)zbMATHCrossRefGoogle Scholar
  6. 6.
    Karp, B., Kung, H.T.: GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 243–254 (2000)Google Scholar
  7. 7.
    Mauve, M., Widmer, J., Hartenstein, H.: A Survey on Position-Based Routing in Mobile Ad-Hoc Networks. IEEE Network 15(6), 30–39 (2001)CrossRefGoogle Scholar
  8. 8.
    Ahuja, R.K., Mehlhorn, K., Orlin, J., Tarjan, R.E.: Faster algorithms for the Shortest Path Problem. Journal of Association of Computing Machinery 37(2), 213–223 (1990)zbMATHMathSciNetGoogle Scholar
  9. 9.
    Zhan, F.B.: Three Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures. Journal of Geographic Information and Decision Analysis 1(1), 69–82 (1997)Google Scholar
  10. 10.
    Wolfson, O., Jiang, L., Sistla, A.P., Chamberlain, S., Rishe, N., Deng, M.: Databases for Tracking Mobile Units in Real Time. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 169–186. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  11. 11.
    Trajcevski, G., Wolfson, O., Xu, B., Nelson, P.: Real-Time Traffic Updates in Moving Objects Databases. In: Proceedings of the 13th International Workshop on Database and Expert Systems Applications, pp. 698–704 (2002)Google Scholar
  12. 12.
    Chon, H.-D., Agrawal, D., Abbadi, A.E.: FATES: Finding A Time dependent Shortest path. In: Proceedings of the 4th International Conference on Mobile Data Management, pp. 165–180 (2003)Google Scholar
  13. 13.
    Kosch, T., Schwingenschlogl, C., Ai, L.: Information dissemination in multihop intervehicle networks. In: Proceedings of the IEEE 5th International Conference on Intelligent Transportation Systems, pp. 685–690 (2002)Google Scholar
  14. 14.
    Bachir, A., Benslimane, A.: A multicast protocol in ad hoc networks inter-vehicle geocast. In: Proceedings of the 57th IEEE Semiannual Vehicular Technology Conference, vol. 4, pp. 2456–2460 (2003)Google Scholar
  15. 15.
    Bachir, A., Benslimane, A.: Towards supporting GPS-unequipped vehicles in intervehicle geocast. In: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks, pp. 766–767 (2003)Google Scholar
  16. 16.
    An, B., Papavassiliou, S.: An architecture for supporting geomulticast services in mobile ad-hoc wireless networks. In: IEEE Military Communications Conference, Communications for Network-Centric Operations: Creating the Information Force, vol. 1, pp. 301–305 (2001)Google Scholar
  17. 17.
    Brinkhoff, T.: A framework for generating network-based moving objects. GeoInfomatica 6(2), 153–180 (2002)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Kyoung-Sook Kim
    • 1
  • So-Young Hwang
    • 1
  • Ki-Joune Li
    • 1
  1. 1.Department of Computer Science and EngineeringPusan National UniversityPusanSouth Korea

Personalised recommendations