67,267 research outputs found
Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm
This paper explores optimization of paging and registration policies in
cellular networks. Motion is modeled as a discrete-time Markov process, and
minimization of the discounted, infinite-horizon average cost is addressed. The
structure of jointly optimal paging and registration policies is investigated
through the use of dynamic programming for partially observed Markov processes.
It is shown that there exist policies with a certain simple form that are
jointly optimal, though the dynamic programming approach does not directly
provide an efficient method to find the policies.
An iterative algorithm for policies with the simple form is proposed and
investigated. The algorithm alternates between paging policy optimization and
registration policy optimization. It finds a pair of individually optimal
policies, but an example is given showing that the policies need not be jointly
optimal. Majorization theory and Riesz's rearrangement inequality are used to
show that jointly optimal paging and registration policies are given for
symmetric or Gaussian random walk models by the nearest-location-first paging
policy and distance threshold registration policies.Comment: 13 pages, submitted to IEEE Trans. Information Theor
Energy-Efficient Resource Allocation in Multiuser OFDM Systems with Wireless Information and Power Transfer
In this paper, we study the resource allocation algorithm design for
multiuser orthogonal frequency division multiplexing (OFDM) downlink systems
with simultaneous wireless information and power transfer. The algorithm design
is formulated as a non-convex optimization problem for maximizing the energy
efficiency of data transmission (bit/Joule delivered to the users). In
particular, the problem formulation takes into account the minimum required
system data rate, heterogeneous minimum required power transfers to the users,
and the circuit power consumption. Subsequently, by exploiting the method of
time-sharing and the properties of nonlinear fractional programming, the
considered non-convex optimization problem is solved using an efficient
iterative resource allocation algorithm. For each iteration, the optimal power
allocation and user selection solution are derived based on Lagrange dual
decomposition. Simulation results illustrate that the proposed iterative
resource allocation algorithm achieves the maximum energy efficiency of the
system and reveal how energy efficiency, system capacity, and wireless power
transfer benefit from the presence of multiple users in the system.Comment: 6 pages. The paper has been accepted for publication at the IEEE
Wireless Communications and Networking Conference (WCNC) 2013, Shanghai,
China, Apr. 201
- …