Maximum bandwidth routing and maximum flow routing in wireless mesh networks

Hu, Chia-Cheng; Kuo, Yu‐Liang; Chiu, Chian‐Song; Huang, Yueh‐Min

doi:10.1007/s11235-009-9217-2

Cited by 6 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This theorem uses the more common version of graph theory, particularly in the development of the Cut Covering Problem (CCP). Hu et al [44] Is mostly applicable in solving wireless mesh network issues, which include maximum flow and bandwidth routing problems. It also, proposes a heuristic algorithm and derives an optimization bound.…”

Section: Type Of Application Article the Solution Approach Telecommunmentioning

confidence: 99%

A Review of Flow-Capacitated Networks: Algorithms, Techniques and Applications

Alsalami

Rushdi

2021

AJRCoS

View full text Add to dashboard Cite

This paper presents a review of flow network concepts, including definition of some graph-theoretic basics and a discussion of network flow properties. It also provides an overview of some crucial algorithms used to solve the maximum-flow problem such as the Ford and Fulkerson algorithm (FFA), supplemented with alternative solutions, together with the essential terminology for this algorithm. Moreover, this paper explains the max-flow min-cut theorem in detail, analyzes the concepts behind it, and provides some examples and their solutions to demonstrate this theorem. As a bonus, it expounds the reduction and transformation techniques used in a capacitated network. In addition, this paper reviews one of the popular techniques for analyzing capacitated networks, which is the “decomposition technique”. This technique is centered on conditioning a complicated network on the possible states of a keystone element or on the possible combinations of states of many keystone elements. Some applications of capacitated network problems are addressed based on each type of problem being discussed.

show abstract

Section: Type Of Application Article the Solution Approach Telecommunmentioning

confidence: 99%

A Review of Flow-Capacitated Networks: Algorithms, Techniques and Applications

Alsalami

Rushdi

2021

AJRCoS

View full text Add to dashboard Cite

show abstract

“…While WEFTR method counters the node failure by using multipath routing, our method counters that by using RSR with SMN configuration and reassignment. Additionally, there are some related works exist [7,26].…”

Section: Assurance Networkmentioning

confidence: 99%

Improving assurance of a sustainable route-split MANET routing by adapting node battery exhaustion

et al. 2013

View full text Add to dashboard Cite

Assurance networks are designed to realize trustable Internet-Of-Things including terminal devices/infrastructure service applications for new generation networks. To construct assurance networks, it is necessary to evaluate them quantitatively. In this paper, we provide one of case studies to evaluate them quantitatively. In mobile ad hoc networks (MANETs), the network environments change over time due to the movement of nodes, the battery level of nodes, and so on. Assurance networks must maintain high performance even when such diverse changes of the network environments occur in the widely applicable domain. And if their performance degrades, they must early recover from the changes. So far, we have proposed a routing method for MANETs, called Route-Split Routing (RSR). RSR can suppress escalation of control packets in large scale MANETs. However, with RSR, drawbacks occur when some nodes exhaust their batteries. In this paper, we propose a sustainable route-split routing scheme to improve assurance by adapting node faults due to battery exhaustion for MANETs. To evaluate the assurance of the proposed method, we have implemented it with a simulator and have conducted simulation experiments. The results indicate that the proposed method can maintain high throughput when some nodes experience

show abstract

“…The authors in [23] proposed a flooding-based algorithm to find a path that satisfies multiple QoS constraints. The most closely related studies to this paper are [17][18][19]26,27]. The authors in [17] proposed the IQRouting algorithm, which is a combination of multiple routing algorithms.…”

Section: Related Workmentioning

confidence: 99%

“…In [19], a hop-count bounded heuristic algorithm was proposed to find a feasible path with maximum bottleneck capacity, which approximates the widest path. The authors in [26] studied the maximum bandwidth routing problem and proposed a heuristic algorithm and an optimization model. A technique was proposed in [28] to approximate the bandwidth of a given path.…”

Section: Related Workmentioning

confidence: 99%