Asynchronous interactive multi-address access method

Abstract

The related asynchronous interactive multi-address accessing method comprises: a central node sets the basic access unit number and business group-transmission unit number according to the business condition, and sends the subscribe group for startup; all nodes requiring group- transmission compete in time slot, and the central node counts collision condition and sends the subscribe-start group to distribute the successful access result, and prompts the next time slot; repeating till all basic access units end; the central node sends business groups or polling-control group and prompts the follow-up successful node to transmit business group till all successful node end, and goes into next stage. This invention has large channel throughput, small access time delay, low abandoning rate, and well service quality.

Description

technical field [0001] The present invention relates to a multiple access method, especially a method that has or can be used in various mobile wireless communication networks such as mobile ad hoc networks (or mobile AdHoc networks), wireless sensor networks, wireless access networks, and cellular systems. Under the condition of forming a central control node, an asynchronous interactive multiple access method in which multiple users share wireless channel resources. Background technique [0002] The method of multiple access (that is, Medium Access Control, MAC for short) is to solve the problem of how multiple nodes or users share channel resources quickly, efficiently, fairly and reliably. [0003] In the multiple access method of random access in the prior art, each node usually competes to use the channel after a random delay according to the carrier sense situation. That is, before sending a packet, the node listens to the channel first, and sends the packet if the c...

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

In addition, compared with random access multiple access methods, most of the currently proposed on-demand multiple access methods have a large proportion of control overhead, access and transmission time when the network traffic is low. Compared with the fixed allocation multiple access method, there is a problem that the maximum channel throughput is not high enough when the network traffic is high, and the fairness of the shared channel cannot be guaranteed.

[0005] In addition, among the various multiple access methods mentioned above, most of the multiple access methods can only be realized under the premise of establishing relatively accurate network synchronization. accurate synchronization

Images