Matching Theory: Applications in wireless communications

Bayat, Siavash; Li, Yonghui; Song, Lingyang; Han, Zhu

doi:10.1109/msp.2016.2598848

Cited by 157 publications

(111 citation statements)

References 52 publications

Supporting

Mentioning

111

Contrasting

Order By: Relevance

“…Moreover, matching theory represents a fitting mathematical tool for wireless network communications field, especially to solve wireless resource management problem that can be formulated as a matching problem between resources and users . In Xu et al, the authors proposed a resource management approach that jointly optimizes relay selection, spectrum allocation, and power control, in a way that the total energy efficiency of device‐to‐device (D2D) links is maximized while guaranteeing the QoS requirements of D2D and cellular links simultaneously.…”

Section: Related Workmentioning

confidence: 99%

Two‐sided matching framework for optimal user association in 5G multi‐RAT UDNs

Amine

Kobbane

Ben‐Othman

et al. 2020

Int J Communication

View full text Add to dashboard Cite

Summary Recently, academic and industrial research communities are paying more explicit attention to the 5G multiple radio access technology ultra‐dense networks (5G multi‐RAT UDNs) for boosting network capacity, especially in UD urban zones. To this aim, in this paper, we intend to tackle the user association problem in 5G multi‐RAT UDNs. By considering the decoupled uplink/downlink access (DUDA), we divide our user association problem into two distinct subproblems representing, respectively, the uplink and the downlink channels. Next, we formulated each one as a nonlinear optimization problem with binary variables. Then, to solve them, we were restricted by the hard complexity, as well as the hard feasibility of centralized user association schemes. Thus, to resolve our user association problem in a reasonable time and distributed manner, we formulated each subproblem as a many‐to‐one matching game based on matching theory. Next, we provide two fully distributed association algorithms to compute the uplink and downlink stable matching among user equipments (UEs) and base stations (BSs). Simulation results corroborate our theoretical model and show the effectiveness and improvement of our achieved results in terms of the overall network performance, quality of service (QoS), and energy efficiency (EE) of UEs.

show abstract

Section: Related Workmentioning

confidence: 99%

Two‐sided matching framework for optimal user association in 5G multi‐RAT UDNs

Amine

Kobbane

Ben‐Othman

et al. 2020

Int J Communication

View full text Add to dashboard Cite

show abstract

“…From theory 3 defined in Bayat et al, we know the algorithm in Table produces matching and price‐allocation values with competitive equilibrium with sufficiently small values of price factor ϵ . The theorem provides an important property of the matching algorithm, that when ϵ is small enough, the outcome of the algorithm will be in the competitive equilibrium.…”

Section: Proposed Ag‐dpa Algorithmmentioning

confidence: 99%

AG‐DPA: Assignment game–based dynamic power allocation in multibeam satellite systems

Liu

Fan

et al. 2019

Satell Commun Network

View full text Add to dashboard Cite

Summary Dynamic power allocation is the key technology to maintain the link quality and improve the system throughput in multibeam satellite systems. Many numerical optimization algorithms have been proposed to optimize the power allocation schemes among beams. However, current metaheuristic algorithms, most of which are off‐line iterative methods, are not appropriate in nonuniform traffic demands and time‐varying channels due to the high computational complexity. To solve this problem, an assignment game–based dynamic power allocation (AG‐DPA) is proposed to achieve the suboptimality with low complexity in multibeam satellite systems. The key idea of the proposed AG‐DPA is to model the DPA problem into an assignment game model where the competitive equilibrium is achieved. Further, an adaptive price factor is introduced to make a trade‐off between algorithm performance and complexity. Simulation results show the effectiveness of the proposed AG‐DPA algorithm.

show abstract

“…The tasks offloading scheme proposed here is based on the MT that has recently emerged as a powerful mathematical tool to establish mutually beneficial relations between the elements belonging to two distinct sets, based on the preferences expressed by each element of one set on the elements of the opposite set . Such preferences are collected in lists, ie, preferences lists, formed by ranking the elements of the opposite set according to a local metric and vice versa . Hence, a matching game consists of a series of interactions between the elements of two distinct sets, which mutually express their own preferences in being matched with the elements of the opposite set.…”

Section: Proposed Solution and Algorithmmentioning

confidence: 99%

A matching game for tasks offloading in integrated edge‐fog computing systems

Chiti

Fantacci

Picano

2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Edge and fog computing paradigms have recently emerged as promising approaches to overcome latency and network congestion drawbacks of the cloud network architecture alternative. In this direction, the paper deals with an integrated edge‐fog computing system to provide computational offloading capabilities to end‐devices by assuming that each task can be alternatively run locally at the end‐device site, offloaded to a nearby device through a direct communication link (ie, device‐to‐device) or to a more far and computational powerful node, ie, a fog node. In particular, the goal of this paper is to identify a suitable tasks allocation strategy in order to minimize both the system energy consumption and the worst overall task completion time. The related optimization problem is formulated here as a matching game with externalities with incomplete preferences lists between tasks and computation sites due to the fact that each end‐device can reach only a subset of the fog nodes of the integrated computing system. Furthermore, this paper pursuits the stability analysis of the outcome matching, and provides a post matching procedure to reach a stable final matching configuration. Finally, the good behavior of the proposed approach is validated by providing performance comparisons with different alternatives, namely a typical cloud approach architecture, potential game and other matching theory based approaches recently proposed in literature.

show abstract

Matching Theory: Applications in wireless communications

Cited by 157 publications

References 52 publications

Two‐sided matching framework for optimal user association in 5G multi‐RAT UDNs

Two‐sided matching framework for optimal user association in 5G multi‐RAT UDNs

AG‐DPA: Assignment game–based dynamic power allocation in multibeam satellite systems

A matching game for tasks offloading in integrated edge‐fog computing systems

Contact Info

Product

Resources

About