6,559 research outputs found
Joint Access Point Selection and Power Allocation for Uplink Wireless Networks
We consider the distributed uplink resource allocation problem in a
multi-carrier wireless network with multiple access points (APs). Each mobile
user can optimize its own transmission rate by selecting a suitable AP and by
controlling its transmit power. Our objective is to devise suitable algorithms
by which mobile users can jointly perform these tasks in a distributed manner.
Our approach relies on a game theoretic formulation of the joint power control
and AP selection problem. In the proposed game, each user is a player with an
associated strategy containing a discrete variable (the AP selection decision)
and a continuous vector (the power allocation among multiple channels). We
provide characterizations of the Nash Equilibrium of the proposed game, and
present a set of novel algorithms that allow the users to efficiently optimize
their rates. Finally, we study the properties of the proposed algorithms as
well as their performance via extensive simulations.Comment: Revised and Resubmitted to IEEE Transactions on Signal Processin
Optimization Framework and Graph-Based Approach for Relay-Assisted Bidirectional OFDMA Cellular Networks
This paper considers a relay-assisted bidirectional cellular network where
the base station (BS) communicates with each mobile station (MS) using OFDMA
for both uplink and downlink. The goal is to improve the overall system
performance by exploring the full potential of the network in various
dimensions including user, subcarrier, relay, and bidirectional traffic. In
this work, we first introduce a novel three-time-slot time-division duplexing
(TDD) transmission protocol. This protocol unifies direct transmission, one-way
relaying and network-coded two-way relaying between the BS and each MS. Using
the proposed three-time-slot TDD protocol, we then propose an optimization
framework for resource allocation to achieve the following gains: cooperative
diversity (via relay selection), network coding gain (via bidirectional
transmission mode selection), and multiuser diversity (via subcarrier
assignment). We formulate the problem as a combinatorial optimization problem,
which is NP-complete. To make it more tractable, we adopt a graph-based
approach. We first establish the equivalence between the original problem and a
maximum weighted clique problem in graph theory. A metaheuristic algorithm
based on any colony optimization (ACO) is then employed to find the solution in
polynomial time. Simulation results demonstrate that the proposed protocol
together with the ACO algorithm significantly enhances the system total
throughput.Comment: 27 pages, 8 figures, 2 table
- …