Destination-oriented Routing and Maximum Capacity Scheduling Algorithms in Cayley Graph Model for Wireless Mesh Network

Abstract

Routing and scheduling act important roles in improving capacity and throughput in wireless mesh networks. In this paper, Cayley graph model is suggested for wireless Mesh Networks (WMN) with MIMO channels for efficient routing and fair scheduling. The model is based on the multiple interfaces, directional antennas, single channel mesh model. And the link edges or active edges can be viewed as connections between node pairs. A node can have as many links as its interface permits, but links are limited not conflicting with the interference model in wireless network. By placing edges into different channel plane virtually, the Cayley graph model allows a node to use maximum active edges under orthogonal channels. The model is helpful for WMN routing and scheduling schemes with the symmetry coding character in WMN. Consequently, layered active edge group scheduling algorithm and destination oriented routing schemes are proposed for maximum capacity and throughput. Furthermore, efficient transformations are used to take advantage of previous maximum active edge group scheduling for fairness.