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

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.

[1]  Keshab K. Parhi,et al.  Distributed scheduling of broadcasts in a radio network , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[2]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[3]  Svatopluk Poljak,et al.  On the arc-chromatic number of a digraph , 1981, J. Comb. Theory, Ser. B.

[4]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

[5]  Imrich Chlamtac,et al.  Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network , 1987, IEEE Transactions on Computers.

[6]  Roger C. Entringer,et al.  Arc Colorings of Digraphs , 1972 .

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .