CN115413043A - Data link self-organizing access control method based on control sequence - Google Patents
Data link self-organizing access control method based on control sequence Download PDFInfo
- Publication number
- CN115413043A CN115413043A CN202211041036.5A CN202211041036A CN115413043A CN 115413043 A CN115413043 A CN 115413043A CN 202211041036 A CN202211041036 A CN 202211041036A CN 115413043 A CN115413043 A CN 115413043A
- Authority
- CN
- China
- Prior art keywords
- sequence
- control
- access
- control sequence
- network
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000001228 spectrum Methods 0.000 claims abstract description 4
- 230000005540 biological transmission Effects 0.000 claims description 16
- 230000009191 jumping Effects 0.000 claims description 3
- 230000001360 synchronised effect Effects 0.000 claims description 3
- 150000001875 compounds Chemical class 0.000 claims 1
- 238000004891 communication Methods 0.000 abstract description 14
- 238000010276 construction Methods 0.000 abstract description 2
- 238000005516 engineering process Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000003068 static effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000036039 immunity Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/08—Access security
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Time-Division Multiplex Systems (AREA)
Abstract
The invention discloses a control sequence-based data link self-organizing access control method, which comprises the following steps: a user finds out a working channel where a network is located through spectrum sensing; a user autonomously selects an idle control sequence and prepares to access a data chain according to any time slot of the selected control sequence; and the users in the network use the pseudo-randomly hopping time slots in different time frame periods according to the selected control sequences. Each network group in the control sequence construction method is also provided with a control center, and the control center sets the control sequence when initializing
In (1)
Sequence of thingsThe columns are divided into two sets of,
and
and is and
，
the method is used for allocating idle control sequences and corresponding specific access time frames to users in the network. The method provides the autonomous random access data link for the user, realizes the theoretical maximum utilization rate of the time slot resources, and solves the problems of insufficient and inflexible utilization of the time slot resources, poor interception resistance and interception resistance, unstable communication link and the like existing in the data link access control scheme.
Description
Technical Field
The invention relates to the technical field of data transmission and network communication, in particular to a control sequence-based data link self-organizing access control method.
Background
The data link is an air-space-ground integrated tactical wireless data communication system which transmits and processes digital information in real time in a bit-oriented mode among a command control system, a sensor platform and a weapon platform according to a specified message standard and a communication protocol. It is essentially a real-time distribution, secure, tamper-resistant data communications network.
Time Division Multiple Access (TDMA) is one of the most important access control techniques in data link systems, in which architecture the network time is divided into periods, time frames and time slots. A slot is a basic unit of access to a data link network. In the channel access strategy of the existing TDMA system, there are two main categories of the channel access control scheme based on "contention" and the channel access control scheme based on "collision avoidance".
The contention-based channel access scheme mainly adopts the technologies of carrier sense, backoff wait, error retransmission and the like, and nodes needing to access a channel compete for the channel use right through a backoff algorithm. Along with the increase of the service load transmitted by users in the network, the probability of packet collision can be greatly increased, and meanwhile, the users can use fixed time slots for communication after channel resources are distributed for a period of time, so that the users do not have the anti-interception capability.
The collision avoidance type channel access technique, under the control of an allocation type channel access algorithm, nodes in the network transmit data traffic using the allocated one or more time slots. The techniques can be classified into static channel access control, dynamic channel access control and deterministic access control according to different time slot allocation modes.
The static channel access technology adopts a centralized time slot allocation mode to allocate a fixed amount of time slot resources to each node. The control mode is not flexible, and the time slot resource is not fully utilized. The dynamic TDMA channel access technology dynamically calculates the number of time slots required by the nodes, and each node can acquire required time slot resources by adopting a distributed time slot allocation mode, but a large amount of control overhead is caused to the system in the implementation process. For the conditions of large density and large number of network users and frequent and rapid change of a topological structure, the stability of a communication link cannot be ensured.
Deterministic channel access control techniques provide for each node to schedule the times at which data is transmitted and received according to a deterministic sequence that is assigned in advance. Compared with other access TDMA channel access protocols, the deterministic channel access protocol does not need channel feedback information and strict clock synchronization, is simple to realize, and can improve the resource utilization rate and reduce the hardware cost of nodes. The deterministic channel access control technique is mainly based on the protocol sequence, the collision avoidance code, the frequency/time hopping sequence and the control sequence to realize the access control.
In the protocol sequence, each network node transmits data according to the allocated protocol sequence, so that the data can be successfully transmitted within fixed time delay, and good short-term communication performance fairness and stability are provided. The collision avoidance code is used to ensure that each node can successfully transmit data at least once in a sequence period under the condition of time slot synchronization. The frequency/time hopping sequence is a q-ary pseudo-random sequence with good interference immunity, and the design goal is to ensure that any pair of transceivers can converge on a common channel for all delay offsets in a cycle. However, access schemes based on protocol sequences, collision avoidance codes, and frequency/time hopping sequences, do not guarantee a completely collision-free transmission in the same time frame.
The control sequence is a q-element pseudo-random sequence which is oriented to a data chain and has zero correlation, zero time delay and non-periodic characteristics. The time slots of each user in the data chain are allocated by using the control sequence based on the control scheme without using a channel monitoring, a back-off algorithm or a packet retransmission technology in the traditional channel access scheme. On the other hand, the time slots used by any node in different time frames are selected pseudo-randomly according to the control sequence. By using the control sequence, the user can realize collision-free transmission in each time frame, and the terminal user can randomly and uniformly select the time slot hopped in the continuous frames, thereby improving the utilization rate of resources to the maximum extent.
Random access control of time slots makes it difficult for an interceptor to intercept a user by tracking "fixed" time slots. Particularly in a multi-user scene, the interceptor considers that the access is the unordered access of a group of users, and cannot distinguish time slots of different users, so that the interception resistance of the network is greatly improved. In addition, the data link access control method based on the control sequence can optimize the system capacity. In particular, when the access sequences are sufficiently evenly distributed, a maximization of the slot resource utilization may be achieved.
According to the requirement of the data chain system, the control sequence set has the following characteristics:
(1) The time slot set size k of the control sequence corresponds to the time slot number of the unit time frame of the system, and each time slot of the unit time frame is ensured to be used with opportunity;
(2) The length N of the control sequence should be long enough (N → ∞) to satisfy the number of time frames required for information transfer;
(3) The number M of the sequences of the control sequence set is large enough (M is less than or equal to k) so as to meet the requirement that more users can simultaneously use different control sequences to access a network, thereby improving networking capability and realizing multi-address communication;
(4) The control sequences need to meet the collision-free performance, namely the Hamming cross-correlation of different sequences is 0, so as to avoid time slot collision among users;
(5) The use of time slots satisfies the uniformity, i.e. each time slot t i (i is more than or equal to 1 and less than or equal to k) the probability of occurrence in one period N is equal, so as to ensure the utilization rate of time slot resources;
(6) The control sequence needs to have excellent randomness and complexity to ensure good anti-interception performance.
Disclosure of Invention
Based on the defects of the prior contention-based channel access technology and the prior conflict avoidance type channel access technology, the invention provides a control sequence-based data link self-organizing access control method, which has the following specific technical scheme:
a data chain self-organizing access control method based on a control sequence comprises the following steps:
a user finds out a working channel where a network is located through spectrum sensing;
a user autonomously selects an idle control sequence and prepares to access a data chain according to any time slot of the selected control sequence;
and the users in the network use the time slots of pseudo-random hopping in different time frame periods according to the selected control sequences.
The method uses a control sequence set S = S i ＝(s i (1)，s i (2)，...，s i (n)), 1 ≦ i ≦ M access control, the access control method comprising the steps of:
user selection of sequence s 1 As a control sequenceColumn, starting with time frame # 1, using time slot s 1 (1)，s 1 (2)，...，s 1 (n) transmitting information in time slots used in different subsequent time frames according to the control sequence s 1 Random jumping is carried out to ensure the safety of information transmission;
user selection of sequence s x As a control sequence, time slot s is used from time frame # 1 to time frame # i-1 x (1)，s x (2)，...，s x (i-1) transmitting information. The user finishes the current transmission in the time frame # i-1, quits the network and sends the sequence s x Release, control sequence s x Can be used by the users who access the network later;
user selects sequence s from idle sequence in time frame # i-1 M As a control sequence, time slot s may be used from any time frame thereafter M (1)，s M (2)，...，s M (n) performing information transmission;
the user accesses the network in time frame # i, selects sequence s from the idle sequence x As a control sequence, time slot s may be used from any time frame thereafter x (1)，s x (2)，...，s x And (n) carrying out information transmission.
Specifically, the method for constructing the control sequence includes a control sequence set algorithm:
step A: given the value of the prime number M, a base sequence b = (b) is initialized 0 ，b 1 ，...，b M-1 ) Each element in the sequence satisfies the condition:
and all elements b in b i ∈ (0，1，...，M-1)；
And B: given the integer θ, gcd (M, θ) =1, a shifted sequence set is constructed
Wherein, when j is more than or equal to 0 and less than M,
when M is less than or equal to j and less than M (M-1),
and C: given the integer k, Z = k | M, and given the integer α, gcd (k, α) =1; constructing a control sequence set
Specifically, a control center is arranged in each network group in the data chain, and the control center divides M sequences in a control sequence set C into two sets when initializing, wherein C is A And C B And | C A |＝Z，|C B L = M-Z for assigning control sequences and corresponding specific access time frames to users in the network.
In particular, the idle control sequence is from C A Is selected from, if C A If there is a free control sequence in the control sequence, user u x From C A In (b) select sequence c x And choose to access with C A The difference of the access time frames of other users is not the time frame of integral multiple of Z;
if C A Has no idle sequence in, then the slave C B In which a sequence and its access time frame are allocated to u x And is combined with C A A certain existing access time frame and u x Is an integer multiple of Z.
Specifically, the method for controlling network quit comprises the following steps:
step 1: user u x A network quit request is sent to a control center;
and 2, step: the control centre checks the sequence c it uses x Whether or not to belong to C B If so, directly release the sequence c x (ii) a If not, performing the step 3;
and 3, step 3: if c is x Is a member of C A Then search for C B Whether or not there is a x Synchronized users u y . If so, release sequence c x And let c x ∈C B ，c y ∈C A (ii) a If not, directly releasing the sequence c x 。
The invention has the beneficial effects that:
the invention aims to solve the problems of insufficient and inflexible utilization of time slot resources, poor interception and interception resistance, unstable communication link and the like in a data link access control scheme. The method can realize the random network access of the user, can also utilize the time slot resource to the maximum extent to realize the maximization of the network channel capacity, and can realize the interception resistance, the interception resistance and the safety confidentiality of the message through the difference of the stealing channels. Meanwhile, the data link based on the control sequence also has flexible control and can be expanded into a control mode without a central node; the communication link is stable; the method has the advantages of simple implementation, low system overhead and the like. Therefore, the data link security access control scheme based on the control sequence is a time slot control method which has the characteristics of strong anti-interception capability, flexible time slot control, high utilization rate, stable communication link and the like.
Drawings
Fig. 1 is a schematic diagram illustrating a data chain ad hoc model access control according to the present invention.
Fig. 2 is a schematic diagram of the ad hoc network access process based on the control sequence according to the present invention.
Fig. 3 is a schematic diagram illustrating a self-organizing logout process based on a control sequence according to the present invention.
Detailed Description
In order to more clearly understand the technical features, objects, and effects of the present invention, embodiments of the present invention will now be described with reference to the accompanying drawings.
The invention provides a control sequence-based data link self-organizing access control method, which comprises the following steps:
a user finds out a working channel where a network is located through spectrum sensing;
a user autonomously selects an idle control sequence and prepares to access a data chain according to any time slot of the selected control sequence;
and the users in the network use the pseudo-randomly hopping time slots in different time frame periods according to the selected control sequences.
As shown in fig. 1, the method uses a set of control sequences S = S i ＝(s i (1)，s i (2)，...，s i (n)), 1 ≦ i ≦ M access control, the access control method comprising the steps of:
user selection of sequence s 1 As a control sequence, starting from the #1 time frame, a time slot s is used 1 (1)，s 1 (2)，...，s 1 (n) transmitting information in time slots used in different subsequent time frames according to the control sequence s 1 Random jumping is carried out to ensure the safety of information transmission;
user selection of sequence s x As a control sequence, time slot s is used from time frame # 1 to time frame # i-1 x (1)，s x (2)，...，s x (i-1) transmitting information. The user finishes the current transmission in the time frame # i-1, quits the network and sends the sequence s x Release, control sequence s x Can be used by the users who access the network later;
user selects sequence s from idle sequence in time frame # i-1 M As a control sequence, time slot s may be used from any time frame thereafter M (1)，s M (2)，...，s M (n) performing information transmission;
the user accesses the network at time # i, and selects sequence s from the idle sequence x As a control sequence, time slot s may be used from any time frame thereafter x (1)，s x (2)，...，s x And (n) carrying out information transmission.
Specifically, the construction method of the control sequence includes a control sequence set algorithm:
step A: given the value of the prime number M, a base sequence b = (b) is initialized 0 ，b 1 ，...，b M-1 ) Each element in the sequence satisfies the condition:
and all elements b in b i ∈ (0，1，...，M-1)；
And B, step B: given the integer θ, gcd (M, θ) =1, a shifted sequence set is constructed
Wherein, when j is more than or equal to 0 and less than M,
when M is less than or equal to j and less than M (M-1),
and C: given the integer k, Z = k | M, and given the integer α, gcd (k, α) =1; constructing a control sequence set
As shown in fig. 2, specifically, a control center is provided in each network group in the data chain, and when the control center initializes, the control center divides M sequences in a control sequence set C into two sets, C A And C B And | C A |＝Z， |C B I = M-Z for allocating control sequences and corresponding specific access time frames to users in the network.
In particular, the idle control sequence is from C A Is selected from, if C A If there is a free control sequence in the control sequence, user u x From C A In (b) select sequence c x And choose to access with C A The difference of the access time frames of other users is not the time frame of integral multiple of Z;
if C A Has no idle sequence in, then the slave C B In which a sequence and its access time frame are allocated to u x And is combined with C A An access time frame and u that must exist in x Is an integer multiple of Z.
As shown in fig. 3, specifically, the method further includes a logout control method, including the following steps:
step 1: user u x A network quitting request is sent to the control center;
step 2: the control centre checks the sequence c it uses x Whether or not it belongs to C B If so, directly release the sequence c x (ii) a If not, performing the step 3;
and 3, step 3: if c is x Is a member of C A Then search for C B Whether or not there is a x Synchronized users u y . If so, release sequence c x And let c x ∈C B ，c y ∈C A (ii) a If not, directly releasing the sequence c x 。
The data link security access control scheme based on the self-organizing model not only can realize random network access of users, but also can maximize the capacity of a network channel by utilizing time slot resources to the maximum extent, and can realize interception resistance, interception resistance and security privacy of messages through the difference of main stealing channels. Meanwhile, the data chain based on the control sequence also has flexible control and can be expanded into a control mode without a central node; the communication link is stable; the method has the advantages of simple implementation, low system overhead and the like. Therefore, the data link security access control scheme based on the control sequence is a time slot control method which has the characteristics of strong anti-interception capability, flexible time slot control, high utilization rate, stable communication link and the like.
The foregoing shows and describes the general principles and broad features of the present invention and advantages thereof. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are described in the specification and illustrated only to illustrate the principle of the present invention, but that various changes and modifications may be made therein without departing from the spirit and scope of the present invention, which fall within the scope of the invention as claimed.
Claims (6)
1. A data chain self-organizing access control method based on a control sequence is characterized by comprising the following steps:
a user finds out a working channel where a network is located through spectrum sensing;
a user autonomously selects an idle control sequence and prepares to access a data chain according to any time slot of the selected control sequence;
and the users in the network use the pseudo-randomly hopping time slots in different time frame periods according to the selected control sequences.
2. The method for controlling sequence-based data chain ad hoc access as claimed in claim 1, wherein the control sequence set S = is useds i ＝(s i (1),s i (2),…,s i (n)), i is more than or equal to 1 and less than or equal to M access control, and the access control method comprises the following steps:
user selection of sequence s 1 As a control sequence, starting from the #1 time frame, a time slot s is used 1 (1),s 1 (2),…,s 1 (n) transmitting information in time slots used in different subsequent time frames according to the control sequence s 1 Random jumping is carried out to ensure the safety of information transmission;
user selection of sequence s x As a control sequence, time slot s is used from time frame #1 to time frame # i-1 x (1),s x (2),…,s x (i-1) carrying out information transmission, finishing current transmission by a user in the time frame of # i-1, quitting the network and transmitting the sequence s x Release, control sequence s x Can be used by the users who access the network later;
user selects sequence s from idle sequence in time frame # i-1 M As a control sequence, time slot s may be used from any time frame thereafter M (1),s M (2),…,s M (n) carrying out information transmission;
the user accesses the network in time frame # i, selects sequence s from the idle sequence x As a control sequence, time slot s may be used from any time frame thereafter x (1),s x (2),…,s x And (n) carrying out information transmission.
3. The method according to claim 1, wherein the method for constructing the control sequence comprises a control sequence set algorithm:
step A: given the value of the prime number M, a base sequence b = (b) is initialized 0 ,b 1 ,…,b M-1 ) Each element in the sequence satisfies the condition:
and all elements b in b i ∈(0,1,…,M-1)；
And B, step B: given the integer θ, gcd (M, θ) =1, a shifted sequence set is constructed
Wherein, j is more than or equal to 0<M, the content of the compound is M,
when M is less than or equal to j<When M (M-1) is used,
and C: given the integer k, Z = k | M, and given the integer α, gcd (k, α) =1; constructing a control sequence set
4. The method according to claim 1, wherein a control center is provided in each network group in the data chain, and the control center, when initializing, divides M sequences in a control sequence set C into two sets, C A And C B And | C A |＝Z，|C B L = M-Z for assigning control sequences and corresponding specific access time frames to users in the network.
5. The method according to claim 4, wherein the idle control sequence is selected from C A Is selected from, if C A If there is a free control sequence in the control sequence, user u x From C A In (b) select sequence c x And choose to access with C A The difference of the access time frames of other users is not the time frame of integral multiple of Z;
if C A Has no idle sequence in, then the slave C B In allocating a sequence and its access time frame to u x And is combined with C A A certain existing access time frame and u x Is an integer multiple of Z.
6. The method for controlling data link self-organizing access based on the control sequence as claimed in claim 5, further comprising a logoff control method, comprising the steps of:
step 1: user u x A network quitting request is sent to the control center;
step 2: the control centre checks the sequence c it uses x Whether or not it belongs to C B If so, directly release the sequence c x (ii) a If not, performing the step 3;
and step 3: if sequence c x Is a member of C A Then search for C B Whether or not there is a x Synchronized users u y If so, release sequence c x And let c x ∈C B ，c y ∈C A (ii) a If not, directly releasing the sequence c x 。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211041036.5A CN115413043B (en) | 2022-08-29 | 2022-08-29 | Data link self-organizing access control method based on control sequence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211041036.5A CN115413043B (en) | 2022-08-29 | 2022-08-29 | Data link self-organizing access control method based on control sequence |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115413043A true CN115413043A (en) | 2022-11-29 |
| CN115413043B CN115413043B (en) | 2024-03-05 |
Family
ID=84160855
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211041036.5A Active CN115413043B (en) | 2022-08-29 | 2022-08-29 | Data link self-organizing access control method based on control sequence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115413043B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116455834A (en) * | 2023-06-19 | 2023-07-18 | 西华大学 | Data chain hierarchical access control method based on control sequence |
| CN116582152A (en) * | 2023-06-30 | 2023-08-11 | 西华大学 | Construction method of long-period wide-interval frequency hopping sequence set |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090060001A1 (en) * | 2007-08-27 | 2009-03-05 | Waltho Alan E | Cognitive frequency hopping radio |
| CN102307392A (en) * | 2011-08-17 | 2012-01-04 | 东南大学 | Relevance-based access method of frequency-hopping communication system |
| CN102612152A (en) * | 2012-02-27 | 2012-07-25 | 西北工业大学 | Ad Hoc network MAC (Media Access Control) protocol realizing method based on STDMA (Self Organizing Time Division Multiple Access) |
| CN112534920A (en) * | 2018-06-22 | 2021-03-19 | 弗劳恩霍夫应用研究促进协会 | Channel access via hierarchically organized channel access patterns |
-
2022
- 2022-08-29 CN CN202211041036.5A patent/CN115413043B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090060001A1 (en) * | 2007-08-27 | 2009-03-05 | Waltho Alan E | Cognitive frequency hopping radio |
| CN102307392A (en) * | 2011-08-17 | 2012-01-04 | 东南大学 | Relevance-based access method of frequency-hopping communication system |
| CN102612152A (en) * | 2012-02-27 | 2012-07-25 | 西北工业大学 | Ad Hoc network MAC (Media Access Control) protocol realizing method based on STDMA (Self Organizing Time Division Multiple Access) |
| CN112534920A (en) * | 2018-06-22 | 2021-03-19 | 弗劳恩霍夫应用研究促进协会 | Channel access via hierarchically organized channel access patterns |
Non-Patent Citations (1)
| Title |
|---|
| 胡梦婷;牛宪华;韩璐;: "最优单次重合跳频序列集设计", 西华大学学报(自然科学版), no. 03 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116455834A (en) * | 2023-06-19 | 2023-07-18 | 西华大学 | Data chain hierarchical access control method based on control sequence |
| CN116455834B (en) * | 2023-06-19 | 2023-08-11 | 西华大学 | Data chain hierarchical access control method based on control sequence |
| CN116582152A (en) * | 2023-06-30 | 2023-08-11 | 西华大学 | Construction method of long-period wide-interval frequency hopping sequence set |
| CN116582152B (en) * | 2023-06-30 | 2023-12-29 | 西华大学 | Construction method of long-period wide-interval frequency hopping sequence set |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115413043B (en) | 2024-03-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115413043B (en) | Data link self-organizing access control method based on control sequence | |
| AU2002313823B2 (en) | System and method for collision-free transmission scheduling using neighborhood information and advertised transmission times | |
| CN101964694B (en) | System and method for transmitting low interception signal of high-throughput and delay sensibility wireless network | |
| US20120250632A1 (en) | Distributed scheduler design for multiuser detection enabled wireless mobile ad-hoc networks | |
| CN115413042B (en) | Data link safety access control method based on control sequence | |
| Tseng et al. | Rotational listening strategy for IEEE 802.15. 4 wireless body networks | |
| Jamal et al. | CR-WSN MAC: An energy efficient and spectrum aware MAC protocol for cognitive radio sensor network | |
| Zhou et al. | A k-round elimination contention scheme for WLANs | |
| Tuysuz et al. | A beacon-based collision-free channel access scheme for IEEE 802.11 WLANs | |
| Lee et al. | Avoiding collision with hidden nodes in IEEE 802.11 wireless networks | |
| Farag et al. | PR-CCA MAC: A prioritized random CCA MAC protocol for mission-critical IoT applications | |
| Kartsakli et al. | Cross-layer enhancement for WLAN systems with heterogeneous traffic based on DQCA | |
| Cirimelli-Low et al. | Key-Activation Multiple Access (KAMA) | |
| Xu et al. | PDMAC-SIC: Priority-based distributed low delay MAC with successive interference cancellation for industrial wireless networks | |
| Sasikumar et al. | Contention-based Access Protocol for Intra-Cluster Communications in Mobile Ad hoc Networks | |
| CN110233762B (en) | Method for improving throughput of full-duplex CSMA network by using MAB | |
| Zheng et al. | A novel mac protocol for vanet based on improved generalized prime sequence | |
| Ding et al. | Multi-priority MAC protocol for terahertz wireless local area network | |
| Lee et al. | Study on backoff algorithm for IEEE 802.15. 4 LR-WPAN | |
| Kim et al. | A design of hybrid csma using sequential-based scheduling algorithm | |
| Mo et al. | Distributed scheduler design for multiuser detection enabled wireless mobile ad-hoc networks | |
| Agarwal et al. | K-preferential slotted ALOHA for ultra reliable low latency communications | |
| Zhou et al. | Low-overhead distributed mac for serving dynamic users over multiple channels | |
| Xu et al. | A heuristic approach for low delay distributed MAC using successive interference cancellation in priority-based industrial wireless network | |
| Broustis et al. | A new binary conflict resolution‐based MAC protocol for impulse‐based UWB ad hoc networks |
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 |