Heterogeneous Resource Allocation Algorithm for Ad Hoc Networks with Utility Fairness

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.

[1]  Ashutosh Sabharwal,et al.  An Axiomatic Theory of Fairness in Network Resource Allocation , 2009, 2010 Proceedings IEEE INFOCOM.

[2]  Zheng Liu,et al.  Utility-based scheduling in wireless multi-hop networks over non-deterministic fading channels , 2012, Comput. Networks.

[3]  Edward W. Knightly,et al.  Congestion control in CSMA-based networks with inconsistent channel state , 2006, WICON '06.

[4]  Ellen W. Zegura,et al.  Utility max-min: an application-oriented bandwidth allocation scheme , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[6]  Ahmed Abdel-Hadi,et al.  A utility proportional fairness approach for resource allocation in 4G-LTE , 2014, 2014 International Conference on Computing, Networking and Communications (ICNC).

[7]  Rekha Jain,et al.  Wireless Sensor Network -A Survey , 2013 .

[8]  Binoy Ravindran,et al.  Achieving Max-Min lifetime and fairness with rate allocation for data aggregation in sensor networks , 2011, Ad Hoc Networks.

[9]  Soung Chang Liew,et al.  Proportional fairness in wireless LANs and ad hoc networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[10]  Baochun Li.  End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[11]  Marimuthu Palaniswami,et al.  A simple framework of utility max-min flow control using sliding mode approach , 2009, IEEE Communications Letters.

[12]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[13]  Fernando Casadevall,et al.  Control of the trade-off between resource efficiency and user fairness in wireless networks using utility-based adaptive resource allocation , 2011, IEEE Communications Magazine.

[14]  James F. Kurose,et al.  An information-theoretic characterization of weighted α-proportional fairness in network resource allocation , 2011, Inf. Sci..

[15]  Klara Nahrstedt,et al.  Optimal resource allocation in wireless ad hoc networks: a price-based approach , 2006, IEEE Transactions on Mobile Computing.

[16]  Sem C. Borst,et al.  Network iso-elasticity and weighted α-fairness , 2012, Perform. Evaluation.

[17]  Weijia Jia,et al.  Design a novel fairness model in WiMAX mesh networks , 2012, Comput. Commun..

[18]  Jean-Yves Le Boudec,et al.  Rate adaptation, Congestion Control and Fairness: A Tutorial , 2000 .

[19]  Robin Kravets,et al.  Throughput guarantees for multi-priority traffic in ad hoc networks , 2007, Ad Hoc Networks.

[20]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[21]  Pin-Han Ho,et al.  Fair packet scheduling in Wireless Mesh Networks , 2014, Ad Hoc Networks.

[22]  Paulo F. Pires,et al.  Efficient allocation of resources in multiple heterogeneous Wireless Sensor Networks , 2014, J. Parallel Distributed Comput..

[23]  Jack Minker,et al.  An Analysis of Some Graph Theoretical Cluster Techniques , 1970, JACM.

[24]  Ben Liang,et al.  Near-optimal spectrum allocation in multi-tier cellular networks with random inelastic traffic , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[25]  Bill Lin,et al.  Optimal multi-path routing and bandwidth allocation under utility max-min fairness , 2009, 2009 17th International Workshop on Quality of Service.

[26]  Aylin Yener,et al.  Optimum Transmission Policies for Battery Limited Energy Harvesting Nodes , 2010, IEEE Transactions on Wireless Communications.

[27]  Marimuthu Palaniswami,et al.  Application-Oriented Flow Control: Fundamentals, Algorithms and Fairness , 2006, IEEE/ACM Transactions on Networking.

[28]  Marimuthu Palaniswami,et al.  Handling inelastic traffic in wireless sensor networks , 2010, IEEE Journal on Selected Areas in Communications.

[29]  Nicholas F. Maxemchuk,et al.  Scalable max-min fairness in wireless ad hoc networks , 2011, Ad Hoc Networks.

[30]  Vincent W. S. Wong,et al.  Random access for elastic and inelastic traffic in WLANs , 2010, IEEE Transactions on Wireless Communications.

[31]  Biswanath Mukherjee,et al.  Wireless sensor network survey , 2008, Comput. Networks.

[32]  Drakoulis Martakos,et al.  A utility-based fuzzy TOPSIS method for energy efficient network selection in heterogeneous wireless networks , 2012, Appl. Soft Comput..

[33]  Lijun Chen,et al.  Joint congestion control and media access control design for ad hoc wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[34]  Shamik Sengupta,et al.  Price-bandwidth dynamics for WSPs in heterogeneous wireless networks , 2014, Phys. Commun..

[35]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem , 2003, MobiCom '03.