A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks

Abstract

Abstract-This article proposes a scheme for bandwidth allocation in wireless ad hoc networks. The quality of service (QoS) levels for each end-to-end flow are expressed using a resourceutility function, and our algorithms aim to maximize aggregated utility. The shared channel is modeled as a bandwidth resource defined by maximal cliques of mutual interfering links.We propose a novel resource allocation algorithm that employs an auction mechanism in which flows are bidding for resources. The bids depend both on the flow's utility function and the intrinsically derived shadow prices. We then combine the admission control scheme with a utility-aware on-demand shortest path routing algorithm where shadow prices are used as a natural distance metric.As a baseline for evaluation we show that the problem can be formulated as a linear programming (LP) problem. Thus, we can compare the performance of our distributed scheme to the centralized LP solution, registering results very close to the optimum. Next we isolate the performance of price-based routing and show its advantages in hotspot scenarios, and also propose an asynchronous version that is more feasible for ad hoc environments.Further experimental evaluation compares our scheme with the state-of-the-art derived from Kelly's utility maximization framework and shows that our approach exhibits superior performance for networks with increased mobility or less frequent allocations.Index Terms-Mobile computing, pricing and resource allocation, quality of service, optimization, performance evaluation of algorithms and systems.

Queue-Aware Distributive Resource Control for Delay-Sensitive Two-Hop MIMO Cooperative Systems

“…Specifically, using the approximation in (21), the control policy in (18) can be obtained by solving the following simplified optimization problem.…”

Adding Redundancy to Replication in Window-aware Delay-tolerant Routing

“…This has been studied in fully connected mobile ad-hoc networks [19] where construction of the route also involves maximizing the accumulated utility for the whole network. In the context of DTNs, Balasubramanian et al [20] use utility in order to optimize resources with respect to delay related metrics, in particular minimizing average delay, minimizing missed deadlines or minimizing maximum delay.…”

“…Earlier work has studied similar allocation schemes in highly overloaded and dense networks [19]. Zhang [14] and Erramilli et al [22] show that in sparse networks differences between routing protocols are more accentuated as a bad forwarding decision could lead to infinite delay without rollback possibility, due to shortage of contacts.…”

Opportunistic DTN routing with window-aware adaptive replication

“…A rather different approach is to introduce utility and differentiation between messages when dealing with resource allocation. This has been studied in fully connected mobile ad-hoc networks [5] where construction of the route also enforces maximizing the accumulated utility for the whole network. In the context of DTNs, Balasubramanian et al [1] use utility in order to optimize with respect to delay related metrics; in particular minimizing average delay, minimizing missed deadlines or minimizing maximum delay.…”