[go: up one dir, main page]

CN114630434B - Competition ordering and admitting method based on unknown number of nodes - Google Patents

Competition ordering and admitting method based on unknown number of nodes Download PDF

Info

Publication number
CN114630434B
CN114630434B CN202210272030.2A CN202210272030A CN114630434B CN 114630434 B CN114630434 B CN 114630434B CN 202210272030 A CN202210272030 A CN 202210272030A CN 114630434 B CN114630434 B CN 114630434B
Authority
CN
China
Prior art keywords
admission
detection frame
node
downlink
period
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.)
Active
Application number
CN202210272030.2A
Other languages
Chinese (zh)
Other versions
CN114630434A (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
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

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446Resources in time domain, e.g. slots or frames
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2854Wide area networks, e.g. public data networks
    • H04L12/2856Access arrangements, e.g. Internet access
    • H04L12/2863Arrangements for combining access network resources elements, e.g. channel bonding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/44Star or tree networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/0473Wireless resource allocation based on the type of the allocated resource the resource being transmission power
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • H04W74/0833Random access procedures, e.g. with 4-step access

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses an admission method for node competition sequencing based on unknown quantity, which mainly solves the problem that in the prior art, admission is prolonged under the condition 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-type access network consisting of a central node and a plurality of unknown slave nodes, the central node forms a plurality of continuous admission periods into a competition period according to the number of the slave nodes which are admitted by the current request, 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 contention period, and randomly selects one uplink detection frame time slot from a plurality of uplink detection frame time slots in the admission period to send an admission request; the central node receives the slave nodes in sequence. The invention reduces the admission time, avoids the conflict when the slave nodes are more, improves the admission efficiency, and can be used for various access networks of which the time division multiplexing/time division multiple access mechanisms distribute channels.

Description

基于未知数量节点的竞争排序接纳方法Competitive ranking admission method based on unknown number of nodes

技术领域Technical Field

本发明属于通信技术领域,更进一步涉及一种竞争排序接纳方法,可用于各种采用时分复用/时分多址机制分配信道的接入网络,对网络中新上电的终端节点进行快速高效地接入。The present invention belongs to the field of communication technology, and further relates to a competitive sorting admission method, which can be used for various access networks that use time division multiplexing/time division multiple access mechanism to allocate channels, and quickly and efficiently access newly powered-on terminal nodes in the network.

背景技术Background technique

在基于共享媒质的接入网中,常采用由一个中心节点和若干从属节点组成的星型拓扑结构。在这种网络结构中,中心节点和从属节点之间可以直接进行数据通信,各从属节点之间的通信则需要通过中心节点进行转发。一个新的从属节点上电初始化或复位之后,向中心节点注册并加入到现有系统的过程称为节点接纳。通常,节点接纳完成之后,才能进行正常数据通信。为完成节点接纳,中心节点和从属节点通常需要多次交互信息。在此过程中,信道在时间上被划分成多个连续的且互不重叠的接纳周期,每个接纳周期含有下行探测帧时隙和上行探测帧时隙,下行探测帧时隙用于中心节点生成并发送下行探测帧,上行探测帧时隙用于从属节点生成并发送上行探测帧。上行/下行探测帧主要完成物理层的信道训练,并承载中心节点和从属节点在节点接纳过程中交互的媒质接入控制层上行/下行信令帧。相邻两个下行探测帧的起始时间间隔为一个接纳周期。In an access network based on shared media, a star topology consisting of a central node and several slave nodes is often used. In this network structure, data communication can be carried out directly between the central node and the slave nodes, while communication between the slave nodes needs to be forwarded through the central node. After a new slave node is powered on and initialized or reset, the process of registering with the central node and joining the existing system is called node admission. Usually, normal data communication can be carried out only after node admission is completed. To complete node admission, the central node and the slave nodes usually need to exchange information multiple times. In this process, the channel is divided into multiple continuous and non-overlapping admission cycles in time. Each admission cycle contains a downlink detection frame time slot and an uplink detection frame time slot. The downlink detection frame time slot is used for the central node to generate and send a downlink detection frame, and the uplink detection frame time slot is used for the slave node to generate and send an uplink detection frame. The uplink/downlink detection frame mainly completes the channel training of the physical layer and carries the uplink/downlink signaling frames of the media access control layer exchanged between the central node and the slave node during the node admission process. The starting time interval of two adjacent downlink detection frames is an admission cycle.

在已存在的接入网络系统中,通常各从属节点采用基于竞争的方法获取接纳机会。在这种方法中,每个接纳周期仅含有一个下行探测帧时隙和一个上行探测帧时隙,各从属节点随机退避若干个接纳周期,使用该接纳周期内唯一的上行探测帧时隙发送接纳请求,竞争接纳机会。接纳请求发送成功的从属节点,可以和中心节点进行接纳过程。该从属节点接纳完成后,其余从属节点继续重复上述过程,执行随机退避算法,竞争接纳机会。该方法的不足之处在于:当多个从属节点需要同时接纳到网络中时,大量从属节点在唯一的上行探测帧时隙竞争接纳机会,故而接纳请求易发生冲突;且该方法中一次竞争只能选出一个可被接纳的从属节点,该从属节点完成接纳过程后,其余的待接纳从属节点需要在之后接纳周期内的上行探测帧时隙再次竞争接纳机会,因此需等待较长时间才能完成整个接纳过程。In the existing access network system, each slave node usually obtains the admission opportunity by using a competition-based method. In this method, each admission cycle contains only one downlink detection frame time slot and one uplink detection frame time slot. Each slave node randomly backs off for several admission cycles and uses the only uplink detection frame time slot in the admission cycle to send an admission request to compete for the admission opportunity. The slave node that successfully sends the admission request can go through the admission process with the central node. After the admission of the slave node is completed, the remaining slave nodes continue to repeat the above process, execute the random backoff algorithm, and compete for the admission opportunity. The disadvantage of this method is that when multiple slave nodes need to be admitted to the network at the same time, a large number of slave nodes compete for the admission opportunity in the only uplink detection frame time slot, so the admission request is prone to conflict; and in this method, only one slave node that can be admitted can be selected in one competition. After the slave node completes the admission process, the remaining slave nodes to be admitted need to compete for the admission opportunity again in the uplink detection frame time slot in the subsequent admission cycle, so it takes a long time to complete the entire admission process.

国内申请号为201310165257的专利文献中公开了一种“基于多通道的并行节点接纳方法”。该方法中节点接纳的步骤为:(1)划分接入信道,将下行信道在频率上划分为Q个下行接入信道,承载N路下行MAC层信令帧,将上行信道在时间上划分为Q个上行接入信道,承载Q路上行MAC层信令帧;(2)构建双向信令帧通道,将Q个下行MAC层信令帧通道和Q个上行MAC层信令帧通道一一对应,构成Q个并行的双向信令帧通道;(3)从属节点选择信令帧通道,各从属节点从Q个双向信令帧通道中随机选取一个空闲的双向信令帧通道,进行节点接纳流程。该方法可在多个并行的双向信令帧通道上同时进行从属节点接纳,一定程度上缩短了接纳时长,但是,该方法仍然存在的不足之处有两点:其一,当处于接纳状态的忙双向信令帧通道个数较多时,各从属节点在发送接纳请求时可选择的空闲双向信令帧通道个数少,易发生竞争冲突,导致节点接纳成功率低下。其二,使用该方法进行节点接纳时需要在网络的中心节点配置N套接收机,来完成不同信令帧通道上的从属节点接纳,方法实现过于复杂。The patent document with domestic application number 201310165257 discloses a "parallel node admission method based on multiple channels". The steps of node admission in this method are as follows: (1) divide the access channel, divide the downlink channel into Q downlink access channels in frequency, carry N downlink MAC layer signaling frames, divide the uplink channel into Q uplink access channels in time, carry Q uplink MAC layer signaling frames; (2) construct a bidirectional signaling frame channel, correspond the Q downlink MAC layer signaling frame channels to the Q uplink MAC layer signaling frame channels one by one, and form Q parallel bidirectional signaling frame channels; (3) the slave node selects the 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 the node admission process. This method can accept slave nodes on multiple parallel two-way signaling frame channels at the same time, which shortens the acceptance time to a certain extent. However, this method still has two shortcomings: First, when there are a large number of busy two-way signaling frame channels in the acceptance state, each slave node can choose from a small number of idle two-way signaling frame channels when sending an acceptance request, which is prone to competition conflicts, resulting in a low node acceptance success rate. Second, when using this method for node acceptance, it is necessary to configure N sets of receivers at the central node of the network to complete the acceptance of slave nodes on different signaling frame channels, and the method is too complicated to implement.

国内其申请号为201910173511的专利文献中公布了一种“基于竞争排序的节点接纳方法”。该方法中节点接纳的步骤为:(1)划分接纳周期,将信道在时间上划分成多个连续的且互不重叠的时间段,每一个时间段作为一个接纳周期;(2)将M个连续的接纳周期组成一个竞争期,中心节点通告各从属节点可在竞争期内随机选择一个接纳周期发送接纳请求,其中M的取值范围为,大于等于1且小于等于接入网络中的从属节点的总数;(3)从属节点发送接纳请求,每个从属节点在通告的竞争期中随机选择一个接纳周期,并从该接纳周期内的Q个上行探测帧时隙中随机选择一个时隙发送接纳请求;(4)中心节点决定从属节点的接纳顺序并进行通告,(5)请求成功的节点开始按照顺序依次进行接纳。该方法将从属节点的竞争期由原来的一个接纳周期的Q个上行探测帧时隙改为M个接纳周期共M*Q个上行探测帧时隙,该方法减少了竞争冲突次数并且缩短了接纳时长,但是,由于将竞争期M取为固定值,无法根据实际请求接纳从属节点的数量实时改变竞争期时长;当请求接纳的从属节点较多,竞争期较小时,冲突次数较多,竞争次数提升,或者竞争期较大时,会导致竞争期的浪费,均会导致接纳效果变差。A "node admission method based on competition sorting" is disclosed in a domestic patent document with application number 201910173511. The steps of node admission in this method are as follows: (1) Divide the admission cycle, divide the channel into multiple continuous and non-overlapping time periods in time, and each time period is an admission cycle; (2) M continuous admission cycles form a competition period, and the central node notifies each slave node that it can randomly select an admission cycle in the competition period to send an admission request, where the value range of M is greater than or equal to 1 and less than or equal to the total number of slave nodes in the access network; (3) The slave node sends an admission request, and each slave node randomly selects an admission cycle in the notified competition period, and randomly selects a time slot from the Q uplink detection frame time slots in the admission cycle to send an admission request; (4) The central node determines the admission order of the slave nodes and notifies it; (5) The nodes with successful requests begin to be admitted in order. This method changes the contention period of the slave nodes from Q uplink detection frame time slots of one acceptance cycle to M acceptance cycles with a total of M*Q uplink detection frame time slots. This method reduces the number of contention conflicts and shortens the acceptance time. However, since the contention period M is taken as a fixed value, the contention period cannot be changed in real time according to the number of slave nodes actually requesting acceptance. When there are many slave nodes requesting acceptance and the contention period is short, the number of conflicts is large, the number of contentions increases, or the contention period is long, which will lead to a waste of the contention period, all of which will lead to a poor acceptance effect.

发明内容Summary of the invention

本发明的目的在于针对上述现有技术的不足,提出一种基于未知数量节点的竞争排序接纳方法,以使网络中心节点根据请求接纳的从属节点数量实时变化竞争期的时长,减小接纳时延,提高接纳效率。The purpose of the present invention is to address the deficiencies of the above-mentioned prior art and propose a competitive sorting and acceptance method based on an unknown number of nodes, so that the network center node can change the length of the contention period in real time according to the number of slave nodes requested to be accepted, thereby reducing the acceptance delay and improving the acceptance efficiency.

为实现上述目的,本发明的技术思想是在由一个中心节点和未知数量的从属节点组成的星型接入网络中,为了达到平均接纳时延最小,中心节点根据当前请求接纳的节点数将连续的多个接纳周期组成一个竞争期;各从属节点从竞争期中随机选择一个接纳周期,并在该接纳周期内的Q个上行探测帧时隙中随机选择一个上行探测帧时隙发送接纳请求;中心节点按顺序依次接纳各从属节点;第一次和第二次的竞争期时长均选择固定值,之后,根据前两个竞争期内成功接纳的节点数来估计总的节点数,并且依靠该估计值选择后续竞争期时长。具体实现如下: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 minimize the average acceptance delay, the central node combines multiple consecutive acceptance cycles into a contention period according to the number of nodes currently requesting acceptance; each slave node randomly selects an acceptance cycle from the contention period, and randomly selects an uplink detection frame time slot from the Q uplink detection frame time slots within the acceptance cycle to send an acceptance request; the central node accepts each slave node in sequence; the first and second contention period lengths are both fixed values, and then the total number of nodes is estimated based on the number of nodes successfully accepted in the first two contention periods, and the subsequent contention period length is selected based on the estimated value. The specific implementation is as follows:

(1)将信道在时间上划分成多个连续的且互不重叠的时间段,将每一个时间段作为一个接纳周期;(1) Divide the channel into multiple continuous and non-overlapping time periods, and regard each time period as an acceptance cycle;

(2)规划不同用途的时隙:(2) Planning time slots for different purposes:

(2a)将每个接纳周期的起始时刻,作为下行探测帧时隙的起始时刻,中心节点利用下行探测帧时隙,发送承载下行媒质接入控制MAC层信令帧的下行物理层探测帧;(2a) The start time of each reception period is used as the start time of the downlink detection frame time slot, and the central node uses the downlink detection frame time slot to send a downlink physical layer detection frame carrying a downlink media access control MAC layer signaling frame;

(2b)将每个接纳周期的其余部分Q等分,将每个等分的起点作为每个上行探测帧时隙的起始时刻,从属节点利用上行探测帧时隙,发送承载上行媒质接入控制MAC层信令帧的上行物理层探测帧;(2b) the remaining part Q of each reception period is divided into equal parts, and the starting point of each equal part is used as the starting time of each uplink detection frame time slot. The slave node uses the uplink detection frame time slot to send an uplink physical layer detection frame carrying an uplink medium access control MAC layer signaling frame;

(3)从属节点调整接收功率增益,确定下行物理层信道参数:(3) The slave node adjusts the receiving power gain and determines the downlink physical layer channel parameters:

(3a)中心节点在下行探测帧时隙持续发送下行探测帧,各从属节点检测持续接收的下行探测帧的信号强度;(3a) The central node continuously sends downlink detection frames in the downlink detection frame time slot, and each slave node detects the signal strength of the downlink detection frames continuously received;

(3b)从属节点记录检测到的下行探测帧信号强度,利用增益调整方法调整从属节点接收功率的增益;(3b) The slave node records the detected downlink detection frame signal strength and adjusts the gain of the slave node receiving power using a gain adjustment method;

(3c)从属节点利用信道参数估计方法确定出下行物理层的信道参数;(3c) The slave node determines the channel parameters of the downlink physical layer using a channel parameter estimation method;

(4)选择竞争期时长(4) Choose the duration of the competition period

(4a)将M个接纳周期组成一个竞争期,将第一次、第二次竞争期时长即M选择为固定值;(4a) M acceptance cycles are combined into one contention period, and the duration of the first and second contention periods, i.e., M, is selected as a fixed value;

(4b)中心节点根据前两个竞争期内成功接纳的节点数量估计当前竞争期等待接纳的从属节点数N,N取[0,64]之间的整数,即在每个竞争期内,上行探测帧时隙为M*Q,通过仿真得到n个节点成功接纳的概率近似值P;(4b) The central node estimates the number of slave nodes N waiting to be accepted in the current contention period based on the number of nodes successfully accepted in the previous two contention periods. N is an integer between [0,64]. That is, in each contention period, the uplink detection frame time slot is M*Q. The probability approximation P of n nodes being successfully accepted is obtained through simulation.

(4c)找出满足max(Pn1*Pn2)成立的最佳N,其中n1、n2分别为前两个竞争期内各自成功接纳的从属节点数,且均为非负整数,N为当前竞争期等待接纳的从属节点数;(4c) Find the best N that satisfies max(P n1 *P n2 ), where n1 and n2 are the numbers of slave nodes successfully accepted in the first two contention periods, respectively, and both are non-negative integers, and N is the number of slave nodes waiting to be accepted in the current contention period;

(4d)根据N选择竞争期时长即确定M值;(4d) Selecting the duration of the competition period based on N to determine the value of M;

(5)中心节点发送下行探测帧,从属节点发送接纳请求:(5) The central node sends a downlink detection frame, and the slave node sends an admission request:

(5a)在竞争期内,中心节点在下行探测帧时隙发送下行探测帧,并通告各从属节点从竞争期内随机选择一个接纳周期;(5a) During the contention period, the central node sends a downlink detection frame in the downlink detection frame time slot and notifies each slave node to randomly select an acceptance period from the contention period;

(5b)每个从属节点接收下行探测帧,并从所选接纳周期内的Q个上行探测帧时隙中随机选择一个上行探测帧时隙,发送接纳请求;(5b) Each slave node receives the downlink detection frame and randomly selects an uplink detection frame time slot from the Q uplink detection frame time slots in the selected admission period and sends an admission request;

(6)中心节点按照接收到接纳请求的先后顺序,先将下行媒质接入控制MAC层信令帧中填入可以被接纳的从属节点ID;再将下行媒质接入控制MAC层信令帧封装入下行探测帧,在下行探测帧时隙广播发送该下行探测帧,向各从属节点通告节点接纳顺序;(6) The central node first fills the IDs of the slave nodes that can be accepted into the downlink media access control MAC layer signaling frame in the order in which the admission requests are received; then encapsulates the downlink media access control MAC layer signaling frame into a downlink detection frame, broadcasts the downlink detection frame in the downlink detection frame time slot, and informs each slave node of the node admission order;

(7)从属节点判断下行媒质接入控制MAC层信令帧中是否存在自身节点的ID:(7) The slave node determines whether the ID of its own node exists in the downlink media access control MAC layer signaling frame:

若是,则执行(8);If yes, execute (8);

否则,等待下行媒质接入控制MAC层信令帧中通报的所有从属节点的接纳流程结束后返回(4);Otherwise, wait for the acceptance process of all slave nodes notified in the downlink media access control MAC layer signaling frame to be completed and then return to (4);

(8)中心节点按顺序依次接纳各从属节点:(8) The central node accepts each slave node in sequence:

(8a)中心节点在下行探测帧时隙依次给各从属节点发送接纳响应,调整从属节点的上行发送功率增益;(8a) The central node sends an acceptance response to each slave node in turn in the downlink detection frame time slot, and adjusts the uplink transmission power gain of the slave node;

(8b)从属节点在接纳周期内的Q个上行探测帧时隙发送上行探测帧;(8b) The slave node sends an uplink detection frame in Q uplink detection frame time slots within the acceptance period;

(8c)中心节点利用上行探测帧中的训练序列信号确定上行信道参数,将从属节点接纳到当前网络。(8c) The central node uses the training sequence signal in the uplink detection frame to determine the uplink channel parameters and accept the slave node into the current network.

本发明与现有技术相比具有如下优点:Compared with the prior art, the present invention has the following advantages:

本发明由于根据已有的接纳成功节点来估计总的从属节点数,且根据预估值动态实时调整每次竞争期的时长,可使竞争期的选择更加符合当前请求接纳的节点数,避免了由于竞争期选择不恰当导致接纳时延长的情况,减小了接纳总时延。Since the present invention estimates the total number of subordinate nodes based on the existing successfully accepted nodes and dynamically adjusts the duration of each contention period in real time based on the estimated value, the selection of the contention period can be made more consistent with the number of nodes currently requesting acceptance, thereby avoiding the situation in which the acceptance time is prolonged due to inappropriate selection of the contention period and reducing the total acceptance delay.

附图说明BRIEF DESCRIPTION OF THE DRAWINGS

图1为本发明的实现流程图;Fig. 1 is a flow chart of the implementation of the present invention;

图2为本发明中的接纳周期结构图。FIG. 2 is a diagram showing the structure of the receiving cycle in the present invention.

具体实施方式Detailed ways

下面结合附图及实施例对本发明做进一步的详细描述。The present invention is further described in detail below in conjunction with the accompanying drawings and embodiments.

本实施例中,星型接入网络由一个中心节点和28个从属节点组成,且在该星型接入网络将加入有新上电的24个从属节点N1、N2…N24In this embodiment, the star access network is composed of a central node and 28 slave nodes, and 24 newly powered-on slave nodes N 1 , N 2 . . . N 24 will be added to the star access network.

参照图1,本实施例的实现步骤如下:Referring to FIG. 1 , the implementation steps of this embodiment are as follows:

步骤1,划分接纳周期。Step 1: Divide the acceptance cycle.

将信道在时间上划分成多个连续的且互不重叠的时间段,将每一个时间段作为一个接纳周期,该接纳周期的时间长度由用户根据需求设置为定长或不定长。The channel is divided into multiple continuous and non-overlapping time periods in time, and each time period is used as an admission cycle. The length of the admission cycle is set by the user to be fixed or variable according to needs.

在本实施例中,接纳周期的时间长度是固定的,设为65536uS。In this embodiment, the duration of the reception period is fixed and is set to 65536uS.

步骤2,规划不同用途的时隙。Step 2: Plan time slots for different purposes.

2.1)将每个接纳周期的起始时刻,作为下行探测帧时隙的起始时刻,中心节点利用下行探测帧时隙,发送承载下行媒质接入控制MAC层信令帧的下行物理层探测帧;2.1) The starting time of each reception period is used as the starting time of the downlink detection frame time slot. The central node uses the downlink detection frame time slot to send a downlink physical layer detection frame carrying a downlink medium access control MAC layer signaling frame;

