CN114630434A - Contention sequencing admission method based on unknown number of nodes - Google Patents

Contention sequencing admission method based on unknown number of nodes Download PDF

Info

Publication number
CN114630434A
CN114630434A CN202210272030.2A CN202210272030A CN114630434A CN 114630434 A CN114630434 A CN 114630434A CN 202210272030 A CN202210272030 A CN 202210272030A CN 114630434 A CN114630434 A CN 114630434A
Authority
CN
China
Prior art keywords
admission
period
node
downlink
detection frame
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202210272030.2A
Other languages
Chinese (zh)
Other versions
CN114630434B (en
Inventor
张冰
牛战松
张奭
齐晓鑫
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN202210272030.2A priority Critical patent/CN114630434B/en
Priority claimed from CN202210272030.2A external-priority patent/CN114630434B/en
Publication of CN114630434A publication Critical patent/CN114630434A/en
Application granted granted Critical
Publication of CN114630434B publication Critical patent/CN114630434B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2854—Wide area networks, e.g. public data networks
    • H04L12/2856—Access arrangements, e.g. Internet access
    • H04L12/2863—Arrangements for combining access network resources elements, e.g. channel bonding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/44—Star or tree networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0473—Wireless resource allocation based on the type of the allocated resource the resource being transmission power
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure

Abstract

The invention discloses an admission method for node competition sequencing based on unknown quantity, which mainly solves the problems that in the prior art, admission time is prolonged under the scene that each slave node is more, and conflict is easy to occur when each slave node sends an admission request. The scheme is as follows: in a star access network consisting of a central node and a plurality of unknown slave nodes, the central node forms a competition period with a plurality of continuous receiving periods according to the number of the slave nodes which are requested to receive at present, and dynamically adjusts the size of the competition period according to the number of the slave nodes; each slave node randomly selects an admission period from the competition period, and randomly selects an uplink sounding frame time slot from a plurality of uplink sounding frame time slots in the admission period to send an admission request; the central node receives each slave node in turn in order. The invention reduces the admission time, avoids the conflict when the subordinate nodes are more, improves the admission efficiency, and can be used for the access network of various time division multiplexing/time division multiple access mechanisms for allocating channels.

Description

Contention sequencing admission method based on unknown number of nodes
Technical Field
The invention belongs to the technical field of communication, and further relates to a competition sequencing and accepting method which can be used for various access networks which adopt a time division multiplexing/time division multiple access mechanism to allocate channels and carry out quick and efficient access on newly electrified terminal nodes in the networks.
Background
In shared medium based access networks, a star topology consisting of one central node and several slave nodes is often used. In such a network structure, data communication can be directly performed between the central node and the slave nodes, and communication between the slave nodes needs to be forwarded through the central node. The process of registering with the central node and joining an existing system after a new slave node has been power-on initialized or reset is called node admission. Normally, normal data communication is performed after the node admission is completed. To complete node admission, the central node and the dependent nodes typically need to exchange information many times. In the process, a channel is divided into a plurality of continuous and non-overlapping admission periods in terms of time, each admission period comprises a downlink sounding frame time slot and an uplink sounding frame time slot, the downlink sounding frame time slot is used for a central node to generate and send a downlink sounding frame, and the uplink sounding frame time slot is used for a slave node to generate and send an uplink sounding frame. The uplink/downlink detection frame mainly completes channel training of a physical layer and bears an uplink/downlink signaling frame of a medium access control layer interacted between the central node and the subordinate node in the node admission process. The starting time interval of two adjacent downlink sounding frames is one admission period.
In existing access network systems, each slave node generally acquires an admission opportunity by using a contention-based method. In the method, each admission period only comprises one downlink detection frame time slot and one uplink detection frame time slot, each slave node randomly backs off for a plurality of admission periods, and sends an admission request by using the only uplink detection frame time slot in the admission period to compete for admission opportunities. And the slave node which successfully sends the admission request can perform an admission process with the central node. After the slave node finishes the admission, the other slave nodes continue to repeat the process, execute a random back-off algorithm and compete for admission opportunities. The method has the following disadvantages: when a plurality of slave nodes need to be simultaneously admitted into the network, a large number of slave nodes compete for admission opportunities in the time slot of the unique uplink detection frame, so that admission requests are easy to collide; and in the method, only one slave node capable of being admitted can be selected through one competition, and after the slave node completes the admission process, the rest slave nodes to be admitted need to compete for the admission opportunity again in the uplink sounding frame time slot in the following admission period, so that the whole admission process can be completed after waiting for a long time.
A "parallel node admission method based on multiple channels" is disclosed in the domestic patent application No. 201310165257. The method comprises the following steps of node admission: (1) dividing access channels, dividing downlink channels into Q downlink access channels in frequency, bearing N downlink MAC layer signaling frames, dividing uplink channels into Q uplink access channels in time, and bearing Q uplink MAC layer signaling frames; (2) constructing bidirectional signaling frame channels, and enabling Q downlink MAC layer signaling frame channels and Q uplink MAC layer signaling frame channels to correspond one to form Q parallel bidirectional signaling frame channels; (3) the slave nodes select a signaling frame channel, and each slave node randomly selects an idle bidirectional signaling frame channel from the Q bidirectional signaling frame channels to carry out a node admission process. The method can simultaneously carry out the accepting of the slave nodes on a plurality of parallel bidirectional signaling frame channels, shortens the accepting duration to a certain extent, but has the following two defects: first, when the number of busy bidirectional signaling frame channels in the admission state is large, the number of selectable idle bidirectional signaling frame channels when each slave node sends an admission request is small, so that contention conflict is easy to occur, and the node admission success rate is low. Secondly, when the method is used for node admission, an N-socket receiver needs to be configured at a central node of a network to complete the admission of the slave nodes on different signaling frame channels, and the method is complicated to implement.
A "node admission method based on contention based ranking" is disclosed in domestic patent document No. 201910173511. The method comprises the following steps of node admission: (1) dividing an admission cycle, namely dividing a channel into a plurality of continuous time periods which are not overlapped with each other in time, wherein each time period is used as an admission cycle; (2) forming M continuous accepting periods into a competition period, and informing that each slave node can randomly select one accepting period to send an accepting request in the competition period by a central node, wherein the value range of M is more than or equal to 1 and less than or equal to the total number of the slave nodes in an access network; (3) the method comprises the following steps that slave nodes send admission requests, each slave node randomly selects an admission period in an announced competition period, and randomly selects a time slot from Q uplink detection frame time slots in the admission period to send the admission request; (4) the central node determines the admission sequence of the slave nodes and makes an announcement, and (5) the nodes which successfully request start to sequentially admit according to the sequence. The method changes the competition period of the slave nodes from Q uplink detection frame time slots of one original accepting period to M-Q uplink detection frame time slots of the accepting period, reduces the competition conflict times and shortens the accepting duration, but the competition period M is a fixed value, so that the duration of the competition period cannot be changed in real time according to the number of actually requested accepting slave nodes; when the number of slave nodes requesting admission is large and the contention period is small, the number of collisions is large, the number of contention is increased, or the contention period is large, waste of the contention period is caused, and the admission effect is poor.
Disclosure of Invention
The invention aims to provide a competition sequencing admission method based on an unknown number of nodes aiming at the defects of the prior art, so that a network center node changes the duration of a competition period in real time according to the number of slave nodes requesting to be admitted, the admission time delay is reduced, and the admission efficiency is improved.
In order to achieve the above purpose, the technical idea of the present invention is that in a star access network composed of a central node and an unknown number of slave nodes, in order to achieve the minimum average admission delay, the central node makes a plurality of consecutive admission cycles form a contention period according to the number of nodes currently requesting admission; each slave node randomly selects an admission period from the competition period, and randomly selects an uplink sounding frame time slot from Q uplink sounding frame time slots in the admission period to send an admission request; the central node sequentially receives each subordinate node; the duration of the first and second contention periods are both selected to be fixed values, then the total number of nodes is estimated according to the number of successfully admitted nodes in the first two contention periods, and the duration of the subsequent contention period is selected according to the estimated value. The concrete implementation is as follows:
(1) dividing a channel into a plurality of continuous time periods which are not overlapped with each other in time, and taking each time period as an admission period;
(2) planning time slots for different purposes:
(2a) the initial time of each admission period is used as the initial time of a downlink detection frame time slot, and the central node transmits a downlink physical layer detection frame for bearing a downlink medium access control MAC layer signaling frame by using the downlink detection frame time slot;
(2b) equally dividing the rest part Q of each admission period, taking the starting point of each equal division as the starting moment of each uplink detection frame time slot, and sending an uplink physical layer detection frame for bearing an uplink medium access control MAC layer signaling frame by the slave node by using the uplink detection frame time slot;
(3) the slave node adjusts the receiving power gain and determines the parameters of the downlink physical layer channel:
(3a) the central node continuously sends downlink detection frames in downlink detection frame time slots, and each slave node detects the signal intensity of the continuously received downlink detection frames;
(3b) the slave node records the detected signal intensity of the downlink detection frame, and adjusts the gain of the slave node receiving power by using a gain adjustment method;
(3c) the subordinate node determines the channel parameters of a downlink physical layer by using a channel parameter estimation method;
(4) selecting a duration of a contention period
(4a) Forming a competition period by the M admission periods, and selecting the duration of the first competition period and the second competition period, namely M, as a fixed value;
(4b) the central node estimates the number N of subordinate nodes waiting to be admitted in the current competition period according to the number of successfully admitted nodes in the previous two competition periods, wherein N is an integer between [0 and 64], namely in each competition period, the time slot of an uplink detection frame is M x Q, and a probability approximate value P of the successful admission of the N nodes is obtained through simulation;
(4c) find out to satisfy max (P)n1*Pn2) The best N is established, wherein N1 and N2 are the numbers of slave nodes successfully admitted in the previous two competition periods respectively and are non-negative integers, and N is the number of slave nodes waiting to be admitted in the current competition period;
(4d) selecting the duration of the competition period according to N to determine the value M;
(5) the central node sends a downlink detection frame, and the subordinate nodes send admission requests:
(5a) in a competition period, a central node sends a downlink detection frame in a downlink detection frame time slot and informs each subordinate node to randomly select an admission period from the competition period;
(5b) each slave node receives the downlink detection frame, randomly selects an uplink detection frame time slot from Q uplink detection frame time slots in the selected admission period, and sends an admission request;
(6) according to the sequence of receiving the admission request, the central node firstly fills the slave node ID which can be admitted in the downlink media access control MAC layer signaling frame; then, a downlink medium access control MAC layer signaling frame is encapsulated into a downlink detection frame, the downlink detection frame is broadcast and sent in a downlink detection frame time slot, and a node admission sequence is announced to each subordinate node;
(7) the slave node judges whether the downlink media access control MAC layer signaling frame has the ID of the node:
if yes, executing (8);
otherwise, the process returns to the step (4) after the admission process of all the subordinate nodes notified in the signaling frame of the downlink media access control MAC layer is finished;
(8) the central node sequentially receives all the subordinate nodes in sequence:
(8a) the central node sequentially sends admission responses to all the slave nodes in a downlink detection frame time slot, and adjusts the uplink sending power gain of the slave nodes;
(8b) the slave node sends uplink detection frames in Q uplink detection frame time slots in an admission period;
(8c) and the central node determines the uplink channel parameters by using the training sequence signals in the uplink detection frame and admits the slave nodes to the current network.
Compared with the prior art, the invention has the following advantages:
the invention estimates the total number of the subordinate nodes according to the prior successful admission nodes, and dynamically adjusts the duration of each competition period in real time according to the estimated value, so that the selection of the competition period can better accord with the number of the nodes requesting to be admitted at present, the condition of prolonging the admission time caused by improper selection of the competition period is avoided, and the total admission time delay is reduced.
Drawings
FIG. 1 is a flow chart of an implementation of the present invention;
fig. 2 is a view showing an admission cycle in the present invention.
Detailed Description
The invention is described in further detail below with reference to the figures and examples.
In this embodiment, the star access network is composed of a central node and 28 slave nodes, and 24 slave nodes N that are newly powered on will be added to the star access network1、N2…N24。
Referring to fig. 1, the implementation steps of this embodiment are as follows:
and step 1, dividing an admission period.
The channel is divided into a plurality of continuous time periods which are not overlapped with each other in time, each time period is taken as an admission period, and the time length of the admission period is set to be fixed length or unfixed length by a user according to requirements.
In the present embodiment, the time length of the admission period is fixed and set to 65536 uS.
And 2, planning time slots with different purposes.
2.1) taking the starting time of each admission period as the starting time of a downlink detection frame time slot, and sending a downlink physical layer detection frame carrying a downlink Medium Access Control (MAC) layer signaling frame by the central node by using the downlink detection frame time slot;
2.2) the rest 8 of each admission cycle is equally divided, the starting point of each equal division is taken as the starting moment of each uplink detection frame time slot, and the slave node transmits an uplink physical layer detection frame carrying an uplink medium access control MAC layer signaling frame by using the uplink detection frame time slot.
Fig. 2 is an admission cycle according to an embodiment of the present invention, which includes 1 downlink sounding frame slot and 8 uplink sounding frame slots.
And 3, the slave node adjusts the receiving power gain and determines the channel parameters of the downlink physical layer.
3.1) the central node continuously sends downlink detection frames in the downlink detection frame time slots, and each slave node detects and records the continuously received signals of the downlink detection frames;
3.2) the slave node adjusts the gain of its received power:
(3.2a) setting an initial received power gain of the slave node to a maximum value;
(3.2b) when the downlink detection frame signal with the error check is received or the downlink detection frame signal is not received in the specified time, reducing the receiving power gain of the downlink detection frame signal and continuously detecting the received downlink detection frame signal;
(3.2c) repeating (3.2b) until the slave node can receive the downlink signaling frame signal which is checked correctly, wherein the receiving power gain is optimal;
3.3) the slave node determines the channel parameters of the downlink physical layer by using a channel parameter estimation method, namely extracting a header from the received correct downlink detection frame signal, and analyzing and calculating the preamble sequence in the header to obtain a frame synchronization signal and a frequency synchronization signal.
And 4, selecting the duration of the competition period.
4.1) forming a competition period by the M admission periods, and selecting the time length of the first competition period and the second competition period, namely M, as a fixed value;
4.2) the central node estimates the number N of slave nodes waiting to be admitted in the current competition period according to the number of successfully admitted nodes in the previous two competition periods, wherein N is an integer between [0 and 64], and N is 0, which indicates that admission is completed; in each competition period, the time slot of an uplink detection frame is M x Q, a probability approximate value P of successful admission of n nodes is obtained through simulation, and the simulation process is as follows;
(4.2a) there are M × Q uplink sounding frame slots in the contention period, there are N slave nodes waiting to send admission requests, and N is an integer between [0,64 ];
(4.2b) each slave node is independent and randomly selects an uplink sounding frame time slot in a contention period to send an admission request;
(4.2c) when the competition period is over, counting the number of uplink sounding frame time slots which only accept one request in the competition period, namely the number n of successfully accepted nodes in the competition period, wherein n is a non-negative integer;
(4.3d) repeating (4.2b) - (4.2c) for a plurality of times, counting the occurrence times of successfully admitting N slave nodes, and obtaining a probability approximation value P of successfully admitting N slave nodes waiting for admission when the competition period is M admission periods, wherein the more the repetition times, the more accurate P is;
4.3) finding out that max (P) is satisfiedn1*Pn2) The best N is established, wherein N1 and N2 are the numbers of slave nodes successfully admitted in the previous two competition periods respectively and are non-negative integers, and N is the number of slave nodes waiting to be admitted in the current competition period;
4.4) selecting the duration of the competition period according to N, namely determining the value of M according to the following rule;
when N is more than or equal to 1 and less than or equal to 11, M is 1; when N is more than or equal to 12 and less than or equal to 19, M is 2;
when N is more than or equal to 20 and less than or equal to 27, M is 3; when N is more than or equal to 28 and less than or equal to 35, M is 4;
when N is more than or equal to 36 and less than or equal to 43, M is 5; when N is more than or equal to 44 and less than or equal to 51, M is 6;
when N is more than or equal to 52 and less than or equal to 59, M is 7; when N is more than or equal to 60 and less than or equal to 64, M is 8.
In the example, the competition periods of the 1 st time and the 2 nd time are 1 admission period, namely, M is 1; the central node estimates the number of slave nodes waiting to be admitted in the current competition period according to the number of successfully admitted nodes in the previous two competition periods, and the 1 st successfully admitted node n is assumed12, node n is admitted 2 nd time successfully21, obtaining n when the time slot number of the uplink sounding frame is 1 × 8 by simulation1、n2Approximate probability P of successful admission of individual noden1、Pn2According to max (P)n1*Pn2) Screening, and estimating the number N of slave nodes waiting to be admitted in the current competition period to be 19; and taking M to be 2 according to the rule of selecting the duration of the contention period according to N, namely the contention period is 2 admission periods.
And 5, the central node sends a downlink detection frame, and the slave nodes send admission requests.
5.1) in a competition period, the central node sends a downlink detection frame in a downlink detection frame time slot and informs each slave node that an admission period can be randomly selected from the competition period;
5.2) each slave node receives the downlink detection frame, randomly selects an uplink detection frame time slot from 8 uplink detection frame time slots in the selected admission period, and sends an admission request;
competition period 1:
the slave node 5 randomly selects a 3 rd uplink detection frame time slot from 8 uplink detection frame time slots to send an admission request;
the slave node 2 randomly selects a 5 th uplink detection frame time slot from 8 uplink detection frame time slots to send an admission request;
the other slave nodes randomly select the 6 th uplink detection frame time slot from the 8 uplink detection frame time slots to send an admission request;
in the 2 nd competition period:
the slave node 9 randomly selects the 3 rd uplink sounding frame time slot from the 8 uplink sounding frame time slots to send an admission request;
the rest 21 slave nodes which are not successfully admitted randomly select the 5 th uplink detection frame time slot from the 8 uplink detection frame time slots to send admission requests;
in the 3 rd competition period:
the slave node 10 randomly selects a 4 th uplink sounding frame time slot from 8 uplink sounding frame time slots of a first admission period in a contention period to send an admission request;
the slave node 19 randomly selects the 1 st uplink sounding frame time slot from the 8 uplink sounding frame time slots of the first admission period in the contention period to send an admission request;
the slave node 17 randomly selects the 2 nd uplink sounding frame time slot from the 8 uplink sounding frame time slots of the second admission period in the contention period to send an admission request;
the slave node 21 randomly selects an 8 th uplink sounding frame time slot from 8 uplink sounding frame time slots of a first admission period in a contention period to send an admission request;
the slave node 23 randomly selects the 2 nd uplink sounding frame time slot from the 8 uplink sounding frame time slots of the first admission period in the contention period to send an admission request;
the rest slave nodes which are not successfully admitted randomly select the 4 th uplink detection frame time slot from the 8 uplink detection frame time slots of the second admission period in the contention period to send admission requests;
then, the duration of the competition period is determined according to the step 4 at each competition, and the step 5 is repeated until all slave nodes are completely admitted.
And 6, the central node determines the admission sequence of each slave node and announces the admission sequence.
According to the sequence of receiving the admission request, the central node fills the slave node ID which can be admitted in the downstream media access control MAC layer signaling frame, and broadcasts and sends the signaling frame in the downstream detection frame time slot, and informs the node admission sequence to each slave node:
the central node receives the admission request sent by the slave node 5 in the 3 rd uplink detection frame time slot, so the central node fills the node ID of the slave node 5 into a downlink Media Access Control (MAC) layer signaling frame;
the central node receives the admission request sent by the slave node 2 in the 5 th uplink detection frame time slot, so the central node fills the node ID of the slave node 2 into the downlink Media Access Control (MAC) layer signaling frame and is arranged behind the node ID of the slave node 5;
as the admission requests of other slave nodes all collide in the 6 th uplink detection frame time slot, the central node does not receive the uplink detection frame in the 6 th uplink detection frame time slot and does not perform any processing;
the central node announces to each slave node that the slave node 2 and the slave node 5 can be admitted by broadcasting, and admission is performed in the order of the slave node 5 and the slave node 2.
Step 7, the slave node judges whether the downlink media access control MAC layer signaling frame has the ID of the node itself:
if yes, executing step 8;
otherwise, the step 4 is returned after the admission process of all the subordinate nodes notified in the downlink media access control MAC layer signaling frame is finished.
In the embodiment of the invention, the slave node 5 inquires the ID of the node from the received downlink media access control MAC layer signaling frame to know that the receiving request is successfully sent, and the slave node is the first slave node waiting for receiving;
the slave node 2 inquires the ID of the node from the received downlink media access control MAC layer signaling frame, knows that the receiving request of the slave node is successfully sent, and is a second slave node waiting for receiving;
the other slave nodes do not inquire the ID of the node from the received downlink media access control MAC layer signaling frame and know that the receiving request of the slave nodes fails to be sent. And the rest slave nodes return to the step 5 after waiting for the completion of the admission process of all slave nodes reported in the downlink media access control MAC layer signaling frame.
And 8, the central node sequentially receives the slave nodes in sequence.
8.1) the central node sequentially sends admission responses to each slave node in the downlink detection frame time slot, and adjusts the uplink sending power gain of the slave nodes by adopting the method same as the step 3.2);
8.2) the slave node simultaneously sends uplink detection frames in 8 uplink detection frame time slots in the admission period;
8.3) the central node determines the uplink channel parameters by using the training sequence signals in the uplink detection frame by using the same method as the step 3.3), and admits the slave nodes to the current network.
In the embodiment of the invention, the central node admits the two slave nodes to the star access network according to the sequence of the slave node 5 and the slave node 2, and then the slave node 2 and the slave node 5 can carry out normal data communication with other nodes in the network.
The foregoing description is only an example of the present invention and should not be construed as limiting the invention, as it will be apparent to those skilled in the art that various modifications and variations in form and detail can be made without departing from the principle and structure of the invention after understanding the present disclosure and the principles, but such modifications and variations are considered to be within the scope of the appended claims.

