Author(s)

Sarwar Jahan¹, Md. Imdadul Islam², M. Ruhul Amin³

¹Department of Electronics and Communications Engineering, East West University, Dhaka, Bangladesh.
²Department of Computer Science and Engineering, Jahangirnagar University, Savar, Bangladesh.
³Deparment of Mathematical and Physical Sciences, East West University, Dhaka, Bangladesh.

To enhance link capacity of a wireless link one or more repeater is used between the sender and the receiver. Recent literature deals with multiple parallel links to enhance throughput instead of conventional single path. In case of a multidirectional and multi-hop wireless network, the selection of link of maximum signal to noise ratio (SNR) does not guarantee the maximum throughput. In this paper, we use augmenting path of Ford-Fulkerson algorithm in detection of maximum flow from sender to receiver. To reduce the process time at the sending node, minimum-cut theorem is used to determine maximum flow like power flow of previous work. Using the maximum flow algorithm, we obtain the capacity of multi-hop wireless link higher than the conventional theorem. The concept of the paper is applicable in MANET (Mobile Ad-hoc Network), WSN (Wireless Sensor Network) and CRN (Cognitive Radio Network).

Ford Fulkerson Algorithm, Flow-Conservation, Minimum Cut Theorem, SNR, Channel Capacity

Jahan, S. , Islam, M. and Amin, M. (2019) Performance Analysis of Multi-Hop Wireless Link under Maximum Flow Algorithm. Journal of Computer and Communications, 7, 8-16. doi: 10.4236/jcc.2019.78002.