2.2)将每个接纳周期的其余部分8等分,将每个等分的起点作为每个上行探测帧时隙的起始时刻,从属节点利用上行探测帧时隙,发送承载上行媒质接入控制MAC层信令帧的上行物理层探测帧。2.2) Divide the rest of each reception cycle into 8 equal parts, and use the starting point of each equal part as the starting time of each uplink detection frame time slot. The slave node uses the uplink detection frame time slot to send an uplink physical layer detection frame carrying an uplink medium access control MAC layer signaling frame.

图2是本发明实施例的接纳周期,其包含1个下行探测帧时隙和8个上行探测帧时隙。FIG. 2 is an admission period according to an embodiment of the present invention, which includes one downlink detection frame time slot and eight uplink detection frame time slots.

步骤3,从属节点调整接收功率增益,并确定下行物理层信道参数。Step 3: The slave node adjusts the receiving power gain and determines the downlink physical layer channel parameters.

3.1)中心节点在下行探测帧时隙持续发送下行探测帧,各从属节点检测持续接收的下行探测帧的信号,并记录;3.1) The central node continuously sends downlink detection frames in the downlink detection frame time slot, and each slave node detects the signal of the downlink detection frame continuously received and records it;

3.2)从属节点调整其接收功率的增益:3.2) The slave node adjusts its received power gain:

