A (m, k)-firm scheduling algorithm combined with wireless channel state consideration was proposed. The algorithm classified the messages into mandatory ones and optional ones, and scheduled the mandatory messages in higher priority. The message type was jointly decided by static offline assignment and dynamical online adjustment. The static assignment used (m, k)-pattern to assign the message types, and the dynamic adjustment adjusted message types by trying to reduce the number of mandatory messages in the bad channel state without breaking the (m, k)-firm constraints. The theoretical analysis prove that ��the dynamic adjustment will not break the (m, k)-firm constraints if assuming all the mandatory messages can be transmitted successfully before deadline, and ��the dynamic adjustment will not change the mandatory messages- schedulability when using evenly distributed (m, k)-Pattern. The simulation results show that compared with the algorithm that assigns message types in static way this algorithm can improve the schedulability and save the wireless networks- bandwidth and energy.