CN105491637A - Method and system for searching optimal relay position of mobile relay based on fixed step size - Google Patents

Method and system for searching optimal relay position of mobile relay based on fixed step size Download PDF

Info

Publication number
CN105491637A
CN105491637A CN201510898373.XA CN201510898373A CN105491637A CN 105491637 A CN105491637 A CN 105491637A CN 201510898373 A CN201510898373 A CN 201510898373A CN 105491637 A CN105491637 A CN 105491637A
Authority
CN
China
Prior art keywords
relay
communication performance
mobile relay
mobile
location
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201510898373.XA
Other languages
Chinese (zh)
Other versions
CN105491637B (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.)
Shenzhen University
Original Assignee
Shenzhen University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen University filed Critical Shenzhen University
Priority to CN201510898373.XA priority Critical patent/CN105491637B/en
Publication of CN105491637A publication Critical patent/CN105491637A/en
Application granted granted Critical
Publication of CN105491637B publication Critical patent/CN105491637B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
    • H04W64/006—Locating users or terminals or network equipment for network management purposes, e.g. mobility management with additional information processing, e.g. for direction or speed determination
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

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

Abstract

The present invention discloses a method and a system for searching for an optimum relay position of a mobile relay based on a fixed step size. The method comprises the following steps: the mobile relay receives a test signal sent by a source terminal and forwards the test signal to a destination terminal after amplification; the destination terminal calculates the communication performance according to the amplified test signal and generates a bit information to be fed back to the mobile relay after comparing with the communication performance of a stored optimum known position; and the mobile relay moves to a next relay position according to the bit information and a preset fixed step size and performs the step of receiving the test signal sent by the source terminal again until the optimum relay position is determined. The method can improve the performance of relay communication, and can still determine an optimum relay position point within a preset trajectory range as long as the destination terminal feeds back the bit information to the mobile relay to search and control, without acquiring the position information of the source terminal and the destination terminal and increasing antennas, thereby expanding an application range.

Description

