Performance Analysis of Multi-Hop Wireless Link under Maximum Flow Algorithm

• 作者: M. Ruhul Amin Md. Imdadul Islam Sarwar Jahan
• 来源期刊: 电脑和通信(英文)
• 学科: 工学
• 关键词: FORD Fulkerson Algorithm Flow-Conservation Minimum CUT THEOREM SNR Channel Capacity
• 年，卷（期）: 2019,（8）
• 页码范围: 8-16
• 页数: 9页
• 分类号: TN92

摘要

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).