Claims (6)

1. An admission method based on an unknown number of node competition ordering is characterized by comprising the following steps:
(1) dividing a channel into a plurality of continuous time periods which are not overlapped with each other in time, and taking each time period as an admission period;
(2) planning time slots for different purposes:
(2a) the initial time of each admission period is used as the initial time of a downlink detection frame time slot, and the central node transmits a downlink physical layer detection frame for bearing a downlink medium access control MAC layer signaling frame by using the downlink detection frame time slot;
(2b) equally dividing the rest part Q of each admission period, taking the starting point of each equal division as the starting moment of each uplink detection frame time slot, and sending an uplink physical layer detection frame for bearing an uplink medium access control MAC layer signaling frame by the slave node by using the uplink detection frame time slot;
(3) the slave node adjusts the receiving power gain and determines the parameters of the downlink physical layer channel:
(3a) the central node continuously sends downlink detection frames in downlink detection frame time slots, and each slave node detects the continuously received downlink detection frames;
(3b) the slave node records the detected downlink detection frame and adjusts the gain of the receiving power by using a gain adjustment method;
(3c) the subordinate node determines the channel parameters of a downlink physical layer by using a channel parameter estimation method;
(4) selecting a duration of a contention period
(4a) Forming a competition period by the M admission periods, and selecting the duration of the first competition period and the second competition period, namely M, as a fixed value;
(4b) the central node estimates the number N of subordinate nodes waiting to be admitted in the current competition period according to the number of successfully admitted nodes in the previous two competition periods, wherein N is an integer between [0 and 64], namely in each competition period, the time slot of an uplink detection frame is M x Q, and a probability approximate value P of the successful admission of the N nodes is obtained through simulation;
(4c) find out to satisfy max (P)n1*Pn2) The best N is established, wherein N1 and N2 are the numbers of slave nodes successfully admitted in the previous two competition periods respectively and are non-negative integers, and N is the number of slave nodes waiting to be admitted in the current competition period;
(4d) selecting the duration of the competition period according to N to determine the value M;
(5) the central node sends a downlink detection frame, and the subordinate nodes send admission requests:
(5a) in a competition period, a central node sends a downlink detection frame in a downlink detection frame time slot and informs each subordinate node to randomly select an admission period from the competition period;
(5b) each slave node receives the downlink detection frame, randomly selects an uplink detection frame time slot from Q uplink detection frame time slots in the selected admission period, and sends an admission request;
(6) according to the sequence of receiving the admission request, the central node firstly fills the slave node ID which can be admitted in the downlink media access control MAC layer signaling frame; then, a downlink medium access control MAC layer signaling frame is encapsulated into a downlink detection frame, the downlink detection frame is broadcast and sent in a downlink detection frame time slot, and a node admission sequence is announced to each subordinate node;
(7) the slave node judges whether the downlink media access control MAC layer signaling frame has the ID of the node:
if yes, executing (8);
otherwise, the process returns to the step (4) after the admission process of all the subordinate nodes notified in the signaling frame of the downlink media access control MAC layer is finished;
(8) the central node sequentially receives all the subordinate nodes in sequence:
(8a) the central node sequentially sends admission responses to all the slave nodes in a downlink detection frame time slot, and adjusts the uplink sending power gain of the slave nodes;
(8b) the slave node sends uplink detection frames in Q uplink detection frame time slots in an admission period;
(8c) and the central node determines the uplink channel parameters by using the training sequence signals in the uplink detection frame and admits the slave nodes to the current network.
2. The method according to claim 1, wherein the admission period in (1) has a time length set by a user to a fixed length or an unfixed length according to a requirement.
3. The method of claim 1, wherein the slave node in (3b) adjusts the gain of its received power by using a gain adjustment method, which is implemented as follows:
(3b1) setting an initial received power gain of the slave node to a maximum value;
(3b2) when a downlink detection frame signal with a check error is received or a downlink detection frame signal is not received within a specified time, reducing the receiving power gain of the downlink detection frame signal and continuously detecting the received downlink detection frame signal;
(3b3) and repeating (3b2) until the slave node receives the downlink signaling frame signal which is checked to be correct, wherein the receiving power gain is optimal.
4. The method of claim 1, wherein the slave node in (3c) determines the channel parameters of the downlink physical layer by using a channel parameter estimation method, which is implemented as follows:
(3c1) extracting a header of the received correct downlink detection frame signal to obtain a leader sequence;
(3c2) analyzing the preamble sequence to obtain the physical layer channel parameters, including: frame synchronization signal, frequency synchronization signal.
5. The method according to claim 1, wherein in (4b), the probability approximation P of successful admission of the n slave nodes is obtained through simulation, and the simulation process is as follows:
(4b1) there are M × Q uplink sounding frame time slots in the contention period, there are N slave nodes waiting for sending admission requests, and N is an integer between [0 and 64 ];
(4b2) each slave node is mutually independent and randomly selects an uplink detection frame time slot in a competition period to send an admission request;
(4b3) when the competition period is ended, counting the number of uplink detection frame time slots with only one admission request in the competition period, namely the number n of successfully admitted nodes in the competition period, wherein n is a non-negative integer;
(4b4) repeating (4b2) and (4b3) for a plurality of times, and counting the times of occurrence of successfully admitting N slave nodes, so as to obtain an approximate probability value P of successfully admitting N slave nodes waiting for admission when the contention period is M admission periods, wherein the more the repetition times, the more accurate P is.
6. The method according to claim 1, wherein the selecting of the contention period duration (M) in (4d) according to N is performed according to the following rule:
when N is more than or equal to 1 and less than or equal to 11, M is 1; when N is more than or equal to 12 and less than or equal to 19, M is 2;
when N is more than or equal to 20 and less than or equal to 27, M is 3; when N is more than or equal to 28 and less than or equal to 35, M is 4;
when N is more than or equal to 36 and less than or equal to 43, M is 5; when N is more than or equal to 44 and less than or equal to 51, M is 6;
when N is more than or equal to 52 and less than or equal to 59, M is 7; when N is more than or equal to 60 and less than or equal to 64, M is 8.
CN202210272030.2A 2022-03-18 Competition ordering and admitting method based on unknown number of nodes Active CN114630434B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210272030.2A CN114630434B (en) 2022-03-18 Competition ordering and admitting method based on unknown number of nodes

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210272030.2A CN114630434B (en) 2022-03-18 Competition ordering and admitting method based on unknown number of nodes

