Topology-transparent scheduling for MANETs using orthogonal arrays

Abstract

In this paper, we generalize the known topology-transparent medium access control protocols for mobile ad hoc networks by observing that their transmission schedule corresponds to an orthogonal array. Some new results on throughput are obtained as a consequence. We also show how to compute the probability of successful transmission if the actual node degree in the network exceeds the design parameter related to maximum node degree, showing the sensitivity of the schedule to this parameter. The selection of orthogonal array to provide the best throughput is also examined, and combinatorial generalizations are explored. Finally we outline schemes that combine the delay guarantees of current approaches to handle exceeding the stipulated maximum node degree.