KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

Relay Assignment in Cooperative Communication Networks: Distributed Approaches Based on Matching Theory

  • Received : 2015.07.30
  • Accepted : 2016.09.26
  • Published : 2016.11.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this article, we model the distributed relay assignment network as a many-to-one matching market with peer effects. We discuss two scenarios for throughput optimization of relay networks: the scenario of aggregate throughput optimization and the scenario of fairness performance optimization. For the first scenario, we propose a Mutual Benefit-based Deferred Acceptance (MBDA) algorithm to increase the aggregate network throughput. For the second scenario, instead of using the alternative matching scheme, a non-substitution matching algorithm (NSA) is designed to solve the fairness problem. The NSA improves the fairness performance. We prove that both two algorithms converge to a globally stable matching, and discuss the practical implementation. Simulation results show that the performance of MBDA algorithm outperforms existing schemes and is almost the same with the optimal solution in terms of aggregate throughput. Meanwhile, the proposed NSA improves fairness as the scale of the relay network expands.

Keywords

References

  1. A. Nosratinia, T. E. Hunter, and A. Hedayat, "Cooperative Communication in Wireless Networks," IEEE Communications Magazine, vol. 42, pp. 74-80, 2004. https://doi.org/10.1109/MCOM.2004.1341264
  2. P. Li, S. Guo, W. Zhuang and B. Ye, "Capacity Maximization in Cooperative CRNs: Joint Relay Assignment and Channel Allocation," in Proc. of IEEE International Conference on Communications (ICC), pp. 5097-5101, 2012.
  3. Y. Zhao, R. Adve and T. J. Lim, "Improving Amplify-and-Forward Relay Networks: Optimal Power Allocation Versus Selection," IEEE Transactions on Wireless Communications, vol. 6, no. 8, pp. 3114-3123, August 2007.
  4. H. Wu, Y. Wang, C. Xiong and D. Yang, "A Novel Relay Selection Scheme with Simplified Power Allocation for Wireless Relay Networks," in Proc. of IEEE Global Telecommunications Conference, GLOBECOM 2009., pp. 1-5 , 2009.
  5. F. Ke, S. Feng and H. Zhuang, "Relay Selection and Power Allocation for Cooperative Network Based on Energy Pricing," IEEE Communications Letters, vol. 14, pp. 396-398, 2010. https://doi.org/10.1109/LCOMM.2010.05.100168
  6. F. He, Y. Sun, L. Xiao, X. Chen, C. Y. Chi and S. Zhou, "Capacity Region Bounds and Resource Allocation for Two-Way OFDM Relay Channels," IEEE Transactions on Wireless Communications, vol. 12, pp. 2904-2917, 2013. https://doi.org/10.1109/TWC.2013.042213.121205
  7. H. Xu, L. Huang, H. Deng, C. Qiao, and Y. Lin, "Fairness-Aware Shared Relay Assignment for Cooperative Communications," in Proc. of IEEE International Conference on Communications (ICC), pp.5700-5705, June, 2014.
  8. S. Sharma, Y. Shi, Y. Hou and S. Kompella, "An Optimal Algorithm for Relay Node Assignment in Cooperative Ad Hoc Networks," IEEE/ACM Transactions on Networking, vol. 19, no. 3, pp. 879-892, 2011. https://doi.org/10.1109/TNET.2010.2091148
  9. J. Cai, X. Shen, J. W. Mark and A. S. Alfa, "Semi-Distributed User Relaying Algorithm for Amplify-and-Forward Wireless Relay Networks," IEEE Transactions on Wireless Communications, vol. 7, pp. 1348-1357, 2008. https://doi.org/10.1109/TWC.2008.060909
  10. A. Bletsas, A. Khisti, D. P. Reed and A. Lippman, "A Simple Cooperative Diversity Method Based on Network Path Selection," IEEE Journal on Selected Areas in Communications, vol. 24, pp. 659-672, 2006. https://doi.org/10.1109/JSAC.2005.862417
  11. Z. Chen, T. Lin and C. Wu, "Decentralized Learning-Based Relay Assignment for Cooperative Communications," IEEE Transactions on Vehicular Technology, vol. 65, no. 2, pp. 813-826, Feb. 2016. https://doi.org/10.1109/TVT.2015.2399653
  12. D. Gale and L. S. Shapley, "College Admissions and The Stability of Marriage," American Mathematical Monthly, vol. 69, pp. 9-15, Jan 1962. https://doi.org/10.2307/2312726
  13. Y. Gu, W. Saad, M. Bennis, M. Debbah and Z. Han, "Matching Theory for Future Wireless Networks: Fundamentals and Applications," IEEE Communications Magazine, vol. 53, pp. 52-59, 2015.
  14. E. C. V. D. Meulen, "Three-Terminal Communication Channels," Advances in Applied Probability, vol. 3, pp. 120-154, 1971. https://doi.org/10.1017/S0001867800037605
  15. T. Cover and A. E. Gamal, "Capacity Theorems for The Relay Channel," IEEE Transactions on Information Theory, vol. 25, pp. 572-584, 1979. https://doi.org/10.1109/TIT.1979.1056084
  16. H. Xu, L. Huang, G. Wang, T. Xu and G. Liu, "Joint Relay Assignment and Power Allocation for Cooperative Communications," Wireless Networks, vol. 16, pp. 2209-2219, 2010. https://doi.org/10.1007/s11276-010-0254-2
  17. D. Yang, X. Fang and G. Xue, "OPRA: Optimal Relay Assignment for Capacity Maximization in Cooperative Networks," in Proc. of IEEE International Conference on Communications (ICC) 2011, pp. 1-6, 2011.
  18. E. A. Jorswieck, "StableMatchings for Resource Allocation in Wireless Networks," in Proc. of 17th International Conference on Digital Signal Processing (DSP)., pp. 1-8, 2011.
  19. N. Namvar, W. Saad, B. Maham, and S. Valentin, "A Context-Aware Matching Game for User Association in Wireless Small Cell Networks," in Proc. of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 439-443, 2014.
  20. O. Semiari, W. Saad, S. Valentin, M. Bennis, and B. Maham, "Matching Theory for Priority-Based Cell Association in The Downlink of Wireless Small Cell Networks," in Proc. of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 444-448, 2014.
  21. F. Pantisano, M. Bennis, W. Saad, S. Valentin, and M. Debbah, "Matching with Externalities for Context-Aware User-Cell Association in Small Cell Networks," in Proc. of IEEE Global Communications Conference (GLOBECOM) 2013, pp. 4483-4488, 2013.
  22. D. Li, J. Liu, Y. Xu, X. Wang and W. Chen, "Distributed Relay-Source Matching for Cooperative Wireless Networks Using Two-Sided Market Games," in Proc. of Global Telecommunications Conference, GLOBECOM 2009. IEEE, pp. 1-5, 2009.
  23. X. Feng, G. Sun, X. Gan, F. Yang, et al., "Cooperative Spectrum Sharing in Cognitive Radio Networks: A Distributed Matching Approach," IEEE Transactions on Communications, vol. 62, pp. 2651-2664, 2014. https://doi.org/10.1109/TCOMM.2014.2322352
  24. J. N. Laneman, D. N. C. Tse, and G. W. Wornell, "Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior," IEEE Transactions on Information Theory, vol. 50, pp. 3062-3080, 2004. https://doi.org/10.1109/TIT.2004.838089
  25. A. E. Roth and M. A. O. Sotomayor, "Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis," Cambridge University Press, 1992.
  26. Y. Y. A. Leshem and E. Zehavi, "Stable Matching for Channel Access Control in Cognitive Radio Systems," in Proc. of IEEE CIP, 2010.
  27. G. Wang, K. Wu and L. Ni, "CSMA/SF: Carrier Sense Multiple Access with Shortest First," IEEE Transactions on Wireless Communications, vol. 13, no. 3, pp. 1692-1702, March 2014. https://doi.org/10.1109/TWC.2014.020414.131457
  28. K. Wu, H. Li, L. Wang, Y. Yi, Y. Liu, D. Chen, X. Luo, Q. Zhang and L. Ni, "hJam: Attachment Transmission in WLANs," IEEE Transactions on Mobile Computing, vol. 12, no. 12, pp. 2334-2345, Dec 2013. https://doi.org/10.1109/TMC.2012.194
  29. G. T. 36.814, "Further Advancements for E-UTRA: Physical Layer Aspects," Technical Specification Group Radio Access Network, June 2009.
  30. A. Sen, "On Economic Inequality," Clarendon Press, Oxford, 1973.
  31. R. Jain, D. Chiu, and W. Haws, "A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer System," Technical Report, 1984.