By Topic

Interference-aware channel allocation for Device-to-Device communication underlaying cellular networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yanfang Xu ; Department of Information Science and Electronic Engineering, Zhejiang Provincial Key Laboratory of Information Network Technology, Zhejiang University, Hangzhou 310027, P.R. China ; Rui Yin ; Tao Han ; Guanding Yu

Device-to-Device (D2D) communication underlaying cellular networks will become an important technology in future networks such as IMT-Advanced to improve spectral efficiency. In order to enhance the overall system performance, the mutual interference between cellular and D2D communication caused by reusing the spectrum should be properly coordinated and channel allocation is considered as one of the methods to coordinate the interference. In this paper, the problem of channel allocation in a single cell system with several D2D pairs wanting to communicate directly is modeled. Then, an optimal interference-aware channel allocation scheme based on Hungarian algorithm is proposed. The scheme aims to maximize the number of permitted D2D communication pairs in a system meanwhile avoiding the strong interference from D2D communication to the cellular communication. Besides, we also propose a heuristic algorithm to reduce the computational complexity. Simulation results show that the proposed methods enhance the number of permitted D2D communication pairs significantly and the heuristic algorithm has a performance similar to that of the optimal algorithm which is based on Hungarian algorithm.

Published in:

2012 1st IEEE International Conference on Communications in China (ICCC)

Date of Conference:

15-17 Aug. 2012