CN110365390B - Low-power-consumption Internet of things wireless power supply distributed MIMO antenna network arrangement optimization method - Google Patents

Low-power-consumption Internet of things wireless power supply distributed MIMO antenna network arrangement optimization method Download PDF

Info

Publication number
CN110365390B
CN110365390B CN201910772061.2A CN201910772061A CN110365390B CN 110365390 B CN110365390 B CN 110365390B CN 201910772061 A CN201910772061 A CN 201910772061A CN 110365390 B CN110365390 B CN 110365390B
Authority
CN
China
Prior art keywords
antennas
antenna
reader
writer
tag
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
CN201910772061.2A
Other languages
Chinese (zh)
Other versions
CN110365390A (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.)
Hangzhou Zhiai Time Technology Co ltd
Original Assignee
Hangzhou Zhiai Time Technology Co ltd
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 Hangzhou Zhiai Time Technology Co ltd filed Critical Hangzhou Zhiai Time Technology Co ltd
Priority to CN201910772061.2A priority Critical patent/CN110365390B/en
Publication of CN110365390A publication Critical patent/CN110365390A/en
Application granted granted Critical
Publication of CN110365390B publication Critical patent/CN110365390B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/23—Clustering techniques
    • G06F18/232—Non-hierarchical techniques
    • G06F18/2321—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions
    • G06F18/23213—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions with fixed number of clusters, e.g. K-means clustering
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/20—Design optimisation, verification or simulation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B5/00—Near-field transmission systems, e.g. inductive or capacitive transmission systems
    • H04B5/70—Near-field transmission systems, e.g. inductive or capacitive transmission systems specially adapted for specific purposes
    • H04B5/77—Near-field transmission systems, e.g. inductive or capacitive transmission systems specially adapted for specific purposes for interrogation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/022—Site diversity; Macro-diversity
    • H04B7/024—Co-operative use of antennas of several sites, e.g. in co-ordinated multipoint or co-operative multiple-input multiple-output [MIMO] systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
    • H04B7/0615—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal
    • H04B7/0617—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal for beam forming
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18—Network planning tools
    • H04W16/20—Network planning tools for indoor coverage or short range network deployment

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Computation (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Geometry (AREA)
  • Computer Hardware Design (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Evolutionary Biology (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Variable-Direction Aerials And Aerial Arrays (AREA)

Abstract

The invention provides a low-power-consumption Internet of things wireless power supply distributed MIMO antenna network arrangement optimization method, which comprises the following steps: 1. finding out the position of each antenna according to the tag set at the given position, judging whether the threshold condition of the tag set completely covering the given position is met, calculating the minimum total number of reader-writer antennas meeting the threshold condition, and performing beam forming processing on all the antennas, wherein the number of antennas which are matched to allow beam forming is equal to the total number of the reader-writer antennas; 2. after the total number of the reader-writer antennas is increased and the number of the antennas allowed to be shaped by beams is reduced, the position of each antenna is determined again, and the optimal combination of the total number of the reader-writer antennas and the number of the antennas allowed to be shaped by beams under the condition of meeting the threshold value is calculated; 3. and distributing the network for the antennas according to the total number of the selected reader-writer antennas under the optimal combination, the number of the allowed beam forming antennas and the positions of the antennas. The invention can reduce the number of the antennas and the complexity of beam forming.

Description

Low-power-consumption Internet of things wireless power supply distributed MIMO antenna network arrangement optimization method
Technical Field
The invention relates to an optimization method for the number and the arrangement of reader-writer antennas in a passive radio frequency identification system, in particular to a low-power-consumption internet-of-things wireless power supply distributed MIMO antenna networking optimization method.
Background
A Radio Frequency Identification (RFID) system includes an RF tag and a reader/writer that transmits and receives data via radio frequency signals, and since a communication range between the reader/writer and the tag is limited, generally, one system involves a plurality of reader/writers and a plurality of antennas, and how to deploy these reader/writers and antennas becomes a very important issue. In addition, communication service is continuously developed, people have higher and higher requirements on wireless communication networks, the antenna plays a crucial role in equipment needing wireless information transmission, the stability and reliability of the equipment in information transmission can be improved by reasonably arranging the number and the positions of the antenna, the cost is effectively reduced, and the system efficiency is improved.
The document "Optimizing RFID Network Planning by Using a Particle Swarm Optimizing algorithm With Redundant Reader/writer With reduced Reader/writer optimization" discloses an optimization of RFID Network deployment by eliminating Redundant Reader/writers, which adopts a tentative Reader/writer Elimination (TRE) method to handle the RFID Network Planning problem (RNP) assuming that each Reader/writer uses only one antenna. On the premise that the coverage rate of the current tag set is 100%, the reader-writer with the least covered tags in the network is tried to be deleted, but the number of the reader-writers in the network is reduced by one, and meanwhile the coverage rate of the network may be reduced.
In future intelligent living and working environments, a large number of internet of things devices are connected into a wireless network, and in the face of the situation of continuous power supply, a power supply mode of laying a wired power supply is unrealistic to supply power for massive internet of things devices; the battery-powered mode is very troublesome to replace, and the volume and the cost of the Internet of things equipment are increased. The low-power consumption equipment can be wirelessly powered through the beamforming generated by the antenna, which relates to an important network layout optimization problem of a wireless power supply energy emission source antenna, and the research of the network layout optimization problem of the low-power consumption internet of things wireless power supply distributed MIMO antenna is very little.
The existing multiple indoor wireless communication system antenna position optimization technologies utilize specific transmitting signal characteristics to select the optimal antenna network arrangement position, and reduce the error rate of transmission. However, the effective coverage area of the method is not a given target area, only the optimal deployment position of the centralized antenna is considered, the optimal network distribution position of the distributed antenna is not considered, the number of the antennas to be used is large, and the complexity of beam forming is high.
Based on this, the present case arises.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a low-power-consumption internet-of-things wireless power supply distributed MIMO antenna network deployment optimization method, which is used for realizing full coverage on a passive tag set at a given position, ensuring that each tag can be activated smoothly, calculating the number of antennas required by the tag set covering all the given positions, optimizing the number of antennas participating in beam forming and the positions of the antennas, reducing the using amount of wireless power supply energy emission source antennas and reducing the complexity of beam forming.
The problem of the invention is realized as follows:
a low-power-consumption Internet of things wireless power supply distributed MIMO antenna network arrangement optimization method comprises the following steps:
step 1, finding out the position of each antenna according to a tag set at a given position, judging whether a threshold condition of the tag set which completely covers the given position is met or not according to the positions of the antennas, calculating the minimum total number of reader-writer antennas meeting the threshold condition, performing beam forming treatment on all the antennas, calculating the number of antennas which are allowed to perform beam forming, wherein the number of the antennas which are matched and allowed to perform beam forming is equal to the total number of the antennas of the reader-writer;
step 2, according to the minimum total number of the reader-writer antennas and the number of antennas which are currently matched and allowed to perform beam forming, after increasing the total number of the reader-writer antennas and reducing the number of the antennas which are allowed to perform beam forming, re-determining the position of each antenna, and calculating the optimal combination of the total number of the reader-writer antennas and the number of the antennas which are allowed to perform beam forming under the condition of meeting the threshold value according to the position of the antenna at the moment;
and 3, distributing the network for the reader-writer antennas according to the total number of the selected reader-writer antennas under the optimal combination, the number of the allowed beam forming antennas and the positions of the corresponding antennas.
Further, the step 1 specifically includes:
step 11, supposing that the total number of the reader-writer antennas to be solved is M, wherein J antennas are used for beam forming;
step 12, calculating the value of M in a recursive manner, and enabling Mn+1＝mn+1 calculate the next mn+1Up to mn+1Is M, wherein MnRepresenting the total number of antennas, m, of the reader/writer at presentnIs an integer and has an initial value of 0, n is an integer and has an initial value of 0; m isn+1Representing the total number of next reader-writer antennas;
step 13, clustering the label sets at all given positions by using a K-means clustering algorithm, and finding out the central positions of all classes, namely mn+1The position coordinates of the antennas, represented as R for a set of antenna coordinate sets at a given position, where the coordinate of the mth antenna is R (m), 1. ltoreq. m.ltoreq.mn+1；
Step 14, for all tags i, according to the mn+1Calculating the maximum total power of the reader-writer antenna and the maximum total power of the label reflection received by the reader-writer antenna under the optimal beam forming according to the position coordinates of the root antennan+1Judging whether the position coordinates of the root antenna meet a threshold condition: the maximum total power of the reader-writer antenna obtained by the label is not less than the sensitivity of the label, the maximum total power of the reflection of the label received by the reader-writer antenna is not less than the sensitivity of the reader-writer, and if the maximum total power of the reflection of the label is not less than the sensitivity of the reader-writer, the maximum total power of the reflection of the label is Mn+1Satisfying a set of labels covering all given locations; if not, let the current mn＝mn+1Then execute the next mn+1Repeating the steps 13-14 until the threshold condition is met;
step 15, when the maximum total power of the reader-writer antenna obtained by the tag is not less than the sensitivity of the tag and the maximum total power of the reflection of the tag received by the reader-writer antenna is not less than the sensitivity of the reader-writer, M is M at this timen+1Let J be M for the minimum total number of reader antennas that completely cover the tag set at all given locations.
Further, the step 14 specifically includes:
for all tags i, according to this mn+1The position coordinates of the root antenna determine the distance d from the kth antenna to the ith labelkiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA0002173886640000031
Equation 1:
Figure BDA0002173886640000032
wherein c represents the speed of light, fcRepresenting the carrier frequency, dkiRepresents the distance from the kth antenna to the ith tag, and γ is the path loss exponent;
calculating the maximum total power of the reader-writer antenna obtained by the label and the maximum total power of the label reflection received by the reader-writer antenna under the optimal beam forming through a formula 2 and a formula 3 respectively;
equation 2:
Figure BDA0002173886640000033
wherein the content of the first and second substances,
Figure BDA0002173886640000034
representing the maximum total power of the reader antenna,
Figure BDA0002173886640000035
the antenna subset is selected from all M reader-writer antennas and used for beam forming, and the number of the antennas in the subset is J; pTXIndicating that each antenna uses equal transmit power, GRIndicating the gain of the reader antenna, GTThe antenna gain of each tag is expressed,
Figure BDA0002173886640000036
representing the channel loss from the kth antenna to the ith tag,
Figure BDA0002173886640000037
from the k antenna to theThe channel coefficients of the forward link for the i tags,
Figure BDA0002173886640000038
a beam forming weight value of a forward link from the kth antenna to the ith tag;
Figure BDA0002173886640000039
wherein the content of the first and second substances,
Figure BDA0002173886640000041
the maximum total reflection power of the label received by the antenna of the reader-writer is represented;
Figure BDA0002173886640000042
indicating that the ith tag receives the reverse link channel loss of the mth antenna, when m is k,
Figure BDA0002173886640000043
the channel coefficients of the reverse link for the mth antenna are received for the ith tag, and when m is k,
Figure BDA0002173886640000044
and receiving the beamforming weight of the reverse link of the mth antenna for the ith tag, when m is k,
Figure BDA0002173886640000045
when in use
Figure BDA0002173886640000046
And is
Figure BDA0002173886640000047
When M is Mn+1For the minimum total number of reader/writer antennas, where θTIndicating the sensitivity of the tag, thetaRIndicating the sensitivity of the reader/writer.
Further, the step 2 specifically includes:
step 21, returning a (J, M) pair corresponding to the minimum total number of reader-writer antennas, wherein J is M;
step 22, through a recursive method, let jx-1＝jx-1 is decremented, wherein jxIndicating the number of antennas currently allowed to be beamformed, jxThe initial value of (A) is J, x is an integer of x being more than or equal to 2 and less than or equal to J, and the initial value of x is J; j is a function ofx-1J is more than or equal to 1 and represents the number of the next antennas allowed to be shaped by beamsx-1J-1 or less; at the same time, let my+1＝my+1, wherein myRepresenting the total number of antennas, m, of the reader/writer at presentyIs M; y is an integer of which y is more than or equal to M, and the initial value of y is M; m isy+1Indicates the total number of antennas of the next reader/writer, my+1≥M+1；
Step 23, clustering the label sets at all given positions by using a K-means clustering algorithm, and finding out the central positions of all classes, namely my+1The position coordinates of the antennas, represented as R for a set of antenna coordinate sets at a given position, where the coordinate of the mth antenna is R (m), 1. ltoreq. m.ltoreq.my+1；
Step 24, according to the my+1Judging whether the position coordinates of the root antenna meet a threshold condition:
Figure BDA0002173886640000048
and is
Figure BDA0002173886640000049
If satisfied, (j) at this timex-1，my+1) (j) satisfies the set of labels covering all given locations, at that timex-1，my+1) The optimal combination is obtained; if not, then j is kept at this timex-1Is unchanged, let the current my＝my+1Then execute the next my+1＝my+1, repeating steps 23-24 until a threshold condition is met;
step 25, let j which finally satisfies the threshold conditionx-1And my+1Is set to j of the next roundxAnd myRepeating the steps 22-25 until jx-1Is 1.
Further, the step 25 is followed by: providing optimal received power for a given set of tags in a location
Figure BDA00021738866400000410
The calculation method is shown in formula 4:
equation 4:
Figure BDA00021738866400000411
wherein
Figure BDA00021738866400000412
Represents the power received by the ith tag from the kth antenna with the optimal beamforming;
Figure BDA00021738866400000413
a wave beam forming weight value of a forward link from a kth antenna to an ith label is obtained;
Figure BDA00021738866400000414
the maximum value of the total received power of the ith label under the optimal beamforming of each antenna to the ith label is obtained, and the weight of each antenna at the moment
Figure BDA0002173886640000051
Is the best weight for the ith label if satisfied
Figure BDA0002173886640000052
And is
Figure BDA0002173886640000053
The threshold condition of (d) indicates that the tag was successfully identified over-coverage.
Further, each tag in the tag set at the given position is a standard Gen-2 passive tag, and the antenna gain of each tag is GTAll tags are static.
Furthermore, the reader-writer antennas are all omni-directional distributed antennas and have the same gain G of received signalsR。
The invention has the advantages that:
(1) the invention is an optimization method of the number of antennas and the arrangement thereof, which calculates the lower bound of the number of antennas required by a label set covering a given position and obviously reduces the number of antennas;
(2) the invention can calculate the optimal combination of the number of the antennas which are allowed to carry out beam forming and the total number of the antennas on the basis of covering all the tag sets at the given positions, thereby reducing the complexity of the beam forming and improving the efficiency of a system using the algorithm;
(3) the invention discloses a low-power-consumption internet-of-things wireless power supply distributed MIMO antenna network arrangement optimization method, which can obtain an optimal solution of antenna network arrangement positions under a K-means clustering algorithm.
Drawings
The invention will be further described with reference to the following examples with reference to the accompanying drawings.
Fig. 1 is an execution flow chart of the low-power-consumption internet-of-things wireless power supply distributed MIMO antenna networking optimization method.
Fig. 2 is a comparison diagram before and after the optimal reader antenna is deployed in the embodiment of the present invention.
Fig. 3 is a schematic diagram of conditions for satisfying the transmission and reception powers in the embodiment of the present invention.
Fig. 4 is an optimized combined line graph of the number of antennas participating in beamforming of the reader/writer corresponding to the total number of antennas of the reader/writer in the embodiment of the present invention.
Fig. 5 is a line diagram of beam forming complexity in an embodiment of the present invention.
Detailed Description
In order to make the technical means and technical effects achieved by the technical means of the present invention more clearly and more perfectly disclosed, the following embodiments are provided, and the following detailed description is made with reference to the accompanying drawings:
as shown in fig. 1, the method for optimizing the network deployment of the low-power-consumption internet-of-things wireless power supply distributed MIMO antenna of the invention comprises the following steps:
step 1, finding out the position of each antenna according to a tag set at a given position, judging whether a threshold condition of the tag set which completely covers the given position is met or not according to the positions of the antennas, calculating the minimum total number of reader-writer antennas meeting the threshold condition, performing beam forming treatment on all the antennas, calculating the number of antennas which are allowed to perform beam forming, wherein the number of the antennas which are matched and allowed to perform beam forming is equal to the total number of the antennas of the reader-writer;
step 2, according to the minimum total number of the reader-writer antennas and the number of antennas which are currently matched and allowed to perform beam forming, after increasing the total number of the reader-writer antennas and reducing the number of the antennas which are allowed to perform beam forming, re-determining the position of each antenna, and calculating the optimal combination of the total number of the reader-writer antennas and the number of the antennas which are allowed to perform beam forming under the condition of meeting the threshold value according to the position of the antenna at the moment;
and 3, distributing the network for the reader-writer antennas according to the total number of the selected reader-writer antennas under the optimal combination, the number of the allowed beam forming antennas and the positions of the corresponding antennas.
The low-power-consumption internet-of-things wireless power supply distributed MIMO antenna network deployment optimization method is used for calculating the number of antennas required by a tag set covering all given positions, the number of antennas optimizing beam forming and the positions of the antennas, so that the passive tag set at the given positions is fully covered, each tag can be enabled to be activated smoothly, and information returned by the tags can be received correctly. The method can reduce the using amount of the antenna and the complexity of beam forming.
Preferably, each tag in the tag set at the given location is a standard class 1, generation 2 (Gen-2) passive tag, and each tag has an antenna gain of GTAll tags are static, and the coordinates of the tags are known a priori information; the reader-writer antennas are all omni-directional distributed antennas and have the same gain G for receiving signalsR。
Preferably, the step 1 specifically includes:
step 11, supposing that the total number of the reader-writer antennas to be solved is M, wherein J antennas are used for beam forming;
step 12, calculating the value of M by a recursive methodLet m stand forn+1＝mn+1 calculate the next mn+1Up to mn+1Is M, wherein MnRepresenting the total number of antennas, m, of the reader/writer at presentnIs an integer and has an initial value of 0, n is an integer and has an initial value of 0; m isn+1Representing the total number of next reader-writer antennas;
step 13, clustering the label sets at all given positions by using a K-means clustering algorithm, and finding out the central positions of all classes, namely mn+1The position coordinates of the antennas, represented as R for a set of antenna coordinate sets at a given position, where the coordinate of the mth antenna is R (m), 1. ltoreq. m.ltoreq.mn+1；
Step 14, for all tags i, according to the mn+1The position coordinates of the root antenna determine the distance d from the kth antenna to the ith labelkiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA0002173886640000071
Equation 1:
Figure BDA0002173886640000072
wherein c represents the speed of light, fcRepresenting the carrier frequency, dkiRepresents the distance from the kth antenna to the ith tag, and γ is the path loss exponent;
calculating the maximum total power of the reader-writer antenna obtained by the label and the maximum total power of the label reflection received by the reader-writer antenna under the optimal beam forming through a formula 2 and a formula 3 respectively;
equation 2:
Figure BDA0002173886640000073
wherein the content of the first and second substances,
Figure BDA0002173886640000074
representing the maximum total power of the reader antenna,
Figure BDA0002173886640000075
the antenna subset is selected from all M reader-writer antennas and used for beam forming, and the number of the antennas in the subset is J; pTXIndicating that each antenna uses equal transmit power, GRIndicating the gain of the reader antenna, GTThe antenna gain of each tag is expressed,
Figure BDA0002173886640000076
representing the channel loss from the kth antenna to the ith tag,
Figure BDA0002173886640000077
is the channel coefficient for the forward link from the kth antenna to the ith tag,
Figure BDA0002173886640000078
a beam forming weight value of a forward link from the kth antenna to the ith tag;
equation 3:
Figure BDA0002173886640000079
wherein the content of the first and second substances,
Figure BDA00021738866400000710
the maximum total reflection power of the label received by the antenna of the reader-writer is represented;
Figure BDA00021738866400000711
indicating that the ith tag receives the reverse link channel loss of the mth antenna, when m is k,
Figure BDA00021738866400000712
the channel coefficients of the reverse link for the mth antenna are received for the ith tag, and when m is k,
Figure BDA00021738866400000713
and receiving the beamforming weight of the reverse link of the mth antenna for the ith tag, when m is k,
Figure BDA00021738866400000714
according to the mn+1Judging whether the position coordinates of the root antenna meet a threshold condition:
Figure BDA00021738866400000715
and is
Figure BDA00021738866400000716
Wherein, thetaTIndicating the sensitivity of the tag, thetaRThe sensitivity of the reader/writer is indicated, and if satisfied, M is Mn+1Satisfying a set of labels covering all given locations; if not, let the current mn＝mn+1Then execute the next mn+1＝mn+1, repeating steps 13-14 until a threshold condition is met;
step 15, as shown in fig. 3, the schematic diagram of the conditions for the transmission and reception power satisfaction is shown, when the conditions are satisfied
Figure BDA00021738866400000717
And is
Figure BDA00021738866400000718
When M is Mn+1Let J be M for the minimum total number of reader antennas that completely cover the tag set at all given locations.
Examples include:
let mnAnd n has an initial value of 0, i.e. m0When the value is 0, the next value m1＝m0And (3) setting +1 to 0+1 to 1, wherein only 1 antenna is arranged at the moment, the position coordinate of the antenna is found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinate of the antennakiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA0002173886640000081
Then according to
Figure BDA0002173886640000082
Computing
Figure BDA0002173886640000083
And
Figure BDA0002173886640000084
judging that the threshold condition cannot be met by adopting 1 antenna when the tag set at a given position is determined:
Figure BDA0002173886640000085
and is
Figure BDA0002173886640000086
That is, when the number of antennas M is 1, the antennas cannot completely cover all the tag sets at a given location;
then let the next value m2＝m1And determining the distance d from the kth antenna to the ith tag according to the position coordinates of the 2 antennas, wherein the +1 is equal to 1 and the +1 is equal to 2, and only 2 antennas are arranged at the moment, the position coordinates of the 2 antennas are found out, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 2 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA0002173886640000087
Then according to
Figure BDA0002173886640000088
Computing
Figure BDA0002173886640000089
And
Figure BDA00021738866400000810
judging that the threshold condition cannot be met by adopting 2 antennas when the tag set at a given position is determined:
Figure BDA00021738866400000811
and is
Figure BDA00021738866400000812
I.e. when the number of antennas M is 2, the antennasA labelset that cannot completely cover all given locations;
then let the next value m3＝m2And 3, only 3 antennas are arranged at the moment, the position coordinates of the 3 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 3 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA00021738866400000813
Then according to
Figure BDA00021738866400000814
Computing
Figure BDA00021738866400000815
And
Figure BDA00021738866400000816
judging that the threshold condition cannot be met by adopting 3 antennas when the tag set at a given position is determined:
Figure BDA00021738866400000817
and is
Figure BDA00021738866400000818
That is, when the number of antennas M is 3, the antennas cannot completely cover all of the tag sets at a given location;
then let the next value m4＝m3And determining the distance d from the kth antenna to the ith tag according to the position coordinates of the 4 antennas, wherein the +1 is 3, the +1 is 4, only the 4 antennas are arranged at the moment, the position coordinates of the 4 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 4 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA00021738866400000819
Then according to
Figure BDA00021738866400000820
Computing
Figure BDA00021738866400000821
And
Figure BDA00021738866400000822
judging that the threshold condition cannot be met by adopting 4 antennas when the tag set at a given position is determined:
Figure BDA00021738866400000823
and is
Figure BDA00021738866400000824
That is, when the number of antennas M is 4, the antennas cannot completely cover all of the tag sets at a given location;
then let the next value m5＝m4And determining the distance d from the kth antenna to the ith tag according to the position coordinates of the 5 antennas, wherein the +1 is equal to 4 and the +1 is equal to 5, and only the 5 antennas are arranged at the moment, the position coordinates of the 5 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 5 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA00021738866400000825
Then according to
Figure BDA00021738866400000826
Computing
Figure BDA0002173886640000091
And
Figure BDA0002173886640000092
when the tag set at a given position is judged to be not capable of meeting the threshold condition by adopting 5 antennas:
Figure BDA0002173886640000093
and is
Figure BDA0002173886640000094
That is, when the number of antennas M is 5, the antennas cannot completely cover all of the tag sets at a given location;
then let the next value m6＝m5And determining the distance d from the kth antenna to the ith tag according to the position coordinates of the 6 antennas, wherein the +1 is equal to 5 and the +1 is equal to 6, only the 6 antennas are arranged at the moment, the position coordinates of the 6 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 6 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA0002173886640000095
Then according to
Figure BDA0002173886640000096
Computing
Figure BDA0002173886640000097
And
Figure BDA0002173886640000098
judging that the threshold condition cannot be met by adopting 6 antennas when the tag set at a given position is determined:
Figure BDA0002173886640000099
and is
Figure BDA00021738866400000910
That is, when the number of antennas M is 6, the antennas cannot completely cover all of the tag sets at a given location;
then let the next value m7＝m6And determining the distance d from the kth antenna to the ith tag according to the position coordinates of the 7 antennas, wherein the +1 is 6, the +1 is 7, the 7 antennas are only arranged at the moment, the position coordinates of the 7 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 7 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA00021738866400000911
Then according to
Figure BDA00021738866400000912
Computing
Figure BDA00021738866400000913
And
Figure BDA00021738866400000914
when the tag set at a given position is judged to be incapable of meeting the threshold condition by adopting 7 antennas:
Figure BDA00021738866400000915
and is
Figure BDA00021738866400000916
That is, when the number of antennas M is 7, the antennas cannot completely cover all of the tag sets at a given location;
then let the next value m8＝m7And determining the distance d from the kth antenna to the ith tag according to the position coordinates of the 8 antennas, wherein the +1 is 7, the +1 is 8, only the 8 antennas are arranged at the moment, the position coordinates of the 8 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 8 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA00021738866400000917
Then according to
Figure BDA00021738866400000918
Computing
Figure BDA00021738866400000919
And
Figure BDA00021738866400000920
judging that the condition of a threshold value cannot be met by adopting 8 antennas when the tag set at a given position is given:
Figure BDA00021738866400000921
and is
Figure BDA00021738866400000922
That is, when the number of antennas M is 8, the antennas cannot completely cover all of the tag sets at a given location;
then let the next value m9＝m8+ 1+ 8+ 1-9, only 9 antennas, and findThe position coordinates of the 9 antennas are obtained, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 9 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA00021738866400000923
Then according to
Figure BDA00021738866400000924
Computing
Figure BDA00021738866400000925
And
Figure BDA00021738866400000926
judging that the threshold condition cannot be met by adopting 9 antennas when the tag set at a given position is determined:
Figure BDA00021738866400000927
and is
Figure BDA00021738866400000928
That is, when the number of antennas M is 9, the antennas cannot completely cover all of the tag sets at a given location;
then let the next value m10＝m9And when the +1 is 9 and the +1 is 10, only 10 antennas are arranged, the position coordinates of the 10 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 10 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA0002173886640000101
Then according to
Figure BDA0002173886640000102
Computing
Figure BDA0002173886640000103
And
Figure BDA0002173886640000104
when the tag set at a given position is judged to adopt 10 antennas, the threshold condition can be met:
Figure BDA0002173886640000105
and is
Figure BDA0002173886640000106
I.e., when the number of antennas M is 10, the antennas may completely cover all of the tag sets for a given location.
As shown in fig. 2, which is a comparison diagram before and after the antenna deployment of the optimized reader-writer of the present invention, in this embodiment, 1000 tag positions are generated within a range of 60M × 60M, in the diagram, "+" indicates the distribution of tags, and a circle indicates that no beamforming is used, at this time, the reader-writer needs 41 antennas to cover all tags, and after the number of beamforming antennas is optimized by using the method, it can be seen from the diagram that when the number J of beamforming antennas is equal to the total number M of antennas, the optimal number is equal to 10,
preferably, the step 2 specifically includes:
step 21, returning a (J, M) pair corresponding to the minimum total number of reader-writer antennas, wherein J is M;
step 22, through a recursive method, let jx-1＝jx-1 is decremented, wherein jxIndicating the number of antennas currently allowed to be beamformed, jxThe initial value of (A) is J, x is an integer of x being more than or equal to 2 and less than or equal to J, and the initial value of x is J; j is a function ofx-1J is more than or equal to 1 and represents the number of the next antennas allowed to be shaped by beamsx-1J-1 or less; at the same time, let my+1＝my+1, wherein myRepresenting the total number of antennas, m, of the reader/writer at presentyIs M; y is an integer of which y is more than or equal to M, and the initial value of y is M; m isy+1Indicates the total number of antennas of the next reader/writer, my+1≥M+1；
Step 23, clustering the label sets at all given positions by using a K-means clustering algorithm, and finding out the central positions of all classes, namely my+1The position coordinates of the root antenna, a set of antenna coordinate sets for a given position denoted R,wherein the coordinate of the mth antenna is R (m), m is more than or equal to 1 and less than or equal to my+1；
Step 24, according to the my+1Judging whether the position coordinates of the root antenna meet a threshold condition:
Figure BDA0002173886640000107
and is
Figure BDA0002173886640000108
If satisfied, (j) at this timex-1，my+1) (j) satisfies the set of labels covering all given locations, at that timex-1，my+1) The optimal combination is obtained; if not, then j is kept at this timex-1Is unchanged, let the current my＝my+1Then execute the next my+1＝my+1, repeating steps 23-24 until a threshold condition is met;
step 25, let j which finally satisfies the threshold conditionx-1And my+1Is set to j of the next roundxAnd myRepeating the steps 22-25 until jx-1Is 1;
step 26 of providing optimal received power for a given set of tags at a given location
Figure BDA0002173886640000109
The calculation method is shown in formula 4:
equation 4:
Figure BDA00021738866400001010
wherein
Figure BDA0002173886640000111
Represents the power received by the ith tag from the kth antenna with the optimal beamforming;
Figure BDA0002173886640000112
a wave beam forming weight value of a forward link from a kth antenna to an ith label is obtained;
Figure BDA0002173886640000113
the maximum value of the total received power of the ith label under the optimal beamforming of each antenna to the ith label is obtained, and the weight of each antenna at the moment
Figure BDA0002173886640000114
Is the best weight for the ith label if satisfied
Figure BDA0002173886640000115
And is
Figure BDA0002173886640000116
The threshold condition of (d) indicates that the tag was successfully identified over-coverage.
Examples include:
when the (J, M) pair corresponding to the minimum total number of reader-writer antennas is (10,10), let JxAnd x has an initial value of J10, i.e. J 1010, let myAnd y has an initial value of M-10, i.e. M 1010, the next value j9＝j10-1＝10-1＝9，m11＝m10And when the +1 is 10+1 is 11, the total number of the reader-writer antennas is 11, only 9 antennas are subjected to beam forming processing, the position coordinates of the 11 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 11 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA0002173886640000117
Then according to
Figure BDA0002173886640000118
Computing
Figure BDA0002173886640000119
And
Figure BDA00021738866400001110
when the tag set at a given position is judged to be adopted, 11 antennas can meet the threshold condition:
Figure BDA00021738866400001111
and is
Figure BDA00021738866400001112
That is, when the total number M of the reader antennas is 11 and the number J of the antennas for beamforming is 9, the antennas can completely cover all the tag sets at the given positions, the number of the antennas to be used is large, and the complexity of beamforming can be reduced, at this time, when J is 9, the optimal combination (J, M) is (9, 11);
then let the next value j8＝j9-1＝9-1＝8，m12＝m11And + 1+ 12, the total number of the reader-writer antennas is 12, but only 8 antennas are subjected to beam forming processing, the position coordinates of the 12 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 12 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA00021738866400001113
Then according to
Figure BDA00021738866400001114
Computing
Figure BDA00021738866400001115
And
Figure BDA00021738866400001116
when the label set at a given position is judged to be satisfied with 12 antennas:
Figure BDA00021738866400001117
and is
Figure BDA00021738866400001118
That is, when the total number M of the reader antennas is 12 and the number J of the antennas for beam forming is 8, the antennas can completely cover all the tag sets at the given positions, the number of the antennas to be used is large, and the reader antennas can be used in a large numberReducing the complexity of beam forming, wherein when J is 8, the optimal combination (J, M) is (8, 12);
then let the next value j7＝j8-1＝8-1＝7，m13＝m12And + 1-12 + 1-13, wherein the total number of the reader-writer antennas is 13, but only 7 antennas are subjected to beam forming processing, the position coordinates of the 13 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 13 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA00021738866400001119
Then according to
Figure BDA00021738866400001120
Computing
Figure BDA00021738866400001121
And
Figure BDA00021738866400001122
judging that the adoption of 13 antennas in the tag set at a given position can meet the threshold condition:
Figure BDA0002173886640000121
and is
Figure BDA0002173886640000122
That is, when the total number M of the reader antennas is 13 and the number J of the antennas for beamforming is 7, the antennas can completely cover all the tag sets at the given positions, the number of the antennas to be used is large, and the complexity of beamforming can be reduced, and at this time, when J is 7, the optimal combination (J, M) is (7, 13);
then let the next value j6＝j7-1＝7-1＝6，m14＝m13And + 1-13 + 1-14, wherein the total number of the reader-writer antennas is 14, but only 6 antennas are subjected to beam forming processing, the position coordinates of the 14 antennas are found, and the k antenna to the k antenna are determined according to the position coordinates of the 14 antennasDistance d of i tagskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA0002173886640000123
Then according to
Figure BDA0002173886640000124
Computing
Figure BDA0002173886640000125
And
Figure BDA0002173886640000126
the use of 14 antennas in a given set of tags is judged to satisfy the threshold condition:
Figure BDA0002173886640000127
and is
Figure BDA0002173886640000128
That is, when the total number M of the reader antennas is 14 and the number J of the antennas for beamforming is 6, the antennas can completely cover all the tag sets at the given positions, the number of the antennas to be used is large, and the complexity of beamforming can be reduced, and at this time, when J is 6, the optimal combination (J, M) is (6, 14);
then let the next value j5＝j6-1＝6-1＝5，m15＝m14And + 1-14 + 1-15, the total number of the reader-writer antennas is 15, only 5 antennas are subjected to beam forming processing, the position coordinates of the 15 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 12 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA0002173886640000129
Then according to
Figure BDA00021738866400001210
Computing
Figure BDA00021738866400001211
And
Figure BDA00021738866400001212
the 15 antennas used when the tag set at a given position is judged to satisfy the threshold condition:
Figure BDA00021738866400001213
and is
Figure BDA00021738866400001214
That is, when the total number M of the reader antennas is 15 and the number J of the antennas for beamforming is 5, the antennas can completely cover all the tag sets at the given positions, the number of the antennas to be used is large, and the complexity of beamforming can be reduced, and at this time, when J is 5, the optimal combination (J, M) is (5, 15);
then let the next value j4＝j5-1＝5-1＝4，m16＝m15And + 1-15 + 1-16, the total number of the reader-writer antennas is 16, but only 4 antennas are subjected to beam forming processing, the position coordinates of the 16 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 16 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA00021738866400001215
Then according to
Figure BDA00021738866400001216
Computing
Figure BDA00021738866400001217
And
Figure BDA00021738866400001218
it is judged that the use of 16 antennas in a given set of tags fails to satisfy the threshold condition:
Figure BDA00021738866400001219
and is
Figure BDA00021738866400001220
That is, when the total number M of the reader antennas is 16 and the number J of the antennas for beam forming is 4, the antennas cannot completely cover all the tag sets at the given positions; at this time, j is held4＝j5-1-5-1-4 is unchanged, and then m is executed17＝m16And + 1-16 + 1-17, wherein the total number of the reader-writer antennas is 17, but only 4 antennas are subjected to beam forming processing, the position coordinates of the 17 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 17 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA0002173886640000131
Then according to
Figure BDA0002173886640000132
Computing
Figure BDA0002173886640000133
And
Figure BDA0002173886640000134
when the tag set at a given position is judged to be adopted, 17 antennas can meet the threshold condition:
Figure BDA0002173886640000135
and is
Figure BDA0002173886640000136
That is, when the total number M of the reader antennas is 17 and the number J of the antennas for beamforming is 4, the antennas can completely cover all the tag sets at the given positions, the number of the antennas to be used is large, and the complexity of beamforming can be reduced, and at this time, when J is 4, the optimal combination (J, M) is (4, 17);
then let the next value j3＝j4-1＝4-1＝3，m18＝m17+1＝17+1＝18，At the moment, the total number of the reader-writer antennas is 18, but only 3 antennas are subjected to beam forming treatment, the position coordinates of the 18 antennas are found out, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 18 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA0002173886640000137
Then according to
Figure BDA0002173886640000138
Computing
Figure BDA0002173886640000139
And
Figure BDA00021738866400001310
the use of 18 antennas in a given set of tags is judged to satisfy the threshold condition:
Figure BDA00021738866400001311
and is
Figure BDA00021738866400001312
That is, when the total number M of the reader antennas is 18 and the number J of the antennas for beamforming is 3, the antennas can completely cover all the tag sets at the given positions, the number of the antennas to be used is large, and the complexity of beamforming can be reduced, and at this time, when J is 3, the optimal combination (J, M) is (3, 18);
then let the next value j2＝j3-1＝3-1＝2，m19＝m18And + 1-18 + 1-19, the total number of the reader-writer antennas is 19, only 2 antennas are subjected to beam forming processing, the position coordinates of the 19 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 19 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA00021738866400001313
Then according to
Figure BDA00021738866400001314
Computing
Figure BDA00021738866400001315
And
Figure BDA00021738866400001316
the use of 19 antennas in a given set of tags is judged to satisfy the threshold condition:
Figure BDA00021738866400001317
and is
Figure BDA00021738866400001318
That is, when the total number M of the reader antennas is 19 and the number J of the antennas for beamforming is 2, the antennas can completely cover all the tag sets at the given positions, the number of the antennas to be used is large, and the complexity of beamforming can be reduced, and at this time, when J is 2, the optimal combination (J, M) is (2, 19);
then let the next value j1＝j2-1＝2-1＝1，m20＝m19And + 1-19 + 1-20, wherein the total number of the reader-writer antennas is 20, only 1 antenna is subjected to beam forming processing, the position coordinates of the 20 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 20 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA00021738866400001319
Then according to
Figure BDA00021738866400001320
Computing
Figure BDA00021738866400001321
And
Figure BDA00021738866400001322
it is judged that the threshold condition cannot be satisfied with 20 antennas at a given location of the tag set:
Figure BDA00021738866400001323
and is
Figure BDA00021738866400001324
That is, when the total number M of the reader antennas is 20 and the number J of the antennas for beam forming is 1, the antennas cannot completely cover all the tag sets at given positions; at this time, j is held1＝j2-1-2-1 is unchanged, and then m is executed21＝m20And when the number of the reader-writer antennas is 21, only 1 antenna among the 21 antennas is subjected to beam forming processing, the position coordinates of the 21 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 21 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA0002173886640000141
Then according to
Figure BDA0002173886640000142
Computing
Figure BDA0002173886640000143
And
Figure BDA0002173886640000144
it is determined that the threshold condition still cannot be met with 21 antennas at a given location of the tag set:
Figure BDA0002173886640000145
and is
Figure BDA0002173886640000146
That is, when the total number M of the reader antennas is 21 and the number J of the antennas for beam forming is 1, the antennas cannot completely cover all the tag sets at given positions; continue to hold j1＝j2-1 ═ 2-1 ═ 1 unchangedThen m is executed22＝m21The + 1-21 + 1-22, then judge the threshold condition, and so on until when m41＝m40And +1 is 40+1 is 41, the total number of the reader-writer antennas is 41 at this time, but only 1 antenna is subjected to beam forming processing, the position coordinates of the 41 antennas are found, and the distance d from the kth antenna to the ith tag is determined according to the position coordinates of the 41 antennaskiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure BDA0002173886640000147
Then according to
Figure BDA0002173886640000148
Computing
Figure BDA0002173886640000149
And
Figure BDA00021738866400001410
the use of 41 antennas in a given set of tags is judged to satisfy the threshold condition:
Figure BDA00021738866400001411
and is
Figure BDA00021738866400001412
That is, when the total number M of the reader antennas is 41 and the number J of the antennas for beamforming is 1, the antennas can completely cover all the tag sets at a given position, the number of the antennas to be used is large, and the complexity of beamforming can be reduced, and at this time, when J is 1, the optimal combination (J, M) is (1, 41).
Fig. 4 is an optimized combined line graph of the number of antennas participating in beamforming, which corresponds to the total number of antennas of the reader, and shows the optimal M values under different J values. Therefore, the invention can effectively reduce the using number of the antennas and reduce the complexity of beam forming after optimization. As shown in fig. 5, which is a line graph of beamforming complexity, the horizontal axis in the graph represents the value of (J, M), the vertical axis represents the beamforming complexity, and S represents the number of angles of beamforming scanning, it can be seen that the complexity increases exponentially as the beamforming antenna J increases. Optimization of the antennas and the number of antennas allowed for beamforming is therefore required.
The invention relates to a low-power-consumption internet-of-things wireless power supply distributed MIMO antenna networking optimization algorithm, in particular to an optimization algorithm applied to the number and the arrangement of reader-writer antennas in a passive radio frequency identification system, which is used for calculating the lower bound of the number of antennas capable of covering all given position labels, the optimal total number of antennas and the number combination of allowed beam forming antennas.
The working principle of the invention is as follows: the invention can provide the optimal receiving power for the label set at the given position through the beam forming algorithm based on the selected distributed antenna, and the optimal receiving power is determined by a formula 4. The number of antennas needed for the set of tags covering all given locations is calculated by the K-means clustering algorithm, the number of antennas in which beamforming is allowed is calculated, and the locations of these antennas are calculated.
Although specific embodiments of the invention have been described above, it will be understood by those skilled in the art that the specific embodiments described are illustrative only and are not limiting upon the scope of the invention, and that equivalent modifications and variations can be made by those skilled in the art without departing from the spirit of the invention, which is to be limited only by the appended claims.

