A simple distributed channel allocation algorithm for D2D communication pairs

Date
2018-08-31
Authors
Zhao, H
Ding, K
Sarkar, NI
Wei, J
Xiong, J
Supervisor
Item type
Journal Article
Degree name
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Abstract

Device-to-device (D2D) communication is a promising technology due to its advantages of 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 (such as a BS). 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 BS 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.

Description
Keywords
Channel allocation; Device-to-device communication; Receivers; Interference; Switches; Resource management; Information exchange; Multi-channel network; Device-to-Device (D2D) communication; Channel allocation; Distributed algorithm
Source
IEEE Transactions on Vehicular Technology. doi: 10.1109/TVT.2018.2865817
Rights statement
Copyright © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.