1,897 research outputs found
NUM-Based Rate Allocation for Streaming Traffic via Sequential Convex Programming
In recent years, there has been an increasing demand for ubiquitous streaming
like applications in data networks. In this paper, we concentrate on NUM-based
rate allocation for streaming applications with the so-called S-curve utility
functions. Due to non-concavity of such utility functions, the underlying NUM
problem would be non-convex for which dual methods might become quite useless.
To tackle the non-convex problem, using elementary techniques we make the
utility of the network concave, however this results in reverse-convex
constraints which make the problem non-convex. To deal with such a transformed
NUM, we leverage Sequential Convex Programming (SCP) approach to approximate
the non-convex problem by a series of convex ones. Based on this approach, we
propose a distributed rate allocation algorithm and demonstrate that under mild
conditions, it converges to a locally optimal solution of the original NUM.
Numerical results validate the effectiveness, in terms of tractable convergence
of the proposed rate allocation algorithm.Comment: 6 pages, conference submissio
Controlled Matching Game for Resource Allocation and User Association in WLANs
In multi-rate IEEE 802.11 WLANs, the traditional user association based on
the strongest received signal and the well known anomaly of the MAC protocol
can lead to overloaded Access Points (APs), and poor or heterogeneous
performance. Our goal is to propose an alternative game-theoretic approach for
association. We model the joint resource allocation and user association as a
matching game with complementarities and peer effects consisting of selfish
players solely interested in their individual throughputs. Using recent
game-theoretic results we first show that various resource sharing protocols
actually fall in the scope of the set of stability-inducing resource allocation
schemes. The game makes an extensive use of the Nash bargaining and some of its
related properties that allow to control the incentives of the players. We show
that the proposed mechanism can greatly improve the efficiency of 802.11 with
heterogeneous nodes and reduce the negative impact of peer effects such as its
MAC anomaly. The mechanism can be implemented as a virtual connectivity
management layer to achieve efficient APs-user associations without
modification of the MAC layer
Stability and Distributed Power Control in MANETs with Outages and Retransmissions
In the current work the effects of hop-by-hop packet loss and retransmissions
via ARQ protocols are investigated within a Mobile Ad-hoc NET-work (MANET).
Errors occur due to outages and a success probability function is related to
each link, which can be controlled by power and rate allocation. We first
derive the expression for the network's capacity region, where the success
function plays a critical role. Properties of the latter as well as the related
maximum goodput function are presented and proved. A Network Utility
Maximization problem (NUM) with stability constraints is further formulated
which decomposes into (a) the input rate control problem and (b) the scheduling
problem. Under certain assumptions problem (b) is relaxed to a weighted sum
maximization problem with number of summants equal to the number of nodes. This
further allows the formulation of a non-cooperative game where each node
decides independently over its transmitting power through a chosen link. Use of
supermodular game theory suggests a price based algorithm that converges to a
power allocation satisfying the necessary optimality conditions of (b).
Implementation issues are considered so that minimum information exchange
between interfering nodes is required. Simulations illustrate that the
suggested algorithm brings near optimal results.Comment: 25 pages, 6 figures, 1 table, submitted to the IEEE Trans. on
Communication
- …