Service scheduling method suitable for wireless TDMA ad hoc network

Abstract

The invention discloses a service scheduling method in a wireless TDMA ad hoc network, and the method comprises the following steps: maintaining a plurality of service queues in each node MAC layer inthe ad hoc network, and carrying out the arrangement and distribution according to the message priority from high to low; in the node operation process, classifying data or control information received or generated by the MAC layer according to service types, and adding the classified data or control information into a corresponding service queue according to priorities; when the node belongs tothe sending time slot of the node, selecting data from the service queue according to a preset scheduling rule to schedule and send the data; and recalculating the priorities of the messages in the remaining initial transmission data service queues to be sent, sorting the messages, and deleting the services which still fail when the maximum retransmission times are reached. According to the methoddisclosed by the invention, the service types are classified and sorted according to the importance real-time priority, and then influence factors in multiple aspects are comprehensively considered in data service scheduling, so that the MAC layer data transmission has relatively low time delay and relatively good throughput guarantee.

Description

technical field [0001] The invention belongs to the field of service control and scheduling in wireless communication, and in particular relates to a service scheduling method suitable for a wireless TDMA ad hoc network. Background technique [0002] Wireless ad hoc network (Ad Hoc network) is a distributed network composed of multiple wireless communication devices (referred to as "nodes"). It has the characteristics of no center, dynamic topology changes, self-organization, and multi-hop routing. The network is flexible and convenient, and has strong invulnerability. Each node in the network can communicate with other nodes. In addition to data services such as video and voice, the content of inter-node communication also includes some necessary control signaling services for interaction. Limited by the limitation of wireless broadband resources, the length of data transmitted by a node at each transmission moment belonging to itself is also limited. Therefore, in the des...

AI Technical Summary

Problems solved by technology

If there are multiple service messages in the node that need to be sent to different nodes and different service types, then the Max C / I algorithm can schedule the service with the best current channel quality at each sending time, and this algorithm can maximize the system throughput , the services with good channel quality can be sent out in time, but the fairness of each service cannot be guaranteed, and the services with poor channel quality may never be scheduled and appear "starved to death" phenomenon; the RR scheduling algorithm can ensure that these services follow the A definite order cyclically occupies wireless resources for transmission. In a specified cycle, the number of scheduling of each service is the same, which fully guarantees fairness, but does not take into account the specific conditions of the wireless channel, and cannot maximize the throughput of the system. ; The PF scheduling algorithm often considers the scheduling fairness and priority information of the business at the same time, which is a compromise between the Max C / I and the RR scheduling algorithm. Combining the factors considered by the above two, it can be calculated by a certain calculation method. Priority factors, and then schedule from high to low, but still do not consider the QoS (Quality of Service, service quality) information of the business, and cannot guarantee the user's business experience

Images