2011
DOI: 10.5296/npa.v3i1.576
View full text |Buy / Rent full text
|
Sign up to set email alerts
|

Abstract: Flow control in mobile ad hoc networks (MANETs) encounters more challenges than flow control in conventional wired networks, such as channel bandwidth variation, medium contention, and frequent re-routing. Without proper flow control, serious network performance degradation in MANETs has been reported in recent studies. In this paper, we introduce a distributed bottleneck flow control technique in MANETs. The proposed scheme uses a distributed flow control mechanism that has been used in both bottleneck flow c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2014
2014
2015
2015

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 22 publications
(3 reference statements)
0
3
0
Order By: Relevance
“…In a similar context, if each sensor node in the network has an admissible flow [19], the MaxBNW-DG tree algorithm could also be used to determine DG trees such that the path from any node to the leader node is guaranteed to honor the admissible flow of the end nodes of the path (i.e., every intermediate node as well as the node at one end of the path are guaranteed to have an admissible flow that is at least the admissible flow of the node at the other end of the path). In [20], the authors have proposed a distributed bottleneck flow control technique for mobile ad hoc networks (MANETs) wherein each node monitors its channel to determine the residual capacity and the source manages to determine a path of the largest bottleneck weight. The MaxLW-DG Network Protocols and Algorithms ISSN 1943-3581 2015 algorithm discussed in this paper can serve as a benchmarking algorithm to evaluate the relative performance of the distributed protocol.…”
Section: Related Workmentioning
confidence: 99%
“…In a similar context, if each sensor node in the network has an admissible flow [19], the MaxBNW-DG tree algorithm could also be used to determine DG trees such that the path from any node to the leader node is guaranteed to honor the admissible flow of the end nodes of the path (i.e., every intermediate node as well as the node at one end of the path are guaranteed to have an admissible flow that is at least the admissible flow of the node at the other end of the path). In [20], the authors have proposed a distributed bottleneck flow control technique for mobile ad hoc networks (MANETs) wherein each node monitors its channel to determine the residual capacity and the source manages to determine a path of the largest bottleneck weight. The MaxLW-DG Network Protocols and Algorithms ISSN 1943-3581 2015 algorithm discussed in this paper can serve as a benchmarking algorithm to evaluate the relative performance of the distributed protocol.…”
Section: Related Workmentioning
confidence: 99%
“…Although there is some interest to manage the traffic flow in ad hoc networks [ 10 ], many researchers take into account QoS parameters in their proposals [ 11 ]. But existing cluster systems do not use QoS parameters as criteria to build the logical topology.…”
Section: Introductionmentioning
confidence: 99%
“…Although there is some interest to manage the traffic flow in ad hoc networks [139], many researchers take into account QoS parameters in their proposals [140]. But, existing cluster systems do not use QoS parameters as criteria to build the logical topology.…”
Section: Mwahca: a Multimedia Wireless Ad Hoc Cluster Architecturementioning
confidence: 99%