(3.2a)将从属节点的初始接收功率增益设置为最大值;(3.2a) Set the initial receive power gain of the slave node to the maximum value;

(3.2b)在规定时间内收到校验错误的下行探测帧信号或者未收到下行探测帧信号时,减小其接收功率增益,继续检测接收到的下行探测帧信号;(3.2b) when a downlink detection frame signal with a check error is received within a specified time or no downlink detection frame signal is received, the receiving power gain is reduced and the received downlink detection frame signal is continued to be detected;

(3.2c)重复(3.2b)直至从属节点可以接收到校验正确的下行信令帧信号,此时的接收功率增益为最佳;(3.2c) Repeat (3.2b) until the slave node can receive the verified downlink signaling frame signal, and the receiving power gain is optimal at this time;

3.3)从属节点利用信道参数估计方法确定下行物理层信道参数,即从接收到的正确下行探测帧信号中提取出首部,对首部中的前导序列进行解析计算可得到帧同步信号和频率同步信号。3.3) The slave node determines the downlink physical layer channel parameters using the channel parameter estimation method, that is, extracts the header from the received correct downlink detection frame signal, and parses and calculates the leading sequence in the header to obtain the frame synchronization signal and the frequency synchronization signal.

步骤4,选择竞争期时长。Step 4: Select the duration of the competition period.

