Heterogeneous Resource Allocation Algorithm for Ad Hoc Networks with Utility Fairness

Bing-Qing Han, Guo-Fu Feng and Yi-Fei Chen

International Journal of Distributed Sensor Networks, 2015, vol. 11, issue 1, 686189

Abstract: Resource allocation is expected to be a most important factor especially for heterogeneous applications in wireless ad hoc networks. In this paper, a novel heterogeneous resource allocation algorithm (HRA) is presented for ad hoc networks, supporting both elastic and inelastic traffic. First, by combining the first order Lagrangian method with pseudo utility, the original nonconvex problem is converted into a new convex one. Then, we successfully solve the heterogeneous problem with the dual-based decomposition approach. In addition, we integrate utility fairness into the resource allocation framework, which can adaptively manage the tradeoff between elastic and inelastic flows. Simulations show and prove that HRA converges fast and can achieve the global optimum starting from many different network conditions, such as elastic, inelastic, and hybrid scenario. With both considerations of flow rate and utility fairness, HRA improves the overall network utility and system throughput greatly.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2015/686189 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:11:y:2015:i:1:p:686189

DOI: 10.1155/2015/686189

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().