[an error occurred while processing this directive]
   
 
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2011, Vol. 37 Issue (8) :962-967,996    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
����������Ӳʵʱ�����㷨
������, ������, �ܻ���*
�������պ����ѧ ������Ϣ����ѧԺ, ���� 100191
Weakly-hard real-time scheduling algorithm for wireless networks
Jiang Yule, Wang Hailiang, Xiong Huagang*
School of Electronics and Information Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100191, China

ժҪ
�����
�������
Download: PDF (1KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ �����һ�ֽ���ŵ�״�����ǵ�(m, k)-firm��Ӳʵʱ�����㷨.���㷨����Ϣ����Ϊǿ��(mandatory)�Ϳ�ѡ(optional)2������,�����ȵ���ǿ����Ϣ.��Ϣ�����������¾�̬��������϶�̬������ͬ����.����,��̬����ʹ��(m, k)-pattern������Ϣ����,��̬�������ڲ�Υ��(m, k)-firmԼ����ǰ���¾�������ǿ����Ϣ�ڲ��ŵ�״���´���.���۷���֤��:���ڼ�������ǿ����Ϣ��ʵʱ�ɹ������ǰ����,����̬��������Ϣ����Ȼ����(m, k)-firm;����ʹ��ƽ���ֲ�(m, k)-patternʱ,��̬����֮�󲻸ı���Ϣ����ǿ����Ϣ��N���ش��ɵ�����.����������,���㷨���ʹ�þ�̬������Ϣ���͵��㷨�Ƚ�,�ܹ�������Ӳʵʱ�Ŀɵ�������,��ʡ���������д�����ܺĵĿ���.
Service
�ѱ����Ƽ�������
�����ҵ����
�������ù�����
Email Alert
RSS
�����������
�ؼ����� ʵʱϵͳ   ��������   �����㷨   �ŵ�״̬��Ϣ     
Abstract�� 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.
Keywords�� real time systems   wireless networks   scheduling algorithms   channel state information     
Received 2010-03-31;
Fund:

������Ȼ��ѧ����������Ŀ(60879024)

About author: ������(1982-),��,����������,��ʿ��,agu0740@ee.buaa.edu.cn.
���ñ���:   
������, ������, �ܻ���.����������Ӳʵʱ�����㷨[J]  �������պ����ѧѧ��, 2011,V37(8): 962-967,996
Jiang Yule, Wang Hailiang, Xiong Huagang.Weakly-hard real-time scheduling algorithm for wireless networks[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2011,V37(8): 962-967,996
���ӱ���:  
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2011/V37/I8/962
Copyright 2010 by �������պ����ѧѧ��