Method and system for searching optimal relay position of mobile relay based on fixed step length
Technical Field
The invention relates to the technical field of wireless communication, in particular to a method and a system for searching an optimal relay position of a mobile relay based on a fixed step length.
Background
The communication relay can be used for forwarding information sent out among different nodes, so that the communication range is expanded, and the performance of a communication system is improved. Terrestrial radio communications are easily obstructed and shielded by obstacles, and aircraft, satellites and unmanned aerial vehicles (UVAs) can act as communication relays because airborne relays can effectively establish connections for two parties that need to communicate with each other in rugged mountainous or urban areas.
Among the prior art, the mode of being applied to unmanned aerial vehicle and confirming relay position mainly has: the position information of the ground communication unit is measured using a Global Positioning System (GPS), the unmanned aerial vehicle searches for the best relay position using the GPS, and a disturbance-based extremum search control algorithm, an overloaded antenna-based algorithm, and the like.
However, in the above prior art, certain disadvantages and shortcomings exist, which are mainly reflected in:
1. the ground communication unit needs to measure own position information by using a GPS function of the ground communication unit and send the information to the unmanned aerial vehicle, and the position search is failed due to the fact that the GPS function is easily attacked and interfered;
2. for a ground communication unit without a GPS function or with damaged GPS equipment, some existing technologies cannot be used, namely the existing technology for determining the relay position is limited in use;
3. the optimal relay position is determined by estimating the airborne multi-antenna signal arrival angle (DOA), so that estimation errors are prone to occur relative to a single antenna, and meanwhile, the complexity of the unmanned aerial vehicle communication equipment and the algorithm complexity are increased.
Disclosure of Invention
The embodiment of the invention provides a method and a system for searching an optimal relay position of a mobile relay based on a fixed step length, wherein the optimal relay position of the mobile relay is determined by comparing communication performances at different positions, so that the efficiency and the accuracy of determining the optimal relay position of the mobile relay are improved, and the application range is increased.
The embodiment of the invention discloses a method for searching the optimal relay position of a mobile relay based on a fixed step length, which comprises the following steps:
step A, a mobile relay receives a test signal sent by a source end at any position of a fixed track, amplifies the test signal and forwards the test signal to a destination end;
step B, the destination receives the signal sent by the mobile relay and calculates the communication performance of the time, wherein the communication performance comprises signal-to-noise ratio and bit error rate, and compares the calculation result with the communication performance of the stored best known relay position, and generates bit information to feed back the bit information to the mobile relay, wherein the bit information represents the comparison result of the current communication performance and the communication performance of the stored best known relay position, and the best known relay position is the position with the best tested communication performance;
step C, the mobile relay records the current position information, moves to the next relay position according to the one-bit information and the preset fixed step length, and returns to the step A until the optimal relay position is finally determined, wherein the optimal relay position is as follows: the position with the best communication performance in a preset searching time length, or the position with the best communication performance when the mobile relay moves the whole fixed track, or the position with the best communication performance meeting the system setting requirement.
The embodiment of the invention discloses a mobile relay optimal relay position searching system based on fixed step length, which comprises:
a mobile relay, a source terminal and a destination terminal;
the mobile relay is arranged at any position of a fixed track, receives a test signal sent by the source end, amplifies and forwards the test signal to the destination end;
the destination end receives a signal sent by the mobile relay and calculates the communication performance of the time, wherein the communication performance comprises a signal-to-noise ratio and an error rate, and compares the calculation result with the communication performance of the stored best known relay position to generate one bit of information to be fed back to the mobile relay, the one bit of information represents the comparison result of the current communication performance and the communication performance of the stored best known relay position, and the best known relay position is the position with the best tested communication performance;
the mobile relay records the current position information, moves to the next relay position according to the bit information and the preset fixed step length, returns to the execution step, receives the test signal sent by the source end on any position of the fixed track, amplifies and forwards the test signal to the destination end until the optimal relay position is finally determined, wherein the optimal relay position is as follows: the position with the best communication performance in a preset searching time length, or the position with the best communication performance when the mobile relay moves the whole fixed track, or the position with the best communication performance meeting the system setting requirement.
According to the technical scheme, the embodiment of the invention has the following advantages: the optimal relay position of the mobile relay is searched by utilizing the fixed disturbance step length and the communication performance strength, the performance of relay communication can be improved, the dependence on the position information of a source end and a target end is not needed, multiple antennas are not needed, only one bit of information is fed back to the mobile relay by the target end to control the mobile relay to search the optimal relay position, the application range is wider, the applicability is stronger, the limitation is small, and the efficiency and the accuracy for determining the optimal relay position are improved.
Drawings
Fig. 1 is a flowchart illustrating a method for searching an optimal relay position of a mobile relay based on a fixed step length according to a first embodiment of the present invention;
fig. 2 is a schematic diagram of a mobile relay communication model according to an embodiment of the present invention;
FIGS. 3a and 3b are simulation diagrams of a mobile relay searching for an optimal relay position based on SNR in an embodiment of the present invention;
fig. 4a and 4b are simulation diagrams of a mobile relay searching for an optimal relay position based on an error rate according to an embodiment of the present invention;
fig. 5 is a diagram illustrating a mobile relay optimal relay location search system based on a fixed step size according to a second embodiment of the invention.
Detailed Description
The embodiment of the invention provides a method and a system for searching an optimal relay position of a mobile relay based on a fixed step length.
The embodiment of the invention is suitable for the fixed relay motion track, and the application scenes can be the scenes of the construction of a temporary communication system, the communication connection of a disaster site and the like.
Referring to fig. 1, a method for searching an optimal relay position of a mobile relay based on a fixed step length according to a first embodiment of the present invention includes the following steps:
and step A, the mobile relay receives the test signal sent by the source end at any position of the fixed track, amplifies the test signal and forwards the test signal to the destination end.
The test signal is a signal for testing communication performance, which can help the mobile relay to search for the best relay position, data for testing communication performance can be carried in the test signal, and before the mobile relay searches for the best relay position, the source end sends all the test signals, and only after the mobile relay finds the best relay position, the source end sends really useful data.
In the nth time slot, the source end sends a test signal to the mobile relay, and the mobile relay receives the test signal sent by the source end at any position of the fixed track, amplifies the test signal and forwards the amplified test signal to the destination end, so that the destination end compares the communication performance strength of the test signal with the stored communication performance strength of the best known position.
And step B, the destination terminal receives the signal sent by the mobile relay and calculates the communication performance of the time, wherein the communication performance comprises the signal-to-noise ratio and the error rate, and compares the calculation result with the communication performance of the stored best known relay position to generate one bit of information to be fed back to the mobile relay, and the one bit of information represents the comparison result of the current communication performance and the communication performance of the stored best known relay position.
The best known relay location is the location where the tested communication performance is best.
Before searching the optimal relay position, the mobile relay firstly initializes the position information of the mobile relay, receives the test signal emitted from the source end, amplifies the test signal and forwards the test signal to the destination end, and the destination end calculates the communication performance and stores the calculation result as the initial record of the destination end. In each time slot, the source end sends a test signal to the mobile relay, the mobile relay amplifies the test signal and sends the amplified test signal to the destination end, and the destination end receives the signal sent by the mobile relay and calculates the communication performance, where the communication performance includes a signal-to-noise ratio (SNR) and a bit error rate (SER), where a larger SNR indicates a stronger communication performance, and a smaller SER indicates a stronger communication performance, and the signal is obtained after the test signal is amplified.
The position with the highest communication performance intensity in all the test signals before the nth time slot is the best known position, and the information of the best known position is stored in the destination terminal and also stored in the mobile relay.
After calculating the communication performance of the current mobile relay and the mobile relay according to the signal, the destination compares the communication performance of the current mobile relay and the communication performance of the best known relay position according to the calculation result, namely, compares the communication performance of the current mobile relay and the current mobile relay position with the communication performance of the best known relay position, so as to judge whether the communication performance of the current mobile relay is improved compared with the communication performance of the last mobile relay position. And the destination terminal updates the best known received signal communication performance in the memory according to the comparison result of the current communication performance and the stored communication performance of the best known relay position.
Further, a bit of information is generated according to the comparison result, and the bit of information is fed back to the mobile relay, where the bit of information indicates the comparison result between the current communication performance and the communication performance of the saved best known relay location, that is, the bit of information includes information on whether the performance of the received signal of the destination is improved. For example, it may be preset that bit information 1 indicates that the current communication performance is improved from the communication performance of the best known position, and bit information 0 indicates that the current communication performance of the signal is reduced from the communication performance of the best known position. In practical applications, the comparison result may also be set in other forms, which are not limited herein.
Specifically, the one-bit information may be a comparison result between the snr of the test signal received by the destination and the snr of the best known position stored on the destination, where the best known position is a position corresponding to the maximum snr of all the test signals calculated before the nth time slot. The one-bit information may also be a comparison result of the bit error rate of the test signal received for the destination and the bit error rate of the best known position stored on the destination, where the best known position is a position corresponding to the minimum bit error rate of all test signals calculated before the nth time slot.
The source end and the destination end may be various types of wireless communication transceiving equipment, such as: cell phones, base stations, etc. The mobile relay uses a single antenna on board.
For convenience of understanding, a scenario of the mobile relay communication will be briefly described, please refer to fig. 2, and fig. 2 is a schematic diagram of a mobile relay communication model in an embodiment of the present invention.
The mobile relay is respectively connected with the source end and the destination end through a wireless network. The mobile relay is a point R on a cylindrical coordinate systemi，RiProjected as a point R on the XOY planei' the source end is a point S on the XOY plane of the cylindrical coordinate system, and the destination end is a point D on the XOY plane of the cylindrical coordinate system.
Specifically, the coordinate variable of the origin O of the cylindrical coordinate system is (0, 0, z), and the coordinate variable of the source end S is (x)s，ys，zs) The coordinate variable of the destination D is (x)d，yd，zd) Moving relay RiIs (r, theta, z), where r is the radius of motion of the mobile relay on the XOY plane and theta is the rotation from the X axis to OR in the counterclockwise direction as viewed from the positive z axisi' Angle turned, z is the height of the moving relay. The origin, r, and z of the cylindrical coordinate system are preset, so that the motion trajectory of the mobile relay is determined, that is, the mobile relay moves on a circle with a radius r of z in fig. 2. The mobile relay has coordinates R (R, θ (n), z) at the nth slot and coordinates R (R, θ (n +1), z) at the n +1 th slot.
The transformation relationship between the cylindrical coordinate system (r, theta, z) and the spatial rectangular coordinate system (x, y, z) is as follows:
further, in the nth slot, the communication distance (i.e., the straight-line distance) d between the mobile relay and the source end S1And a communication distance D between the destination terminal D and the terminal2Respectively as follows:
in the following, taking the communication performance as the signal-to-noise ratio as an example, the communication process and the signal-to-noise ratio of the mobile relay, the source end and the destination end are described, please refer to fig. 2:
first hop communication: source to mobile relay;
signal sent by source to mobile relay:
E[|n1|2]＝N01(2)
where x denotes the test signal emitted by the source, PSDenotes the emission power of the source terminal, LS,RRepresenting the free space path loss, n, from source to mobile relay1Which represents the additive white gaussian noise of the first hop communication. E denotes solving the mathematical expectation, N01Representing additive white Gaussian noise n1Of the power of (c).
Free space path loss of first hop communication:
where λ represents the wavelength of the test signal emitted by the source, d1Representing the distance between the source and the mobile relay.
The signal has fading in the transmission process and is also interfered by noise, and the information forwarded by the mobile relay includes a test signal subjected to free path fading and white gaussian noise.
And second hop communication: moving the relay to the destination;
the signal sent to the destination terminal by the mobile relay is as follows:
E[|n2|2]＝N02(5)
wherein x represents a test signal, PSDenotes the emission power of the source terminal, LS,RRepresents the free path loss, L, from source to mobile relayR,DRepresenting the free path loss from the source to the mobile relay, G representing the gain of the mobile relay to the received test signal, i.e. the relay gain, n2Which represents the additive white gaussian noise of the second hop communication. E denotes solving the mathematical expectation, N02Representing additive white Gaussian noise n2Of the power of (c).
Free space path loss of the second hop channel:
where λ represents the wavelength of the amplified test signal emitted by the moving relay, d2Indicating the distance between the destination and the mobile relay.
The gain of the mobile repeater to the received test signal is:
the SNR of the test signal sent by the source end after being received by the destination end is obtained from formula (4) as follows:
wherein the SNR1、SNR2The following were used:
the meaning of the parameters in the formulas (7), (8) and (9) is referred to the foregoing description and will not be described herein.
And step C, recording the current position information by the mobile relay, moving to the next relay position according to the one-bit information and the preset fixed step length, and returning to the step A until the optimal relay position is finally determined.
Specifically, if the one-bit information indicates that the current communication performance is greater than the communication performance of the best known relay position, the current position is recorded as the best known position, and the current position is randomly moved by a fixed step length to determine and move to the next relay position, wherein the random increase means that a positive symbol and a negative symbol are randomly selected to increase.
If the one-bit information indicates that the current communication performance is less than the communication performance of the best known relay position, the mobile relay returns to the last position, then randomly increases a fixed step length to determine and move to the next relay position, and returns to the step A until the best relay position is finally determined.
Randomly adding a perturbation step with a fixed value to each iteration time slot:
(n)＝±0
wherein,0for a fixed step size, n represents the number of slots, and for each additional slot, (n) is appliedIs increased by one0. When (n) ═0When, it means that the mobile relay moves one counter-clockwise0When (n) ═ -0When, it means the mobile relay moves clockwise one0。
It should be noted that the moving direction of the mobile relay may be reversed, that is, when (n) is equal to n0When, it means the mobile relay moves clockwise one0When (n) ═ -0When, it means that the mobile relay moves one counter-clockwise0。
The mobile relay records its current position, and takes the current position as the best known relay position, where θ (n) represents the number of slots. The mobile relay calculates the next position according to the fixed step length and moves to the next position toRepresenting the next position, and the random increment step is represented by (n), then:
further, the mobile relay determines the next relay position according to the information of whether the destination received signal performance in the one-bit information is improved and a preset fixed step size. When the mobile relay determines that the signal performance of the mobile relay received by the destination is improved, that is, when the current communication performance is higher than the communication performance of the stored best known relay position, the mobile relay records the current position as the best known position θ (n +1) ═ θ (n) + (n), and when the signal performance of the mobile relay received by the destination is not improved, that is, when the current communication performance is worse than the communication performance of the stored best known relay position, the mobile relay returns to the position θ (n +1) ═ θ (n) of the previous time slot, and the process returns to step a.
The optimal relay position includes: the position with the best communication performance in the preset searching time length, or the position with the best communication performance when the mobile relay moves the whole fixed track, or the position with the best communication performance meeting the set requirement of the system. That is, the optimal relay position is determined by setting any one of the search time, the search distance, and the communication performance strength of the mobile relay.
If the next relay location is not the best relay location, step a is executed again: and the mobile relay receives the test signal sent by the source end at any position of the fixed track, amplifies the test signal and forwards the amplified test signal to the destination end, and thus, the steps A to C are performed in a circulating manner until the optimal relay position is searched. That is, the relay position with the highest communication performance strength of the signal is searched, and after the optimal relay position is determined, the loop search process is stopped.
Specifically, when the communication performance is the signal-to-noise ratio, if the comparison result is that the signal-to-noise ratio of the current communication is greater than the signal-to-noise ratio of the best known position, it indicates that the communication condition of the current position is better, and the current position is more suitable for being used as the relay position.
And, the mobile relay updates the signal-to-noise ratio of the best received signal, and the updating rule is as follows:
SNRbest(n+1)＝max(SNRbest(n),SNR(n))
wherein the SNRbestSignal-to-noise ratio, max (SNR), of the signal received optimally for the (n +1) th slotbest(n), SNR (n) represents the maximum value of the SNR at the best known position of the nth time slot and the SNR at the current position, and the maximum value is the SNRbest。
Meanwhile, the mobile relay updates the current position to the best known position, and the updating rule is as follows:
the comparison result is that the signal-to-noise ratio of the current communication is smaller than that of the best known position, which indicates that the communication condition of the current position is not ideal, and no best known position is more suitable for being used as the relay position, so the mobile relay returns to the position where the mobile relay is located last time, and randomly moves a distance of the fixed step length to determine and move to the next relay position.
When the communication performance is the error rate, if the error rate of the test signal is lower than the error rate of the best known position as the comparison result, the communication condition of the current position is better, and the test signal is preferably used as a relay position.
If the error rate of the test signal is greater than that of the best known position, it indicates that the communication condition of the current position is not ideal, and no best known position is better for the relay position, so the mobile relay will return to the previous position and randomly move a distance of the fixed step length to determine and move to the next relay position.
Further, if the comparison result is that the calculated signal-to-noise ratio of the test signal is greater than the signal-to-noise ratio of the best known position, or if the comparison result is that the calculated error rate of the test signal is less than the signal-to-noise ratio of the best known position, the current position of the mobile relay is updated to the best known position, and the signal-to-noise ratio or the error rate of the test signal is correspondingly updated.
In the embodiment of the invention, the optimal relay position of the mobile relay is searched by utilizing the fixed disturbance step length and the communication performance strength, so that the performance of relay communication can be improved, the dependence on the position information of a source end and a target end is not required, multiple antennae are not required, only one bit of information is fed back to the target end to control the mobile relay to search the optimal relay position, the application range is wider, the applicability is stronger, the limitation is small, and the efficiency and the accuracy for determining the optimal relay position are improved.
In the above embodiment of the method for searching for an optimal relay position of a mobile relay based on a fixed step length, simulation diagrams of searching for an optimal relay position of a mobile relay by using an snr are shown in fig. 3a and 3b, and simulation diagrams of searching for an optimal relay position of a mobile relay by using an ber are shown in fig. 4a and 4 b:
wherein, the initial step length:
position coordinates of the source end: (x)s,ys,zs)＝(0,-700,1)
Position coordinates of the destination: (x)d,yd,zd)＝(30,-600,1)
Position coordinates of mobile relay: (r, θ (n), z) ═ 500, θ (n),30)
Fig. 3a and 3b show the communication performance strength, i.e., formula (8), based on the signal-to-noise ratio, where the horizontal axis of fig. 3a shows θ (n) and the vertical axis shows the signal-to-noise ratio SNR from the source end to the destination end of the relay position corresponding to θ (n). Figure 3b shows the number of slots spent by the mobile relay in searching for the best relay position on the horizontal axis and the signal-to-noise ratio from source to destination on the vertical axis. When the 35 th time slot is searched, the best relay position, i.e. the position corresponding to the maximum point in fig. 3a, is determined.
Fig. 4a and 4b show communication performance strength based on the bit error rate, the horizontal axis of fig. 4a shows θ (n), and the vertical axis shows the BER from the source end to the destination end of the relay position corresponding to θ (n). Fig. 4b shows the number of slots spent in the mobile relay searching for the best relay position on the horizontal axis and the error rate from source to destination on the vertical axis. When the 35 th time slot is searched, the best relay position, i.e. the position corresponding to the minimum point in fig. 4a, is determined.
Referring to fig. 5, fig. 5 is a schematic structural diagram of a mobile relay optimal relay position searching system based on a fixed step size according to a second embodiment of the present invention, and for convenience of illustration, only the parts related to the embodiment of the present invention are shown. The system mainly comprises: a mobile relay 501, a source peer 502, and a destination peer 503.
The mobile relay 501 receives a test signal sent from the source terminal 502 at an arbitrary position of the fixed track, and amplifies and forwards the test signal to the destination terminal 503.
The destination 503 receives the signal sent from the mobile relay 501 and calculates the communication performance of this time, which includes the signal-to-noise ratio and the error rate, and compares the calculation result with the communication performance of the stored best known relay position, and generates a bit of information to be fed back to the mobile relay 501, where the bit of information represents the comparison result between the current communication performance and the communication performance of the stored best known relay position, and the best known relay position is the position with the best communication performance tested.
The mobile relay 501 records the current position information and moves to the next relay position according to the bit information and the preset fixed step length, and returns to the execution step that the mobile relay is at any position of the fixed track, receives the test signal sent from the source end, amplifies the test signal and forwards the test signal to the destination end, and continuously circulates until the optimal relay position is finally determined. The optimal relay positions are: the position with the best communication performance within the preset search time, or the position with the best communication performance when the mobile relay 501 moves the whole fixed track, or the position with the best communication performance meets the system setting requirement.
Further, the mobile relay 501 initializes its location information before performing the best relay location search, and receives the test signal transmitted from the source terminal 502 and amplifies the test signal to be forwarded to the destination terminal 503.
Further, if the one-bit information indicates that the current communication performance is greater than the communication performance of the best known relay location, the current location of the mobile relay 501 is recorded as the best known location, and is randomly moved by one of the fixed step sizes to determine and move to the next relay location. If the one-bit information indicates that the current communication performance is less than the communication performance of the best known relay location, the mobile relay 501 returns to the previous location and then randomly moves a fixed step to determine and move to the next relay location.
For a specific process of implementing each function by the mobile relay, the source end, and the destination end of the mobile relay optimal relay position searching system based on the fixed step length in this embodiment, please refer to the specific contents described in the embodiment shown in fig. 1, which is not described herein again.
In the embodiment of the invention, the optimal relay position of the mobile relay is searched by utilizing the fixed disturbance step length and the communication performance strength, so that the performance of relay communication can be improved, the dependence on the position information of a source end and a target end is not required, multiple antennae are not required, only one bit of information is fed back to the target end to control the mobile relay to search the optimal relay position, the application range is wider, the applicability is stronger, the limitation is small, and the efficiency and the accuracy for determining the optimal relay position are improved.
Those skilled in the art will appreciate that all or part of the steps in the method according to the above embodiments may be implemented by hardware instructions related to a program, and the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk, an optical disk, or the like.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
The above detailed description is directed to a method and system for searching an optimal relay position of a mobile relay based on a fixed step length, and those skilled in the art will appreciate that the present invention is not limited to the above description.