4.1)将M个接纳周期组成竞争期,将第一次、第二次竞争期时长即M选择为固定值;4.1) M acceptance cycles are composed of a contention period, and the duration of the first and second contention periods, i.e., M, is selected as a fixed value;

4.2)中心节点根据前两个竞争期内成功接纳的节点数量估计当前竞争期等待接纳的从属节点数N,N取[0,64]之间的整数,N为0即表示已经接纳完成;在每个竞争期内,上行探测帧时隙为M*Q,通过仿真得到n个节点成功接纳的概率近似值P,仿真过程如下;4.2) The central node estimates the number of slave nodes N waiting to be accepted in the current contention period based on the number of nodes successfully accepted in the previous two contention periods. N is an integer between [0,64]. N is 0, which means that the acceptance has been completed. In each contention period, the uplink detection frame time slot is M*Q. The probability approximation P of n nodes successfully accepted is obtained through simulation. The simulation process is as follows;

(4.2a)在竞争期内有M*Q个上行探测帧时隙,等待发送接纳请求的从属节点有N个,N取[0,64]之间的整数;(4.2a) During the contention period, there are M*Q uplink detection frame time slots, and there are N slave nodes waiting to send admission requests, where N is an integer between [0,64];

(4.2b)每个从属节点相互独立并且随机选择竞争期内的一个上行探测帧时隙发送接纳请求;(4.2b) Each slave node independently and randomly selects an uplink detection frame time slot within the contention period to send an admission request;

