Joint Flow Control, Routing and Medium Access Control in Random Access Multi-Hop Wireless Networks

Supittayapornpong, Sucha; Saengudomlert, Poompat

doi:10.1109/icc.2009.5199113

Cited by 9 publications

(17 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Results from an algorithm with static link capacity [10] are also listed in Table 1, and match the results from the centralized Octave solver. In particular, static link capacities are set equal to the average N 3, N 4) 0.301 0.301 0.295 link capacities.…”

mentioning

confidence: 63%

“…The characteristics of the log-harmonic rate function are studied in [10], where it is shown that using the log-harmonic rate provides a fairer treatment among S-D pairs compared to viewing different paths of the same S-D pair as virtually separated S-D pairs. Furthermore, flows of an S-D pair tend to be distributed more equally among its candidate paths.…”

Section: Fairness and Harmonic Ratementioning

confidence: 99%

“…(1) Since a collision occurs at a receiver node of each active link if the node receives signals from multiple transmitting nodes or the node is transmitting as well as receiving, a successful transmission probability [4][5][6]8,10] of link l is…”

Section: Average Link Ratementioning

confidence: 99%

“…To overcome the non-convexity of the associated optimization problem and to provide proportional fairness [9] between S-D pairs, the harmonic rate function proposed in [10] is used at each S-D pair to represent the S-D pair's rate in a one dimensional scale. A rate of S-D pair s with the harmonic rate function is [10] …”

Section: Fairness and Harmonic Ratementioning

confidence: 99%

“…The work jointly designs flow control and MAC mechanisms with proportional fairness [9] in random access multi-hop wireless networks. Routing, which directly affects the resource allocation, is introduced to form the joint flow control, routing and MAC problem for a random access multi-hop network in [10]. However, in [10], all network parameters, including the topology and link capacities, are assumed static for the investigation.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Joint flow control, routing and medium access control in random access multi-hop wireless networks with time varying link capacities

Supittayapornpong

Saengudomlert

2009

2009 6th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technolog

View full text Add to dashboard Cite

This work extends the existing static framework for joint flow control, routing and medium access control (MAC) in random access multi-hop wireless networks to a dynamic framework where link capacities vary over time. The overall problem is formulated as a long term network utility maximization (NUM) problem (instead of the existing static NUM problem) that accounts for link capacity variation. This dynamic formulation is more realistic than the static one, and is one step closer to practical networks. Under the stationary and ergodic assumptions on the link capacity variation, the problem is decomposed to form a distributed algorithm. The algorithm samples current link capacities while it is iteratively and locally updating flow rates and link transmission probabilities. Simulation results demonstrate the ability of the algorithm to sustain the optimal average data rates despite the link capacity variation.

show abstract

mentioning

confidence: 63%

Section: Fairness and Harmonic Ratementioning

confidence: 99%

Section: Average Link Ratementioning

confidence: 99%

Section: Fairness and Harmonic Ratementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Joint flow control, routing and medium access control in random access multi-hop wireless networks with time varying link capacities

Supittayapornpong

Saengudomlert

2009

2009 6th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technolog

View full text Add to dashboard Cite

show abstract

Robustness, Stability, and Gains of Utility Maximization Algorithms for Mobile Ad Hoc Networks

Alhosainy

Kunz

2016

Int J Wireless Inf Networks

View full text Add to dashboard Cite

Energy-efficient capacity optimization in wireless networks

Liu

Cao

Cheng

et al. 2014

IEEE INFOCOM 2014 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

We study how to achieve optimal network capacity in the most energy-efficient manner over a general large-scale wireless network, say, a multi-hop multi-radio multi-channel (MR-MC) network. We develop a multi-objective optimization framework for computing the resource allocation that leads to optimal network capacity with minimal energy consumption. Our framework is based on a linear programming multi-commodity flow (MCF) formulation augmented with scheduling constraints over multi-dimensional conflict graph (MDCG). The optimization problem however involves finding all independent sets (ISs), which is NP-hard in general. Novel delayed column generation (DCG) based algorithms are developed to effectively solve the optimization problem. The DCG-based algorithms have significant advantages of low computation overhead and achieving high energy efficiency, compared to the common heuristic algorithm that randomly searches a large number of ISs to use. Extensive numerical results demonstrate the energy efficiency improvement by the proposed energy-efficient optimization techniques, over a wide range of networking scenarios.

show abstract

Joint Flow Control, Routing and Medium Access Control in Random Access Multi-Hop Wireless Networks

Cited by 9 publications

References 12 publications

Joint flow control, routing and medium access control in random access multi-hop wireless networks with time varying link capacities

Joint flow control, routing and medium access control in random access multi-hop wireless networks with time varying link capacities

Robustness, Stability, and Gains of Utility Maximization Algorithms for Mobile Ad Hoc Networks

Energy-efficient capacity optimization in wireless networks

Contact Info

Product

Resources

About