Wu, G.W., Chen, X.J., Obaidat, M.S. and Lin, C. (2013) A High Efficient Node Capture Attack Algorithm in Wireless Sensor Network Based on Route Minimum Key Set. Journal of Security and Communication Networks, 6, 230-238.

has been cited by the following article:

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

  AUTHORS: Sarwar Jahan, Md. Imdadul Islam, M. Ruhul Amin

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

  JOURNAL NAME: Journal of Computer and Communications, Vol.7 No.8, August 26, 2019

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