Primary Network Interference Compensation-Based Dynamic Spectrum Leasing and Secondary Network Power Control

Wen, Feng; Jiang, Weiheng

doi:10.1007/s11277-014-2261-6

Cited by 4 publications

(3 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We denote the time of period T as the set

scriptT = false{t false| 0 \leq t \leq T false}

. As shown in Figure A, in fact, the resources allocation in a period T can be modeled as a multiple dimension knapsack problem (MDKP), that is, filling the three‐dimensional space by the cubes as much as possible. While one cube represents one resources request from one MU, and the boundary denotes the constraint on the available resource in the system, ie, T denotes the allocated time period, W denotes the available communication resource, and C denotes the available computing resources.…”

Section: Optimization Problem and Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Online combinatorial based mechanism for MEC network resource allocation

Jiang

et al. 2019

Int J Communication

Self Cite

View full text Add to dashboard Cite

Summary In this paper, the resource allocation problem for mobile edge computing (MEC) network is discussed. We focus on the design of online resource allocation strategy by considering the time‐varying demands of the combinatorial resources for the mobile users. To handle this issue, at first, a time splitting‐based online allocation mechanism is introduced. Then, for a given resource allocation period of the time splitting, a combinatorial auction mechanism for the combination resources allocation is proposed. We further prove that the proposed combinatorial auction is both individual rational and incentive‐compatible, and which can bring a higher revenue to the service provider. In order to verify the performance of the proposed mechanism, a variable‐relaxed‐based performance‐bound algorithm and a greedy optimization‐based suboptimal algorithm are presented for comparison purpose. Finally, the performance of these proposed algorithms are testified by numerical simulations, which confirm the analysis results.

show abstract

“…We denote the time of period T as the set

scriptT = false{t false| 0 \leq t \leq T false}

Section: Optimization Problem and Algorithmmentioning

confidence: 99%

“…Herein, a heuristic optimization algorithm based on greedy though and named GOA is proposed for IP1. The main idea is that based on the MUs' bidding index function

f_{i} = b_{i}^{s} false/ false(t_{i} false(w_{i} + c_{i} false) false)

, the combinatorial resources are allocated.…”

Section: Optimization Problem and Algorithmmentioning

confidence: 99%

Online combinatorial based mechanism for MEC network resource allocation

Jiang

et al. 2019

Int J Communication

Self Cite

View full text Add to dashboard Cite

show abstract

“…Wang, et.al discuss price-based non-cooperation power control and water-filling-based algorithms were proposed [6], while the authors just use simulation to verify the convergence without proving. There are some further work about this topic, such as [7][8][9][10], but multiple primary user base stations were not considered there. This paper focus on the CRN power control and we use the shadowing-price based non-cooperation game theory to analysis the user's behavior and optimization the CRUs' performance.…”

Section: Introductionmentioning

confidence: 99%