Browsing by Author "Gu, Yunan"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item Matching theory for future wireless networks: fundamentals and applications(IEEE Communications Magazine, 5/14/2015) Gu, Yunan; Saad, Walid; Bennis, Mehdi; Debbah, Mérouane; Han, ZhuThe emergence of novel wireless networking paradigms such as small cell and cognitive radio networks has forever transformed the way in which wireless systems are operated. In particular, the need for self-organizing solutions to manage the scarce spectral resources has become a prevalent theme in many emerging wireless systems. In this article, the first comprehensive tutorial on the use of matching theory, a Nobel Prize winning framework, for resource management in wireless networks is developed. To cater for the unique features of emerging wireless networks, a novel, wireless-oriented classification of matching theory is proposed. Then the key solution concepts and algorithmic implementations of this framework are exposed. The developed concepts are applied in three important wireless networking areas in order to demonstrate the usefulness of this analytical tool. Results show how matching theory can effectively improve the performance of resource allocation in all three applications discussed.Item Matching Theory Framework for 5G Wireless Communications(2016-12) Gu, Yunan; Han, Zhu; Saad, Walid; Prasad, Saurabh; Qian, Lijun; Pan, MiaoThe prevalence of high-performance mobile devices such as smartphones and tablets has brought fundamental changes to the existing wireless networks. The growth of multimedia and location-based mobile services has exponentially increased the network congestion and the demands for more wireless resources. The extremely high computational complexity and communication overhead resulting from the conventional centralized resource management methods are no longer suitable to capture the scale of tomorrow’s wireless networks. As a result, the resource management in next-generation networks is shifting from the centralized optimization to the self-organizing solutions. The goal of this thesis is to demonstrate the effectiveness of matching theory, a powerful operational research framework, for solving the wireless resource allocation problems in a distributed manner. Matching theory, as a Nobel-prize winning framework, has already been widely used in many economic fields. More recently, matching theory has been shown to have a promising potential for modeling and analyzing wireless resource allocation problems due to three reasons: (1) it offers suitable models that can inherently capture various wireless communication features; (2) the ability to use notions, such as preference relations, that can interpret complex system requirements; (3) it provides low-complexity and near-optimal matching algorithms while guaranteeing the system stability. This dissertation provides a theoretical research of implementing the matching theory into the wireless communication fields. The main contributions of this dissertation are summarized as follows. An overview of the basic concepts, classifications, and models of the matching theory is provided. Furthermore, comparisons with existing mathematical solutions for the resource allocation problems in the wireless networks are conducted. Applications of matching theory in the wireless communications are studied. Especially, the stable marriage model, the student project allocation model and so on are introduced and applied to solve the resource allocation problems, such as the device-to-device (D2D) communication, LTE-Unlicensed, and so on. Both theoretical and numerical analysis are provided to show that matching theory can model complex system requirements, and also provide semi-distributive matching algorithms to achieve stable and close-optimal results. The potential and challenges of the matching theory for designing resource allocation mechanisms in the future wireless networks are discussed.Item Offloading in Software Defined Network at Edge with Information Asymmetry: A Contract Theoretical Approach(Journal of Signal Processing Systems, 9/30/2015) Zhang, Yanru; Liu, Lanchao; Gu, Yunan; Niyato, Dusit; Pan, Miao; Han, ZhuThe proliferation of highly capable mobile devices such as smartphones and tablets has significantly increased the demand for wireless access. Software defined network (SDN) at edge is viewed as one promising technology to simplify the traffic offloading process for current wireless networks. In this paper, we investigate the incentive problem in SDN-at-edge of how to motivate a third party access points (APs) such as WiFi and smallcells to offload traffic for the central base stations (BSs). The APs will only admit the traffic from the BS under the precondition that their own traffic demand is satisfied. Under the information asymmetry that the APs know more about own traffic demands, the BS needs to distribute the payment in accordance with the APs’ idle capacity to maintain a compatible incentive. First, we apply a contract-theoretic approach to model and analyze the service trading between the BS and APs. Furthermore, other two incentive mechanisms: optimal discrimination contract and linear pricing contract are introduced to serve as the comparisons of the anti adverse selection contract. Finally, the simulation results show that the contract can effectively incentivize APs’ participation and offload the cellular network traffic. Furthermore, the anti adverse selection contract achieves the optimal outcome under the information asymmetry scenario.