Matching theory for future wireless networks: fundamentals and applications

The emergence of novel wireless networking paradigms such as small cell and cognitive radio networks has forever transformed the way in which wireless systems are operated. In particular, the need for self-organizing solutions to manage the scarce spectral resources has become a prevalent theme in many emerging wireless systems. In this article, the first comprehensive tutorial on the use of matching theory, a Nobel Prize winning framework, for resource management in wireless networks is developed. To cater for the unique features of emerging wireless networks, a novel, wireless-oriented classification of matching theory is proposed. Then the key solution concepts and algorithmic implementations of this framework are exposed. The developed concepts are applied in three important wireless networking areas in order to demonstrate the usefulness of this analytical tool. Results show how matching theory can effectively improve the performance of resource allocation in all three applications discussed.

[1]  Miao Pan,et al.  Cheating in matching of device to device pairs in cellular networks , 2014, 2014 IEEE Global Communications Conference.

[2]  Alvin E. Roth,et al.  Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

[3]  Walid Saad,et al.  A college admissions game for uplink user association in wireless small cell networks , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[4]  Walid Saad,et al.  Many-to-many matching games for proactive social-caching in wireless small cell networks , 2014, 2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[5]  Eduard A. Jorswieck,et al.  Distributed medium access control for energy efficient transmission in cognitive radios , 2014, ArXiv.

[6]  Eduard A. Jorswieck,et al.  Stable matchings for resource allocation in wireless networks , 2011, 2011 17th International Conference on Digital Signal Processing (DSP).

[7]  David Manlove,et al.  Algorithmics of Matching Under Preferences , 2013, Bull. EATCS.

[8]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[9]  Robert W. Irving,et al.  An efficient algorithm for the “optimal” stable marriage , 1987, JACM.

[10]  W IrvingRobert,et al.  An efficient algorithm for the optimal stable marriage , 1987 .

[11]  Zhu Han,et al.  Game Theory in Wireless and Communication Networks: Theory, Models, and Applications , 2011 .

[12]  Baochun Li,et al.  Seen as stable marriages , 2011, 2011 Proceedings IEEE INFOCOM.

[13]  Dusit Niyato,et al.  Game Theory in Wireless and Communication Networks: Fundamentals of game theory , 2011 .

[14]  Zhu Han,et al.  Multiple operator and multiple femtocell networks: Distributed stable matching , 2012, 2012 IEEE International Conference on Communications (ICC).

[15]  Amir Leshem,et al.  Multichannel Opportunistic Carrier Sensing for Stable Channel Access Control in Cognitive Radio Systems , 2012, IEEE Journal on Selected Areas in Communications.

[16]  Walid Saad,et al.  Matching with externalities for context-aware user-cell association in small cell networks , 2013, 2013 IEEE Globecom Workshops (GC Wkshps).

[17]  Walid Saad,et al.  Game Theory in Wireless and Communication Networks: Applications of game theory in communications and networking , 2011 .