Service scheduling method of wireless Ad hoc network

Abstract

The invention relates to a scheduling method, and particularly is a service scheduling method of a wireless Ad hoc network, belonging to the technical field of wireless communication networks. According to the method, a specified main node collects network topology information, and selects / updates a scheduling center node; the scheduling center node collects current information of request nodes to complete intermediate speed scheduling for air interface resource of each request node; a local scheduler of each request node performs fast local service scheduling based on the obtained air interface resource, hereby, guarantee capability of QoS (Quality of Service) is promoted based on reduction of scheduling delay of the wireless Ad hoc network, and finally, quality of service of the whole network is promoted.

Description

technical field [0001] The invention relates to a scheduling method, in particular to a wireless self-organizing network service scheduling method, which belongs to the technical field of wireless communication networks. Background technique [0002] Wireless ad hoc networks have two obvious features: high channel error rate and scarce bandwidth resources. To ensure the QoS (QualityOfService) index of wireless ad hoc networks, service scheduling is a very important issue. Aiming at these two problems, it is necessary to design a scheduling algorithm that can guarantee both system throughput and fairness. [0003] At present, there are mainly three types of scheduling algorithms in the point-to-multipoint field: round-robin RR (RoundRobin), maximum carrier-to-interference ratio scheduling algorithm MaxC / I (Maximum Carrier to Interference), and proportional fairness algorithm PF (Proportional Fairness). [0004] RR ensures that all users in the system have the same opportunit...

AI Technical Summary

Problems solved by technology

[0004] RR guarantees that all users in the system have the same opportunity to obtain system resources. This algorithm does not consider the channel conditions of users. The reliability of data transmission by users is not high, and the obtained system throughput is not high.

The maximum carrier-to-interference ratio scheduling algorithm MaxC / I always selects the user with the best wireless channel conditions for scheduling in each scheduling time slot, which can well adapt to the time-varying nature of the wireless channel, but cannot guarantee the fairness among users

The proportional fairness algorithm PF obtains a compromise between system throughput and fairness. It makes full use of the time-frequency characteristics of the channel to schedule users with better channel conditions as much as possible, and schedules every user as much as possible. This method does not consider the user Waiting time, system delay cannot be guaranteed

[0005] In the field of wireless ad-hoc networks, because the status of each node is equal, it is a natural idea to adopt distributed scheduling, and it is a natural idea for each node to compete for resources, but distributed scheduling is difficult to guarantee the QoS of each node's business. The surrounding neighbor nodes negotiate, so the scheduling delay is relatively long

However, centralized scheduling has the problems of high node information transmission overhead and long round-trip transmission delay, so it is rarely used in practical applications.

Images