(4.2c)竞争期结束时,统计竞争期内只有一个接纳请求的上行探测帧时隙的数量,即该次竞争期内成功接纳的节点数n,n为非负整数;(4.2c) At the end of the contention period, the number of uplink detection frame time slots with only one admission request during the contention period is counted, that is, the number of nodes successfully admitted during the contention period, n, where n is a non-negative integer;

(4.3d)重复(4.2b)-(4.2c)若干次,统计成功接纳n个从属节点出现的次数,便可得到在竞争期为M个接纳周期时,N个等待接纳的从属节点成功接纳n个的概率近似值P,其中重复次数越多P越精确;(4.3d) Repeat (4.2b)-(4.2c) several times, and count the number of times that n slave nodes are successfully accepted. Then, we can get the approximate probability P of N slave nodes waiting for acceptance successfully accepting n slave nodes when the contention period is M acceptance cycles. The more repetitions, the more accurate P is.

4.3)找出满足max(Pn1*Pn2)成立的最佳N,其中n1、n2分别为前两个竞争期内各自成功接纳的从属节点数,且均为非负整数,N为当前竞争期等待接纳的从属节点数;4.3) Find the best N that satisfies max(P n1 *P n2 ), where n1 and n2 are the numbers of slave nodes successfully accepted in the first two contention periods, respectively, and both are non-negative integers, and N is the number of slave nodes waiting to be accepted in the current contention period;

4.4)根据N选择竞争期时长,即按照如下规则确定M值;4.4) Select the contention period duration according to N, that is, determine the value of M according to the following rules;

当1≤N≤11时,M=1;当12≤N≤19时,M=2;When 1≤N≤11, M=1; when 12≤N≤19, M=2;

当20≤N≤27时,M=3;当28≤N≤35时,M=4;When 20≤N≤27, M=3; when 28≤N≤35, M=4;

当36≤N≤43时,M=5;当44≤N≤51时,M=6;When 36≤N≤43, M=5; when 44≤N≤51, M=6;

当52≤N≤59时,M=7;当60≤N≤64时,M=8。When 52≤N≤59, M=7; when 60≤N≤64, M=8.

本实例选第1次、第2次的竞争期均为1个接纳周期,即M=1;中心节点根据前两个竞争期内成功接纳的节点数量估计当前竞争期等待接纳的从属节点数,假设第1次成功接纳节点n1=2,第2次成功接纳节点n2=1,通过仿真得到在上行探测帧时隙数为1*8时,n1、n2个节点成功接纳的概率近似值Pn1、Pn2,按照max(Pn1*Pn2)进行筛选,估计出当前竞争期等待接纳的从属节点数N=19;根据N选择竞争期时长的规则取M=2,即竞争期为2个接纳周期。In this example, the first and second contention periods are both selected as 1 acceptance cycle, that is, M=1; the central node estimates the number of slave nodes waiting for acceptance in the current contention period based on the number of nodes successfully accepted in the first two contention periods. Assuming that the first successfully accepted node n1 =2 and the second successfully accepted node n2 =1, the approximate probabilities Pn1 and Pn2 of successful acceptance of n1 and n2 nodes are obtained through simulation when the number of uplink detection frame time slots is 1*8. According to max( Pn1 * Pn2 ), screening is performed to estimate the number of slave nodes waiting for acceptance in the current contention period to be N=19; according to the rule of selecting the contention period duration, M=2 is taken, that is, the contention period is 2 acceptance cycles.

步骤5,中心节点发送下行探测帧,从属节点发送接纳请求。Step 5: The central node sends a downlink detection frame, and the slave node sends an admission request.

5.1)在竞争期内,中心节点在下行探测帧时隙发送下行探测帧,通告各从属节点可从竞争期内随机选择一个接纳周期;5.1) During the contention period, the central node sends a downlink detection frame in the downlink detection frame time slot, notifying each slave node that it can randomly select an acceptance period from the contention period;

