An Efficient Algorithm to Find Broadcast Schedule in Ad Hoc TDMA Networks

Table 1

Maximal compatibles and incompatibles of $M_1.$

Maximal compatibles (${\mathrm{\Omega }}_m$)				Maximal incompatibles (${\mathrm{\Omega }}_i$)
(12,13,2)	(13,7,2)	(12,4)	(15,2)	(13,10,9,8,5,4)	(12,11,10,6,5,3)
(12,9,1)	(10,7)	(11,4)	(12,13,1)	(14,15,12,11,10,6,5)	(10,9,6,5,4,3,2)
(15,8,3)	(9,7)	(14,8,3)	(15,8,1)	(14,15,13,11,10,9,6,5)	(12,11,7,6,5,3)
(14,8,7)	(8,6)	(13,3)	(10,1)	(15,12,11,7,6,5)	(10,9,8,5,4,2)
(12,8,1)	(14,7,4)	(11,2)	(14,8,1)	(13,10,9,6,5,4)	(6,5,4,3,2,1)
(11,8,1)	(15,4)	(14,7,2)	(11,10,9,6,5,3)	(7,6,5,3,1)