Point coordination wireless medium access method based on latest leaving moment and least heap
A wireless medium and access method technology, applied in wireless communication, electrical components, etc., can solve the problems that data frames are difficult to access channels and occupy channel resources for a long time, so as to improve the effective utilization rate and reduce the transmission frequency , Avoid the effect of wasting network resources
Patent Information
- Authority / Receiving Office
- CN · China
- Current Assignee / Owner
- Publication Date
- 2018-04-24
Smart Images

Figure 1 
Figure 2 
Figure 3
Abstract
Description
technical field
[0001] The invention relates to the field of wireless medium access control in a wireless local area network, in particular to a point-coordinated wireless medium access method based on the latest departure time and the minimum stack. Background technique
[0002] The IEEE 802.11 WLAN standard plays a very important role in building a wireless broadband computing environment. Multimedia applications in wireless networks are usually multi-user and require QoS support, such as bandwidth, delay, jitter, and bit error rate guarantees. Since the traditional MAC layer does not support the QoS function and the physical layer often changes state due to noise interference, it is a big challenge to guarantee the QoS requirement of the 802.11 WLAN. Therefore, improving the IEEE802.11MAC layer protocol to meet the QoS requirements has great application significance.
[0003] The basic mode of IEEE 802.11 is DCF (Distributed Coordination Function, distributed coordinati...
Examples
Embodiment
[0030] This embodiment provides a method for coordinating wireless medium access based on the latest departure time and the minimum heap point. The flow chart of the method is as follows figure 1 shown, including the following steps:
[0031] S1. The data packet first enters the queue of the common site, and calculates the local remaining delay and the latest departure time, wherein, when the data packet enters the queue, it is queued according to the latest departure time of the data packet, so that the latest departure time is smaller Data packets, the higher the position in the queue;
[0032]The data packets of each service flow have a maximum end-to-end delay limit. When the end-to-end delay of a data packet exceeds its maximum value, the data packet will be discarded even after being received by the target site. , therefore, the maximum value of the end-to-end delay can also be understood as the maximum survival time of the data packet. The maximum value of the end-to-e...