An Overlapping Coalition Formation Game Based Multicast Scheme in Backhaul-Limited Small Cell Networks

2020 ◽  
Vol 66 (3) ◽  
pp. 647-655
Author(s):  
Ronghui Hou ◽  
Kaiwen Huang ◽  
King-Shan Lui
2018 ◽  
Vol 12 (1) ◽  
pp. 604-615 ◽  
Author(s):  
Manzoor Ahmed ◽  
Mugen Peng ◽  
Munzali Abana ◽  
Shi Yan ◽  
Chonggang Wang

2019 ◽  
Vol 15 (1) ◽  
pp. 155014771881728 ◽  
Author(s):  
Changhua Yao ◽  
Lei Zhu ◽  
Yongxing Jia ◽  
Lei Wang

This article investigates the problem of efficient spectrum access for traffic demands of self-organizing cognitive small-cell networks, using the coalitional game approach. In particular, we propose a novel spectrum and time two-dimensional Traffic Cooperation Coalitional Game model which aims to improve the network throughput. The main motivation is to complete the data traffics of users, and the main idea is to make use of spectrum resource efficiently by reducing mutual interference in the spectrum dimension and considering cooperative data transmission in the time dimension at the same time. With the approach of coalition formation, compared with the traditional binary order in most existing coalition formation algorithms, the proposed functional order indicates a more flexibly preferring action which is a functional value determined by the environment information. To solve the distributed self-organizing traffic cooperation coalition formation problem, we propose three coalition formation algorithms: the first one is the Binary Preferring Traffic Cooperation Coalition Formation Algorithm based on the traditional Binary Preferring order; the second one is the Best Selection Traffic Cooperation Coalition Formation Algorithm based on the functional Best Selection order to improve the converging speed; and the third one is the Probabilistic Decision Traffic Cooperation Coalition Formation Algorithm based on the functional Probabilistic Decision order to improve the performance of the formed coalition. The proposed three algorithms are proved to converge to Nash-stable coalition structure. Simulation results verify the theoretic analysis and the proposed approaches.


2013 ◽  
Vol 12 (10) ◽  
pp. 5360-5372 ◽  
Author(s):  
Sudarshan Guruacharya ◽  
Dusit Niyato ◽  
Mehdi Bennis ◽  
Dong In Kim

2014 ◽  
Vol 26 (4) ◽  
pp. 718-731 ◽  
Author(s):  
Manzoor Ahmed ◽  
Wenbo Wang ◽  
Biling Zhang ◽  
Chengdan Sun ◽  
Ishtiaq Ahmad ◽  
...  

Electronics ◽  
2021 ◽  
Vol 10 (9) ◽  
pp. 1040
Author(s):  
Menghan Wei ◽  
Youjia Chen ◽  
Ming Ding

Unmanned aerial vehicles (UAVs), featured by the high-mobility and high-quality propagation environment, have shown great potential in wireless communication applications. In this paper, a novel UAV-aided small-cell content caching network is proposed and analyzed, where joint transmission (JT) is considered in the dense small-cell networks and mobile UAVs are employed to shorten the serving distance. The system performance is evaluated in terms of the average cache hit probability and the ergodic transmission rate. From the analytical results, we find that (i) the proposed UAV-aided small-cell network shows superior caching performance and, even with a small density of UAVs the system’s cache hit probability, can be improved significantly; (ii) the content’s optimal caching probability to maximize the cache hit probability is proportional to the (K+1)-th root of its request probability, where K is the number of small-cell base stations that serve each user by JT; (iii) caching the most popular content in UAVs may lead to a low transmission rate due to the limited resource offered by the low-density UAVs. Simulation results are presented to validate the theoretical results and the performance gain achieved by the optimal caching strategy.


Sign in / Sign up

Export Citation Format

Share Document