A simple joint routing and scheduling algorithm for a multi-hop wireless network

Abstract

Routing and scheduling in wireless multi-hop networks is challenging, particularly when there are large number of nodes. Simple route construction algorithm becomes attractive as it requires fewer computations. In this paper, a novel routing and scheduling algorithm is proposed, which can be implemented in centralized or distributed way. In this algorithm when the user node (U) tries to reach the base station (BS) through intermediate nodes (IMs), it draws a reference line to the BS, chooses the intermediate node at minimum angle with the reference line, from its neighboring nodes within one transmission range. The other links of the route to the BS through the IMs are also found in the same way. We call it minimum angle (MA) routing and distributed scheduling (DS), MA-DS. The minimum angle (MA) routing and centralized scheduling (CS) is initiated by the BS using the same principle to reach the user node (U), we call it MA-CS. The algorithm requires only the position (x-y co-ordinate) information and the burst profile of the nodes.