Claims (7)

1. A low-power-consumption Internet of things wireless power supply distributed MIMO antenna network arrangement optimization method is characterized by comprising the following steps: the method comprises the following steps:
step 1, finding out the position of each antenna according to a tag set at a given position, judging whether a threshold condition of the tag set which completely covers the given position is met or not according to the positions of the antennas, calculating the minimum total number of reader-writer antennas meeting the threshold condition, performing beam forming treatment on all the antennas, calculating the number of antennas which are allowed to perform beam forming, wherein the number of the antennas which are matched and allowed to perform beam forming is equal to the total number of the antennas of the reader-writer;
step 2, according to the minimum total number of the reader-writer antennas and the number of antennas which are currently matched and allowed to perform beam forming, after increasing the total number of the reader-writer antennas and reducing the number of the antennas which are allowed to perform beam forming, re-determining the position of each antenna, and calculating the optimal combination of the total number of the reader-writer antennas and the number of the antennas which are allowed to perform beam forming under the condition of meeting the threshold value according to the position of the antenna at the moment;
and 3, distributing the network for the reader-writer antennas according to the total number of the selected reader-writer antennas under the optimal combination, the number of the allowed beam forming antennas and the positions of the corresponding antennas.
2. The low-power-consumption internet-of-things wireless power supply distributed MIMO antenna networking optimization method of claim 1, wherein: the step 1 specifically comprises:
step 11, supposing that the total number of the reader-writer antennas to be solved is M, wherein J antennas are used for beam forming;
step 12, calculating the value of M in a recursive manner, and enabling Mn+1＝mn+1 calculate the next mn+1Up to mn+1Is M, wherein MnRepresenting the total number of antennas, m, of the reader/writer at presentnIs an integer and has an initial value of 0, n is an integer and has an initial value of 0; m isn+1Representing the total number of next reader-writer antennas;
step 13, clustering the label sets at all given positions by using a K-means clustering algorithm, and finding out the central positions of all classes, namely mn+1The position coordinates of the antennas, represented as R for a set of antenna coordinate sets at a given position, where the coordinate of the mth antenna is R (m), 1. ltoreq. m.ltoreq.mn+1；
Step 14, for all tags i, according to the mn+1Calculating the maximum total power of the reader-writer antenna and the maximum total power of the label reflection received by the reader-writer antenna under the optimal beam forming according to the position coordinates of the root antennan+1Judging whether the position coordinates of the root antenna meet a threshold condition: maximum total power of reader-writer antenna obtained by labelNot less than the sensitivity of the label and the maximum total reflection power of the label received by the antenna of the reader-writer is not less than the sensitivity of the reader-writer, if the maximum total reflection power is satisfied, the M is Mn+1Satisfying a set of labels covering all given locations; if not, let the current mn＝mn+1Then execute the next mn+1＝mn+1, repeating steps 13-14 until a threshold condition is met;
step 15, when the maximum total power of the reader-writer antenna obtained by the tag is not less than the sensitivity of the tag and the maximum total power of the reflection of the tag received by the reader-writer antenna is not less than the sensitivity of the reader-writer, M is M at this timen+1Let J be M for the minimum total number of reader antennas that completely cover the tag set at all given locations.
3. The low-power-consumption internet-of-things wireless power supply distributed MIMO antenna networking optimization method of claim 2, wherein: the step 14 specifically includes:
for all tags i, according to this mn+1The position coordinates of the root antenna determine the distance d from the kth antenna to the ith labelkiThen according to the distance dkiDetermining the channel loss from the kth antenna to the ith tag
Figure FDA0002173886630000021
Equation 1:
Figure FDA0002173886630000022
wherein c represents the speed of light, fcRepresenting the carrier frequency, dkiRepresents the distance from the kth antenna to the ith tag, and γ is the path loss exponent;
calculating the maximum total power of the reader-writer antenna obtained by the label and the maximum total power of the label reflection received by the reader-writer antenna under the optimal beam forming through a formula 2 and a formula 3 respectively;
equation 2:
Figure FDA0002173886630000023
wherein the content of the first and second substances,
Figure FDA0002173886630000024
representing the maximum total power of the reader antenna,
Figure FDA0002173886630000025
the antenna subset is selected from all M reader-writer antennas and used for beam forming, and the number of the antennas in the subset is J; pTXIndicating that each antenna uses equal transmit power, GRIndicating the gain of the reader antenna, GTThe antenna gain of each tag is expressed,
Figure FDA0002173886630000026
representing the channel loss from the kth antenna to the ith tag,
Figure FDA0002173886630000027
is the channel coefficient for the forward link from the kth antenna to the ith tag,
Figure FDA0002173886630000028
a beam forming weight value of a forward link from the kth antenna to the ith tag;
equation 3:
Figure FDA0002173886630000029
wherein the content of the first and second substances,
Figure FDA00021738866300000210
the maximum total reflection power of the label received by the antenna of the reader-writer is represented;
Figure FDA00021738866300000211
indicating that the ith tag receives the reverse link channel loss of the mth antenna when m ═ kWhen the temperature of the water is higher than the set temperature,
Figure FDA00021738866300000212
Figure FDA00021738866300000213
the channel coefficients of the reverse link for the mth antenna are received for the ith tag, and when m is k,
Figure FDA00021738866300000214
Figure FDA00021738866300000215
and receiving the beamforming weight of the reverse link of the mth antenna for the ith tag, when m is k,
Figure FDA00021738866300000216
when in use
Figure FDA00021738866300000217
And is
Figure FDA00021738866300000218
When M is Mn+1For the minimum total number of reader/writer antennas, where θTIndicating the sensitivity of the tag, thetaRIndicating the sensitivity of the reader/writer.
4. The low-power-consumption Internet-of-things wireless power supply distributed MIMO antenna networking optimization method of claim 3, wherein: the step 2 specifically comprises:
step 21, returning a (J, M) pair corresponding to the minimum total number of reader-writer antennas, wherein J is M;
step 22, through a recursive method, let jx-1＝jx-1 is decremented, wherein jxIndicating the number of antennas currently allowed to be beamformed, jxThe initial value of (A) is J, x is an integer of x being more than or equal to 2 and less than or equal to J, and the initial value of x is J; j is a function ofx-1Is shown belowThe number of antennas allowed to form wave beams is more than or equal to 1 and less than or equal to jx-1J-1 or less; at the same time, let my+1＝my+1, wherein myRepresenting the total number of antennas, m, of the reader/writer at presentyIs M; y is an integer of which y is more than or equal to M, and the initial value of y is M; m isy+1Indicates the total number of antennas of the next reader/writer, my+1≥M+1；
Step 23, clustering the label sets at all given positions by using a K-means clustering algorithm, and finding out the central positions of all classes, namely my+1The position coordinates of the antennas, represented as R for a set of antenna coordinate sets at a given position, where the coordinate of the mth antenna is R (m), 1. ltoreq. m.ltoreq.my+1；
Step 24, according to the my+1Judging whether the position coordinates of the root antenna meet a threshold condition:
Figure FDA0002173886630000031
and is
Figure FDA0002173886630000032
If satisfied, (j) at this timex-1，my+1) (j) satisfies the set of labels covering all given locations, at that timex-1，my+1) The optimal combination is obtained; if not, then j is kept at this timex-1Is unchanged, let the current my＝my+1Then execute the next my+1＝my+1, repeating steps 23-24 until a threshold condition is met;
step 25, let j which finally satisfies the threshold conditionx-1And my+1Is set to j of the next roundxAnd myRepeating the steps 22-25 until jx-1Is 1.
5. The low-power-consumption Internet-of-things wireless power supply distributed MIMO antenna networking optimization method of claim 4, wherein: said step 25 is followed by: providing optimal received power for a given set of tags in a location
Figure FDA0002173886630000033
The calculation method is shown in formula 4:
equation 4:
Figure FDA0002173886630000034
wherein
Figure FDA0002173886630000035
Represents the received power of the ith tag from the kth antenna with the optimal beamforming;
Figure FDA0002173886630000036
a wave beam forming weight value of a forward link from a kth antenna to an ith label is obtained;
Figure FDA0002173886630000037
the maximum value of the total received power of the ith label under the optimal beamforming of each antenna to the ith label is obtained, and the weight of each antenna at the moment
Figure FDA0002173886630000038
Is the best weight for the ith label if satisfied
Figure FDA0002173886630000039
And is
Figure FDA00021738866300000310
The threshold condition of (d) indicates that the tag was successfully identified over-coverage.
6. The low-power-consumption internet-of-things wireless power supply distributed MIMO antenna networking optimization method of claim 1, wherein: each tag in the tag set at the given position is a standard Gen-2 passive tag, and the antenna gain of each tag is GTAll tags are static.
7. A process as claimed in claim 1A low-power-consumption Internet of things wireless power supply distributed MIMO antenna network arrangement optimization method is characterized by comprising the following steps: the reader-writer antennas are all omni-directional distributed antennas and have the same gain G for receiving signalsR。
CN201910772061.2A 2019-08-21 2019-08-21 Low-power-consumption Internet of things wireless power supply distributed MIMO antenna network arrangement optimization method Active CN110365390B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910772061.2A CN110365390B (en) 2019-08-21 2019-08-21 Low-power-consumption Internet of things wireless power supply distributed MIMO antenna network arrangement optimization method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910772061.2A CN110365390B (en) 2019-08-21 2019-08-21 Low-power-consumption Internet of things wireless power supply distributed MIMO antenna network arrangement optimization method

