International Journal of Advances in Computer Science and Its Applications
Author(s) : HIROAKI HIGAKI, YUKI KUBO
In wireless multihop networks, transmission capacity of each wireless node is relatively low and wireless signal transmissions of neighbor wireless nodes might interfere each other. Thus, it is difficult for a wireless multihop transmission route to provide required throughput to a network application. The authors have proposed a method to provide required throughput by combination of multiple wireless multihop transmission routes with joins and branches based on Ford-Fulkerson algorithm for maximum flow calculation in wired networks. Here, by using capacities of wireless nodes and flows along wireless links in wireless multihop networks, flow increasing wireless multihop routes are searched and detected until the required throughput can be provided. However, there are no cut-off conditions of search for flow increasing wireless multihop transmission routes, longer calculation time cannot be avoided. This paper proposes the cut-off conditions based on the current assignment of flow in wireless links within a wireless transmission range of each wireless node. The reduction of route search time duration is evaluated in simulation experiments.