Distributed Bottleneck Flow Control in Mobile Ad Hoc Networks

Zhou, Congzhou; Maxemchuk, Nicholas F.

doi:10.5296/npa.v3i1.576

Cited by 3 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

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%

A Generic Algorithm to Determine Maximum Bottleneck Node Weight-based Data Gathering Trees for Wireless Sensor Networks

Meghanathan¹

2015

NPA

View full text Add to dashboard Cite

We propose a generic algorithm to determine maximum bottleneck node weight-based data gathering (MaxBNW-DG) trees for wireless sensor networks (WSNs) and compare the performance of the MaxBNW-DG trees with those of maximum and minimum link weight-based data gathering trees (MaxLW-DG and MinLW-DG trees). Assuming each node in a WSN graph has a weight, the bottleneck weight for the path from a node u to the root node of the DG tree is the minimum of the node weights on the path (inclusive of the weights of the end nodes). The MaxBNW-DG tree algorithm determines a DG tree such that each node has a path of the largest bottleneck weight to the root node. We observe the MaxBNW-DG trees to incur lower height, larger percentage of nodes as leaf nodes and a larger weight per intermediate node compared to the leaf node; the tradeoff being a larger a network-wide data aggregation delay due to larger number of child nodes per intermediate node. The MaxBNW-DG algorithm could be used to determine DG trees with larger trust score, larger energy (and other such criterion for node weight) per intermediate node compared to the leaf node.

show abstract

Section: Related Workmentioning

confidence: 99%

A Generic Algorithm to Determine Maximum Bottleneck Node Weight-based Data Gathering Trees for Wireless Sensor Networks

Meghanathan¹

2015

NPA

View full text Add to dashboard Cite

show abstract

“…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%

MWAHCA: A Multimedia Wireless Ad Hoc Cluster Architecture

Díaz

Lloret

Jiménez

et al. 2014

The Scientific World Journal

View full text Add to dashboard Cite

Wireless Ad hoc networks provide a flexible and adaptable infrastructure to transport data over a great variety of environments. Recently, real-time audio and video data transmission has been increased due to the appearance of many multimedia applications. One of the major challenges is to ensure the quality of multimedia streams when they have passed through a wireless ad hoc network. It requires adapting the network architecture to the multimedia QoS requirements. In this paper we propose a new architecture to organize and manage cluster-based ad hoc networks in order to provide multimedia streams. Proposed architecture adapts the network wireless topology in order to improve the quality of audio and video transmissions. In order to achieve this goal, the architecture uses some information such as each node's capacity and the QoS parameters (bandwidth, delay, jitter, and packet loss). The architecture splits the network into clusters which are specialized in specific multimedia traffic. The real system performance study provided at the end of the paper will demonstrate the feasibility of the proposal.

show abstract

“…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%

Design and Implementation of a Communication Protocol to Improve Multimedia QoS and QoE in Wireless Ad Hoc Networks

Santos¹,

Ramón²

View full text Add to dashboard Cite

show abstract

Distributed Bottleneck Flow Control in Mobile Ad Hoc Networks

Cited by 3 publications

References 22 publications

A Generic Algorithm to Determine Maximum Bottleneck Node Weight-based Data Gathering Trees for Wireless Sensor Networks

A Generic Algorithm to Determine Maximum Bottleneck Node Weight-based Data Gathering Trees for Wireless Sensor Networks

MWAHCA: A Multimedia Wireless Ad Hoc Cluster Architecture

Design and Implementation of a Communication Protocol to Improve Multimedia QoS and QoE in Wireless Ad Hoc Networks

Contact Info

Product

Resources

About