Abstract
In general, automobiles travel from the origin to the destination using a shortest route. However, the shortest route may not be a highest wireless connection-capacity route, because of availability of wireless services (base station and access points etc.) along the route. To the best of our knowledge, currently no algorithm exists for selecting a route that maximizes wireless connection-capacity, while keeping route length shortest and close to shortest. In this paper, we propose two modified version of Dijkstra route selection algorithms: one for selecting a maximum connection capacity shortest route, and the other is for discovering higher wireless connection-capacity routes; the length of the route could be larger than a shortest route, but no larger than predetermined bound. The second proposed algorithm exploits the state change of the intersection to broaden the search range of possible routes. Results from our extensive simulation for a Manhattan-street type grid network with the heterogeneous IEEE 802.11a wireless access, show that for a 50% increase in route length and 15 Access Points (APs), the proposed algorithm can increases wireless connection-capacity by 35.67% and 31.27% compared to the shortest and random route selection algorithms, respectively.