A topology-independent transmission scheduling in multihop packet radio networks

In this paper, based on coding theory concepts, a new time scheduling algorithm for multihop packet radio networks is described. Each mobile host is assigned a word from an appropriate constant weight code of length n, distance d and weight w. The host can send a message at the j^th slot provided the assigned code has a 1 in this j ^th bit. The proposed algorithm is better than the previously known algorithms in terms of minimum system throughput. The algorithm also preserves other desired properties, such as topology independence, guaranteed minimum throughput, bounded maximum delay, and fair transmission policy