首页    期刊浏览 2024年09月07日 星期六
登录注册

文章基本信息

  • 标题:Performance Analysis of Multi-Hop Wireless Link under Maximum Flow Algorithm
  • 本地全文:下载
  • 作者:Sarwar Jahan ; Imdadul Islam ; M. Ruhul Amin
  • 期刊名称:Journal of Computer and Communications
  • 印刷版ISSN:2327-5219
  • 电子版ISSN:2327-5227
  • 出版年度:2019
  • 卷号:7
  • 期号:8
  • 页码:8-16
  • DOI:10.4236/jcc.2019.78002
  • 出版社:Scientific Research Publishing
  • 摘要: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
国家哲学社会科学文献中心版权所有