BS-3-22 A Novel Higher Wireless Connection-Capacity Route Selection Algorithm for Automobiles(BS-3. Management and Control Technologies for Innovative Networks)

概要

論文の詳細を見る
Although automobiles usually use a shortest route to travel from the original to the destination, due to the availability of various wireless services, the wireless connection-capacity of the shortest route may not be maximized. By modifying Dijkstra's shortest route selection algorithm, we propose to find a higher wireless connection-capacity route whose length is larger than that of a shortest route but no longer than a pre-defined bound. The route search range is expanded by changing the state of the intersection from visited to unvisited. Besides, a length metric is used to avoid unnecessary route searching. Results from our extensive simulation for a Manhattan-street type grid network, show that for a 50% increase in route length the proposed algorithm can increases wireless connection-capacity by about 35 % and 25 % compared to the shortest and random route selection algorithms, respectively.
2012-03-06