Query Routing in Road-Based Mobile Ad-Hoc Networks


The KIPS Transactions:PartD, Vol. 12, No. 2, pp. 259-266, Apr. 2005
10.3745/KIPSTD.2005.12.2.259,   PDF Download:

Abstract

Recently data centric routing or application dependent routing protocols are emerged in mobile ad hoc networks. In this paper, we propose a routing method for query processing in MANET(Mobile Ad hoc NETwork) environment, called road-based query routing, with consideration on real time traffic information of large number of vehicles. In particular, we focus on the method that process arrival time dependent shortest path query in MANET without a central server on the road networks. The main idea of our approach lies in a routing message that includes query predicates based on the road connectivity and on data gathering method in real time from vehicles on the road by ad-hoc network. We unify route discovery phase and data delivery(query processing) phase in our mechanism and reduce unnecessary flooding messages by pruning mobile nodes which are not on the same or neighboring road segments. In order to evaluate the performances of the proposed method, we established a model of road networks and mobile nodes which travel along the roads. The measurement factor is the number of nodes to whom route request is propagated according to each pruning strategy. Simulation result shows that road information is a dominant factor to reduce the number of messages.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. Y. Hwang, K. S. Kim, K. J. Li, "Query Routing in Road-Based Mobile Ad-Hoc Networks," The KIPS Transactions:PartD, vol. 12, no. 2, pp. 259-266, 2005. DOI: 10.3745/KIPSTD.2005.12.2.259.

[ACM Style]
So Young Hwang, Kyoung Sook Kim, and Ki Joune Li. 2005. Query Routing in Road-Based Mobile Ad-Hoc Networks. The KIPS Transactions:PartD, 12, 2, (2005), 259-266. DOI: 10.3745/KIPSTD.2005.12.2.259.