6,702 research outputs found
Wireless Scheduling with Power Control
We consider the scheduling of arbitrary wireless links in the physical model
of interference to minimize the time for satisfying all requests. We study here
the combined problem of scheduling and power control, where we seek both an
assignment of power settings and a partition of the links so that each set
satisfies the signal-to-interference-plus-noise (SINR) constraints.
We give an algorithm that attains an approximation ratio of , where is the number of links and is the ratio
between the longest and the shortest link length. Under the natural assumption
that lengths are represented in binary, this gives the first approximation
ratio that is polylogarithmic in the size of the input. The algorithm has the
desirable property of using an oblivious power assignment, where the power
assigned to a sender depends only on the length of the link. We give evidence
that this dependence on is unavoidable, showing that any
reasonably-behaving oblivious power assignment results in a -approximation.
These results hold also for the (weighted) capacity problem of finding a
maximum (weighted) subset of links that can be scheduled in a single time slot.
In addition, we obtain improved approximation for a bidirectional variant of
the scheduling problem, give partial answers to questions about the utility of
graphs for modeling physical interference, and generalize the setting from the
standard 2-dimensional Euclidean plane to doubling metrics. Finally, we explore
the utility of graph models in capturing wireless interference.Comment: Revised full versio
Spatial Throughput Maximization of Wireless Powered Communication Networks
Wireless charging is a promising way to power wireless nodes' transmissions.
This paper considers new dual-function access points (APs) which are able to
support the energy/information transmission to/from wireless nodes. We focus on
a large-scale wireless powered communication network (WPCN), and use stochastic
geometry to analyze the wireless nodes' performance tradeoff between energy
harvesting and information transmission. We study two cases with battery-free
and battery-deployed wireless nodes. For both cases, we consider a
harvest-then-transmit protocol by partitioning each time frame into a downlink
(DL) phase for energy transfer, and an uplink (UL) phase for information
transfer. By jointly optimizing frame partition between the two phases and the
wireless nodes' transmit power, we maximize the wireless nodes' spatial
throughput subject to a successful information transmission probability
constraint. For the battery-free case, we show that the wireless nodes prefer
to choose small transmit power to obtain large transmission opportunity. For
the battery-deployed case, we first study an ideal infinite-capacity battery
scenario for wireless nodes, and show that the optimal charging design is not
unique, due to the sufficient energy stored in the battery. We then extend to
the practical finite-capacity battery scenario. Although the exact performance
is difficult to be obtained analytically, it is shown to be upper and lower
bounded by those in the infinite-capacity battery scenario and the battery-free
case, respectively. Finally, we provide numerical results to corroborate our
study.Comment: 15 double-column pages, 8 figures, to appear in IEEE JSAC in February
2015, special issue on wireless communications powered by energy harvesting
and wireless energy transfe
- …