Lowering outage probability in ad hoc networks by nearest neighbor FDMA scheduling

This paper investigates the performance of a wireless ad hoc network capable of dynamically coordinating a set of orthogonal frequency channels such that every receiver and its nearest interferer operate in different channels. The distribution of the ratio of the interference powers of the second and first interferer is derived to show that the nearest interferer has dominant character, particularly in the absence of fading. Lower and upper bounds on outage probability are derived for the path loss model. For Rayleigh fading, an approximation is presented. Simulation results show that nearest neighbor scheduling is beneficial, thereby avoiding interference effectively. In contrast to other techniques such as successive interference cancellation, the complexity of nearest neighbor scheduling remains comparatively low.