A Simple Distributed Channel Allocation Algorithm for D2D Communication Pairs

Device-to-device (D2D) communication is a promising technology to achieve high spectrum efficiency, low energy consumption, and enhanced system capacity. In D2D communications, the channel allocation plays a crucial role to avoid interference, which usually involves a centralized coordination. With the increasing number of devices or terminals as well as the dynamic network environment, the computation and information exchange during the centralized channel allocation would be a big burden for wireless networks. We tackle this problem by proposing a distributed channel allocation method with blind rendezvous to enable collision-free concurrent transmissions over multiple channels. Specifically, we first present a receiver-oriented channel allocation algorithm to reduce interference and then propose a sender-jump blind channel rendezvous algorithm based on channel hopping techniques. The proposed channel allocation method allows each sender-receiver pair to obtain an appropriate channel for collision-free transmissions requires no centralized coordination. Theoretical analysis, simulation results and test-bed experiments validate the proposed solution. Our findings reported in this paper may help network designers to contribute in the development of high-density Internet of Things.