Interference Graph Construction And Collision-free Distributed Resource Allocation For Cellular D2D Communications

The last decades have seen a great development in mobile communications,and the development facil?itates the people's life greatly.At the same time,people put forward higher requirements for the speed and the capacity of communication.Nowadays,the traditional communication modes are difficult to improve the spectrum efficiency and system performance greatly,so the concept of Device-to-Device(D2D)communica-tion is proposed.D2D communication is tried to apply into the cellular communication and other scenarios.The basic idea of D2D communication is that devices could communicate with other devices without using base station.D2D communication can reduce the load of base station and conserve spectrum resources.In order to enable D2D communication in cellular communication networks,we propose a wireless resource allocation in this paper.Firstly this paper proposes an interference graph construction algorithm for D2D communication,which is an iterative process and contains both announcement stage and collision-resolution stage.If the receiver of one D2D link could receive the message of another D2D link,the interference relationship between D2D links can be established.In order to avoid the interference,the announcement stage and collision-resolution stage need to be iterated until a complete cell interference graph is constructed.At the same time,in order to improve the efficiency of the algorithm,a back-off mechanism is proposed in the collision-resolution stage,which further reduces the interference of the terminal when receiving the broadcast message.The algorithm can completely construct the D2D communication interference graph in the cellular network.This paper has given a detailed theoretical analysis and simulation for the proposed interference graph construction algorithm.In order to verify the feasibility of proposed conflict graph constructing algorithm,this paper compares the performance of the algorithm with the raw algorithm.It is concluded that the conflict graph constructing algorithm has a lower latency and complexity,and the algorithm meets the requirements of the design.It is a new algorithm with feasibility.Theoretical analysis is also shown in this paper.It can be indicated that the simulation results match well with the theoretical results.This paper also introduces a wireless resource allocation algorithm in cellular D2D communication,which is a distributed manner.By constructing the interference graph,D2D links could find their neighbors and then allocate wireless resource.In the realization of the algorithm,D2D links in the cellular are based on certain rules and strategies.Each link competes for spectrum resources spontaneously to transfer data by obtaining information of their own neighbors,rather than scheduling resources by using the central equipment.Firstly,each link in the cellular obtains its own two-hop neighbor information and tries to obtain conflicting sets,which includes its competing relationships from the two-hop neighbor.Secondly,each link runs a random selection function,which can recognize whether the vehicle acquires a spectrum resource successfully or not.If the link fails,it will continue to compete for the next resource until the operation is successful.This paper also simulates the algorithm and gives the theoretical analysis with some details.The theoretical analysis proves the correctness and feasibility of the distributed resource allocation algorithm,and its performance difference is within the acceptable range.