Vertex multi-coloring scheduling algorithm for concurrent transmission in 60-GHz networks

Communication in 60-GHz frequency exhibits unique characteristics that are unavailable in traditional lower frequencies. Tremendous propagation loss together with oxygen absorption characteristics helps localize interference and encourages concurrent transmission. It is observed that in short-range, high-speed communication network, (Tx, Rx) pair tends to come close to each others. The network can be seen as naturally formed group of devices, which shared mutual interests. In Such networks, it is argued that throughput mainly depends on scheduling algorithms rather than transmission power control. In this paper, we proposed a concurrent scheduling algorithm based on vertex coloring technique. The proposed algorithm employs time and space division in scheduling in 60-GHz networks. Using vertex multi-coloring, we allow (Tx - Rx) communication pairs to span over more colors, enabling better time slot utilization. Since we use directional antennas, we extend distance based space division between two flows by considering angel between them. Since, data rate in 60-GHz mainly depends on transmission links, distance based relay selection algorithm is also proposed. We evaluate our scheduling algorithm in single-hop and multi-hop scenarios and discover that it outperforms traditional TDMA and greedy algorithm by significantly improving network throughput.