Node Pair Selection Scheme in Relay-Aided Communication Based On Stable Marriage Problem
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32799
Node Pair Selection Scheme in Relay-Aided Communication Based On Stable Marriage Problem

Authors: Tetsuki Taniguchi, Yoshio Karasawa

Abstract:

This paper describes a node pair selection scheme in relay-aided multiple source multiple destination communication system based on stable marriage problem. A general case is assumed in which all of source, relay and destination nodes are equipped with multiantenna and carry out multistream transmission. Based on several metrics introduced from inter-node channel condition, the preference order is determined about all source-relay and relay-destination relations, and then the node pairs are determined using Gale-Shapley algorithm. The computer simulations show that the effectiveness of node pair selection is larger in multihop communication. Some additional aspects which are different from relay-less case are also investigated.

Keywords: Relay, multiple input multiple output (MIMO), multiuser, amplify and forward, stable marriage problem, Gale-Shapley algorithm.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1093281

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1886

References:


[1] M. Maddah-Ali, A. Motahari and A. Khandani, "Communication over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis,” IEEE Trans. Inf. Theory, vol.54, no.8, pp.3457-3470, Aug. 2008.
[2] T. Q. S. Quek, G. de la Roche, I. Gueven, and M. Kountouris ed., Small Cell Networks: Deployment, PHY Techniques, and Resource Management, Cambridge University Press, Cambridge, UK, 2013.
[3] F. Monsees, C. Bockelmann, D. Wubben, and A. Dekorsy, "A sparsity aware multiuser detection for machine to machine communication,” 2012 IEEE Global Commun. Conf. Workshops (Globecom Workshops), Anaheim, CA, Dec. 2012.
[4] M. Barbeau and E. Kranakis, Principles of Ad-hoc Networking, Wiley, Sussex, UK, 2007.
[5] G. Gupta, and A. Chaturvedi, "User selection in MIMO interfering broadcast channels,” IEEE Trans. Commun, 2014 (in print).
[6] A. Sibille, C. Oestges, and A. Zanella, MIMO : from theory to implementation, Elsevier, Burlington, MA, 2011.
[7] T. Taniguchi, Y. Karasawa, and N. Nakajima, "Node pair selection in MU-MIMO using mathching theory - analysis and interpretation based on stable marriage problem -,” 2013 Int. Conf. Wireless Mobile Commun. (WMCS’13), October 2013.
[8] A. E. Roth and M. A. O. Sotomayor, Two-sided matching: A study in game-theoretic modeling and analysis, Cambridge University Press, Cambridge, UK, 1990.
[9] Q. H. Spencer and C. B. Peel and A. L. Swindlehurst and M. Haardt, An introduction to the multi-user MIMO downlink, IEEE Commun. Mag., vol.42, no.10, Oct. 2004, pp.60-67.
[10] P. Bir´o and E. McDermid, "Three-sided stable matchings with cyclic preferences,” Algorithmica, vol.58, no.1, pp.5-18, 2010.