Publications (2)

Publication Number Publication Date
CN110365390A CN110365390A (en) 2019-10-22
CN110365390B true CN110365390B (en) 2022-04-19

Family

ID=68224123

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910772061.2A Active CN110365390B (en) 2019-08-21 2019-08-21 Low-power-consumption Internet of things wireless power supply distributed MIMO antenna network arrangement optimization method

Country Status (1)

Country Link
CN (1) CN110365390B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114630336B (en) * 2022-03-22 2023-05-09 南通大学 Non-honeycomb large-scale MIMO access point position deployment method based on cluster analysis

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103310248A (en) * 2013-04-25 2013-09-18 中山大学 Optimized RFID (Radio Frequency Identification) network system based on particle swarm algorithm
KR101579705B1 (en) * 2015-01-30 2015-12-23 세종대학교산학협력단 Wi-Fi Backscatter System and Method For Beamforming using The Same
CN108135004A (en) * 2017-12-20 2018-06-08 深圳大学 The charging network efficiency optimization method and system distributed based on beam forming and time
CN109640281A (en) * 2018-11-30 2019-04-16 北京卫星制造厂有限公司 A kind of RFID reader layout method towards Discrete Production Workshop
CN109714094A (en) * 2018-12-04 2019-05-03 中国科学院深圳先进技术研究院 A kind of blind adaptive beamforming algorithm

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9715608B2 (en) * 2011-12-19 2017-07-25 Symbol Technologies, Llc Method and apparatus for improving radio frequency identification coverage
US9066224B2 (en) * 2012-10-22 2015-06-23 Centurylink Intellectual Property Llc Multi-antenna distribution of wireless broadband in a building

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103310248A (en) * 2013-04-25 2013-09-18 中山大学 Optimized RFID (Radio Frequency Identification) network system based on particle swarm algorithm
KR101579705B1 (en) * 2015-01-30 2015-12-23 세종대학교산학협력단 Wi-Fi Backscatter System and Method For Beamforming using The Same
CN108135004A (en) * 2017-12-20 2018-06-08 深圳大学 The charging network efficiency optimization method and system distributed based on beam forming and time
CN109640281A (en) * 2018-11-30 2019-04-16 北京卫星制造厂有限公司 A kind of RFID reader layout method towards Discrete Production Workshop
CN109714094A (en) * 2018-12-04 2019-05-03 中国科学院深圳先进技术研究院 A kind of blind adaptive beamforming algorithm

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Shaoyuan Chen ; Shan Zhong ; Siyi Yang ; Xiaodong Wang.A Multiantenna RFID Reader With Blind Adaptive Beamforming.《IEEE Internet of Things Journal ( Volume: 3, Issue: 6, Dec. 2016)》.2016, *
波束赋形RFID读写器天线的研究与设计;李子巍;《中国优秀博硕士学位论文全文数据库(硕士)》;20180615;全文 *

