19,840 research outputs found
Cell Selection in Wireless Two-Tier Networks: A Context-Aware Matching Game
The deployment of small cell networks is seen as a major feature of the next
generation of wireless networks. In this paper, a novel approach for cell
association in small cell networks is proposed. The proposed approach exploits
new types of information extracted from the users' devices and environment to
improve the way in which users are assigned to their serving base stations.
Examples of such context information include the devices' screen size and the
users' trajectory. The problem is formulated as a matching game with
externalities and a new, distributed algorithm is proposed to solve this game.
The proposed algorithm is shown to reach a stable matching whose properties are
studied. Simulation results show that the proposed context-aware matching
approach yields significant performance gains, in terms of the average utility
per user, when compared with a classical max-SINR approach.Comment: 11 pages, 11 figures, Journal article in ICST Wireless Spectrum, 201
Distributed Relay Selection for Heterogeneous UAV Communication Networks Using A Many-to-Many Matching Game Without Substitutability
This paper proposes a distributed multiple relay selection scheme to maximize
the satisfaction experiences of unmanned aerial vehicles (UAV) communication
networks. The multi-radio and multi-channel (MRMC) UAV communication system is
considered in this paper. One source UAV can select one or more relay radios,
and each relay radio can be shared by multiple source UAVs equally. Without the
center controller, source UAVs with heterogeneous requirements compete for
channels dominated by relay radios. In order to optimize the global
satisfaction performance, we model the UAV communication network as a
many-to-many matching market without substitutability. We design a potential
matching approach to address the optimization problem, in which the optimizing
of local matching process will lead to the improvement of global matching
results. Simulation results show that the proposed distributed matching
approach yields good matching performance of satisfaction, which is close to
the global optimum result. Moreover, the many-to-many potential matching
approach outperforms existing schemes sufficiently in terms of global
satisfaction within a reasonable convergence time.Comment: 6 pages, 4 figures, conferenc
Matching Theory for Backhaul Management in Small Cell Networks with mmWave Capabilities
Designing cost-effective and scalable backhaul solutions is one of the main
challenges for emerging wireless small cell networks (SCNs). In this regard,
millimeter wave (mmW) communication technologies have recently emerged as an
attractive solution to realize the vision of a high-speed and reliable wireless
small cell backhaul network (SCBN). In this paper, a novel approach is proposed
for managing the spectral resources of a heterogeneous SCBN that can exploit
simultaneously mmW and conventional frequency bands via carrier aggregation. In
particular, a new SCBN model is proposed in which small cell base stations
(SCBSs) equipped with broadband fiber backhaul allocate their frequency
resources to SCBSs with wireless backhaul, by using aggregated bands. One
unique feature of the studied model is that it jointly accounts for both
wireless channel characteristics and economic factors during resource
allocation. The problem is then formulated as a one-to-many matching game and a
distributed algorithm is proposed to find a stable outcome of the game. The
convergence of the algorithm is proven and the properties of the resulting
matching are studied. Simulation results show that under the constraints of
wireless backhauling, the proposed approach achieves substantial performance
gains, reaching up to compared to a conventional best-effort approach.Comment: In Proc. of the IEEE International Conference on Communications
(ICC), Mobile and Wireless Networks Symposium, London, UK, June 201
- …