Non-confliction on-demand multi-address access method

Abstract

The invention relates to a conflict-free, on-demand multiple access method, comprising: central control node announces collisions of node-sent reserved access packets have occurred and starts up conflict resolution stages, where each conflict resolution stage comprises several forecast burst and forecast confirm micro time gaps set in sequence; in the forecast burst micro time gap, each access conflicting node monitors or sends forecast burst packet according its virtual ID number, and the central control node receives the forecast burst packets; in the following forecast confirm micro time gaps, the central control node sends the results, and each access conflicting node monitors the results; after a node succeeds in access, the central control node sends result broadcast packet. And the invention can assure access conflicting nodes quickly connect to channel and obtain the channel use right and increases service packet transmitting time as far as possible, and increases the throughput of channel.

Description

technical field [0001] The invention relates to a multiple access method, in particular to a conflict-free on-demand multiple access method. Background technique [0002] The multiple access (ie medium access control, MAC) method solves the problem of how multiple nodes or users share channel resources quickly, efficiently, fairly and reliably. According to the way of channel allocation, multiple access methods are generally divided into three ways: fixed allocation, random access and on-demand allocation. [0003] The fixed-allocation multiple access method generally allocates channel resources to some nodes or all nodes that share the channel for a long time. Since there are a large number of mobile nodes in various mobile communication networks, and the business of each node is mostly bursty business, the multiple access method of fixed allocation will cause a lot of channel resources to be idle and waste, which is not suitable for mobile communication networks. Direct ...

AI Technical Summary

Problems solved by technology

However, the former still has packet collisions in the application reservation part, and the influence of hidden terminals is only weakened but not eliminated; the latter can avoid the occurrence of packet collisions, but when many nodes do not send, this method will waste a lot of Polling Control Overhead

[0006] At the same time, there are other problems in the on-demand allocation multiple access method proposed in the prior art. For example, when the network traffic is low, compared with the random access method, the on-demand allocation method has an excessive proportion of control overhead. The problem of large and large transmission delay

As another example, when the network traffic is high, compared with the fixed allocation method, the on-demand allocation method has problems such as insufficient maximum channel throughput and inability to guarantee the fairness of the shared channel.

In addition, among the various multiple access methods mentioned above, there are many multiple access methods that can only be realized under the premise of establishing relatively accurate network synchronization. accurate synchronization of

Images