Fast precontract and line transmission multi-address access method

An access method and fast technology, applied in radio transmission systems, digital transmission systems, electrical components, etc., can solve the problems of insufficient maximum channel throughput, large proportion of control overhead, weakened hidden terminals, etc., to reduce hidden Termination and exposed termination issues, improving channel throughput, eliminating adverse effects

Inactive Publication Date: 2009-06-24
BEIHANG UNIV
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the method based on random competition still has the problem of packet collision in the application reservation part, and the influence of hidden terminals is only weakened, not eliminated
Although the collision-free method can avoid packet collisions, when many nodes do not send, this method will waste a lot of polling control overhead
[0006] In addition, there are still 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 a large proportion of control overhead. , the problem of 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.
[0007] In addition, the above-mentioned various multiple access methods, especially the multiple access methods based on demand allocation, do not fully consider the impact of signal propagation delay on multiple access performance
In practical applications, aviation communication networks, satellite communication networks, and deep space communication networks all have long signal propagation delays. When performing various control packet handshakes and status information exchanges, excessively long signal propagation delays will greatly degrade multiple access performance

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Fast precontract and line transmission multi-address access method
  • Fast precontract and line transmission multi-address access method
  • Fast precontract and line transmission multi-address access method

Examples

Experimental program
Comparison scheme
Effect test

no. 1 example

[0047] figure 2 It is a flowchart of the first embodiment of the present invention, specifically:

[0048] Step 11, CCN sets the number N of contention time slots according to the number of nodes that have successfully accessed and idle channel resources at present AR ;

[0049] Step 12, CCN on the first channel CH 1 Publish the Reservation Start (SR) on , that is, send the SR packet, followed by N AR contention slots;

[0050] Step 13, each node that has packets to send transmits on the first channel CH 1 After receiving the SR packet, it randomly selects an Access Reservation (AR) packet in each contention time slot for contention reservation, and then transfers to the second channel CH 2 Listen to the results;

[0051] Step 14: Whether the CCN has successfully received the AR packet, if yes, execute step 15; 2 The collision result is announced on the Internet, that is, in which access time slot a collision occurs, and each unsuccessful access node waits until the ne...

no. 2 example

[0076] Figure 4 It is a flowchart of the second embodiment of the present invention, specifically:

[0077] Step 21, CCN sets the number N of contention time slots according to the number of nodes that have successfully accessed and idle channel resources at present AR ;

[0078] Step 22, CCN on the second channel CH 2 Announce the start of the reservation, that is, send the SR packet, followed by the first channel CH 1 on N AR contention slots;

[0079] Step 23, each node that has packets to send transmits on the second channel CH 2 After receiving the SR packet, it immediately transfers to the first channel CH 1 In each contention time slot, randomly select one sending AR packet for contention reservation, and then switch to the second channel CH 2 Listen to the results;

[0080] Step 24: Whether the CCN has successfully received the AR packet, if yes, execute step 15; 2 The collision result is announced on the Internet, that is, in which access time slot a collisi...

no. 3 example

[0099] On the basis of the technical solution of the first embodiment, it is possible to implement a synchronization reference-based rapid reservation multiple access method by sending a transmission start (ST) packet through the CCN.

[0100] Image 6 It is the channel transmission sequence diagram of the third embodiment of the present invention. The various packet transmissions of the CCN in the technical solution of this embodiment provide time synchronization references for each node, specifically:

[0101] CCN on the first channel CH 1 Send SR packet on;

[0102] elapsed propagation delay t p After that, each node receives and immediately selects an AR time slot from several AR time slots to send an AR packet, and then immediately transfers to the second channel CH 2 Listen to the results;

[0103] After the propagation delay tp, the CCN on the first channel CH 1 Each AR packet is received in sequence, and then in turn on the second channel CH 2 Send AD group on th...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The present invention relates to a method for fast reservation multiple access, including: a central control node sets the number of contention time slots according to the number of nodes that have successfully accessed at present and idle channel resources; Announce the start of the reservation on the channel, followed by the number of competition time slots; the node makes a competition reservation on the first channel, and turns to the second channel to listen to the result; the central control node receives the access reservation on the first channel, At the same time, the access result is published on the second channel, and channel resources are allocated to nodes that have successfully accessed; each node sends service packets sequentially on the allocated channel resources without conflict. The present invention effectively eliminates the adverse effect of signal propagation delay on channel throughput, reduces the problem of hidden terminals and exposed terminals in reservation, and eliminates the possibility of collision in business packet transmission, and is especially suitable for communication with large propagation delay Access on the link uses the multiple access method of the channel.

Description

technical field [0001] The invention relates to a multiple access method for multiple nodes to share wireless channel resources, in particular to a fast reservation train multiple access method. Background technique [0002] The multiple access (Medium Access Control, MAC for short) method solves the problem of how multiple nodes or users share channel resources quickly, efficiently, fairly, and reliably. According to the channel allocation method, multiple access methods are usually divided into There are three ways of 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 ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): H04B7/204H04L12/56H04W74/00
Inventor 刘凯张军李献昌
Owner BEIHANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products