2 research outputs found
Dynamic Mobility-Aware Interference Avoidance for Aerial Base Stations in Cognitive Radio Networks
Aerial base station (ABS) is a promising solution for public safety as it can
be deployed in coexistence with cellular networks to form a temporary
communication network. However, the interference from the primary cellular
network may severely degrade the performance of an ABS network. With this
consideration, an adaptive dynamic interference avoidance scheme is proposed in
this work for ABSs coexisting with a primary network. In the proposed scheme,
the mobile ABSs can reconfigure their locations to mitigate the interference
from the primary network, so as to better relay the data from the designated
source(s) to destination(s). To this end, the single/multi-commodity maximum
flow problems are formulated and the weighted Cheeger constant is adopted as a
criterion to improve the maximum flow of the ABS network. In addition, a
distributed algorithm is proposed to compute the optimal ABS moving directions.
Moreover, the trade-off between the maximum flow and the shortest path
trajectories is investigated and an energy-efficient approach is developed as
well. Simulation results show that the proposed approach is effective in
improving the maximum network flow and the energy-efficient approach can save
up to 39% of the energy for the ABSs with marginal degradation in the maximum
network flow.Comment: 9 pages, 13 figures, to be presented in Proc. IEEE INFOCOM 201
Optimum Location-Based Relay Selection in Wireless Networks
This paper studies the performance and key structural properties of the
optimum location-based relay selection policy for wireless networks consisting
of homogeneous Poisson distributed relays. The distribution of the channel
quality indicator at the optimum relay location is obtained. A threshold-based
distributed selective feedback policy is proposed for the discovery of the
optimum relay location with finite average feedback load. It is established
that the total number of relays feeding back obeys to a Poisson distribution
and an analytical expression for the average feedback load is derived. The
analytical expressions for the average rate and outage probability with and
without selective feedback are also obtained for general path-loss models. It
is shown that the optimum location-based relay selection policy outperforms
other common relay selection strategies notably. It is also shown that
utilizing location information from a small number of relays is enough to
achieve almost the same performance with the infinite feedback load case. As
generalizations, full-duplex relays, isotropic Poisson point processes, and
heterogeneous source-to-relay and relay-to-destination links are also studied