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