Publications (2)

Publication Number Publication Date
CN114630434A true CN114630434A (en) 2022-06-14
CN114630434B CN114630434B (en) 2024-05-14

Family

ID=

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5408465A (en) * 1993-06-21 1995-04-18 Hewlett-Packard Company Flexible scheme for admission control of multimedia streams on integrated networks
WO2010061241A1 (en) * 2008-11-25 2010-06-03 Sabanci Universitesi A method for estimation of residual bandwitdth
CN103237323A (en) * 2013-05-07 2013-08-07 西安电子科技大学 Multichannel-based parallel node accepting method
CN109831831A (en) * 2019-03-07 2019-05-31 西安电子科技大学 Node acceptance method based on competition sequence
CN111818633A (en) * 2020-07-20 2020-10-23 西安电子科技大学 Dynamic node admission method in star access network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5408465A (en) * 1993-06-21 1995-04-18 Hewlett-Packard Company Flexible scheme for admission control of multimedia streams on integrated networks
WO2010061241A1 (en) * 2008-11-25 2010-06-03 Sabanci Universitesi A method for estimation of residual bandwitdth
CN103237323A (en) * 2013-05-07 2013-08-07 西安电子科技大学 Multichannel-based parallel node accepting method
CN109831831A (en) * 2019-03-07 2019-05-31 西安电子科技大学 Node acceptance method based on competition sequence
CN111818633A (en) * 2020-07-20 2020-10-23 西安电子科技大学 Dynamic node admission method in star access network

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
H.JINJIAN ET AL: "Design of HIMAC coprocessor for HINOC3.0", 《IEEE ICCCS》, 31 December 2021 (2021-12-31) *
张陆晶: "万兆同轴宽带接入系统MAC机制与设计", 《中国优秀硕士学位论文全文数据库》, 15 February 2020 (2020-02-15) *
齐晓鑫: "一种宽带接入网络中的节点接纳方法", 《西安电子科技大学学报》, 20 August 2020 (2020-08-20) *

