3,927 research outputs found
A Decision-Theoretic Approach to Resource Allocation in Wireless Multimedia Networks
The allocation of scarce spectral resources to support as many user
applications as possible while maintaining reasonable quality of service is a
fundamental problem in wireless communication. We argue that the problem is
best formulated in terms of decision theory. We propose a scheme that takes
decision-theoretic concerns (like preferences) into account and discuss the
difficulties and subtleties involved in applying standard techniques from the
theory of Markov Decision Processes (MDPs) in constructing an algorithm that is
decision-theoretically optimal. As an example of the proposed framework, we
construct such an algorithm under some simplifying assumptions. Additionally,
we present analysis and simulation results that show that our algorithm meets
its design goals. Finally, we investigate how far from optimal one well-known
heuristic is. The main contribution of our results is in providing insight and
guidance for the design of near-optimal admission-control policies.Comment: To appear, Dial M for Mobility, 200
Power allocation in wireless multi-user relay networks
In this paper, we consider an amplify-and-forward wireless relay system where multiple source nodes communicate with their corresponding destination nodes with the help of relay nodes. Conventionally, each relay equally distributes the available resources to its relayed sources. This approach is clearly sub-optimal since each user experiences dissimilar channel conditions, and thus, demands different amount of allocated resources to meet its quality-of-service (QoS) request. Therefore, this paper presents novel power allocation schemes to i) maximize the minimum signal-to-noise ratio among all users; ii) minimize the maximum transmit power over all sources; iii) maximize the network throughput. Moreover, due to limited power, it may be impossible to satisfy the QoS requirement for every user. Consequently, an admission control algorithm should first be carried out to maximize the number of users possibly served. Then, optimal power allocation is performed. Although the joint optimal admission control and power allocation problem is combinatorially hard, we develop an effective heuristic algorithm with significantly reduced complexity. Even though theoretically sub-optimal, it performs remarkably well. The proposed power allocation problems are formulated using geometric programming (GP), a well-studied class of nonlinear and nonconvex optimization. Since a GP problem is readily transformed into an equivalent convex optimization problem, optimal solution can be obtained efficiently. Numerical results demonstrate the effectiveness of our proposed approach
Recommended from our members
A directionally based bandwidth reservation scheme for call admission control
This paper proposes a new advanced Call Admission Control(CAC) strategy involving for the first time, a bandwidth reservation scheme that is influenced by the direction attribute of a mobile terminal (MT). Aside from the Quality-of-Service (QoS) parameters, the direction attribute plays a key role in efficiently reserving resources for MTs supporting multimedia communications for different QoS classes. The framework for a direction-based CAC system is entirely distributed and may be viewed as a message passing system, where MTs inform their neighbouring base stations (BS) not only of their QoS requirements, but also of their mobility parameters. The base stations then predict future demand and reserve resources accordingly, only admitting those terminals that can be adequately supported. The bandwidth reservation scheme proposed in this paper, integrates the direction attribute into the conventional Guard Channel (GC) scheme. Simulation results prove that this new scheme offers significant improvements in both Call Blocking Probability (CBP) and bandwidth utilization, under a variety of differing traffic conditions
Recommended from our members
A connection-level call admission control using genetic algorithm for MultiClass multimedia services in wireless networks
Call admission control in a wireless cell in a personal communication system (PCS) can be modeled as an M/M/C/C queuing system with m classes of users. Semi-Markov Decision Process (SMDP) can be used to optimize channel utilization with upper bounds on handoff blocking probabilities as Quality of Service constraints. However, this method is too time-consuming and therefore it fails when state space and action space are large. In this paper, we apply a genetic algorithm approach to address the situation when the SMDP approach fails. We code call admission control decisions as binary strings, where a value of â1â in the position i (i=1,âŠm) of a decision string stands for the decision of accepting a call in class-i; a value of â0â in the position i of the decision string stands for the decision of rejecting a call in class-i. The coded binary strings are feed into the genetic algorithm, and the resulting binary strings are founded to be near optimal call admission control decisions. Simulation results from the genetic algorithm are compared with the optimal solutions obtained from linear programming for the SMDP approach. The results reveal that the genetic algorithm approximates the optimal approach very well with less complexity
- âŠ