Abstract
Joint design of flow control, multipath routing, and random access control is considered for wireless multihop networks. Based on a network utility maximization formulation, Aloha persistence probabilities are optimized together with multicommodity end-to-end rates and per-link flow rates. Although the joint optimization of Aloha and flow control was previously tackled using a convex reformulation, adding the routing component renders the problem inherently nonconvex. To cope with this challenge, a successive convex approximation approach is taken to obtain a locally optimal solution efficiently. A parallelized distributed algorithm is developed, which scales well in the network size and exhibits low computational complexity. An online implementation is also proposed and tested. Numerical examples verify the novel design and highlight the performance advantage over state-of-the-art alternatives.
| Original language | English (US) |
|---|---|
| Article number | 6148294 |
| Pages (from-to) | 2562-2574 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Signal Processing |
| Volume | 60 |
| Issue number | 5 |
| DOIs | |
| State | Published - May 2012 |
Bibliographical note
Funding Information:Manuscript received August 03, 2011; revised December 05, 2011; accepted January 24, 2012. Date of publication February 07, 2012; date of current version April 13, 2012. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Samson Lasaulce. This work was supported by NSF Grants CCF-0830480, ECCS-0824007, and ECCS-1002180. Part of the results in this paper was presented in the Signal Processing Applications in Wireless Communications Workshop, San Francisco, California, June 26–29, 2011.
Keywords
- Multihop network
- multipath routing
- random access
- successive convex approximation
- utility maximization