Similar Documents

Publication Publication Date Title
CN109831831B (en) Node admission method based on competition sequencing
US11638252B2 (en) Fast wireless local area network communication method and apparatus using multiple transfer rate partitioning and cooperative transmission
US8711830B2 (en) Method for media access controlling and system and method for channel time reservation in distributed wireless personal area network
JP4143011B2 (en) Carrier sense multiple access method, radio base station apparatus and radio terminal apparatus
JP7442767B2 (en) Coordination of WIFI stations using shared TXOP in time domain
WO2018196510A1 (en) Radio frame transmitting method and apparatus
JP2019522923A (en) Training method and system for directional transmission in wireless communication
KR101805560B1 (en) Method, apparatus and system for channel access
US9232361B2 (en) System and method for direct multi-user transmission
EP1429496B1 (en) Apparatus and method for making a polling list taking QOS into consideration
KR20040060964A (en) Optimally serving stations on wlans using contention/resource reservation protocol ieee 802.11e
CN109548156B (en) Single-channel Time Division Multiple Access (TDMA) satellite cluster ad hoc network time slot resource allocation method
US10554351B1 (en) Methods and systems for enabling communications from a station to an access point using an orthogonal frequency division multiple access (OFDMA) communication scheme
CN110167147A (en) A kind of wave beam failure recovery method and user terminal
JP2023531684A (en) Coordination of Stations in a Single BSS Sharing a TXOP in the Frequency Domain
JP2023525062A (en) Coordination of Stations in an OBSS Sharing a TXOP in the Frequency Domain
CN110225593B (en) Random number idle time slot competition method in distributed TDMA protocol
KR101511150B1 (en) Media access control method using channel preemption in distributed cognitive radio network
CN112492625B (en) Narrowband Internet of things coverage enhancement analysis method based on repetition and retransmission
CN114630434B (en) Competition ordering and admitting method based on unknown number of nodes
CN106936557B (en) Wireless channel resource allocation method
CN114630434A (en) Contention sequencing admission method based on unknown number of nodes
Wang et al. Restricted access window based hidden node problem mitigating algorithm in IEEE 802.11 ah networks
US20130205012A1 (en) Apparatus and method for transmitting node discovery messages
JP2023551336A (en) Coordination of WIFI stations using shared TXOP between DL and UL over time domain

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant