To Lie or Not to Lie in Non-Cooperative User-Centric Networks: Is Lying Worth It?
Pages 3443 - 3459
Abstract
This paper presents a load-aware network selection model intended to help users to determine whether or not to connect to a macro cell (MC) or a WiFi access point (AP) in non-cooperative user-centric networks. The problem is formulated as a game theoretic model in which users selfishly maximize their throughput. Unlike in most existing work, we do not assume that users have complete information about the other users’ dynamics, which makes it more realistic in a communication network with distributed users. Then, because the network selection decision depends crucially on truthful reporting of channel states by the users, we explore the idea of non-cooperative users sending signals that are likely to induce the scheduler to behave in a manner beneficial to them. We provide five procedures which consist of introducing hierarchy among the users reflecting their channel quality and dividing them into groups interfering with each other, but not within themselves. Having done this, we allow them to sequentially choose their preferred network. We also propose a solution to compel users to reveal the truthful signals to the macro eNodeB (MeNb) by designing an additional immunity parameter mainly meant to keep lying users from harming truthful users. Particularly noteworthy is the fact that the additional immunity parameter does not only decrease the gain of liars, but it further improves the overall system performance. We provide extensive system level simulation results comparing our procedures between themselves and with traditional schemes. It is shown that the proposed solutions outperform classical approaches in almost every respect.
References
[1]
M. Haddad, P. Wiecek, and O. Habachi, “A game theoretic load-aware network selection,” in Proc. IEEE Conf. Comput. Commun. (INFOCOM) Workshops, Apr. 2018, pp. 577–582.
[2]
“Global 5G: Rise of a transformational technology,” 5G Americas, Bellevue, WA, USA, White paper, Sep. 2020. [Online]. Available: https://www.5gamericas.org
[3]
“WLAN/cellular intelligent network selection,” AT&T, Dallas, TX, USA, Cisco, San Jose, CA, USA, document 3GPP TSG-RAN WG2 #81bis, Apr. 2013.
[4]
S. Singh and J. G. Andrews, “Joint resource partitioning and offloading in heterogeneous cellular networks,” IEEE Trans. Wireless Commun., vol. 13, no. 2, pp. 888–901, Feb. 2014.
[5]
C. Liu, M. Li, S. V. Hanly, and P. Whiting, “Joint downlink user association and interference management in two-tier HetNets with dynamic resource partitioning,” IEEE Trans. Veh. Technol., vol. 66, no. 2, pp. 1365–1378, Feb. 2017.
[6]
H. Ding, H. Zhang, J. Tian, S. Xu, and D. Yuan, “Energy efficient user association and power control for dense heterogeneous networks,” in Proc. Int. Conf. Comput. Netw. Commun. (ICNC), 2018, pp. 741–746.
[7]
A. Keshavarz-Haddad, E. Aryafar, M. Wang, and M. Chiang, “HetNets selection by clients: Convergence, efficiency, and practicality,” IEEE/ACM Trans. Netw., vol. 25, no. 1, pp. 406–419, Feb. 2017.
[8]
H. AlNashwan and A. Agarwal, “User-centric network selection in wireless heterogeneous networks,” in Proc. IEEE 30th Can. Conf. Electr. Comput. Eng. (CCECE), 2017, pp. 1–6.
[9]
L. Wang and G.-S. Kuo, “Mathematical modeling for network selection in heterogeneous wireless networks: A tutorial,” IEEE Commun. Surveys Tuts., vol. 15, no. 1, pp. 271–292, 1st Quart., 2013.
[10]
M. Haddad, S. E. Elayoubi, E. Altman, and Z. Altman, “A hybrid approach for radio resource management in heterogeneous cognitive networks,” IEEE J. Sel. Areas Commun., vol. 2, no. 6, pp. 733–741, Apr. 2011.
[11]
M. Anany, M. M. Elmesalawy, and A. M. Abd El-Haleem, “Matching game-based cell association in multi-RAT HetNet considering device requirements,” IEEE Internet Things J., vol. 6, no. 6, pp. 9774–9782, Dec. 2019.
[12]
G. Zhang, H. Zhang, Z. Han, and G. K. Karagiannidis, “Spectrum allocation and power control in full-duplex ultra-dense heterogeneous networks,” IEEE Trans. Commun., vol. 67, no. 6, pp. 4365–4380, Jun. 2019.
[13]
G. Caso, O. Alay, G. C. Ferrante, L. D. Nardis, M.-G. D. Benedetto, and A. Brunstrom, “User-centric radio access technology selection: A survey of game theory models and multi-agent learning algorithms,” IEEE Access, vol. 9, pp. 84417–84464, 2021.
[14]
S. Anbalagan, D. Kumar, G. Raja, and A. Balaji, “SDN assisted Stackelberg game model for LTE-WiFi offloading in 5G networks,” Digit. Commun. Netw., vol. 5, no. 4, pp. 268–275, 2019.
[15]
A. Zhu, M. Ma, S. Guo, and Y. Yang, “Adaptive access selection algorithm for multi-service in 5G heterogeneous Internet of Things,” IEEE Trans. Netw. Sci. Eng., vol. 9, no. 3, pp. 1630–1644, May/Jun. 2022.
[16]
C.-C. Yang, J.-Y. Chen, Y.-T. Mai, and Y.-C. Wang, “Delay-sensitive network selection and offloading in LTE-A and Wi-Fi heterogeneous networks,” J. Circuits Syst. Comput., vol. 30, no. 7, 2021, Art. no.
[17]
X. Wang and R. A. Berry, “Market competition between LTE-U and WiFi,” IEEE Trans. Netw. Sci. Eng., vol. 8, no. 1, pp. 765–779, Jan.–Mar. 2021.
[18]
M. Gribaudo, D. Manini, and C. F. Chiasserini, “Modelling user radio access in dense heterogeneous networks,” Perform. Eval., vol. 146, Mar. 2021, Art. no.
[19]
V. Kavitha, E. Altman, R. El-Azouzi, and R. Sundaresan, “Fair scheduling in cellular systems in the presence of noncooperative mobiles,” IEEE/ACM Trans. Netw., vol. 22, no. 2, pp. 580–594, Apr. 2014.
[20]
M. Heusse, F. Rousseau, G. Berger-Sabbatel, and A. Duda, “Performance anomaly of 802.11b,” in Proc. 22nd IEEE Comput. Commun. Societies (INFOCOM), vol. 2, 2003, pp. 836–843.
[21]
A. Kumar, E. Altman, D. Miorandi, and M. Goyal, “New insights from a fixed-point analysis of single cell IEEE 802.11 WLANs,” IEEE/ACM Trans. Netw., vol. 15, no. 3, pp. 588–601, Jun. 2007.
[22]
T. M. Cover and J. A. Thomas, Elements of Information Theory. Hoboken, NJ, USA: Wiley, 1991.
[23]
J. Ling, S. Kanugovi, S. Vasudevan, and A. K. Pramod, “Enhanced capacity and coverage by Wi-Fi LTE integration,” IEEE Commun. Mag., vol. 53, no. 3, pp. 165–171, Mar. 2015.
[24]
J. F. Nash, “Equilibrium points in n-person games,” Proc. Nat. Acad. Sci., vol. 36, no. 1, pp. 48–49, 1950.
[25]
N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani, Algorithmic Game Theory. Cambridge, MA, USA: Cambridge Univ. Press, 2007.
[26]
S. Chien and A. Sinclair, “Convergence to approximate Nash equilibria in congestion games,” in Proc. 18th Annu. ACM-SIAM Symp. Discr. Algorithms, 2007, pp. 1–19.
[27]
C. Mehlführer, J. C. Ikuno, M. Šimko, S. Schwarz, M. Wrulich, and M. Rupp, “The Vienna LTE simulators—Enabling reproducibility in wireless communications research,” EURASIP J. Adv. Signal Process., vol. 2011, no. 1, p. 29, 2011. [Online]. Available: https://asp-eurasipjournals.springeropen.com/articles/10.1186/1687-6180-2011-29
Index Terms
- To Lie or Not to Lie in Non-Cooperative User-Centric Networks: Is Lying Worth It?
Index terms have been assigned to the content through auto-classification.
Recommendations
Cooperative or vindictive: bidding strategies in sponsored search auction
WINE'07: Proceedings of the 3rd international conference on Internet and network economicsWe analyze the economic stability and dynamic manipulation of vindictive strategies in conjunction with forward-looking cooperative bidders in Sponsored Search Auction. We investigate different vindictive strategies of different rationalities : ...
Lie symmetries for Lie systems
A Lie system is a nonautonomous system of first-order differential equations admitting a superposition rule, i.e., a map expressing its general solution in terms of a generic family of particular solutions and some constants. Using that a Lie system can ...
Non-cooperative routing in loss networks
The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding to the case of a finite number of agents (such as service providers) that ...
Comments
Information & Contributors
Information
Published In
1932-4537 © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 07 February 2023
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 02 Sep 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in