Claims (10)

1.一种基于固定步长的移动中继最佳中继位置搜寻方法，其特征在于，所述搜寻方法步骤包括：1. A mobile relay optimal relay position searching method based on fixed step size, it is characterized in that, described searching method step comprises: 步骤A，移动中继在固定轨道的任意位置上，接收来自源端发送的测试信号，并放大转发至目的端；Step A, the mobile relay receives the test signal sent from the source at any position on the fixed track, amplifies and forwards it to the destination; 步骤B，所述目的端接收所述移动中继发来的信号并计算本次通信性能，所述通信性能包括信噪比、误码率，并根据计算结果与已保存的最佳已知中继位置的通信性能进行比较，并生成一比特信息反馈至所述移动中继，所述一比特信息表示当前通信性能与已保存的最佳已知中继位置的通信性能的比较结果，所述最佳已知中继位置为已测试的通信性能最好的位置；Step B, the destination end receives the signal sent by the mobile relay and calculates the communication performance of this time, the communication performance includes the signal-to-noise ratio and the bit error rate, and according to the calculation result and the saved best known medium The communication performance of the relay position is compared, and one bit of information is generated to be fed back to the mobile relay. The one bit of information represents the comparison result of the current communication performance and the communication performance of the best known relay position that has been saved. The said The best known relay location is the location with the best communication performance tested; 步骤C，所述移动中继记录当前位置信息并根据所述一比特信息及预置的固定步长移动到下一个中继位置，并返回步骤A，直至最终确定最佳中继位置，所述最佳中继位置为：在预设的搜寻时长内通信性能最好的位置，或者，所述移动中继移动完整个所述固定轨道时通信性能最好的位置，或者，所述通信性能满足系统设定要求的位置。Step C, the mobile relay records the current position information and moves to the next relay position according to the one-bit information and the preset fixed step size, and returns to step A until the optimal relay position is finally determined, the The optimal relay position is: the position with the best communication performance within the preset search time, or the position with the best communication performance when the mobile relay moves the entire fixed orbit, or the communication performance meets The location required by the system settings. 2.如权利要求1所述的搜寻方法，其特征在于，所述方法还包括：2. The search method according to claim 1, further comprising: 以yR表示所述移动中继接收到的所述测试信号，则：Represent the test signal received by the mobile relay with y R , then: 其中x表示源端发射的测试信号，PS表示源端发射功率，LS,R表示所述源端到所述移动中继的第一跳通信的自由空间路径损耗，n1表示所述第一跳通信的加性高斯白噪声； Wherein x represents the test signal transmitted by the source, PS represents the transmit power of the source, L S , R represents the free space path loss of the first hop communication from the source to the mobile relay, n 1 represents the first Additive white Gaussian noise for one-hop communication; 在进行最佳中继位置搜寻前，所述移动中继初始化其位置信息，并接收来自所述源端发射的所述测试信号并放大转发至所述目的端；Before searching for the best relay location, the mobile relay initializes its location information, receives the test signal transmitted from the source, amplifies and forwards it to the destination; 所述目的端计算通信性能，并将计算结果保存为初始记录。The destination end calculates the communication performance, and saves the calculation result as an initial record. 3.如权利要求1所述的搜寻方法，其特征在于，所述方法还包括：3. The search method according to claim 1, further comprising: 以yD表示目的端接收到的信号，则：Let y D represent the signal received by the destination, then: yD＝yRGLR,D+n2，其中yR表示移动中继接收的信号，G表示中继增益，LR,D表示所述移动中继到所述目的端的第二跳通信的自由空间路径损耗，n2表示所述第二条跳通信的加性高斯白噪声。y D =y R GL R,D +n 2 , where y R represents the signal received by the mobile relay, G represents the relay gain, and L R,D represents the second-hop communication from the mobile relay to the destination Free space path loss, n 2 represents the additive white Gaussian noise of the second hop communication. 4.如权利要求1所述的搜寻方法，其特征在于，所述步骤C中，移动中继记录当前位置信息并根据所述一比特信息及预置的固定步长确定移动到下一个中继位置，包括：4. The search method according to claim 1, wherein in said step C, the mobile relay records the current location information and determines to move to the next relay according to the one-bit information and the preset fixed step size location, including: 若所述一比特信息表示当前通信性能大于所述最佳已知中继位置的通信性能，则将当前位置记录为最佳已知位置，并随机增加一个所述固定步长以确定及移动到所述下一个中继位置，所述随机增加是指随机选取正负符号进行增加；If the one-bit information indicates that the current communication performance is greater than the communication performance of the best known relay position, record the current position as the best known position, and randomly increase the fixed step by one to determine and move to In the next relay position, the random increase refers to randomly selecting positive and negative symbols to increase; 若所述一比特信息表示当前通信性能小于所述最佳已知中继位置的通信性能，则所述移动中继先返回到上一次的位置，再随机增加一个所述固定步长以确定及移动到下一个中继位置。If the one-bit information indicates that the current communication performance is less than the communication performance of the best known relay position, the mobile relay first returns to the previous position, and then randomly increases the fixed step size to determine and Move to the next relay location. 5.如权利要求1所述的搜寻方法，其特征在于，所述步骤C中，移动中继记录当前位置信息并根据所述一比特信息及预置的固定步长移动到下一个中继位置，包括：5. The search method according to claim 1, wherein in said step C, the mobile relay records the current location information and moves to the next relay location according to the one-bit information and the preset fixed step ,include: 步骤C1，所述移动中继记录其当前位置n表示时隙数；Step C1, the mobile relay records its current location n represents the number of time slots; 步骤C2，所述移动中继根据所述固定步长计算下一位置并移动到所述下一位置，以表示所述下一位置，以δ(n)＝±δ0表示随机增加步长，δ0表示所述固定步长，则：θ(n)表示最佳已知中继位置。Step C2, the mobile relay calculates the next position according to the fixed step size and moves to the next position, so as to Represent the next position, with δ(n)=±δ 0 representing a random increase in step size, and δ 0 representing the fixed step size, then: θ(n) denotes the best known relay location. 6.如权利要求5所述的搜寻方法，其特征在于，所述步骤B还包括：6. The search method according to claim 5, wherein said step B further comprises: 所述目的端根据当前通信性能与已保存的最佳已知中继位置的通信性能的比较结果，更新内存中的最佳已知接收信号通信性能。The destination end updates the communication performance of the best known received signal in the memory according to the comparison result between the current communication performance and the communication performance of the saved best known relay position. 7.如权利要求6所述的搜寻方法，其特征在于，所述方法还包括：7. The search method according to claim 6, further comprising: 所述移动中继对所述一比特信息进行判断；The mobile relay judges the one-bit information; 当判断为接收信号性能提高时，将当前位置记录为最佳已知位置θ(n+1)＝θ(n)+δ(n)，当判断为接收信号性能未提高时，则返回上一时隙的位置，θ(n+1)＝θ(n)，并返回步骤A。When it is judged that the performance of the received signal has improved, record the current position as the best known position θ(n+1)=θ(n)+δ(n), and when it is judged that the performance of the received signal has not improved, return to the previous time position of the gap, θ(n+1)=θ(n), and return to step A. 8.一种基于固定步长的移动中继最佳中继位置搜寻系统，其特征在于，所述搜寻系统包括移动中继、源端和目的端；8. A mobile relay optimal relay position search system based on a fixed step, characterized in that the search system includes a mobile relay, a source end and a destination end; 其中，所述移动中继在固定轨道的任意位置上，接收来自所述源端发送的测试信号，并放大转发至所述目的端；Wherein, the mobile relay receives the test signal sent from the source at any position on the fixed track, amplifies and forwards it to the destination; 所述目的端接收所述移动中继发来的信号并计算本次通信性能，所述通信性能包括信噪比、误码率，并根据计算结果与已保存的最佳已知中继位置的通信性能进行比较，并生成一比特信息反馈至所述移动中继，所述一比特信息表示当前通信性能与已保存的最佳已知中继位置的通信性能的比较结果，所述最佳已知中继位置为已测试的通信性能最好的位置；The destination terminal receives the signal sent by the mobile relay and calculates the communication performance of this time, the communication performance includes the signal-to-noise ratio and the bit error rate, and according to the calculation result and the saved best known relay position The communication performance is compared, and one bit of information is generated to be fed back to the mobile relay. The one bit of information represents the comparison result between the current communication performance and the communication performance of the best known relay position that has been saved. The best known relay position The known relay location is the location with the best communication performance tested; 所述移动中继记录当前位置信息并根据所述一比特信息及预置的固定步长移动到下一个中继位置，并返回执行步骤移动中继在固定轨道的任意位置上，接收来自所述源端发送的测试信号，并放大转发至所述目的端，直至最终确定最佳中继位置，所述最佳中继位置为：在预设的搜寻时长内通信性能最好的位置，或者，所述移动中继移动完整个所述固定轨道时通信性能最好的位置，或者，所述通信性能满足系统设定要求的位置。The mobile relay records the current position information and moves to the next relay position according to the one-bit information and the preset fixed step size, and returns to the execution step. The test signal sent by the source end is amplified and forwarded to the destination end until the optimal relay position is finally determined. The optimal relay position is: the position with the best communication performance within the preset search time, or, The position where the communication performance is the best when the mobile relay moves the entire fixed orbit, or the position where the communication performance meets the requirements set by the system. 9.根据权利要求8所述的搜寻系统，其特征在于，9. The searching system according to claim 8, characterized in that, 所述移动中继在进行最佳中继位置搜寻前，初始化其位置信息，并接收来自所述源端发射的所述测试信号并放大转发至所述目的端。The mobile relay initializes its location information before searching for the best relay location, receives the test signal transmitted from the source end, amplifies it and forwards it to the destination end. 10.根据权利要求8或9所述的搜寻系统，其特征在于，10. The searching system according to claim 8 or 9, characterized in that, 若所述一比特信息表示当前通信性能大于所述最佳已知中继位置的通信性能，则所述移动中继将当前位置记录为最佳已知位置，并随机移动一个所述固定步长以确定及移动到所述下一个中继位置；If the one-bit information indicates that the current communication performance is greater than the communication performance of the best known relay position, the mobile relay records the current position as the best known position, and moves randomly by one fixed step to determine and move to said next relay location; 若所述一比特信息表示当前通信性能小于所述最佳已知中继位置的通信性能，则所述移动中继先返回到上一次的位置，再随机移动一个所述固定步长以确定及移动到下一个中继位置。If the one-bit information indicates that the current communication performance is less than the communication performance of the best known relay position, the mobile relay first returns to the previous position, and then randomly moves the fixed step to determine and Move to the next relay location.
CN201510898373.XA 2015-12-08 2015-12-08 Mobile relay best relay position searching method based on fixed step size and system Expired - Fee Related CN105491637B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510898373.XA CN105491637B (en) 2015-12-08 2015-12-08 Mobile relay best relay position searching method based on fixed step size and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510898373.XA CN105491637B (en) 2015-12-08 2015-12-08 Mobile relay best relay position searching method based on fixed step size and system