5.2)每个从属节点接收下行探测帧,并从所选接纳周期内的8个上行探测帧时隙中随机选择一个上行探测帧时隙,发送接纳请求;5.2) Each slave node receives the downlink detection frame and randomly selects an uplink detection frame time slot from the 8 uplink detection frame time slots in the selected admission period and sends an admission request;

第1次竞争期中:First round of competition:

从属节点5从8个上行探测帧时隙中随机选择第3个上行探测帧时隙发送接纳请求;The slave node 5 randomly selects the third uplink detection frame time slot from the eight uplink detection frame time slots to send an admission request;

从属节点2从8个上行探测帧时隙中随机选择第5个上行探测帧时隙发送接纳请求;The slave node 2 randomly selects the fifth uplink detection frame time slot from the eight uplink detection frame time slots to send an admission request;

其余从属节点均从8个上行探测帧时隙中随机选择第6个上行探测帧时隙发送接纳请求;The remaining slave nodes randomly select the sixth uplink detection frame time slot from the eight uplink detection frame time slots to send an admission request;

第2次竞争期中:Second round of competition:

从属节点9从8个上行探测帧时隙中随机选择第3个上行探测帧时隙发送接纳请求;The slave node 9 randomly selects the third uplink detection frame time slot from the eight uplink detection frame time slots to send an admission request;

其余未成功接纳的21个从属节点从8个上行探测帧时隙中随机选择第5个上行探测帧时隙发送接纳请求;The remaining 21 slave nodes that have not been successfully admitted randomly select the fifth uplink detection frame time slot from the eight uplink detection frame time slots to send an admission request;

第3次竞争期中:The third competition period:

从属节点10从竞争期中的第一个接纳周期的8个上行探测帧时隙中随机选择第4个上行探测帧时隙发送接纳请求;The slave node 10 randomly selects the fourth uplink detection frame time slot from the eight uplink detection frame time slots of the first admission cycle in the contention period to send an admission request;

从属节点19从竞争期中的第一个接纳周期的8个上行探测帧时隙中随机选择第1个上行探测帧时隙发送接纳请求;The slave node 19 randomly selects the first uplink detection frame time slot from the eight uplink detection frame time slots of the first admission cycle in the contention period to send an admission request;

从属节点17从竞争期中的第二个接纳周期的8个上行探测帧时隙中随机选择第2个上行探测帧时隙发送接纳请求;The slave node 17 randomly selects the second uplink detection frame time slot from the eight uplink detection frame time slots of the second admission cycle in the contention period to send an admission request;

从属节点21从竞争期中的第一个接纳周期的8个上行探测帧时隙中随机选择第8个上行探测帧时隙发送接纳请求;The slave node 21 randomly selects the 8th uplink detection frame time slot from the 8 uplink detection frame time slots of the first admission cycle in the contention period to send an admission request;

从属节点23从竞争期中的第一个接纳周期的8个上行探测帧时隙中随机选择第2个上行探测帧时隙发送接纳请求;The slave node 23 randomly selects the second uplink detection frame time slot from the eight uplink detection frame time slots of the first admission cycle in the contention period to send an admission request;

其余未成功接纳的从属节点从竞争期中的第二个接纳周期的8个上行探测帧时隙中随机选择第4个上行探测帧时隙发送接纳请求;The remaining slave nodes that have not been successfully admitted randomly select the fourth uplink detection frame time slot from the eight uplink detection frame time slots of the second admission cycle in the contention period to send an admission request;

之后每次竞争时根据步骤4确定竞争期时长,并且重复步骤5直至全部从属节点接纳完成。In each subsequent contention, the contention period is determined according to step 4, and step 5 is repeated until all slave nodes have been accepted.

步骤6,中心节点决定各从属节点的接纳顺序并进行通告。Step 6: The central node determines the order of acceptance of each slave node and makes a notification.

中心节点按照接收到接纳请求的先后顺序,在下行媒质接入控制MAC层信令帧中填入可以被接纳的从属节点ID,并在下行探测帧时隙广播发送该信令帧,向各从属节点通告节点接纳顺序:The central node fills in the IDs of the slave nodes that can be accepted in the downlink media access control MAC layer signaling frame in the order in which the admission requests are received, and broadcasts the signaling frame in the downlink detection frame time slot to inform each slave node of the node acceptance order:

中心节点在第3个上行探测帧时隙收到了从属节点5发送的接纳请求,故中心节点将从属节点5的节点ID填入下行媒质接入控制MAC层信令帧;The central node receives the admission request sent by the slave node 5 in the third uplink detection frame time slot, so the central node fills the node ID of the slave node 5 into the downlink medium access control MAC layer signaling frame;

中心节点在第5个上行探测帧时隙收到了从属节点2发送的接纳请求,故中心节点将从属节点2的节点ID填入下行媒质接入控制MAC层信令帧,并置于从属节点5的节点ID之后;The central node receives the admission request sent by slave node 2 in the fifth uplink detection frame time slot, so the central node fills the node ID of slave node 2 into the downlink media access control MAC layer signaling frame and places it after the node ID of slave node 5;

由于其余从属节点的接纳请求均在第6个上行探测帧时隙发生冲突,故中心节点在第6个上行探测帧时隙没有收到上行探测帧,中心节点不做任何处理;Since the admission requests of the remaining slave nodes all collide in the 6th uplink detection frame time slot, the central node does not receive the uplink detection frame in the 6th uplink detection frame time slot, and the central node does not perform any processing;

中心节点通过广播向各从属节点通告从属节点2和从属节点5可以被接纳,且按照从属节点5、从属节点2的顺序进行接纳。The central node notifies each slave node through broadcasting that slave node 2 and slave node 5 can be accepted, and the acceptance is carried out in the order of slave node 5 and slave node 2.

步骤7,从属节点判断下行媒质接入控制MAC层信令帧中是否存在自身节点的ID:Step 7: The slave node determines whether the ID of its own node exists in the downlink media access control MAC layer signaling frame:

