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

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.