Publications (2)

Publication Number Publication Date
CN105491637A true CN105491637A (en) 2016-04-13
CN105491637B CN105491637B (en) 2018-08-24

Family

ID=55678261

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510898373.XA Expired - Fee Related CN105491637B (en) 2015-12-08 2015-12-08 Mobile relay best relay position searching method based on fixed step size and system

Country Status (1)

Country Link
CN (1) CN105491637B (en)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105554840A (en) * 2015-12-08 2016-05-04 深圳大学 Optimum relay position searching method and system based on reverse compensation mechanism
WO2017096543A1 (en) * 2015-12-08 2017-06-15 深圳大学 Method and system for seeking optimal relay position based on reverse compensation mechanism
WO2017096541A1 (en) * 2015-12-08 2017-06-15 深圳大学 Method and system for seeking optimal relay position of mobile relay based on fixed step length
WO2017096545A1 (en) * 2015-12-08 2017-06-15 深圳大学 Method and system for seeking optimal relay position based on timing mechanism
CN107222283A (en) * 2017-04-11 2017-09-29 北京邮电大学 WDM FSO network node resources sharing methods and system
CN107436601A (en) * 2017-07-05 2017-12-05 深圳大学 The position control method and device of the mobile device of adaptive noise feedback
CN108540196A (en) * 2017-03-03 2018-09-14 北京小米移动软件有限公司 Signal processing method and device
CN109982310A (en) * 2017-12-27 2019-07-05 中国移动通信集团北京有限公司 A kind of method of adjustment of base station location and base station
CN110933754A (en) * 2019-10-22 2020-03-27 四川安迪科技实业有限公司 Large-scale FDMA satellite network access time slot dynamic adjustment method, device and system
CN111679932A (en) * 2020-06-01 2020-09-18 北京和德宇航技术有限公司 Error code data generation method and device, computer equipment and storage medium
CN111818453A (en) * 2020-07-13 2020-10-23 深圳大学 Spectrum sharing method and system for millimeter wave mobile base station based on clustering algorithm

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8670759B2 (en) * 2008-07-03 2014-03-11 Nec Corporation Communication system
CN101557630A (en) * 2009-03-25 2009-10-14 山东大学 Method for selecting cooperative nodes in wireless communication network
CN101932064B (en) * 2010-07-27 2013-01-23 北京大学 Joint relay selection-based communication method in bidirectional delay network
CN102811446B (en) * 2011-05-30 2017-05-03 中兴通讯股份有限公司 Method and device for wireless relay node address selection
CN104507136B (en) * 2014-12-22 2018-09-07 哈尔滨工业大学 A kind of relay node selecting method

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017096543A1 (en) * 2015-12-08 2017-06-15 深圳大学 Method and system for seeking optimal relay position based on reverse compensation mechanism
WO2017096541A1 (en) * 2015-12-08 2017-06-15 深圳大学 Method and system for seeking optimal relay position of mobile relay based on fixed step length
WO2017096545A1 (en) * 2015-12-08 2017-06-15 深圳大学 Method and system for seeking optimal relay position based on timing mechanism
CN105554840A (en) * 2015-12-08 2016-05-04 深圳大学 Optimum relay position searching method and system based on reverse compensation mechanism
CN105554840B (en) * 2015-12-08 2018-10-12 深圳大学 The method for searching and system of best relay position based on Contrary compensation mechanism
CN108540196A (en) * 2017-03-03 2018-09-14 北京小米移动软件有限公司 Signal processing method and device
CN107222283B (en) * 2017-04-11 2019-07-05 北京邮电大学 WDM-FSO network node resource sharing method and system
CN107222283A (en) * 2017-04-11 2017-09-29 北京邮电大学 WDM FSO network node resources sharing methods and system
CN107436601A (en) * 2017-07-05 2017-12-05 深圳大学 The position control method and device of the mobile device of adaptive noise feedback
CN107436601B (en) * 2017-07-05 2019-11-26 深圳大学 The position control method and device of the mobile device of adaptive noise feedback
CN109982310A (en) * 2017-12-27 2019-07-05 中国移动通信集团北京有限公司 A kind of method of adjustment of base station location and base station
CN109982310B (en) * 2017-12-27 2020-11-13 中国移动通信集团北京有限公司 A kind of base station position adjustment method and base station
CN110933754A (en) * 2019-10-22 2020-03-27 四川安迪科技实业有限公司 Large-scale FDMA satellite network access time slot dynamic adjustment method, device and system
CN110933754B (en) * 2019-10-22 2023-06-02 四川安迪科技实业有限公司 Method, device and system for dynamically adjusting access time slot of large-scale FDMA satellite network
CN111679932A (en) * 2020-06-01 2020-09-18 北京和德宇航技术有限公司 Error code data generation method and device, computer equipment and storage medium
CN111679932B (en) * 2020-06-01 2021-03-09 北京和德宇航技术有限公司 Error code data generation method and device, computer equipment and storage medium
CN111818453A (en) * 2020-07-13 2020-10-23 深圳大学 Spectrum sharing method and system for millimeter wave mobile base station based on clustering algorithm
CN111818453B (en) * 2020-07-13 2021-10-15 深圳大学 Spectrum sharing method and system for millimeter wave mobile base station based on clustering algorithm

