Fast path searching algorithm by using neighborhood information for ad hoc network

An ad-hoc network is composed only of terminals and can transmit information without infrastructure such as access points. And it transmit information from a source to a destination via multiple hops. However, in an ad-hoc network, the network topology always changes since the terminals may move freely. Therefore the path search from a source to a destination is a difficult problem and a novel path search method for ad-hoc network is necessary. The purpose of our work is to develop a novel path search algorithm for an ad-hoc network which can solve four problems of speed, accuracy, enduring change of network topology, and avoiding loop that is a difficult problem of the path search in this network. The proposed algorithm is composed of the Field conversion (to solve problems of speed and avoiding loop) and the Determining method of next node (to solve problems of speed, accuracy, and enduring change of network topology). To evaluate the proposed algorithm, it is compared with Dijkstra algorithm on simulation using the C++ programming language. As a result, the proposed algorithm can search a path from a source to a destination very fast and some accurately. And it can solve four problems.