Also Published As

Publication number Publication date
CN110365390A (en) 2019-10-22

Similar Documents

Publication Publication Date Title
Lee et al. Transmit power control using deep neural network for underlay device-to-device communication
Shen et al. A graph neural network approach for scalable wireless power control
Liang et al. Backscatter communication assisted by reconfigurable intelligent surfaces
Nie et al. Energy-efficient UAV trajectory design for backscatter communication: A deep reinforcement learning approach
CN103746729B (en) Distributed MIMO system base station side antenna position optimization method
CN107787560A (en) Transmitted while information and power
Liu et al. UAV-enabled data acquisition scheme with directional wireless energy transfer for Internet of Things
US11533093B2 (en) Apparatus and method for transmitting and receiving information and power in wireless communication system
CN116567839B (en) Resource allocation method of symbiotic radio system under de-cellular large-scale MIMO network
Fan et al. Ris-assisted uav for fresh data collection in 3d urban environments: A deep reinforcement learning approach
CN110224723A (en) A kind of unmanned plane assisted backscatter Communication System Design method
CN113490223A (en) Wireless energy supply backscattering communication method and system based on IRS
EP3243342B1 (en) Beamforming to a harvesting device
Botero et al. RFID network topology design based on Genetic Algorithms
CN110365390B (en) Low-power-consumption Internet of things wireless power supply distributed MIMO antenna network arrangement optimization method
López et al. Energy-sustainable iot connectivity: Vision, technological enablers, challenges, and future directions
CN110414289B (en) Low-power-consumption wireless power supply MIMO (multiple input multiple output) beam forming method for Internet of things
Li et al. Artificial immune network-based anti-collision algorithm for dense RFID readers
Hariz et al. Ai-based radio resource management and trajectory design for pd-noma communication in irs-uav assisted networks
Guo et al. Backscatter communications with NOMA
Shah et al. Mobile edge computing (MEC)-enabled UAV placement and computation efficiency maximization in disaster scenario
Muy et al. Joint optimization of trajectory, beamforming, and power allocation in UAV-enabled WPT networks using DRL combined with water-filling algorithm
CN104504424B (en) Radio frequency identification network topology optimization method based on Symbiotic evolution on multiple populations
Song et al. Maximizing packets collection in wireless powered IoT networks with charge-or-data time slots
CN104156680A (en) UHF RFID reader based on beam switching smart antenna

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
TA01 Transfer of patent application right

Effective date of registration: 20201120

Address after: Room 1007, building 3, Fengyuan international building, 430 Fengtan Road, Gongshu District, Hangzhou City, Zhejiang Province

Applicant after: Hangzhou Zhiai time Technology Co., Ltd

Address before: 310000 room 413, building 2, No. 168, Qianwu Road, Qingshanhu street, Lin'an District, Hangzhou City, Zhejiang Province

Applicant before: HANGZHOU LICHEN TECHNOLOGY Co.,Ltd.

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant