Strategy-Proof Mechanism for Online Time-Varying Resource Allocation with Restart

2021 ◽  
Vol 19 (3) ◽  
Author(s):  
Jixian Zhang ◽  
Ning Xie ◽  
Xuejie Zhang ◽  
Weidong Li
Computing ◽  
2021 ◽  
Author(s):  
Jixian Zhang ◽  
Laixin Chi ◽  
Ning Xie ◽  
Xutao Yang ◽  
Xuejie Zhang ◽  
...  

2020 ◽  
Vol 111 ◽  
pp. 27-38 ◽  
Author(s):  
Jixian Zhang ◽  
Xutao Yang ◽  
Ning Xie ◽  
Xuejie Zhang ◽  
Athanasios V. Vasilakos ◽  
...  

Electronics ◽  
2021 ◽  
Vol 10 (23) ◽  
pp. 2909
Author(s):  
Chen Zhang ◽  
Jiangtao Yang ◽  
Yong Zhang ◽  
Ziwei Liu ◽  
Gengxin Zhang

Beam hopping technology is considered to provide a high level of flexible resource allocation to manage uneven traffic requests in multi-beam high throughput satellite systems. Conventional beam hopping resource allocation methods assume constant rainfall attenuation. Different from conventional methods, by employing genetic algorithm this paper studies dynamic beam hopping time slots allocation under the effect of time-varying rain attenuation. Firstly, a beam hopping system model as well as rain attenuation time series based on Dirac lognormal distribution are provided. On this basis, the dynamic allocation method by employing genetic algorithm is proposed to obtain both quantity and arrangement of time slots allocated for each beam. Simulation results show that, compared with conventional methods, the proposed algorithm can dynamically adjust time slots allocation to meet the non-uniform traffic requirements of each beam under the effect of time-varying rain attenuation and effectively improve system performance.


Author(s):  
Venkatesan T. Chakaravarthy ◽  
Amit Kumar ◽  
Sambuddha Roy ◽  
Yogish Sabharwal

2011 ◽  
Vol 18 (3) ◽  
pp. 119-130 ◽  
Author(s):  
Muayad S. Al-Janabi ◽  
Charalampos C. Tsimenidis ◽  
Bayan S. Sharif ◽  
Stéphane Y. Le Goff

Sign in / Sign up

Export Citation Format

Share Document