Telecommunications Science ›› 2018, Vol. 34 ›› Issue (10): 27-35.doi: 10.11959/j.issn.1000-0801.2018249

• research and development • Previous Articles     Next Articles

Graph-based D2D communication resource allocation algorithm in full duplex network

Chunzi SHI1,2,Qi ZHU1,2   

  1. 1 Jiangsu Key Lab of Wireless Communications,Nanjing University of Posts and Telecommunications,Nanjing 210003,China
    2 Key Lab on Wideband Wireless Communications and Sensor Network Technology of Ministry of Education,Nanjing University of Posts and Telecommunications,Nanjing 210003,China
  • Revised:2018-09-09 Online:2018-10-01 Published:2018-11-08
  • Supported by:
    The National Natural Science Foundation of China(61571234);The National Natural Science Foundation of China(61401225);The National Basic Research Program of China (973 Program)(2013CB329005);Jiangsu Provincial Natural Science Foundation of China(BK20140894)

Abstract:

For full duplex cellular communication scenario,a resource allocation algorithm based on graph coloring was proposed in order to maximize the throughput of the system.Firstly,the Hungarian algorithm was used to pair the upstream cellular users with the downstream cellular users.The pair of cellular users simultaneously used a resource block for uplink and downlink communication; then,under the premise of guaranteeing the quality of service of cellular users,channels were assigned for D2D (device-to-device) users based on graph theory coloring theory.Simulation results show that the algorithm can improve the system throughput and obtain higher spectral efficiency.

Key words: D2D communication, full duplex cellular, graph theory, channel allocation

CLC Number: 

No Suggested Reading articles found!