New scheduling problems in a multi-hop network and their complexity results

Abstract

The link scheduling problem and broadcast scheduling problem have been discussed as graph theory. These scheduling problems are channels/time-slots assignment problems in a multi-hop network. It is known that the scheduling problems are NP-hard. We propose new extended scheduling problems. These scheduling problems can be applied to CDMA system. We show that the extended scheduling problems are NP-hard.