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.
Ford-Fulkerson algorithm, wireless multihop networks
 Adrian, L., Anisha, K., Byrav, R., “Network Innovation using OpenFlow: A Survey,” IEEE Communications Surveys & Tutorials Volume: 16, Issue: 1, First Quarter 2014 pp. 493–512.
 Braden, R., Zhang, L., Berson, S., Herzog, S. and Jamin, S., “Resource ReSerVation Protocol (RSVP) Version 1, Functional Specification,” IETF RFC 2205 (1997).
 Doran, A. and Aldous, J., “Networks and Algorithms: An Introductory Approach,” Wiley (1993).
 Jayasuriya, A., Perreau, S., Dadej, A. and Gordon, S., “Hidden vs. Exposed Terminal Problem in Ad Hoc Networks,” Proceedings of the Australian Telecommunication Networks and Applications Conference, pp.52–59, (2004).
 Tatsuno, Y. and Higaki, H., “Extended Labeling Method for Achieving Maximum Data Message Flow in Wireless Multihop Networks,” Proceedings of the 3rd International Conference on Advances in Future Internet, pp.1–7 (2011).
Cite this paper
Hiroaki Higaki. (2017) Pruning in Detection of Multiple Routes for Required Throughput in Wireless Multihop Networks. International Journal of Control Systems and Robotics, 2, 111-114
Copyright © 2017 Author(s) retain the copyright of this article.
This article is published under the terms of the Creative Commons Attribution License 4.0