Also Published As

Publication number Publication date
CN105491637B (en) 2018-08-24

Similar Documents

Publication Publication Date Title
CN105491637A (en) Method and system for searching optimal relay position of mobile relay based on fixed step size
US8026849B2 (en) Systems and methods for three dimensional antenna selection and power control in an ad-hoc wireless network
US11693431B2 (en) Method and system of measuring radio wave distribution of a radio signal source and estimating corresponding radio characteristics by using a flying vehicle
CN105554843A (en) Best relay position search method and best relay position search system based on continuous negative feedback variable step length
CN105553537B (en) Best relay position searching method based on cumulative positive feedback variable step and system
CN105554842B (en) A kind of method for searching and hunting system of more mobile relay optimal communications position
CN111200824A (en) Optimal deployment method and device for unmanned aerial vehicle base station, unmanned aerial vehicle base station and medium
JP2016144194A (en) Radio communication apparatus and radio communication system, and radio communication method
CN105356930B (en) Global optimum's intermediate position method for searching based on timing mechanism and system
Liu et al. Path planning for aerial sensor networks with connectivity constraints
CN104507160A (en) Wireless network positioning method, access point and positioning server
CN105554840B (en) The method for searching and system of best relay position based on Contrary compensation mechanism
Kwon et al. RF signal source search and localization using an autonomous UAV with predefined waypoints
CN105554841B (en) A kind of best relay position searching method and system based on step-length threshold mechanism
WO2017096541A1 (en) Method and system for seeking optimal relay position of mobile relay based on fixed step length
US11218211B2 (en) Iterative beam training method for accessing a mm-wave network
WO2017096540A1 (en) Method and system for seeking optimal relay position based on continuous negative feedback variable step length
WO2017096543A1 (en) Method and system for seeking optimal relay position based on reverse compensation mechanism
JP2019215183A (en) Interference source searching method and interference source searching device
WO2019090527A1 (en) Indoor positioning method and apparatus using reconfigurable antenna
JP2019056656A (en) Control device and program
WO2017096542A1 (en) Method and system for seeking optimal relay position based on accumulated positive feedback variable step length
EP4214529B1 (en) Position determination of a wireless device
WO2011021321A1 (en) Short-distance wireless system, short-distance wireless apparatus and short-distance wireless method
WO2017096545A1 (en) Method and system for seeking optimal relay position based on timing mechanism

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20180824

Termination date: 20181208

CF01 Termination of patent right due to non-payment of annual fee