Sidelink Destekli Hücresel Ağlarda Merkezi Çok Amaçlı İstemci–Ağ Geçidi Eşlemesi

Öz

Mobil veri trafiğinin ve kullanıcı merkezli offloading hizmetlerinin (örneğin Wi-Fi veya sidelink tabanlı röleler) hızla artması, yalnızca sinyal gücüne dayalı basit ilişkilendirmelerin ötesine geçen ilişkilendirme mekanizmalarını gerektirmektedir. Bu çalışmada, sidelink destekli offloading kullanılan hücresel bir sistemde, tek hücreli ve Wi-Fi tabanlı cihazdan cihaza (D2D) bağlantıya sahip bir LTE ağı üzerinde somutlanan merkezi bir ağ geçidi–istemci ilişkilendirme problemini ele alıyoruz. Çok Amaçlı Kapasiteli İstemci–Ağ Geçidi İlişkilendirme Problemini (MO-CGAP) modelleyerek, bir denetleyicinin her istemciyi, ağ geçidi kapasite ve bağlantı kısıtlarına tabi olarak, en fazla bir ağ geçidine atadığını ve bunu yaparken (i) bağlı (servis verilen) istemci sayısını en büyüklediğini, (ii) elde edilen toplam veri oranını en büyüklediğini ve (iii) yük dengelemesini teşvik etmek için tam yükte çalışan ağ geçidi sayısını en aza indirdiğini varsayıyoruz. MO-CGAP’in, yalnızca toplam veri oranını en büyüklemeyi amaçlayan tek amaçlı bir varyantı için bile NP-zor olduğunu gösteriyor, bu da sezgisel çözüm yöntemlerinin kullanımını motive ediyor. MO-CGAP’e uyarlanmış iki meta-sezgisel algoritma tasarlıyoruz: probleme özgü bir kodlama, onarım ve leksikografik uygunluk (fitness) tasarımına sahip bir genetik algoritma (GA) ve aynı üç kademeli amaç önceliklendirmesini kullanan bir tavlama benzetimi (SA) şeması. Her iki yaklaşımı da, gerçekçi hücresel aşağı bağlantı ve sidelink soyutlamaları altında, farklı hotspot kümelenmeleri ve istemci yüklerine sahip dört mekânsal senaryoda dağıtık, RSSI tabanlı bir ilişkilendirme taban çizgisine karşı değerlendiriyoruz. Sayısal sonuçlar, GA ve SA’nın, RSSI tabanlı yaklaşıma kıyasla tutarlı biçimde daha yüksek bağlanabilirlik sağladığını ve orta düzey istemci yoğunluklarında, istemcileri daha dengeli dağıtarak hem toplam veri oranını iyileştirdiğini hem de tam yükte çalışan ağ geçidi sayısını azalttığını göstermektedir. GA genellikle SA’ya göre biraz daha yüksek veri hızı ve adalet (fairness) elde etmektedir. Sayısal çalışma LTE temelli olsa da, problem formülasyonu ve çözüm çerçevesi büyük ölçüde erişim teknolojisinden bağımsızdır ve 5G NR ve NR sidelink tabanlı röle mimarileri gibi modern OFDMA sistemlerine uyarlanabilir.

Anahtar Kelimeler

• Ağ geçidi-istemci eşlemesi
• sidelink destekli yük boşaltma
• cihazdan cihaza (D2D) haberleşme
• çok amaçlı optimizasyon
• genetik algoritmalar
• benzetimli tavlama.

Destekleyen Kurum

Bu çalışma, TÜBİTAK tarafından 115E389 numaralı proje kapsamında desteklenmiştir.

Proje Numarası

115E389

Centralized Multi-Objective Client–Gateway Association for Sidelink-Assisted Cellular Offloading

Öz

The rapid growth of mobile data and user-centric offloading services (e.g., Wi-Fi or sidelink-based relays) requires association mechanisms that go beyond simple signal-strength-based attachment. In this paper, we study a centralized gateway–client association problem in a cellular system with sidelink-assisted offloading, instantiated on a single-cell LTE network with Wi-Fi-based device-to-device connectivity. We model the Multi-Objective Capacitated Client-Gateway Association Problem (MO-CGAP), where a controller assigns each client to at most one gateway, subject to gateway capacity and connectivity constraints, while (i) maximizing the number of connected clients, (ii) maximizing the aggregate achieved data rate, and (iii) minimizing the number of fully loaded gateways to promote load balancing. We show that MO-CGAP is NP-hard even for a single-objective throughput-maximization variant, which motivates heuristic solution methods. We design two metaheuristic algorithms tailored to MO-CGAP: a genetic algorithm (GA) with a problem-specific encoding, repair, and lexicographic fitness design, and a simulated annealing (SA) scheme that uses the same three-tier objective prioritization. Both are evaluated against a distributed RSSI-based association baseline under realistic cellular downlink and sidelink abstractions, across four spatial scenarios with varying hotspot clustering and different client loads. Numerical results show that GA and SA consistently achieve higher connectivity than the RSSI-based baseline and, for moderate client densities, also improve aggregate throughput and reduce the number of fully loaded gateways by distributing clients more evenly. GA typically yields slightly better throughput and fairness than SA. Although the numerical study is LTE-based, the problem formulation and solution framework are largely radio-access-agnostic and can be adapted to modern OFDMA systems such as 5G NR and NR sidelink-based relay architectures.

