CN116455834B - Data chain hierarchical access control method based on control sequence - Google Patents
Data chain hierarchical access control method based on control sequence Download PDFInfo
- Publication number
- CN116455834B CN116455834B CN202310720906.XA CN202310720906A CN116455834B CN 116455834 B CN116455834 B CN 116455834B CN 202310720906 A CN202310720906 A CN 202310720906A CN 116455834 B CN116455834 B CN 116455834B
- Authority
- CN
- China
- Prior art keywords
- access
- sequence
- hierarchical
- user
- access control
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 19
- 230000005540 biological transmission Effects 0.000 claims abstract description 24
- 238000010276 construction Methods 0.000 claims description 6
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 3
- 238000004088 simulation Methods 0.000 description 4
- 230000001360 synchronised effect Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
- H04L63/105—Multiple levels of security
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/40—Network security protocols
-
- 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 Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a data chain hierarchical access control method based on a control sequence, which comprises the following steps: the user sends an access request to a control center; the control center distributes corresponding hierarchical access control sequences and accurate access time slots to the users according to the access frequency types of the users; the users use pseudo-randomly hopped time slots for data transmission in different time slots according to the assigned hierarchical access control sequence. The invention effectively solves the problem that the random conflict-free access data link of the users with multiple access grades can not be met in the existing 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 data chain hierarchical access control method based on a control sequence.
Background
The control sequence is a q-element pseudo-random sequence with zero time delay, zero correlation and non-periodic characteristic facing to the data chain. The existing data link access control scheme based on the control sequence is divided into: an access control scheme based on an access application control model and an access control scheme based on an ad hoc control model.
The access control method based on the access application control model mainly aims at the safe access to the data link under the synchronous condition. In the access application control model, users share a global clock, i.e. users are absolutely synchronized. The user randomly sends an access request to the control center and synchronizes to the data link. The control center allocates control sequences and accurate access time slots to users, and the users use pseudo-randomly hopped time slots for data transmission in different time frames according to the allocated control sequences.
The access control method based on the self-organizing control model is mainly aimed at the safe access to the data link under the asynchronous condition, and the control sequence selected by the user does not need to be synchronous with the control sequence of the user in the network. The terminal user finds the working channel of the network through spectrum sensing, selects an idle control sequence through observation and learning, and then accesses the data chain at any time. The nodes in the network use pseudo-randomly hopped time slots at different time frame periods according to the selected control sequence.
The two access control methods have the defects that the random conflict-free access of users with the same access level to the data chain can only be met, and the random conflict-free access of users with different access levels to the data chain can not be further met.
Disclosure of Invention
The invention provides a data link hierarchical access control method based on a control sequence, which comprises the following steps: a user sends an access request to a control center, wherein the access request comprises an access frequency type and an access grade; the user receiving control center distributes corresponding hierarchical access control sequences and access time slots according to the access frequency types and the access grades of the users; the user performs access control according to the allocated hierarchical access control sequence set, and uses pseudo random jump to perform data transmission in different access time slots.
Further, the access control according to the assigned hierarchical access control sequence set comprises the steps of: s1, the access frequency types of the user A and the user B are the same,user B is assigned to a hierarchical access control sequence S Y Use of time slot S starting from time frame #1 Y (1) Data transmission to S Y (n-1) completion of transmission of the fallback network and release of sequence S Y The method comprises the steps of carrying out a first treatment on the surface of the S2, after system synchronization is completed, the user A is allocated to the sequence S Y Use of time slot S starting from #n time frame Y (n), … for data transmission; s3, the access level of the user C is hopped twice in a time frame corresponding to the access level of the user C, and the access level is distributed to the sequence S X Thereafter, starting with the #2 time frame, time slot S is used X1 （2），S X2 (2) …, data transmission; s4, the user D makes four hops in a time frame corresponding to the access level of the user D, and is distributed to the sequence S M Thereafter, starting with the #2 time frame, time slot S is used M1 （2），S M2 （2），S M3 （2），S M4 (2) …, data transmission takes place.
Furthermore, the users with different access grades can realize the data transmission of the random access data chain by using the hierarchical access control sequence, the mutual interference is avoided, and the time slot is ensured to be utilized to the greatest extent.
Further, the construction method of the hierarchical access control sequence set comprises the following steps: A1. given the number of time slots t in a time frame, the number of access class types lambda, the number of i-type users M i And access frequencyWhereinIs the maximum access frequency; A2. given a pseudo-random sequenceThe element values are taken from the set {0,1, … }>All-permutation set->The element value is selected from the group consisting of +.>Is a group of Abelian; A3. generating a set of hierarchical access control sequences：，WhereinPseudo-random sequenceThe element value is selected from the group consisting of +.>Is a group of Abelian;
in the above-mentioned description of the invention,are all one element value in the pseudo-random sequence; />For one of the full permutation set, +.>Is an element value in an arrangement; />For one hierarchical control sequence of a hierarchical control sequence set,/for one hierarchical control sequence>For a subsequence in the hierarchical control sequence, < ->Is an element value in the subsequence;、/>、/>、/>、/>、j、γ、dall are variables given by a sequence generation formula, m is the number of users, and +.>For the d-level number of users +.>An access level value for a d-level user.
Further, the hierarchical access control sequence set further includes a construction method, including the steps of: b1: number of time slots within a given time frametNumber of access frequency types lambda, number of i type users m i And access frequencyConstructing an initial sequence
The element value of which is represented by the given formula +.>Calculated while giving the value of an integer t, where k is an integer, b 0 Sequence numbering for the initial sequence set;
B2. determining the maximum value of the integer d by the Euler function phi (t) is such thatAnd in the field->Find out the satisfying org (g)=An integer g of d;
B3. utilizing a mapGenerating a set of hierarchical access control sequences:
，Wherein；
In the above-mentioned description of the invention,one sequence in the initial sequence set, +.>Is an element value in the initial sequence;for one hierarchical control sequence of the hierarchical control sequence sets,/->For a sub-sequence in the hierarchical control sequence,is an element value in the subsequence;k、/> 、/> 、/> 、j、/>d are variables given by a sequence generation formula, m is the number of users and +.>For the d-level number of users +.>For the access level value of the d-level user, +.>Representing the sequence length of the generated sequence set, +.>A factor representing the sequence generation formula in the nth iteration.
The invention provides a data link hierarchical access control method based on a control sequence, which effectively solves the problem that the existing data link access control scheme cannot meet the requirement of accessing a data link by a user with multiple access grades randomly without conflict.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a diagram illustrating a user hopping within a time frame according to the present invention;
FIG. 3 is a comparison simulation result of a hierarchical access control sequence with a fixed slot allocation scheme when the interference power is 10dB under single interference;
FIG. 4 is a comparison simulation result of a hierarchical access control sequence with a fixed slot allocation scheme when the interference power is 15dB under single interference;
FIG. 5 is a comparison simulation result of the allocation of the hierarchical access control sequence with the fixed time slot when the interference power is 10dB under multiple interference;
fig. 6 is a comparison simulation result of the allocation of the hierarchical access control sequence with the fixed time slot when the interference power is 15dB under multiple interference.
Description of the embodiments
The following detailed description of embodiments of the invention, taken in conjunction with the accompanying drawings, illustrates only some, but not all embodiments, and for the sake of clarity, illustration and description not related to the invention is omitted in the drawings and description.
As shown in fig. 1 and 2, the present invention provides a data link hierarchical access control method based on a control sequence, and the access control using a hierarchical access control sequence set includes the following steps: s1, the access frequency types of a user A and a user B are the same, and the user B is allocated to a hierarchical access control sequence S Y Use of time slot S starting from time frame #1 Y (1) Data transmission to S Y (n-1) completion of transmission of the fallback network and release of sequence S Y The method comprises the steps of carrying out a first treatment on the surface of the S2, after system synchronization is completed, the user A is allocated to the sequence S Y Use of time slot S starting from #n time frame Y (n), … for data transmission; s3, the access level of the user C is hopped twice in a time frame corresponding to the access level of the user C, and the access level is distributed to the sequence S X Thereafter, starting with the #2 time frame, time slot S is used X1 （2），S X2 (2) …, data transmission; s4, the user D makes four hops in a time frame corresponding to the access level of the user D, and is distributed to the sequence S M Thereafter, starting with the #2 time frame, time slot S is used M1 （2），S M2 （2），S M3 （2），S M4 (2) …, data transmission takes place.
In the hierarchical access control model, users share a global clock, i.e. users are absolutely synchronized. The user sends an access request to the control center and synchronizes to the data link. The control center allocates a corresponding control sequence and an accurate access time slot to the user according to the access level of the user, and the user uses the pseudo-randomly hopped time slot to perform data transmission in different time frames according to the allocated control sequence.
The time slot control sequence facing the data chain is an effective way for realizing the safe access control of the data chain and improving the time slot utilization rate in a physical layer. Users with different access grades can realize data transmission of a random access data chain by using the hierarchical access control sequence, do not interfere with each other, and ensure that time slots are utilized to the greatest extent.
There are two methods of constructing control sequences, construction method 1: A1. number of time slots in a given time frameQuantity t, access class type quantity λ, i type user quantity M i And access frequencyWhereinIs the maximum access frequency; A2. given a pseudo-random sequenceThe element values are taken from the set {0,1, … }>All-permutation setThe element value is selected from the group consisting of +.>Is a group of Abelian; A3. generating a set of hierarchical access control sequences：，WhereinPseudo-random sequenceThe element value is selected from the group consisting of +.>Is a group of Abelian;
in the above-mentioned description of the invention,are all one element value in the pseudo-random sequence; />For one of the full permutation set, +.>Is an element value in an arrangement; />For one hierarchical control sequence of a hierarchical control sequence set,/for one hierarchical control sequence>For a subsequence in the hierarchical control sequence, < ->Is an element value in the subsequence; />、/>、/>、/>、/>、j、γ、dAll are variables given by a sequence generation formula, m is the number of users, and +.>For the d-level number of users +.>An access level value for a d-level user.
Construction method 2: b1: number of time slots within a given time frametNumber of access frequency types lambda, number of i type users m i And access frequencyStructure of the structureCreating an initial sequence
The element value of which is represented by the given formula +.>Calculated while giving the value of an integer t, where k is an integer, b 0 Sequence numbering for the initial sequence set;
B2. determining the maximum value of the integer d by the Euler function phi (t) is such thatAnd in the field->Find out the satisfying org (g)=An integer g of d;
B3. utilizing a mapGenerating a set of hierarchical access control sequences:
，Wherein；
In the above-mentioned description of the invention,one sequence in the initial sequence set, +.>Is an element value in the initial sequence; />For graded controlA hierarchical control sequence in the system set, < >>For a sub-sequence in the hierarchical control sequence,is an element value in the subsequence;k、/> 、/> 、/> 、j、/>d are variables given by a sequence generation formula, m is the number of users and +.>For the d-level number of users +.>For the access level value of the d-level user, +.>Representing the sequence length of the generated sequence set, +.>A factor representing the sequence generation formula in the nth iteration.
The data link hierarchical access control scheme based on the control model can also realize random conflict-free access of users with multiple access grades to the data link on the basis of the original data link access control scheme, thereby further meeting the user communication requirement of the data link in practical application. Therefore, the data chain hierarchical access control scheme based on the control sequence is a time slot control method which has high time slot utilization rate, strong anti-interception capability, flexible control, stable communication link and satisfies the hierarchical access of users.
As shown in fig. 3 and fig. 4, the symbol error rate of the hierarchical access control scheme is lower than 0.1 under the single interference condition. The signal-to-noise ratio is taken as a reference point, and when the interference power is 15dB, the anti-interference performance gain of the hierarchical access control scheme is larger than that when the interference power is 10 dB.
As shown in fig. 5 and 6, in the case of multiple interference, the symbol error rate of the hierarchical access control scheme is always lower than that of the fixed slot allocation scheme. The signal-to-noise ratio is taken as a reference point, and when the interference power is 15dB, the anti-interference performance gain of the hierarchical access control scheme is larger than that when the interference power is 10 dB.
Under single and multiple interference, the data link hierarchical access control scheme based on the hierarchical access control sequence (Hierarchical Access Control Sequence, HACS) has a lower symbol error rate (Symbol Error Ratio, SER) than the fixed slot allocation scheme, i.e. the data link hierarchical access control scheme based on the hierarchical access control sequence has better interference resistance.
While the foregoing is directed to embodiments of the present invention, other and further details of the invention may be had by the present invention, it should be understood that the foregoing description is merely illustrative of the present invention and that no limitations are intended to the scope of the invention, except insofar as modifications, equivalents, improvements or modifications are within the spirit and principles of the invention.
Claims (4)
1. The data link hierarchical access control method based on the control sequence is characterized by comprising the following steps:
a user sends an access request to a control center, wherein the access request comprises an access frequency type and an access grade;
the user receiving control center distributes corresponding hierarchical access control sequences and access time slots according to the access frequency types and the access grades of the users;
the user performs access control according to the allocated hierarchical access control sequence set, and performs data transmission by using pseudo random jump in different access time slots;
the construction method of the hierarchical access control sequence set comprises the following steps:
A1. given the number of time slots t in a time frame, the number of access class types lambda, the number of i-type users m i And access frequencyWherein->Is the maximum access frequency;
A2. given a pseudo-random sequenceThe element values are taken from the set {0,1, … }>All-permutation set
The element value is selected from the group consisting of +.>Is a group of Abelian;
A3. generating a set of hierarchical access control sequences
：
，
，
Wherein the method comprises the steps ofPseudo-random sequenceThe element value is selected from the group consisting of +.>Is a group of Abelian;
in the above-mentioned description of the invention,are all one element value in the pseudo-random sequence; />For one of the full permutation set, +.>Is an element value in an arrangement; />For one hierarchical control sequence of a hierarchical control sequence set,/for one hierarchical control sequence>For a subsequence in the hierarchical control sequence, < ->Is an element value in the subsequence; />、、/>、/>、/>、j、γ、dAll are variables given by a sequence generation formula, m is the number of users, and +.>For the d-level number of users +.>An access level value for a d-level user.
2. A control sequence based data link hierarchical access control method according to claim 1, characterized in that said access control according to the assigned set of hierarchical access control sequences comprises the steps of:
s1, the access frequency types of a user A and a user B are the same, and the user B is allocated to a hierarchical access control sequence S Y Use of time slot S starting from time frame #1 Y (1) Data transmission to S Y (n-1) completion of transmission of the fallback network and release of sequence S Y ；
S2, after system synchronization is completed, the user A is allocated to the sequence S Y Use of time slot S starting from #n time frame Y (n), … for data transmission;
s3, the access level of the user C is hopped twice in a time frame corresponding to the access level of the user C, and the access level is distributed to the sequence S X Thereafter, starting with the #2 time frame, time slot S is used X1 （2），S X2 (2) …, data transmission;
s4, the user D makes four hops in a time frame corresponding to the access level of the user D, and is distributed to the sequence S M Thereafter, starting with the #2 time frame, time slot S is used M1 （2），S M2 （2），S M3 （2），S M4 (2) …, data transmission takes place.
3. The control sequence-based data link hierarchical access control method is characterized in that users with different access grades can realize data transmission of random access data links by using the hierarchical access control sequence, do not interfere with each other, and ensure the maximum utilization of time slots.
4. A data chain hierarchical access control method based on control sequences according to claim 1, characterized in that said set of hierarchical access control sequences further comprises a construction method comprising the steps of:
b1: number of time slots within a given time frametNumber of access frequency types lambda, number of i type users m i And access frequencyConstructing an initial sequence
The element value of which is given by the formulaCalculated while giving the value of an integer t, where k is an integer, b 0 Sequence numbering for the initial sequence set;
B2. determining the maximum value of the integer d by the Euler function phi (t) is such thatAnd in the field->Find out the satisfying org (g)=An integer g of d;
B3. utilizing a mapGenerating a set of hierarchical access control sequences
:
，
Wherein；
In the above-mentioned description of the invention,one sequence in the initial sequence set, +.>Is an element value in the initial sequence; />For one hierarchical control sequence of the hierarchical control sequence sets,/->For a subsequence in the hierarchical control sequence, < ->Is an element value in the subsequence;k、/> 、/> 、/> 、j、/>d are given by the formula generated along with the sequenceM is the number of users, +.>For the d-level number of users +.>For the access level value of the d-level user, +.>Representing the sequence length of the generated sequence set, +.>A factor representing the sequence generation formula in the nth iteration, R being the maximum access frequency.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310720906.XA CN116455834B (en) | 2023-06-19 | 2023-06-19 | Data chain hierarchical access control method based on control sequence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310720906.XA CN116455834B (en) | 2023-06-19 | 2023-06-19 | Data chain hierarchical access control method based on control sequence |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116455834A CN116455834A (en) | 2023-07-18 |
| CN116455834B true CN116455834B (en) | 2023-08-11 |
Family
ID=87122378
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310720906.XA Active CN116455834B (en) | 2023-06-19 | 2023-06-19 | Data chain hierarchical access control method based on control sequence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116455834B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000151622A (en) * | 1998-11-05 | 2000-05-30 | Oki Electric Ind Co Ltd | Medium access control method and system |
| CN1478337A (en) * | 2000-12-14 | 2004-02-25 | Ħ��������˾ | Multiple access frequency hopping network with interference avoidance |
| US8422380B2 (en) * | 2003-03-26 | 2013-04-16 | Sharp Laboratories Of America, Inc. | Dynamically reconfigurable wired network |
| CN107949066A (en) * | 2017-11-21 | 2018-04-20 | 西安空间无线电技术研究所 | A kind of ripple position resource flexible scheduling system and dispatching method towards beam-hopping |
| CN112333739A (en) * | 2014-06-05 | 2021-02-05 | 奥卡多创新有限公司 | Communication system and method |
| CN114143195A (en) * | 2021-11-19 | 2022-03-04 | 烽火通信科技股份有限公司 | Data packet processing device and method |
| CN115413042A (en) * | 2022-08-29 | 2022-11-29 | 西华大学 | Data link safety access control method based on control sequence |
| CN115413043A (en) * | 2022-08-29 | 2022-11-29 | 西华大学 | Data link self-organizing access control method based on control sequence |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4910629B2 (en) * | 2006-10-26 | 2012-04-04 | 富士通株式会社 | Information access system, read / write device, and active contactless information storage device |
| US8867480B2 (en) * | 2011-12-07 | 2014-10-21 | Harris Corporation | Specification of a frequency agile dynamic spectrum access TDMA method |
| US11950237B2 (en) * | 2019-09-24 | 2024-04-02 | Qualcomm Incorporated | Sequence based physical uplink control channel transmission |
-
2023
- 2023-06-19 CN CN202310720906.XA patent/CN116455834B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000151622A (en) * | 1998-11-05 | 2000-05-30 | Oki Electric Ind Co Ltd | Medium access control method and system |
| CN1478337A (en) * | 2000-12-14 | 2004-02-25 | Ħ��������˾ | Multiple access frequency hopping network with interference avoidance |
| US8422380B2 (en) * | 2003-03-26 | 2013-04-16 | Sharp Laboratories Of America, Inc. | Dynamically reconfigurable wired network |
| CN112333739A (en) * | 2014-06-05 | 2021-02-05 | 奥卡多创新有限公司 | Communication system and method |
| CN107949066A (en) * | 2017-11-21 | 2018-04-20 | 西安空间无线电技术研究所 | A kind of ripple position resource flexible scheduling system and dispatching method towards beam-hopping |
| CN114143195A (en) * | 2021-11-19 | 2022-03-04 | 烽火通信科技股份有限公司 | Data packet processing device and method |
| CN115413042A (en) * | 2022-08-29 | 2022-11-29 | 西华大学 | Data link safety access control method based on control sequence |
| CN115413043A (en) * | 2022-08-29 | 2022-11-29 | 西华大学 | Data link self-organizing access control method based on control sequence |
Non-Patent Citations (1)
| Title |
|---|
| An Efficient Medium Access Control Scheme Based on MC-CDMA for Mobile Underwater Acoustic Networks;Jiani Guo等;《IEEE Network》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116455834A (en) | 2023-07-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jafar et al. | Generalized degrees of freedom of the symmetric Gaussian $ K $ user interference channel | |
| Altman et al. | Closed form solutions for water-filling problems in optimization and game frameworks | |
| JP2009505503A (en) | Channel and interference estimation in single-carrier and multi-carrier frequency division multiple access systems | |
| JP6410752B2 (en) | Pilot subcarrier in radio transmission | |
| CN106100696A (en) | A kind of non-linear frequency hopping pattern based on TOD temporal information generates system | |
| Wang et al. | Efficient distributed low-cost backbone formation for wireless networks | |
| CN115413042B (en) | Data link safety access control method based on control sequence | |
| CN106941688B (en) | PDMA system power distribution method based on historical information | |
| Jiang et al. | Dynamic user pairing and power allocation for NOMA with deep reinforcement learning | |
| CN116455834B (en) | Data chain hierarchical access control method based on control sequence | |
| CN107911853B (en) | Resource allocation algorithm of SCMA (sparse code multiple access) system based on ant colony algorithm | |
| Bhattarai et al. | Improved bandwidth allocation in Cognitive Radio Networks based on game theory | |
| Yu et al. | Self-organizing hit avoidance in distributed frequency hopping multiple access networks | |
| CN108242941A (en) | A kind of tamed spread spectrum code preferred method of hybrid spread spectrum multiple access net | |
| Salehkaleybar et al. | A periodic jump-based rendezvous algorithm in cognitive radio networks | |
| Hossain et al. | Rendezvous in cognitive radio ad-hoc networks with asymmetric channel view | |
| CN112235216A (en) | Compressed sensing pilot frequency design method based on tabu search | |
| JP2003023675A (en) | Communication system employing cross-correlation suppression type spread system set | |
| Zhou et al. | Simulated annealing-genetic algorithm and its application in CDMA multi-user detection | |
| Cifici et al. | An optimal estimation algorithm for multiuser chaotic communications systems | |
| CN112242855B (en) | Novel code hopping multiple access method for enhancing bearing capacity | |
| Diao et al. | A nearest neighbor regression based channel estimation algorithm for acoustic channel-aware routing | |
| CN114666191B (en) | Communication method of orthogonal multi-user shift noise reduction DCSK chaotic communication system | |
| Zhu et al. | Residue number system arithmetic assisted coded frequency-hopped OFDMA | |
| Lizhi et al. | Research on effective jamming style of projectile-carried communication for FH communication radio under common modulation systems |
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 |