Resource Allocation for Max-Min Rate Fairness in Molecular Communication Systems

被引:0
|
作者
Chen, Xuan [1 ]
Wen, Miaowen [1 ]
Ji, Fei [1 ]
Chae, Chan-Byoung [2 ]
Yang, Lie-Liang [3 ]
Huang, Yu [1 ]
机构
[1] South China Univ Technol, Sch Elect & Informat Engn, Guangzhou, Guangdong, Peoples R China
[2] Yonsei Univ, Yonsei Inst Convergence Technol, Seoul, South Korea
[3] Univ Southampton, Sch Elect & Comp Sci, Southampton, Hants, England
基金
新加坡国家研究基金会; 中国国家自然科学基金;
关键词
Molecular communication; multiple access; com-binatorial optimization; resource allocation; max-min fairness;
D O I
10.1109/ICC42927.2021.9500785
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Molecular communication (MC) is considered to be a promising technology to realize the Internet of Nano Things (IoNT), especially the biomedical IoNT. In the construction of IoNT, communication between nano-machines is still an important topic, where multiple-access MC is imperative to be studied due to the multiple nano-machine clusters in IoNT. In this paper, a novel multi-user MC system based on the molecular division multiple access technology is proposed, where information molecules with different diffusion coefficients are first employed. Moreover, we employ the max-min rate fairness as a criterion to investigate the optimization of molecular resource allocation, including the assignment for types of molecules and the number of associated molecules. Two assignment strategies for types of molecules, i.e., best-to-best (BTB) and best-to-worst (BTW), are proposed. Subsequently, we analytically deduce the optimal allocation for the number of molecules when types of molecules are fixed for all users. Finally, numerical results show that the combination of BTW and the optimal allocation for the number of molecules exhibits the best performance.
引用
收藏
页数:6
相关论文
共 50 条
  • [41] Which is the fairest allocation in the max-min fairness-based coalitional game?
    Chen, Zheng
    Gu, Zhaoquan
    Wang, Yuexuan
    THEORETICAL COMPUTER SCIENCE, 2021, 888 (888) : 56 - 69
  • [42] Energy-Efficient Subcarrier Assignment and Power Allocation in OFDMA Systems With Max-Min Fairness Guarantees
    Li, Yuzhou
    Sheng, Min
    Tan, Chee Wei
    Zhang, Yan
    Sun, Yuhua
    Wang, Xijun
    Shi, Yan
    Li, Jiandong
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2015, 63 (09) : 3183 - 3195
  • [43] Optimal Control of DDoS defense with Multi-Resource Max-min Fairness
    Wei, Wei
    Dong, Yabo
    Lu, Dongming
    Jin, Guang
    2008 IEEE CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS, VOLS 1 AND 2, 2008, : 1 - +
  • [44] A new distributed optimal utility max-min fair resource allocation
    Zhao, Jian
    Song, Danni
    Zhang, Qiang
    Meng, Jintao
    PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, VOLS 1 AND 2, 2008, : 482 - +
  • [45] Online Max-min Fair Allocation
    Kawase, Yasushi
    Sumita, Hanna
    ALGORITHMIC GAME THEORY, SAGT 2022, 2022, 13584 : 526 - 543
  • [46] Max-min Fairness of Generalized AGV Mechanisms
    Wang, Tao
    Xu, Yunjian
    Ahipasaoglu, Selin Damla
    Courcoubetis, Costas
    2015 54TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2015, : 5170 - 5177
  • [47] A Resource Management Algorithm Based On Multi-path Max-min Fairness
    Zhang Min
    Wu Chunming
    Jiang Ming
    Yu Jing
    2009 FIRST INTERNATIONAL CONFERENCE ON FUTURE INFORMATION NETWORKS, 2009, : 76 - +
  • [48] Max-Min Fairness in 802.11 Mesh Networks
    Leith, Douglas J.
    Cao, Qizhi
    Subramanian, Vijay G.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2012, 20 (03) : 756 - 769
  • [49] Utility Max-Min Fair Resource Allocation for Diversified Applications in EPON
    Zhang, Jingjing
    Ansari, Nirwan
    ACCESS NETWORKS, 2010, 37 : 14 - 24
  • [50] Max-Min Fair Resource Allocation in Millimetre-Wave Backhauls
    Li, Rui
    Patras, Paul
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2020, 19 (08) : 1879 - 1895