CN113364517B - Asynchronous access-oriented satellite Internet of things terminal identity identification method - Google Patents

Asynchronous access-oriented satellite Internet of things terminal identity identification method Download PDF

Info

Publication number
CN113364517B
CN113364517B CN202110720033.3A CN202110720033A CN113364517B CN 113364517 B CN113364517 B CN 113364517B CN 202110720033 A CN202110720033 A CN 202110720033A CN 113364517 B CN113364517 B CN 113364517B
Authority
CN
China
Prior art keywords
sequence
user
identity
reed
muller
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
CN202110720033.3A
Other languages
Chinese (zh)
Other versions
CN113364517A (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.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
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 Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN202110720033.3A priority Critical patent/CN113364517B/en
Publication of CN113364517A publication Critical patent/CN113364517A/en
Application granted granted Critical
Publication of CN113364517B publication Critical patent/CN113364517B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/14Relay systems
    • H04B7/15Active relay systems
    • H04B7/185Space-based or airborne stations; Stations for satellite systems
    • H04B7/18578Satellite systems for providing broadband data service to individual earth stations
    • H04B7/18593Arrangements for preventing unauthorised access or for providing user protection
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/14Relay systems
    • H04B7/15Active relay systems
    • H04B7/185Space-based or airborne stations; Stations for satellite systems
    • H04B7/1851Systems using a satellite or space-based relay

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Astronomy & Astrophysics (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a satellite Internet of things terminal identity identification method facing asynchronous access, which comprises three parts of terminal identity sequence receiving, time delay matching and identity detection and user terminal offset. The terminal identity sequence receiving is that superposition of Reed-Muller sequences and noise of a plurality of users is received under the asynchronous condition; the time delay matching and the identity detection are to use an algorithm to carry out the time delay matching and the identification of the user identity on the received signals; the user terminal offsets the received signal, subtracts the terminal user identity sequence detected under the matched time delay, offsets, then puts the obtained sequence into the time delay matching and identity detection for iteration, and finally sets a decision threshold through energy detection for ending the iteration.

Description

Asynchronous access-oriented satellite Internet of things terminal identity identification method
Technical Field
The invention relates to the technical field of satellite communication, in particular to an asynchronous access-oriented satellite internet of things terminal identity identification method.
Background
With the continuous development of human society, the requirements of information and networks are higher and higher, information communication is performed all the time around the world, most of current communication depends on ground wireless communication, when terminals are far away or in complex environments such as remote mountainous areas, poor communication quality or even communication failure may be caused by light on the ground communication, the existing ground wireless communication cannot meet the requirements of people on information acquisition, and people begin to explore other fields, such as the satellite communication field. The satellite communication has the characteristics of wide coverage range, no limitation by geography, climate factors and natural disasters and the like, has great strategic significance in aspects of maintaining national security, promoting economic development and the like, and is increasingly researched at present.
As the 4G era advances to the 5G era, key technical indicators of communication frequency bands, application requirements, technical standards, and the like of the 5G era are determined successively, wherein a Massive internet of things service (mtc) oriented to connection is an important application scenario of the 5G communication system. The concept of the internet of things is improved gradually from the point of presentation to the present, and the application of the internet of things relying on wireless local area networks such as the traditional ground cellular network is gradually developed and matured, but the traditional ground internet of things cannot be realized in some regions due to the limitation of factors such as space and environment. The satellite communication system can provide access service for the Internet of things terminal placed in remote areas by virtue of the characteristics of wide coverage range, no limitation of geography, climate factors, natural disasters and the like, and can realize real 'everything interconnection' in the global range.
The rapid development of the satellite internet of things technology brings great challenges to the satellite communication technology, and how to guarantee the service quality of users and how to meet the requirement of large-scale user access is a problem which needs to be solved urgently. The large-scale machine communication service traffic, automation, medical treatment, industry, agriculture and other industries promote the revolution of social production modes. While the random access process is the key to realize large-scale connection, under the condition of large-scale connection, frequent collision and sudden retransmission can cause network congestion, delay increase and resource waste. To reduce congestion and achieve low latency, this process must be done with high accuracy and low complexity. In general, detection of active users from tens or hundreds of user sequence spaces can be achieved through careful sequence design and exhaustive sequence search, however, in a large scale access scenario where the user sequence space may be as high as hundreds of thousands or even millions, it is very challenging to do so, and such detection is reminiscent of a large sea fishing needle. Because different active users transmit signals at different times, the sequence of users received by the access point is not synchronous, which increases the difficulty of correctly detecting multiple users in the received signals. On the one hand, given the large number of potential users in the system, it is not possible to assign orthogonal sequences to each user. On the other hand, non-orthogonal sequences will inevitably impose multi-user interference during detection. Therefore, a key challenge is to obtain a relatively large sequence space while obtaining reliable detection.
In the prior art, application publication No. CN107306394A discloses a method for acquiring cellular internet of things terminal information, which includes that a cellular internet of things terminal receives a request message for acquiring cellular internet of things terminal information, where the request message includes a service list for verifying whether an external application is authorized to acquire the cellular internet of things terminal information. The CIoT terminal can directly process the information acquisition request of the external application, thereby effectively reducing the network resource consumption and the signaling flow and reducing the network congestion on the basis of ensuring the information security of the CIoT terminal. It does not allow a relatively large sequence space.
Based on the above viewpoints, the terminal identity identification method of the satellite internet of things based on the asynchronous access, which is researched herein, selects the user sequence as a Reed-Muller sequence, and the Reed-Muller sequence has a large spatial order of magnitude, and can meet the requirement of mass communication. The user sequence may be uniquely and unambiguously mapped to the user identity. Thus, the access point can infer the user identity immediately upon correct detection of the user sequence. Meanwhile, the structural characteristics of the Reed-Muller sequence can be used for designing an efficient detection algorithm with low calculation complexity, a channel estimation coefficient can be obtained while a user sequence is detected, and the channel estimation step is not required to be called by adding extra calculation amount. In asynchronous detection, since the delay information is unknown, a genetic algorithm can be adopted to find the best matching delay.
Disclosure of Invention
In order to overcome the defects in the prior art, the invention provides a terminal identity identification method of a satellite internet of things facing asynchronous access, which realizes the requirement of large-scale user connection in satellite communication by adopting a Reed-Muller sequence as a user identity sequence, realizes low time delay by the low complexity of Reed-Muller sequence detection, and quickly finds the optimal matching time delay by an algorithm under the asynchronous condition. Finally, each active user identity sequence can be separated out in an asynchronous multi-user scene.
In order to achieve the purpose, the invention is realized by the following technical scheme:
the invention relates to an asynchronous access-oriented satellite Internet of things terminal identity identification method, which comprises three parts of terminal identity sequence receiving, time delay matching and identity detection and user terminal offset, and specifically comprises the following steps:
(1) receiving a terminal identity sequence: different users send Reed-Muller sequences at different time, and the sequences received by the access point are the superposition of a plurality of asynchronous Reed-Muller user sequences;
(2) time delay matching and identity detection: the method comprises two parts of time delay matching and user identity detection:
(2.1) time delay matching: setting a fitness function by taking parameters of user identity detection as a target function, reasonably configuring each parameter in a genetic algorithm, obtaining an individual with high fitness through a random competition selection method, single-point crossing and variation, and performing iteration for a certain number of times to obtain an optimal individual, namely optimal matching time delay;
(2.2) user identity detection: recovering a user identity sequence in a receiving sequence by utilizing a nested structure of a Reed-Muller sequence and a special Reed-Muller sequence mapping rule;
(3) user terminal cancellation: the method comprises two parts of user sequence cancellation and energy detection:
(3.1) cancellation of user sequences: subtracting the user sequence detected in (2) from the received sequence;
(3.2) energy detection: and (3) calculating the energy value of the received sequence, comparing with a decision threshold, if the energy value is greater than the decision threshold, indicating that a user identity sequence is not detected yet, then putting the received sequence obtained in the step (3.1) into the step (2) for iteration, and if the energy value is less than the decision threshold, indicating that the rest received sequences are noise sequences, and ending the iteration.
The invention is further improved in that: in the step (1), the formulas of the user identity sequence and the receiving sequence are as follows:
Figure BDA0003136176290000031
Figure BDA0003136176290000032
wherein: m is the order of the Reed-Muller sequence, the Reed-Muller sequence has a length of 2m,CjIs the jth symbol in the user identity sequence, bmIs a (m × 1) column vector corresponding to the user ID, wt (-) represents the number of "1" in the vector, i.e. the code weight, PmIs made byA (m x m) matrix corresponding to the subscriber identity,
Figure BDA0003136176290000033
is an m-bit binary expression of j-1; y isjIs the jth symbol, δ, in the received sequencemaxIs the maximum time delay, kmaxIs the number of users, hkIs the channel coefficient for the kth user, which is modeled as a complex gaussian random process with unit variance,
Figure BDA0003136176290000034
is the jth symbol, δ, in the Reed-Muller identity sequence of the kth userkIs the delay value of the kth user and n represents complex additive white gaussian noise.
The invention is further improved in that: the optimal time delay matching is found by taking parameters in single user identity detection as an objective function, a scale transformation method is selected, the objective function is taken as a fitness function, then the fitness function is subjected to linear transformation, and the formula is as follows:
F′(X)=α*Fit(X)+β
Figure BDA0003136176290000041
Figure BDA0003136176290000042
wherein: f' (X) is the fitness function after transformation, Fit (X) is the fitness function, FitavgDenotes the average value of Fit (X), FitminRepresents the minimum value of Fit (X), X is the time delay number;
carrying out the operation of eliminating the population to obtain a new population by a random competitive selection method, then carrying out single-point crossing to enable new individuals to appear in the new population, inheriting the basic characteristics of a parent, carrying out variation after crossing, determining the global search capability of the genetic algorithm by crossing, wherein the variation is only an auxiliary method for generating the new individuals, determining the local search capability of the genetic algorithm, and finally finding the optimal time delay matching after a certain number of iterations;
(2.2) firstly, designing a Reed-Muller matrix vector pair { P, b }, wherein P is a matrix, b is a column vector, then mapping the Reed-Muller matrix vector pair { P, b } into a unique Reed-Muller sequence, multiplying a Reed-Muller first half sequence and a Reed-Muller second half sequence to obtain a sequence, and orthogonal to a Walsh sequence, namely after the vector is multiplied by the Walsh matrix, a maximum value exists, and the rest values are all equal to 0, and by utilizing the characteristic, carrying out the above operation on a received sequence to obtain the position of the maximum value:
Figure BDA0003136176290000043
wherein w is the position of the maximum, (-)IRepresenting the real part, ViThe ith value after the received sequence and the Walsh sequence are multiplied by a matrix is represented, and the total value is m;
and w contains partial information of the matrix vector pair { P, b }, the matrix vector pair { P, b } is disassembled one layer each time by using a nested structure of a Reed-Muller sequence, namely the matrix P deletes a first row and a first column, partial information of the nested structure can be recovered each time, and finally the matrix vector pair { P, b } can be completely recovered by adding the matrix P one by one, and meanwhile, a channel coefficient corresponding to the detected user can be obtained, and the matrix vector pair { P, b } and the Reed-Muller sequence are in one-to-one correspondence, so that the user identity can be obtained. The invention is further improved in that: the step (3) specifically comprises the following steps:
(3.1) subtracting the detected user sequence, channel estimation coefficient and corresponding time delay from the received sequence in step (2) to reduce the interference to the undetected user, wherein the formula is as follows:
Figure BDA0003136176290000051
wherein: y is the receiving orderColumn, deltaiIndicating the delay of the current detection of the ith user,
Figure BDA0003136176290000052
indicating that the channel estimation coefficient corresponding to the ith user is currently detected,
Figure BDA0003136176290000053
indicating the currently detected ith user sequence;
(3.2) calculating the energy of the received sequence after the cancellation in (3.1), if the energy value is less than the decision threshold, it indicates that all the user identities have been detected, if the energy value is greater than the decision threshold, then jumping to the step (2) to continue detecting the user identity sequence until the energy value is less than the decision threshold, and the energy value calculation formula is as follows:
Figure BDA0003136176290000054
where E is the energy of the received sequence, y (i) is the ith symbol in the received sequence, and y (i) is a sequence of complex numbers.
The invention has the beneficial effects that: according to the asynchronous access-oriented satellite Internet of things terminal identity identification method, the unique Reed-Muller user identity sequence is generated through the matrix vector pair, the user sequence space is expanded, the method can be used for large-scale random access, and the sequence space is exponentially multiplied along with the code length. Meanwhile, aiming at the asynchronous multi-user condition, a genetic algorithm is provided to obtain the optimal time delay matching, the optimal time delay can be estimated under the condition that the time delay is unknown, and then the user identity sequence is detected. The problem that the terminal identity is difficult to detect correctly under the asynchronous condition of the satellite is solved.
Drawings
FIG. 1 is a flow chart of the present invention.
Fig. 2 is a relationship curve between the signal-to-noise ratio and the detection success probability for different users.
Detailed Description
In the following description, for purposes of explanation, numerous implementation details are set forth in order to provide a thorough understanding of the embodiments of the invention. It should be understood, however, that these implementation details are not to be interpreted as limiting the invention. That is, in some embodiments of the invention, such implementation details are not necessary.
The technical scheme of the invention is further explained in detail by combining the attached drawings:
as shown in fig. 1-2, the invention relates to a terminal identity identification method of a satellite internet of things facing asynchronous access, which comprises three parts of terminal identity sequence receiving, time delay matching and identity detection and user terminal offset, and comprises the following specific steps:
(1) receiving a terminal identity sequence: different users send Reed-Muller sequences at different time, and the sequences received by the access point are the superposition of a plurality of asynchronous Reed-Muller user sequences;
the formula of the user identity sequence and the receiving sequence is as follows:
Figure BDA0003136176290000061
Figure BDA0003136176290000062
wherein: m is the order of the Reed-Muller sequence, the Reed-Muller sequence has a length of 2m,CjIs the jth symbol in the user identity sequence, bmIs a (m × 1) column vector corresponding to the user ID, wt (-) represents the number of "1" in the vector, i.e. the code weight, PmIs a matrix of (m x m) corresponding to the user identity,
Figure BDA0003136176290000063
is an m-bit binary expression of j-1; y isjIs the jth symbol, δ, in the received sequencemaxIs the maximum time delay, kmaxIs the number of users, hkIs the k < th > oneThe channel coefficients of the user, which are modeled as complex gaussian random processes with unit variance,
Figure BDA0003136176290000064
is the jth symbol, δ, in the Reed-Muller identity sequence of the kth userkIs the time delay value of the kth user, n represents the complex additive white gaussian noise;
(2) time delay matching and identity detection: the method comprises two parts of time delay matching and user identity detection:
(2.1) time delay matching: in the current scenario, the information of the time delay is unknown, so that the optimal time delay matching is found by using the parameter in the single user identity detection as the objective function, because the objective function value can be positive or negative and the maximum and minimum values cannot be estimated, a scale transformation method is selected, the objective function is used as a fitness function, and then the fitness function is linearly transformed, and the formula is as follows:
F′(X)=α*Fit(X)+β
Figure BDA0003136176290000065
Figure BDA0003136176290000066
wherein: f' (X) is the fitness function after transformation, Fit (X) is the fitness function, FitavgDenotes the average value of Fit (X), FitminRepresents the minimum value of Fit (X), X is the time delay number;
then, performing a win-win and loss-elimination operation on the population by a random competition selection method, wherein the probability of selecting the individual with high fitness is high, the probability of selecting the individual with low fitness is low, a new population can be obtained, then, the new population is subjected to single-point crossing, so that a new individual appears in the new population, the new individual can inherit the basic characteristics of a parent, mutation is performed after crossing, the global search capability of the genetic algorithm is determined by crossing, the mutation is only an auxiliary method for generating the new individual, the local search capability of the genetic algorithm is determined, and finally, the optimal time delay matching can be found after a certain number of iterations;
(2.2) user identity detection: firstly, designing a matrix vector pair { P, b } of Reed-Muller, wherein P is a matrix, b is a column vector, then mapping the matrix vector pair and the Reed-Muller sequence into a Reed-Muller sequence, wherein the matrix vector pair and the Reed-Muller sequence are in one-to-one correspondence, and thus, a sequence obtained by multiplying a Reed-Muller first half sequence and a Reed-Muller second half sequence is orthogonal to a Walsh sequence, namely after the vector and the Walsh matrix are multiplied, a maximum value exists, and the rest values are all equal to 0, and by using the characteristic, the received sequence can be subjected to the above operation to obtain the position of the maximum value:
Figure BDA0003136176290000071
wherein w is the position of the maximum, (-)IRepresenting the real part, ViM values representing the ith value obtained by multiplying the received sequence by the Walsh sequence matrix;
w contains partial information of the matrix vector pair { P, b }, the matrix vector pair { P, b } is disassembled one layer each time by using a nested structure of a Reed-Muller sequence, so that the partial information of the nested structure can be recovered each time, and finally, the matrix vector pair { P, b } can be completely recovered by adding one block layer by layer, and meanwhile, a channel coefficient corresponding to a detected user can be estimated, and the matrix vector pair { P, b } and the Reed-Muller sequence are in one-to-one correspondence relationship, so that the user identity can be obtained;
(3) user terminal cancellation: the method comprises two parts of user sequence cancellation and energy detection:
(3.1) cancellation of user sequences: by removing the user sequence, channel estimation coefficient and corresponding delay detected in step (2) from the received sequence, the interference to undetected users can be reduced, and the formula is as follows:
Figure BDA0003136176290000072
wherein: y is the receive sequence, δiIndicating the delay of the current detection of the ith user,
Figure BDA0003136176290000073
indicating that the channel estimation coefficient corresponding to the ith user is currently detected,
Figure BDA0003136176290000081
indicating the currently detected ith user sequence;
(3.2) energy detection: calculating the energy of the received sequence after the cancellation in the step (3.1), if the energy value is less than the decision threshold, it indicates that all the user identities have been detected, the iteration is finished, if the energy value is greater than the decision threshold, the step (2) is skipped to continue detecting the user identity sequence until the energy value is less than the decision threshold, and the energy value calculation formula is as follows:
Figure BDA0003136176290000082
where E is the energy of the received sequence, y (i) is the ith symbol in the received sequence, and y (i) is a sequence of complex numbers.
The above description is only of the preferred embodiments of the present invention, and it should be noted that: it will be apparent to those skilled in the art that various modifications and adaptations can be made without departing from the principles of the invention and these are intended to be within the scope of the invention.

Claims (4)

1. An asynchronous access-oriented satellite Internet of things terminal identity identification method is characterized by comprising the following steps: the method comprises three parts of terminal identity sequence receiving, time delay matching, identity detection and user terminal offset, and specifically comprises the following steps:
step (1), receiving a terminal identity sequence: different users send Reed-Muller sequences at different time, and the sequences received by the access point are the superposition of a plurality of asynchronous Reed-Muller user sequences;
step (2), time delay matching and identity detection: the method comprises two parts of time delay matching and user identity detection:
step (2.1) time delay matching: setting a fitness function by taking parameters of user identity detection as a target function, reasonably configuring each parameter in a genetic algorithm, obtaining an individual with high fitness through a random competition selection method, single-point crossing and variation, and performing iteration for a certain number of times to obtain an optimal individual, namely optimal matching time delay;
step (2.2) user identity detection: firstly, designing a Reed-Muller matrix vector pair { P, b }, wherein P is a matrix, b is a column vector, then mapping { P, b } into a unique Reed-Muller sequence, multiplying a Reed-Muller first half sequence and a Reed-Muller second half sequence to obtain a sequence, and orthogonal to a Walsh sequence, namely after the vector is multiplied by the Walsh matrix, a maximum value exists, and the rest values are equal to 0, and by utilizing the characteristic, performing the operation on a received sequence to obtain the position of the maximum value:
Figure FDA0003396351360000011
wherein w is the position of the maximum, (-)IRepresenting the real part, ViThe ith value after the received sequence and the Walsh sequence are multiplied by a matrix is represented, and the total value is m;
w contains partial information of the matrix vector pair { P, b }, the matrix vector pair { P, b } is disassembled one layer each time by using a nested structure of a Reed-Muller sequence, namely the matrix P deletes a first row and a first column, then partial information of the nested structure can be recovered each time, and finally the matrix vector pair { P, b } can be completely recovered by adding the matrix P one by one, and meanwhile, a channel coefficient corresponding to the detected user can be obtained, and the matrix vector pair { P, b } is in one-to-one correspondence with the Reed-Muller sequence, so that the user identity is obtained;
and (3) the user terminal counteracts: the method comprises two parts of user sequence cancellation and energy detection:
step (3.1) counteracting of user sequences: subtracting the user sequence detected in (2) from the received sequence;
step (3.2) energy detection: and (3) calculating the energy value of the received sequence after cancellation, then comparing the energy value with a decision threshold, if the energy value is greater than the decision threshold, indicating that a user identity sequence is not detected yet, then putting the received sequence obtained in the step (3.1) into the step (2) for iteration, if the energy value is less than the decision threshold, indicating that the rest received sequences are noise sequences, and ending the iteration.
2. The asynchronous access-oriented satellite internet of things terminal identity identification method according to claim 1, wherein the asynchronous access-oriented satellite internet of things terminal identity identification method comprises the following steps: in the step (1), the formulas of the user identity sequence and the receiving sequence are as follows:
Figure FDA0003396351360000021
Figure FDA0003396351360000022
wherein: m is the order of the Reed-Muller sequence, the Reed-Muller sequence has a length of 2m,CjIs the jth symbol in the user identity sequence, bmIs a (m × 1) column vector corresponding to the user ID, wt (-) represents the number of "1" in the vector, i.e. the code weight, PmIs a matrix of (m x m) corresponding to the user identity,
Figure FDA0003396351360000023
is an m-bit binary expression of j-1; y isjIs the jth symbol, δ, in the received sequencemaxIs the maximum time delay, kmaxIs the number of users, hkIs the channel coefficient for the kth user, which is modeled as a complex gaussian random process with unit variance,
Figure FDA0003396351360000024
is the jth symbol, δ, in the Reed-Muller identity sequence of the kth userkIs the delay value of the kth user and n represents complex additive white gaussian noise.
3. The asynchronous access-oriented satellite internet of things terminal identity identification method according to claim 2, wherein the asynchronous access-oriented satellite internet of things terminal identity identification method comprises the following steps: the step (2.1) is specifically operated as follows: the optimal time delay matching is found by taking parameters in single user identity detection as an objective function, a scale transformation method is selected, the objective function is taken as a fitness function, then the fitness function is subjected to linear transformation, and the formula is as follows:
F′(X)=α*Fit(x)+β
Figure FDA0003396351360000025
Figure FDA0003396351360000026
wherein: f' (X) is the fitness function after transformation, Fit (X) is the fitness function, FitavgDenotes the average value of Fit (X), FitminRepresents the minimum value of Fit (X);
carrying out the selection and elimination operation on the population by a random competition selection method to obtain a new population, carrying out single-point crossing to enable new individuals to appear in the new population, inheriting the basic characteristics of a parent, carrying out variation after crossing, determining the global search capability of the genetic algorithm by crossing, wherein the variation is only an auxiliary method for generating the new individuals, determining the local search capability of the genetic algorithm, and finally finding the optimal time delay matching after a certain number of iterations.
4. The asynchronous access-oriented satellite internet of things terminal identity identification method according to claim 3, wherein the asynchronous access-oriented satellite internet of things terminal identity identification method comprises the following steps: the step (3) specifically comprises the following steps:
(3.1) subtracting the detected user sequence, channel estimation coefficient and corresponding time delay from the received sequence in step (2) to reduce the interference to the undetected user, wherein the formula is as follows:
Figure FDA0003396351360000031
wherein: y is the receive sequence, δiIndicating the delay of the current detection of the ith user,
Figure FDA0003396351360000032
indicating that the channel estimation coefficient corresponding to the ith user is currently detected,
Figure FDA0003396351360000033
indicating the currently detected ith user sequence;
(3.2) calculating the energy of the received sequence after the cancellation in (3.1), if the energy value is less than the decision threshold, it indicates that all the user identities have been detected, if the energy value is greater than the decision threshold, then jumping to the step (2) to continue detecting the user identity sequence until the energy value is less than the decision threshold, and the energy value calculation formula is as follows:
Figure FDA0003396351360000034
where E is the energy of the received sequence, y (i) is the ith symbol in the received sequence, and y (i) is a sequence of complex numbers.
CN202110720033.3A 2021-06-28 2021-06-28 Asynchronous access-oriented satellite Internet of things terminal identity identification method Active CN113364517B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110720033.3A CN113364517B (en) 2021-06-28 2021-06-28 Asynchronous access-oriented satellite Internet of things terminal identity identification method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110720033.3A CN113364517B (en) 2021-06-28 2021-06-28 Asynchronous access-oriented satellite Internet of things terminal identity identification method

Publications (2)

Publication Number Publication Date
CN113364517A CN113364517A (en) 2021-09-07
CN113364517B true CN113364517B (en) 2022-02-18

Family

ID=77537026

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110720033.3A Active CN113364517B (en) 2021-06-28 2021-06-28 Asynchronous access-oriented satellite Internet of things terminal identity identification method

Country Status (1)

Country Link
CN (1) CN113364517B (en)

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017049512A1 (en) * 2015-09-23 2017-03-30 华为技术有限公司 Base station, user terminal, and data transmission method
CN108768903B (en) * 2018-03-21 2021-01-26 西安电子科技大学 Multi-user detection method of low-orbit satellite random access system based on CRDSA (China compact disc system discovery and maintenance) protocols
US11496896B2 (en) * 2019-03-01 2022-11-08 Lenovo (Singapore) Pte. Ltd. User equipment authentication
CN110418402B (en) * 2019-07-16 2021-06-01 东南大学 User random access method and device based on ephemeris broadcast assisted positioning
CN112105087B (en) * 2020-09-21 2022-08-02 南京邮电大学 Asynchronous random access method based on multi-satellite cooperative beam forming technology

Also Published As

Publication number Publication date
CN113364517A (en) 2021-09-07

Similar Documents

Publication Publication Date Title
Wang et al. Physical-layer authentication based on extreme learning machine
Chen et al. Channel aware decision fusion in wireless sensor networks
CN105721106B (en) SCMA ascending communication system multi-user test method based on serial strategy
Chen et al. An efficient tag search protocol in large-scale RFID systems with noisy channel
Jiao et al. Clustering scheme for cooperative spectrum sensing in cognitive radio networks
Yan et al. DV‐hop localisation algorithm based on optimal weighted least square in irregular areas
CN109490826A (en) A kind of ranging and location positioning method based on radio wave field strength RSSI
CN107277773B (en) Adaptive positioning method combining multiple contextual models
Lu et al. Multiple-target tracking based on compressed sensing in the Internet of Things
Cui et al. A gossip-based TDOA distributed localization algorithm for wireless sensor networks
CN113364517B (en) Asynchronous access-oriented satellite Internet of things terminal identity identification method
CN113438732B (en) DV-Hop positioning method based on jump distance weighting and gold sine particle swarm
CN108566227B (en) Multi-user detection method
JP6386052B2 (en) Object detection in a wireless environment
Liu et al. Multiregional secure localization using compressive sensing in wireless sensor networks
CN108834043B (en) Priori knowledge-based compressed sensing multi-target passive positioning method
He et al. A hybrid data fusion based cooperative localization approach for cellular networks
Jin et al. 5G cyberspace security game
CN114884626A (en) PSFCH signal detection method and device, storage medium and electronic device
Zou et al. Joint user activity and data detection in grant-free NOMA using generative neural networks
Zhou et al. Adaptive secondary-user selection without prior information for cooperative spectrum sensing in CRNs
Ma et al. Service demand prediction with incomplete historical data
Gao et al. An improved DV-Hop algorithm based on average hop distance and estimated coordinates
Zhang et al. Spectrum usage anomaly detection from sub-sampled data stream via deep neural network
Wang et al. WiFi fingerprint based indoor localization with iterative weighted KNN for WiFi AP missing

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