Anahtar Kelimeler

• Gateway-client association
• sidelink-assisted offloading
• device-to-device (D2D) communication
• multi-objective optimization
• genetic algorithms
• simulated annealing.

Destekleyen Kurum

This work was supported by TUBITAK under Grant 115E389.

Proje Numarası

115E389

Kaynakça

1. Syrivelis, D., Iosifidis, G., Delimpasis, D., Chounos, K., Korakis, T., & Tassiulas, L. (2015). Bits and coins: Supporting collaborative consumption of mobile Internet. In 2015 IEEE Conference on Computer Communications (INFOCOM) (pp. 2146–2154). IEEE. https://doi.org/10.1109/INFOCOM.2015.7218577
2. Uludağ, K., Taşci, S. E., & Korçak, O. (2020). Sequential bargaining based incentive mechanism for collaborative Internet access. Journal of Network and Computer Applications, 170, Article 102758. https://doi.org/10.1016/j.jnca.2020.102758
3. Abolhasan, M., Ni, W., Lipman, J., Safaei, F., & Jamalipour, A. (2018). A routing framework for offloading traffic from cellular networks to SDN-based multi-hop device-to-device networks. IEEE Transactions on Network and Service Management, 15(4), 1516–1531. https://doi.org/10.1109/TNSM.2018.2869611
4. Poularakis, K., Iosifidis, G., & Tassiulas, L. (2018). SDN-enabled tactical ad hoc networks: Extending programmable control to the edge. IEEE Communications Magazine, 56(7), 132–138. https://doi.org/10.1109/MCOM.2018.1701107
5. Li, L., Liu, C., & Song, F. (2020). A smart collaborative routing protocol for QoE enhancement in multi-hop wireless networks. IEEE Access, 8, 100963–100973. https://doi.org/10.1109/ACCESS.2020.2996618
6. Tehrani, M. N., Uysal, M., & Yanikomeroglu, H. (2014). Device-to-device communication in 5G cellular networks: Challenges, solutions, and future directions. IEEE Communications Magazine, 52(5), 86–92. https://doi.org/10.1109/MCOM.2014.6815891
7. Bayhan, S., Coronado, E., Riggio, R., & Zubow, A. (2020). User–AP association management in software-defined WLANs. IEEE Transactions on Network and Service Management, 17(3), 1838–1852. https://doi.org/10.1109/TNSM.2020.2992261
8. Wu, W., Liu, Y., Yao, J., Fang, X., Shan, F., Yang, M., & Luo, J. (2022). Learning-aided client association control for high-density WLANs. Computer Networks, 212. https://doi.org/10.1016/j.comnet.2022.109043