若是,执行步骤8;If yes, go to step 8;

否则,等待下行媒质接入控制MAC层信令帧中通报的所有从属节点的接纳流程结束后返回步骤4。Otherwise, after waiting for the acceptance process of all slave nodes notified in the downlink medium access control MAC layer signaling frame to be completed, return to step 4.

本发明的实施例中,从属节点5从接收到的下行媒质接入控制MAC层信令帧中查询到自身节点的ID,得知自己的接纳请求发送成功,且自己为第一个等待接纳的从属节点;In the embodiment of the present invention, the slave node 5 inquires about its own node ID from the received downlink media access control MAC layer signaling frame, and learns that its admission request is sent successfully and that it is the first slave node waiting for admission;

从属节点2从接收到的下行媒质接入控制MAC层信令帧中查询到自身节点的ID,得知自己的接纳请求发送成功,且自己为第二个等待接纳的从属节点;Slave node 2 queries its own node ID from the received downlink media access control MAC layer signaling frame, and learns that its admission request is sent successfully and that it is the second slave node waiting for admission;

其余从属节点从接收到的下行媒质接入控制MAC层信令帧中没有查询到自身节点的ID,得知自己的接纳请求发送失败。其余从属节点等待下行媒质接入控制MAC层信令帧中通报的所有从属节点的接纳流程结束后返回步骤5。The remaining slave nodes do not find their own node IDs in the received downlink media access control MAC layer signaling frame, and learn that their admission requests have failed. The remaining slave nodes wait for the admission process of all slave nodes notified in the downlink media access control MAC layer signaling frame to complete, and then return to step 5.

步骤8,中心节点按顺序依次接纳各从属节点。Step 8: The central node accepts each slave node in sequence.

8.1)中心节点在下行探测帧时隙依次给各从属节点发送接纳响应,并采用与与步骤3.2)相同的方法调整从属节点的上行发送功率增益;8.1) The central node sends an acceptance response to each slave node in turn in the downlink detection frame time slot, and adjusts the uplink transmission power gain of the slave node in the same way as step 3.2);

8.2)从属节点在接纳周期内的8个上行探测帧时隙同时发送上行探测帧;8.2) The slave node sends uplink detection frames simultaneously in the 8 uplink detection frame time slots within the acceptance period;

8.3)中心节点利用上行探测帧中的训练序列信号参用与步骤3.3)相同的方法确定上行信道参数,并将从属节点接纳到当前网络。8.3) The central node uses the training sequence signal in the uplink detection frame to determine the uplink channel parameters using the same method as step 3.3), and accepts the slave node into the current network.

本发明的实施例中,中心节点按照从属节点5、从属节点2的顺序将两个从属节点接纳到星型接入网络,之后从属节点2和从属节点5可与网络中其他节点进行正常的数据通信。In the embodiment of the present invention, the central node accepts two slave nodes into the star access network in the order of slave node 5 and slave node 2, and then slave node 2 and slave node 5 can perform normal data communication with other nodes in the network.

以上描述仅是本发明的一个具体实例,不构成对本发明的任何限制,显然对于本领域的专业人员来说,在了解了本发明内容和原理后,都可能在不背离本发明原理、结构的情况下,进行形式和细节上的各种修正和改变,但是这些基于本发明思想的修正和改变仍在本发明的权利要求的保护范围之内。The above description is only a specific example of the present invention and does not constitute any limitation to the present invention. It is obvious that for professionals in this field, after understanding the content and principles of the present invention, they may make various modifications and changes in form and details without departing from the principles and structures of the present invention. However, these modifications and changes based on the ideas of the present invention are still within the scope of protection of the claims of the present invention.

Claims (6)