9. Weng, Z., & Xie, Z. (2024). AP selection game in dense IEEE 802.11 WLANs. Wireless Networks, 30(3), 1799–1814. https://doi.org/10.1007/s11276-023-03634-9
10. Dinh, T. H. L., Kaneko, M., Wakao, K., Kawamura, K., Moriyama, T., Abeysekera, H., & Takatori, Y. (2021). Distributed user-to-multiple access points association through deep learning for beyond 5G. Computer Networks, 197. https://doi.org/10.1016/j.comnet.2021.108258
11. Jian, X., Wu, L., Yu, K., Aloqaily, M., & Ben-Othman, J. (2021). Energy-efficient user association with load-balancing for cooperative IIoT network within B5G era. Journal of Network and Computer Applications, 189. https://doi.org/10.1016/j.jnca.2021.103110
12. Zarifneshat, M., Roy, P., & Xiao, L. (2023). Multi-objective approach for user association to improve load balancing and blockage in millimeter wave cellular networks. IEEE Transactions on Mobile Computing, 22(5), 2818–2836. https://doi.org/10.1109/TMC.2021.3122972
13. Liu, Y. Y., & Wang, S. (2015). A scalable parallel genetic algorithm for the generalized assignment problem. Parallel Computing, 46, 98–119. https://doi.org/10.1016/j.parco.2014.12.003
14. Liu, L., Mu, H., Song, Y., Luo, H., Li, X., & Wu, F. (2012). The equilibrium generalized assignment problem and genetic algorithm. Applied Mathematics and Computation, 218(11), 6526–6535. https://doi.org/10.1016/j.amc.2011.12.061
15. Sohrabi, M., Fathollahi-Fard, A. M., Gromov, V. A., & Dulebenets, M. A. (2025). A genetic engineering algorithm for the generalized quadratic assignment problem. Neural Computing and Applications, 37(18), 12253–12279.
16. Thompson, A., & Suomalainen, J. (2025). GAOR: Genetic algorithm-based optimization for machine learning robustness in communication networks. Network, 5(1).
17. European Telecommunications Standards Institute. (2024). LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Physical layer; Measurements (3GPP TS 36.214 version 17.4.0 Release 17) (ETSI TS 136 214 V17.4.0).
18. Holma, H., Toskala, A., & Reunanen, J. (Eds.). (2016). LTE small cell optimization: 3GPP evolution to Release 13. John Wiley & Sons.
19. Afroz, F., Subramanian, R., Heidary, R., Sandrasegaran, K., & Ahmed, S. (2015). SINR, RSRP, RSSI and RSRQ measurements in long term evolution networks. International Journal of Wireless & Mobile Networks, 7(4), 113–123. https://doi.org/10.5121/ijwmn.2015.7409
20. Luan, L., Wu, M., Shen, J., Ye, J., & He, X. (2012). Optimization of handover algorithms in LTE high-speed railway networks. International Journal of Digital Content Technology and Its Applications, 6(5), 79–87.
21. Zhang, X. (2018). LTE optimization engineering handbook (1st ed.). Wiley-IEEE Press.
22. Tolstrup, M. (2015). Indoor radio planning: A practical guide for 2G, 3G and 4G (2nd ed.). John Wiley & Sons.
23. Ide, C., Falkenberg, R., Kaulbars, D., & Wietfeld, C. (2016, May 15–18). Empirical analysis of the impact of LTE downlink channel indicators on the uplink connectivity. In IEEE 83rd Vehicular Technology Conference (VTC Spring). IEEE. https://doi.org/10.1109/VTCSpring.2016.7504180
24. Uludağ, K., & Korçak, Ö. (2017, November 22–24). Energy and rate modeling of data download over LTE with respect to received signal characteristics. In 27th International Telecommunication Networks and Applications Conference (ITNAC) (pp. 1–6). IEEE. https://doi.org/10.1109/ATNAC.2017.8215407
25. Liu, H. H., & Liu, C. (2017). Implementation of Wi-Fi signal sampling on an Android smartphone for indoor positioning systems. Sensors, 18(1), Article 3. https://doi.org/10.3390/s18010003
26. Van Nee, R., Jones, V. K., Awater, G., Van Zelst, A., Gardner, J., & Steele, G. (2006). The 802.11n MIMO-OFDM standard for wireless LAN and beyond. Wireless Personal Communications, 37(3–4), 445–453.
27. Shmoys, D. B., Tardos, É., & Aardal, K. (1993). Approximation algorithms for the generalized assignment problem. Mathematical Programming, 62(1–3), 461–474. https://doi.org/10.1007/BF01585178
28. Glover, F. (1989). Tabu search—Part I. ORSA Journal on Computing, 1(3), 190–206. https://doi.org/10.1287/ijoc.1.3.190
29. Karaboga, D., & Basturk, B. (2007). A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm. Journal of Global Optimization, 39, 459–471. https://doi.org/10.1007/s10898-007-9149-x
30. Duman, E., Uysal, M., & Alkaya, A. F. (2012). Migrating birds optimization: A new metaheuristic approach and its performance on quadratic assignment problem. Information Sciences, 217, 65–77. https://doi.org/10.1016/j.ins.2012.06.003
31. Whitley, D. (1994). A genetic algorithm tutorial. Statistics and Computing, 4(2), 65–85.
32. Razali, N. M., & Geraghty, J. (2011). Genetic algorithm performance with different selection strategies in solving
33. TSP. In Proceedings of the World Congress on Engineering (WCE 2011) (Vol. 2, pp. 1–6).
34. Kirkpatrick, S., Gelatt, C. D., Jr., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671–680.
35. Dowsland, K. A., & Thompson, J. M. (2012). Simulated annealing. In G. Rozenberg, T. Bäck, & J. N. Kok (Eds.), Handbook of natural computing (pp. 1623–1655). Springer. https://doi.org/10.1007/978-3-540-92910-9
36. Pepper, J. W., Golden, B. L., & Wasil, E. A. (2002). Solving the traveling salesman problem with annealing-based heuristics: A computational study. IEEE Transactions on Systems, Man, and Cybernetics—Part A: Systems and Humans, 32(1), 72–77.
37. 3GPP. (2010). Further advancements for E-UTRA physical layer aspects (Release 9) (3GPP TR 36.814 V9.2.0).