1. An admission method based on unknown number of node competition ordering, which is characterized by comprising the following steps:
(1) Dividing the 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 starting time of each admission period is used as the starting time of a downlink detection frame time slot, and a central node transmits a downlink physical layer detection frame carrying a downlink Medium Access Control (MAC) layer signaling frame by using the downlink detection frame time slot;
(2b) Dividing the rest part Q of each admission period equally, taking the starting point of each equal division as the starting time of each uplink detection frame time slot, and transmitting an uplink physical layer detection frame carrying an uplink Medium Access Control (MAC) layer signaling frame by a subordinate node by using the uplink detection frame time slot;
(3) The slave node adjusts the receiving power gain and determines the channel parameters of the downlink physical layer:
(3a) The central node continuously transmits downlink detection frames in downlink detection frame time slots, and each subordinate node detects the continuously received downlink detection frames;
(3b) The slave node records the detected downlink detection frame and adjusts the gain of the received power by using a gain adjustment method;
(3c) The slave node determines the channel parameters of the downlink physical layer by using a channel parameter estimation method;
(4) Selecting a length of a contention period
(4A) M admission periods are formed into a competition period, and the duration of the first competition period and the duration of the second competition period, namely M, are selected as fixed values;
(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, N is an integer between [0,64], namely, in each competition period, the time slot of an uplink detection frame is M x Q, and the probability approximate value P of successful admission of N nodes is obtained through simulation;
(4c) Finding out the optimal N meeting the establishment of max (P n1*Pn2), wherein N1 and N2 are the number of slave nodes successfully admitted in the first 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 competitive period duration according to N, namely determining an M value;
(5) The center node sends a downlink detection frame, and the slave node sends an admission request:
(5a) In the competition period, the central node transmits a downlink detection frame in a downlink detection frame time slot, and notifies each subordinate node to randomly select an admission period from the competition period;
(5b) Each slave node receives the downlink detection frame, randomly selects one uplink detection frame time slot from Q uplink detection frame time slots in the selected admission period, and sends an admission request;
(6) The central node fills the admitted subordinate node ID into the downlink medium access control MAC layer signaling frame according to the sequence of receiving the admission request; encapsulating the downlink Medium Access Control (MAC) layer signaling frame into a downlink detection frame, broadcasting and transmitting the downlink detection frame in a downlink detection frame time slot, and informing each subordinate node of node admission sequence;
(7) The subordinate node judges whether the ID of the self node exists in the downlink Medium Access Control (MAC) layer signaling frame or not:
If yes, executing (8);
otherwise, waiting for the admission flow of all the slave nodes notified in the downlink Medium Access Control (MAC) layer signaling frame to return (4) after finishing;
(8) The central node sequentially receives the subordinate nodes:
(8a) The central node sequentially transmits admission response to each slave node in the downlink detection frame time slot, and adjusts the uplink transmission power gain of the slave node;
(8b) The slave node transmits an uplink detection frame in Q uplink detection frame time slots in the admission period;
(8c) The central node uses the training sequence signal in the uplink detection frame to determine the uplink channel parameter, and the slave node is admitted to the current network.
2. The method of claim 1, wherein the admission period in (1) is set to a fixed length or an indefinite length by a user according to the need.
3. The method of claim 1, wherein the slave node in (3 b) adjusts the gain of its received power using a gain adjustment method by:
(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 set time, the receiving power gain of the downlink detection frame signal is reduced, and the received downlink detection frame signal is continuously detected;
(3b3) Repeating (3 b 2) until the subordinate node receives the downlink signaling frame signal with correct verification, and the receiving power gain at the moment is the best.
4. The method of claim 1, wherein the slave node in (3 c) determines channel parameters of the downlink physical layer by using a channel parameter estimation method, which is implemented as follows:
(3c1) Extracting the head of the received correct downlink detection frame signal to obtain a preamble sequence;
(3c2) Analyzing the preamble sequence to obtain physical layer channel parameters, including: frame synchronization signal, frequency synchronization signal.
5. The method according to claim 1, wherein the probability approximation P of successful admission of the n slave nodes is obtained in (4 b) by simulation, the simulation being as follows:
(4b1) In the competition period, M.Q uplink detection frame time slots exist, N slave nodes waiting for sending admission requests exist, and N is an integer between [0,64 ];
(4b2) Each slave node is mutually independent and randomly selects one uplink detection frame time slot in the competition period to send an admission request;
(4b3) Counting the number of uplink detection frame time slots with only one admission request in the contention period when the contention period is over, namely, the number n of nodes successfully admitted in the contention period, wherein n is a non-negative integer;
(4b4) Repeating (4 b 2) and (4 b 3) for a plurality of times, counting the occurrence times of successfully admitting N slave nodes, and obtaining probability approximate values P of successfully admitting N slave nodes waiting for admission when the competition period is M admission periods, wherein the more the repetition times are, the more accurate the P is.
6. The method of claim 1, wherein the selecting the contention period duration, i.e., the M value, according to N in (4 d) is performed according to the following rule:
When 1.ltoreq.N.ltoreq.11, M=1; when 12.ltoreq.N.ltoreq.19, M=2;
When 20.ltoreq.N.ltoreq.27, M=3; when 28.ltoreq.N.ltoreq.35, M=4;
when 36.ltoreq.N.ltoreq.43, M=5; when 44.ltoreq.N.ltoreq.51, M=6;
when 52.ltoreq.N.ltoreq.59, M=7; when 60.ltoreq.N.ltoreq.64, M=8.
CN202210272030.2A 2022-03-18 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 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 2022-03-18 Competition ordering and admitting method based on unknown number of nodes

Publications (2)

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

Family

ID=81902658

Family Applications (1)

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

Country Status (1)

Country Link
CN (1) CN114630434B (en)

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
Design of HIMAC coprocessor for HINOC3.0;H.Jinjian et al;《IEEE ICCCS》;20211231;全文 *
一种宽带接入网络中的节点接纳方法;齐晓鑫;《西安电子科技大学学报》;20200820;全文 *
万兆同轴宽带接入系统MAC机制与设计;张陆晶;《中国优秀硕士学位论文全文数据库》;20200215;全文 *

Also Published As

Publication number Publication date
CN114630434A (en) 2022-06-14

Similar Documents

Publication Publication Date Title
CN114788400B (en) Coordinated WIFI stations with shared TXOP in time domain
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
JP2023525062A (en) Coordination of Stations in an OBSS Sharing a TXOP in the Frequency Domain
US11122624B2 (en) Pre-packet arrival channel contention
CN109831831B (en) Node admission method based on competition sequencing
CN116684985A (en) Wireless communication terminal and wireless communication method for multi-user EDCA operation
KR101689364B1 (en) METHOD AND APPARATUS FOR ENERGY ADAPTIVE RESOURCE ALLOCATION IN AN ENERGY HARVESTING IoT NETWORKS
KR101328284B1 (en) Apparatus and method of establishing contention window in wimedia wireless network
CN102036389B (en) Implementation of Cognitive MAC Protocol Based on Multi-Channel Diversity
JP7679488B2 (en) Sharing EDCA TXOP with RTA traffic
CN111328052B (en) Channel resource allocation method in high-density wireless network
CN113329439B (en) Resource allocation method based on transmission delay
KR20240056635A (en) Multi-link limited TWT
JP2023551336A (en) Coordination of WIFI stations using shared TXOP between DL and UL over time domain
CN112398806B (en) Underwater acoustic network MAC protocol generation method based on state coloring
CN118077256B (en) System and computer readable medium for silence interval expiration
CN106936557B (en) Wireless channel resource allocation method
CN105376830A (en) Upstream access method combing channel binding with orthogonal frequency division multiple access
WO2017220011A1 (en) Orthogonal frequency-division multiple access-based uplink access method
CN107926061B (en) A backoff method, message transmission method and device
Wang et al. Restricted access window based hidden node problem mitigating algorithm in IEEE 802.11 ah networks
CN104066206B (en) A kind of cooperation Medium Access Control Protocol based on the selection of double priority
CN114630434B (en) Competition ordering and admitting method based on unknown number of nodes
CN101141176B (en) Distributed acquisition multi-access method
CN106550481B (en) wireless network medium access control layer access method and system based on competition

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
GR01 Patent grant