WO2017096541A1 - 基于固定步长的移动中继最佳中继位置搜寻方法及系统 - Google Patents

基于固定步长的移动中继最佳中继位置搜寻方法及系统 Download PDF

Info

Publication number
WO2017096541A1
WO2017096541A1 PCT/CN2015/096738 CN2015096738W WO2017096541A1 WO 2017096541 A1 WO2017096541 A1 WO 2017096541A1 CN 2015096738 W CN2015096738 W CN 2015096738W WO 2017096541 A1 WO2017096541 A1 WO 2017096541A1
Authority
WO
WIPO (PCT)
Prior art keywords
relay
location
communication performance
mobile relay
mobile
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.)
Ceased
Application number
PCT/CN2015/096738
Other languages
English (en)
French (fr)
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 PCT/CN2015/096738 priority Critical patent/WO2017096541A1/zh
Publication of WO2017096541A1 publication Critical patent/WO2017096541A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

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

Definitions

  • the present invention relates to the field of wireless communication technologies, and in particular, to a mobile relay optimal relay location search method and system based on a fixed step size.
  • Communication relay can be used to forward information sent between different nodes, expand the communication range, and improve the performance of the communication system.
  • Terrestrial radiocommunication is easily obscured and shielded by obstacles, and aircraft, satellites, and drones (UVAs) can act as communication relays because airborne relays can effectively establish for both parties in need of communication in rugged mountains or urban areas. connection.
  • the method for determining the relay position of the drone mainly includes: using GPS (Global Posinioning Sysnem) to measure the position information of the ground communication unit, and the drone uses GPS to search for the optimal relay position.
  • GPS Global Posinioning Sysnem
  • perturbation-based extreme value search control algorithms algorithms based on multi-carrier antennas, and the like.
  • the ground communication unit needs to use its own GPS function to measure its own location information and send the information to the drone, relying on the GPS function to be vulnerable to attack and interference, resulting in location search failure;
  • the estimation error is easy to occur compared to the single antenna, and the complexity and algorithm of the UAV communication device are also increased. the complexity.
  • Embodiments of the present invention provide a mobile relay optimal relay location searching method based on fixed step size And the system determines the optimal relay position of the mobile relay by comparing the communication performance at different locations, so as to improve the efficiency and accuracy of determining the optimal relay position of the mobile relay, and increase the applicable range.
  • Step A The mobile relay receives the test signal sent from the source end at an arbitrary position on the fixed track, and amplifies and forwards the signal to the destination end;
  • Step B The destination end receives a signal sent by the mobile relay and calculates a current communication performance, where the communication performance includes a signal to noise ratio, a bit error rate, and according to the calculated result and the saved best known medium. Comparing the communication performance of the location, and generating one-bit information to the mobile relay, the one-bit information indicating a comparison result of the communication performance of the current communication performance and the saved best known relay location, The best known relay location is the location with the best communication performance tested;
  • 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, and returns to step A until finally determining the optimal relay location.
  • the optimal relay position is: a location with the best communication performance within a preset search duration, or a location where the mobile relay moves the entire fixed track with the best communication performance, or the communication performance is satisfied.
  • the system sets the required location.
  • the mobile relay receives the test signal sent from the source end at an arbitrary position of the fixed track, and amplifies and forwards the test signal to the destination end;
  • the communication performance is compared and a bit of information is sent back to the mobile relay, the one bit of information representing a comparison of the current communication performance with the communication performance of the saved best known relay location, the best Know that the relay location is the best location for tested communication performance;
  • 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 size, and returns to the execution step.
  • the mobile relay is located at any position of the fixed track, and the receiving is from the
  • 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 location with the best communication performance within the preset search duration, or The mobile relay moves the position where the communication performance is best when the entire fixed track is moved, or the communication performance satisfies the position set by the system.
  • the embodiment of the present invention has the following advantages: by using a fixed disturbance step size and communication performance strength to search for the optimal relay position of the mobile relay, the performance of the relay communication can be improved without requiring Depending on the location information of the source and destination, no multi-antenna is needed, and only one bit of information is fed back to the mobile relay to control the search for the best relay position.
  • the application range is wider, the applicability is stronger and the restriction is small, and the detection is improved. Determine the efficiency and accuracy of the optimal relay location.
  • FIG. 1 is a schematic flowchart of a method for searching for an optimal relay position based on a fixed step size according to a first embodiment of the present invention
  • FIG. 2 is a schematic diagram of a mobile relay relay communication model according to an embodiment of the present invention.
  • 3a and 3b are simulation diagrams of a mobile relay searching for an optimal relay position based on a signal to noise ratio according to an embodiment of the present invention
  • 4a and 4b are simulation diagrams of mobile relay searching for an optimal relay position based on a bit error rate according to an embodiment of the present invention
  • FIG. 5 is a schematic structural diagram of a mobile relay optimal relay location searching system based on a fixed step size according to a second embodiment of the present invention.
  • the embodiment of the invention provides a mobile relay optimal relay location searching method and system based on fixed step size, and the mobile relay configured with single antenna searches for the optimal relay bit according to the communication performance strength and the fixed step size.
  • the embodiment of the present invention is applicable to a fixed relay motion track, and the application scenario may be a scenario of setting up a temporary communication system, a communication connection at a disaster site, and the like.
  • a method for searching a mobile relay optimal relay location based on a fixed step size includes the following steps:
  • Step A The mobile relay receives the test signal sent from the source end at any position of the fixed track, and amplifies and forwards it to the destination end.
  • the test signal is a signal for testing communication performance, which can help the mobile relay to search for the optimal relay position, and can carry data for testing communication performance in the test signal, and search for the best in the mobile relay.
  • the source Before the relay position, the source sends the test signal, and the source will send the really useful data only after the mobile relay finds the best relay position.
  • the source 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, and amplifies and forwards the test signal to the destination end, so that the destination end
  • the communication performance strength of the test signal is compared to the communication performance strength of the best known location saved.
  • Step B The destination end receives the signal sent by the mobile relay and calculates the current communication performance, where the communication performance includes a signal to noise ratio, a bit error rate, and according to the calculated result and the saved best known relay position.
  • the communication performance is compared to generate a bit of information fed back to the mobile relay, the one bit of information representing a comparison of the current communication performance with the communication performance of the saved best known relay location.
  • This best known relay location is the location with the best communication performance tested.
  • the mobile relay Before performing the optimal relay location search, the mobile relay first initializes its location information, and receives the test signal transmitted from the source end and amplifies and forwards it to the destination end. The destination end will calculate the communication performance and calculate The result is saved as your own initial record. Each time slot, the source end sends a test signal to the mobile relay, and the mobile relay amplifies the test signal and sends the test signal to the destination end, and the destination end receives the signal sent by the mobile relay and calculates the time.
  • Communication performance including signal to noise ratio (SNR, Signal Noise Ratio, SER (Symbol Error Rate), where the greater the signal-to-noise ratio, the stronger the communication performance, and the smaller the bit error rate, the stronger the communication performance, the signal is amplified by the test signal. After getting it.
  • SNR signal to noise ratio
  • SER Signal Noise Ratio
  • SER Symbol Error Rate
  • the position where the communication performance intensity is the highest among 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 end and also stored in the mobile relay.
  • the destination end calculates the communication performance of the current and the mobile relay according to the signal, and compares the calculation result with the communication performance of the saved best known relay position according to the calculation result, that is, compares the current and the mobile relay.
  • the communication performance of the current location and the communication performance of the best known location saved, to determine whether the communication performance of the mobile relay at the current location is improved compared to the previous location.
  • the destination side updates the best known received signal communication performance in the memory based on the comparison of the current communication performance with the communication performance of the saved best known relay location.
  • one bit information is generated according to the comparison result, and the one bit information is fed back to the mobile relay, where the one bit information represents a comparison result between the current communication performance and the communication performance of the saved best known relay position, that is,
  • the one-bit information includes information on whether the performance of the received signal at the destination end is improved.
  • the bit information 1 may be set in advance to indicate that the communication performance of the current communication performance is improved over the best known position, and the bit information 0 indicates that the current communication performance of the signal is lower than that of the best known position.
  • the comparison result can also be set by other forms, which is not limited herein.
  • the one-bit information may be a comparison result between a signal-to-noise ratio of the test signal received by the destination end and a signal-to-noise ratio of the best known position saved on the destination end, where the best known position is The position corresponding to the maximum signal-to-noise ratio of all test signals that have been calculated before the nth time slot.
  • the one-bit information may also be a comparison result of a bit error rate of the test signal received at the destination end and a bit error rate of the best known position saved on the destination end, the best known position being The position corresponding to the minimum bit error rate of all test signals that have been calculated before the nth time slot.
  • the source end and the destination end may be various types of wireless communication transceiver devices, such as a mobile phone, a base station, and the like.
  • the mobile relay uses an onboard single antenna.
  • Figure 2 is A schematic diagram of a mobile relay relay communication model in the embodiment of the present invention.
  • the mobile relay is connected to the source end and the destination end via a wireless network.
  • Mobile relay based on a cylindrical coordinate point R i, R i XOY plane are projected on a point R i ', the source end in the cylinder coordinate plane xoy as point S, the destination XOY plane in the cylindrical coordinate system On point D.
  • the coordinate variable of the origin O of the cylindrical coordinate system is (0, 0, z)
  • the coordinate variable of the source S is (x s , y s , z s )
  • the coordinate variable of the destination D is (x d , y d , z d )
  • the three coordinate variables of the mobile relay R i are (r, ⁇ , z), where r is the radius of motion of the mobile relay on the XOY plane, and ⁇ is from the positive z-axis from X
  • OR i ' where z is the height of the mobile relay.
  • the origin, r, and z of the above cylindrical coordinate system are preset, thereby determining the motion trajectory of the mobile relay, that is, the mobile relay moves on the circumference of the height z of the radius r in FIG.
  • the coordinates of the mobile relay in the nth slot are R(r, ⁇ (n), z), and the coordinates in the n+1th slot are R(r, ⁇ (n+1), z).
  • the communication distance between the mobile relay and the source S ie, the linear distance
  • d1 and the communication distance d 2 between the destination D are:
  • the communication performance as the signal-to-noise ratio is taken as an example to describe the communication process of the mobile relay, the source and the destination, and the signal-to-noise ratio. Please refer to Figure 2:
  • n 1 represents the additive white Gaussian noise of the first hop communication.
  • E represents the mathematical expectation
  • N 01 represents the power of the additive white Gaussian noise n 1 .
  • ⁇ represents the wavelength at which the source transmits the test signal and d 1 represents the distance between the source and the mobile relay.
  • the signal has fading during transmission and is also interfered by noise.
  • the information relayed by the mobile relay includes the test signal and Gaussian white noise that have passed the free path fading.
  • Second hop communication mobile relay to the destination
  • x is the test signal
  • P S is the transmit power at the source
  • L S is the free path loss from the source to the mobile relay
  • L R is the free path loss from the source to the mobile relay
  • G is the mobile
  • the gain of the received test signal is relayed, that is, the relay gain
  • n 2 represents the additive white Gaussian noise of the second hop communication
  • E represents the mathematical expectation
  • N 02 represents the power of the additive white Gaussian noise n 2 .
  • ⁇ represents the wavelength of the amplified test signal transmitted by the mobile relay
  • d 2 represents the distance between the destination end and the mobile relay.
  • the gain of the mobile relay to the received test signal is:
  • the signal-to-noise ratio SNR of the test signal transmitted by the source end obtained by the formula (4) after receiving at the destination end is:
  • SNR 1 and SNR 2 are as follows:
  • 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, and returns to step A until finally determining the optimal relay location.
  • the current location is recorded as the best known location, and is randomly moved by a fixed step to determine and move to the next.
  • a random position, random increase refers to the random selection of positive and negative signs to increase.
  • the mobile relay first returns to the previous position, then randomly adds a fixed step size to determine and move to the next relay position, and returns to step A until the optimal relay position is finally determined.
  • Each iteration slot is randomly incremented by a perturbation step with a fixed value:
  • ⁇ 0 is a fixed step size and n is the number of time slots. For each additional time slot, ⁇ (n) is increased by ⁇ 0 .
  • the mobile relay records its current location, with the current location being the best known relay location, the best known relay location being denoted by ⁇ (n), and n representing the number of slots.
  • the mobile relay calculates the next position according to the fixed step size and moves to the next position to Indicates the next position, with ⁇ (n) indicating the random increase step size, then:
  • the mobile relay determines the next relay location according to whether the performance of the destination signal in the one-bit information is improved, and the preset fixed step size.
  • the optimal relay location includes: a location with the best communication performance within a preset search duration, or a location where the mobile relay moves the entire communication track with the best communication performance, or the communication performance satisfies the system design Determine the required location. That is, the optimal relay position is determined by setting any one of the search duration, the search distance, and the communication performance strength of the mobile relay.
  • step A moving again Following any position on the fixed track, the test signal transmitted from the source is received and forwarded to the destination, so that it is looped between steps A through C until the optimal relay position is found. That is, the relay position of the search signal having the strongest communication performance strength, after determining the optimal relay position, stops the above loop search process.
  • the mobile relay records the current location as the best known location and randomly moves a fixed step distance to determine and move to the next relay location.
  • the mobile relay updates the signal to noise ratio of the best received signal, and the update rule is:
  • SNR best is the signal-to-noise ratio of the best received signal in the n+1th slot
  • max(SNR best (n), SNR(n)) represents the signal-to-noise ratio and current position of the best known position in the nth slot.
  • the mobile relay updates the current location to the best known location, and the update rules are as follows:
  • the comparison result is that the signal-to-noise ratio of the current communication is smaller than the signal-to-noise ratio of the best known position, indicating that the communication status of the current location is not ideal, and the best known position is not suitable as the relay position, therefore,
  • the mobile relay will return to its last location and randomly move a fixed step distance to determine and move to the next relay location.
  • the mobile relay records the current location as the best known location and randomly moves a fixed step distance to determine and move to the next relay location.
  • the mobile relay will return to the last location and randomly move a fixed step distance to determine and move to the next relay location.
  • the signal to noise ratio of the known location updates the current location of the mobile relay to the best known location, and correspondingly updates the signal to noise ratio or the bit error rate of the test signal.
  • the performance of the relay communication can be improved without relying on the location information of the source end and the destination end, without Multiple antennas, and only need the destination to feed back one bit of information to the mobile relay to control its search for the best relay position, the application range is wider, the applicability is stronger and the limitation is small, and the efficiency and accuracy of determining the optimal relay position are improved. Sex.
  • the optimal relay position simulation diagram for searching the mobile relay by the signal to noise ratio is as shown in FIG. 3a and FIG. 3b, and the error is adopted.
  • the optimal relay position simulation diagram of the rate search mobile relay is shown in Figures 4a and 4b:
  • the initial step size (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 + (0.05 * (1 +
  • FIG. 3a and 3b show the communication performance strength based on the signal-to-noise ratio, that is, the formula (8)
  • the horizontal axis of Fig. 8a represents ⁇ (n)
  • the vertical axis represents the source end of the relay position corresponding to ⁇ (n).
  • the horizontal axis of Figure 3b represents the number of time slots spent by the mobile relay in searching for the best relay position
  • the vertical axis represents the signal-to-noise ratio of the source to the destination.
  • FIG. 4a and 4b show the communication performance strength on the basis of the bit error rate
  • the horizontal axis of Fig. 4a represents ⁇ (n)
  • the vertical axis represents the bit error rate of the source to the destination of the relay position corresponding to ⁇ (n).
  • BER bit error rate
  • Figure 4b horizontal axis Indicates the number of time slots spent by the mobile relay in searching for the best relay position
  • the vertical axis indicates the bit error rate from the source to the destination.
  • FIG. 5 is a schematic structural diagram of a mobile relay optimal relay location searching system based on a fixed step size according to a second embodiment of the present invention.
  • the system mainly includes: a mobile relay 501, a source end 502, and a destination end 503.
  • the mobile relay 501 receives the test signal sent from the source end 502 at any position of the fixed track, and amplifies and forwards it to the destination end 503.
  • the destination 503 receives the signal sent by the mobile relay 501 and calculates the current communication performance, the communication performance includes the signal to noise ratio, the bit error rate, and according to the communication result of the calculated result and the saved best known relay position. Comparing and generating one-bit information back to the mobile relay 501, the one-bit information representing a comparison of the current communication performance with the communication performance of the saved best known relay location, the best known relay location being Test the best location for communication performance.
  • the mobile relay 501 records the current location information and moves to the next relay location according to the one-bit information and the preset fixed step, and returns to the execution step.
  • the mobile relay is in any position on the fixed track, and the receiving is sent from the source.
  • the test signal is amplified and forwarded to the destination for continuous cycling until the optimal relay position is finally determined.
  • the optimal relay position is: a location with the best communication performance within a preset search duration, or a location where the mobile relay 501 moves the entire fixed track with the best communication performance, or the communication performance satisfies the system design. Determine the required location.
  • the mobile relay 501 initializes its location information before performing the optimal relay location search, and receives the test signal transmitted from the source 502 and amplifies and forwards it to the destination end 503.
  • 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 the fixed step size is randomly moved 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 position, the mobile relay mobile relay 501 first returns to the previous position, and then randomly moves a fixed step to determine and move to Next relay location.
  • the performance of the relay communication can be improved without relying on the location information of the source end and the destination end, without Multiple antennas, and only need the destination to feed back one bit of information to the mobile relay to control its search for the best relay position, the application range is wider, the applicability is stronger and the limitation is small, and the efficiency and accuracy of determining the optimal relay position are improved. Sex.

Landscapes

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

Abstract

本发明公开了一种基于固定步长的移动中继最佳中继位置搜寻方法及系统，该方法包括：移动中继接收源端发送的测试信号，放大后转发给目的端，目的端根据放大的测试信号计算通信性能，并与保存的最佳已知位置的通信性能进行比较后生成一比特信息反馈给移动中继，移动中继根据这一比特信息及预置的固定步长移动到下一个中继位置，再次执行接收源端发送的测试信号的步骤，直至确定最佳中继位置。该方法可提高中继通信的性能，且无需获得源端和目的端的位置信息，无需多天线，且只需要目的端反馈一比特信息给移动中继进行搜寻控制，依然可在预定轨迹范围内确定最佳中继位置点，扩大了适用范围。

Description

基于固定步长的移动中继最佳中继位置搜寻方法及系统 技术领域
本发明涉及无线通信技术领域，尤其涉及一种基于固定步长的移动中继最佳中继位置搜寻方法及系统。
背景技术
通信中继可以用来转发不同的节点之间发出的信息，扩大了通信范围，提高了通信系统的性能。陆地无线电通信容易被障碍物遮挡和屏蔽，飞机、卫星及无人机(UVAs)可以充当通信中继，因为机载中继可以在崎岖的山区或者市区有效地为需要互相通信的双方建立起连接。
现有技术中，应用于无人机确定中继位置的方式主要有：利用全球定位系统(GPS，Global Posinioning Sysnem)测量地面通信单元的位置信息，无人机利用GPS搜寻最佳中继位置，以及基于扰动的极值搜索控制算法、基于多载天线的算法等等。
但在以上现有技术中，存在一定的不足和缺陷，主要体现在：
1、地面通信单元需要利用自身的GPS功能测量自己的位置信息并把该信息发送给无人机，依赖GPS功能容易受到攻击和干扰而导致位置搜寻失败；
2、对于没有GPS功能或者GPS设备已损坏的地面通信单元，现有的一些技术无法使用，即现有的确定中继位置的技术使用受限；
3、使用机载多天线信号到达角(DOA，Direcnion of Arrival)进行估计来确定最佳中继位置，相对于单天线容易出现估计误差，同时也增加了无人机通信设备的复杂度和算法复杂度。
发明内容
本发明实施例提供了一种基于固定步长的移动中继最佳中继位置搜寻方法 及系统，通过对比在不同位置的通信性能来确定移动中继的最佳中继位置，以提高确定移动中继最佳中继位置的效率和准确率，以及增加适用范围。
本发明实施例公开的一种基于固定步长的移动中继最佳中继位置搜寻方法包括：
步骤A，移动中继在固定轨道的任意位置上，接收来自源端发送的测试信号，并放大转发至目的端；
步骤B，所述目的端接收所述移动中继发来的信号并计算本次通信性能，所述通信性能包括信噪比、误码率，并根据计算结果与已保存的最佳已知中继位置的通信性能进行比较，并生成一比特信息反馈至所述移动中继，所述一比特信息表示当前通信性能与已保存的最佳已知中继位置的通信性能的比较结果，所述最佳已知中继位置为已测试的通信性能最好的位置；
步骤C，所述移动中继记录当前位置信息并根据所述一比特信息及预置的固定步长移动到下一个中继位置，并返回步骤A，直至最终确定最佳中继位置，所述最佳中继位置为：在预设的搜寻时长内通信性能最好的位置，或者，所述移动中继移动完整个所述固定轨道时通信性能最好的位置，或者，所述通信性能满足系统设定要求的位置。
本发明实施例公开的一种基于固定步长的移动中继最佳中继位置搜寻系统包括：
移动中继、源端和目的端；
其中，所述移动中继在固定轨道的任意位置上，接收来自所述源端发送的测试信号，并放大转发至所述目的端；
所述目的端接收所述移动中继发来的信号并计算本次通信性能，所述通信性能包括信噪比、误码率，并根据计算结果与已保存的最佳已知中继位置的通信性能进行比较，并生成一比特信息反馈至所述移动中继，所述一比特信息表示当前通信性能与已保存的最佳已知中继位置的通信性能的比较结果，所述最佳已知中继位置为已测试的通信性能最好的位置；
所述移动中继记录当前位置信息并根据所述一比特信息及预置的固定步长移动到下一个中继位置，并返回执行步骤移动中继在固定轨道的任意位置上，接收来自所述源端发送的测试信号，并放大转发至所述目的端，直至最终确定最佳中继位置，所述最佳中继位置为：在预设的搜寻时长内通信性能最好的位置，或者，所述移动中继移动完整个所述固定轨道时通信性能最好的位置，或者，所述通信性能满足系统设定要求的位置。
从以上技术方案可以看出，本发明实施例具有以下优点：通过利用固定的扰动步长及通信性能强度来搜寻移动中继的最佳中继位置，可提高中继通信的性能，而不需要依赖源端和目的端的位置信息，无需多天线，且只需目的端反馈一比特信息给移动中继控制其搜寻最佳中继位置，应用范围更广，适用性更强且受限小，提高确定最佳中继位置的效率和准确性。
附图说明
图1为本发明第一实施例中的基于固定步长的移动中继最佳中继位置搜寻方法的流程示意图；
图2为本发明实施例中移动中继中继通信模型示意图；
图3a、3b为本发明实施例中移动中继基于信噪比搜寻最佳中继位置的仿真图；
图4a、4b为本发明实施例中移动中继基于误码率搜寻最佳中继位置的仿真图；
图5为本发明第二实施例中的基于固定步长的移动中继最佳中继位置搜寻系统结构示意图。
具体实施方式
本发明实施例提供了一种基于固定步长的移动中继最佳中继位置搜寻方法及系统，配置单天线的移动中继根据通信性能强度及固定步长搜寻最佳中继位 置点，从而提高中继通信的性能，且无需获得地面的位置信息，依然可在预定轨迹范围内确定最佳中继位置点，扩大了适用范围。
本发明实施例适用于固定的中继运动轨道，应用场景可以是临时通信系统的搭建、灾害现场的通信连接等场景。
请参阅图1，本发明第一实施例提供的基于固定步长的移动中继最佳中继位置搜寻方法，包括以下步骤：
步骤A、移动中继在固定轨道的任意位置上，接收来自源端发送的测试信号，并放大转发至目的端。
该测试信号是用于测试通信性能的信号，它可以帮助移动中继搜寻到最佳中继位置，可以在该测试信号中携带用来测试通信性能的数据，且在移动中继搜寻到最佳中继位置之前，源端发送的都是测试信号，只有在移动中继找到最佳中继位置之后，源端才将发送真正有用的数据。
在第n时隙，源端发送测试信号给移动中继，移动中继在固定轨道的任意位置上接收源端发送的测试信号，并将该测试信号放大以及转发给目的端，使得该目的端将该测试信号的通信性能强度与保存的最佳已知位置的通信性能强度进行对比。
步骤B、该目的端接收该移动中继发来的信号并计算本次通信性能，该通信性能包括信噪比、误码率，并根据计算结果与已保存的最佳已知中继位置的通信性能进行比较，生成一比特信息反馈至该移动中继，该一比特信息表示当前通信性能与已保存的最佳已知中继位置的通信性能的比较结果。
该最佳已知中继位置为已测试的通信性能最好的位置。
在进行最佳中继位置搜寻前，移动中继先要初始化其位置信息，并接收来自源端发射的测试信号并放大转发至目的端，该目的端将计算该次通信性能，并将的计算结果保存为自己的初始记录。每个时隙，该源端都会发送测试信号给该移动中继，该移动中继将该测试信号放大后发送给该目的端，该目的端接收该移动中继发来的信号并计算该次通信性能，该通信性能包括信噪比(SNR， Signal Noise Ratio)、误码率(SER，Symbol Error Rate)，其中信噪比越大，则表示通信性能越强，而误码率越小，表示通信性能越强，该信号为该测试信号放大后得到的。
在第n时隙之前的所有测试信号中通信性能强度最大的位置即为该最佳已知位置，该最佳已知位置的信息保存在该目的端中，也保存在该移动中继中。
该目的端根据该信号计算出本次和移动中继的通信性能后，根据计算结果与已保存的最佳已知中继位置的通信性能进行比较，即，比较出本次与该移动中继所在当前位置的通信性能与保存的最佳已知位置的通信性能的大小，以此判断移动中继在当前位置的通信性能是否较之上次所在位置有了提升。目的端根据当前通信性能与已保存的最佳已知中继位置的通信性能的比较结果，更新内存中的最佳已知接收信号通信性能。
进一步地，根据比较结果生成一比特信息，将该一比特信息反馈至该移动中继，该一比特信息表示当前通信性能与已保存的最佳已知中继位置的通信性能的比较结果，即该一比特信息中包含该目的端接收信号性能是否提高的信息。例如，可以预先设置比特信息1表示当前通信性能比最佳已知位置的通信性能有提高，比特信息0表示信号的当前通信性能比最佳已知位置的通信性能有下降。在实际应用中，还可以通过其他的形式设置比较结果，此处不作限定。
具体地，该一比特信息可以是该目的端接收到的该测试信号的信噪比与该目的端上已保存的最佳已知位置的信噪比的对比结果，该最佳已知位置为在第n时隙之前已计算得到的所有测试信号的最大信噪比对应的位置。该一比特信息也可以是为该目的端接收到的该测试信号的误码率与该目的端上已保存的最佳已知位置的误码率的对比结果，该最佳已知位置为在第n时隙之前已计算得到的所有测试信号的最小误码率对应的位置。
其中，该源端和该目的端可以是各种类型的无线通信收发设备，如：手机、基站等。该移动中继使用机载单天线。
为了便于理解，简单介绍下移动中继中继通信的场景，请参阅图2，图2为 本发明实施例中移动中继中继通信模型示意图。
移动中继分别与源端、目的端通过无线网络连接。移动中继在柱坐标系上为点Ri，Ri在XOY平面上的投影为点Ri′，源端在柱坐标系的xoy平面上为点S，目的端在柱坐标系的XOY平面上为点D。
具体地，柱坐标系的原点O的坐标变量是(0，0，z)，源端S的坐标变量是(xs，ys，zs)，目的端D的坐标变量是(xd，yd，zd)，移动中继Ri的三个坐标变量是(r，θ，z)，其中r为移动中继在XOY平面上的运动半径，θ为从正z轴来看自X轴按逆时针方向转到ORi′所转过的角，z为移动中继的高度。以上柱坐标系的原点、r、z均是预先设定的，从而也就确定了移动中继的运动轨迹，即移动中继在图2中高度为z半径为r的圆周上移动。移动中继在第n时隙的坐标为R(r，θ(n)，z)，在第n+1时隙的坐标为R(r，θ(n+1)，z)。
柱坐标系(r，θ，z)与空间直角坐标系(x，y，z)的转换关系如下：
Figure PCTCN2015096738-appb-000001
进一步地，在第n时隙，移动中继与源端S之间的通信距离(即直线距离)d1、与目的端D之间的通信距离d2分别为：
Figure PCTCN2015096738-appb-000002
下面以通信性能为信噪比时为例，描述移动中继、源端和目的端的通信过程以及信噪比，请仍参见图2：
第一跳通信：源端到移动中继；
源端发送给移动中继的信号：
Figure PCTCN2015096738-appb-000003
E[|n1|2]＝N01        (2)
其中，x表示源端发射的测试信号，PS表示源端的发射功率，LS，R表示源端到移动中继的自由空间路径损耗，n1表示第一跳通信的加性高斯白噪声。E表示求数学期望，N01表示加性高斯白噪声n1的功率。
第一跳通信的自由空间路径损耗：
Figure PCTCN2015096738-appb-000004
其中，λ表示源端发射测试信号的波长，d1表示源端与移动中继之间的距离。
信号在传输过程中有衰落，还会受到噪声的干扰，移动中继转发的信息中会包括经过了自由路径衰落的测试信号和高斯白噪声。
第二跳通信：移动中继到目的端；
移动中继发送给目的端的信号：
Figure PCTCN2015096738-appb-000005
E[|n2|2]＝N02              (5)
其中，x表示测试信号，PS表示源端的发射功率，LS，R表示源端到移动中继的自由路径损耗，LR，D表示源端到移动中继的自由路径损耗，G表示移动中继给接收到的测试信号的增益，即中继增益，n2表示第二跳通信的加性高斯白噪声。E表示求数学期望，N02表示加性高斯白噪声n2的功率。
第二跳信道的自由空间路径损耗：
Figure PCTCN2015096738-appb-000006
其中，λ表示移动中继发射的经过放大的测试信号的波长，d2表示目的端与 移动中继之间的距离。
移动中继给接收到的测试信号的增益为：
Figure PCTCN2015096738-appb-000007
由公式(4)得源端发送的该测试信号在目的端接收后的信噪比SNR为：
Figure PCTCN2015096738-appb-000008
其中，SNR1、SNR2如下：
Figure PCTCN2015096738-appb-000009
公式(7)、(8)、(9)中的参数含义参见前述的描述，此处不再赘述。
步骤C、该移动中继记录当前位置信息，并根据该一比特信息及预置的固定步长移动到下一个中继位置，并返回步骤A，直至最终确定最佳中继位置。
具体地，若该一比特信息表示当前通信性能大于该最佳已知中继位置的通信性能，则将当前位置记录为最佳已知位置，并随机移动一个固定步长以确定及移动到下一个中继位置，随机增加是指随机选取正负符号进行增加。
若该一比特信息表示当前通信性能小于该最佳已知中继位置的通信性能， 则该移动中继先返回到上一次的位置，再随机增加一个固定步长以确定及移动到下一个中继位置，并返回步骤A，直至最终确定最佳中继位置。
每个迭代时隙随机增加一个具有固定值的扰动步长：
δ(n)＝±δ0
其中，δ0为固定步长，n表示时隙数，每增加一个时隙，δ(n)便增加一个δ0。当δ(n)＝δ0时，表示移动中继逆时针方向移动一个δ0，当δ(n)＝-δ0时，表示移动中继顺时针方向移动一个δ0。
需要说明的是，移动中继的移动方向也可以做相反设置，即，当δ(n)＝δ0时，表示移动中继顺时针方向移动一个δ0，当δ(n)＝-δ0时，表示移动中继逆时针方向移动一个δ0。
移动中继记录其当前位置，以当前位置为最佳已知中继位置，该最佳已知中继位置用θ(n)表示，n表示时隙数。移动中继根据固定步长计算下一位置并移动到下一位置，以
Figure PCTCN2015096738-appb-000010
表示下一位置，以δ(n)表示随机增加步长，则：
Figure PCTCN2015096738-appb-000011
进一步地，该移动中继根据该一比特信息中的该目的端接收信号性能是否提高的信息，以及预置的固定步长确定下一个中继位置。移动中继对该一比特信息进行判断，判断为目的端接收移动中继的信号性能提高时，即当前通信性能比已保存的最佳已知中继位置的通信性能更高时，将当前位置记录为最佳已知位置θ(n+1)＝θ(n)+δ(n)，判断为目的端接收移动中继的信号性能未提高时，即当前通信性能比已保存的最佳已知中继位置的通信性能更差时，则移动中继返回上一时隙的位置θ(n+1)＝θ(n)，返回步骤A。
该最佳中继位置包括：在预设的搜寻时长内通信性能最好的位置，或者，该移动中继移动完整个该固定轨道时通信性能最好的位置，或者，该通信性能满足系统设定要求的位置。即，通过设置移动中继的搜寻时长、搜寻路程、通信性能强度中的任一个参数来确定该最佳中继位置。
若该下一个中继位置不是该最佳中继位置，则须再次执行步骤A：移动中 继在固定轨道的任意位置上，接收来自源端发送的测试信号，并放大转发至目的端，这样在步骤A至步骤C之间循环执行，直至搜寻到最佳中继位置。即搜索信号的通信性能强度最大的中继位置，当确定最佳中继位置之后，便停止上述循环搜索过程。
具体地，当通信性能为信噪比时，若该对比结果为本次通信的信噪比大于该最佳已知位置的信噪比，则表示当前位置的通信状况更好，更适宜作中继位置，因此，该移动中继将当前位置记录为最佳已知位置，并随机移动一个该固定步长的距离以确定及移动到下一个中继位置。
并且，该移动中继更新最佳接收信号的信噪比，更新规则为：
SNRbest(n+1)＝max(SNRbest(n)，SNR(n))
其中，SNRbest为第n+1时隙最佳接收信号的信噪比，max(SNRbest(n)，SNR(n))表示第n时隙最佳已知位置的信噪比和当前位置的信噪比的最大值，该最大值即为SNRbest。
同时，该移动中继将当前位置更新为最佳已知位置，更新规则如下：
Figure PCTCN2015096738-appb-000012
该对比结果为本次通信的信噪比小于该最佳已知位置的信噪比，则表示当前位置的通信状况不理想，没有该最佳已知位置更适宜作中继位置，因此，该移动中继将返回到其上一次所在的位置，并随机移动一个该固定步长的距离以确定及移动到下一个中继位置。
当通信性能为误码率时，若该对比结果为该测试信号的误码率小于该最佳已知位置的误码率，则表示当前位置的通信状况更好，更适宜作中继位置，因此，该移动中继将当前位置记录为最佳已知位置，并随机移动一个该固定步长的距离以确定及移动到下一个中继位置。
若该对比结果为该测试信号的误码率大于该最佳已知位置的误码率，则表示当前位置的通信状况不理想，没有该最佳已知位置更适宜作中继位置，因此， 该移动中继将返回到上一次的位置，并随机移动一个该固定步长的距离以确定及移动到下一个中继位置。
进一步地，若该对比结果为计算得到的该测试信号的信噪比大于该最佳已知位置的信噪比，或者，若该对比结果为计算得到的该测试信号的误码率小于该最佳已知位置的信噪比，则将该移动中继的当前位置更新为该最佳已知位置，并对应更新该测试信号的信噪比或误码率。
本发明实施例中，通过利用固定的扰动步长及通信性能强度来搜寻移动中继的最佳中继位置，可提高中继通信的性能，而不需要依赖源端和目的端的位置信息，无需多天线，且只需目的端反馈一比特信息给移动中继控制其搜寻最佳中继位置，应用范围更广，适用性更强且受限小，提高确定最佳中继位置的效率和准确性。
在本发明以上基于固定步长的移动中继最佳中继位置搜寻方法的实施例中，通过信噪比搜寻移动中继的最佳中继位置仿真图如图3a、3b所示，通过误码率搜寻移动中继的最佳中继位置仿真图如图4a、4b所示：
其中，初始步长：
Figure PCTCN2015096738-appb-000013
源端的位置坐标：(xs，ys，zs)＝(0，-700，1)
目的端的位置坐标：(xd，yd，zd)＝(30，-600，1)
移动中继的位置坐标：(r，θ(n)，z)＝(500，θ(n)，30)
图3a和图3b以信噪比为基准表示通信性能强度，即公式(8)，图8a横轴表示θ(n)，纵轴表示与θ(n)相对应的该中继位置的源端到目的端的信噪比SNR。图3b横轴表示移动中继搜寻最佳中继位置过程中花费的时隙数，纵轴表示源端到目的端的信噪比。在搜寻到第35个时隙时，确定最佳中继位置，即图8a中的极大值点对应的位置。
图4a和图4b以误码率为基准表示通信性能强度，图4a横轴表示θ(n)，纵轴表示与θ(n)相对应的该中继位置的源端到目的端的误码率BER。图4b横轴 表示移动中继搜寻最佳中继位置过程中花费的时隙数，纵轴表示源端到目的端的误码率。在搜寻到第35个时隙时，确定最佳中继位置，即图4a中的极小值点对应的位置。
请参阅图5，图5是本发明第二实施例提供的基于固定步长的移动中继最佳中继位置搜寻系统的结构示意图，为了便于说明，仅示出了与本发明实施例相关的部分。该系统主要包括：移动中继501、源端502以及目的端503。
其中，移动中继501在固定轨道的任意位置上，接收来自源端502发送的测试信号，并放大转发至目的端503。
目的端503接收移动中继501发来的信号并计算本次通信性能，该通信性能包括信噪比、误码率，并根据计算结果与已保存的最佳已知中继位置的通信性能进行比较，并生成一比特信息反馈至移动中继501，该一比特信息表示当前通信性能与已保存的最佳已知中继位置的通信性能的比较结果，该最佳已知中继位置为已测试的通信性能最好的位置。
移动中继501记录当前位置信息并根据该一比特信息及预置的固定步长移动到下一个中继位置，并返回执行步骤移动中继在固定轨道的任意位置上，接收来自该源端发送的测试信号，并放大转发至所述目的端，不断循环，直至最终确定最佳中继位置。该最佳中继位置为：在预设的搜寻时长内通信性能最好的位置，或者，移动中继501移动完整个该固定轨道时通信性能最好的位置，或者，该通信性能满足系统设定要求的位置。
进一步地，移动中继501在进行最佳中继位置搜寻前，初始化其位置信息，并接收来自源端502发射的该测试信号并放大转发至目的端503。
进一步地，若该一比特信息表示当前通信性能大于该最佳已知中继位置的通信性能，则将移动中继501当前位置记录为最佳已知位置，并随机移动一个该固定步长以确定及移动到该下一个中继位置。若该一比特信息表示当前通信性能小于该最佳已知中继位置的通信性能，则移动中继移动中继501先返回到上一次的位置，再随机移动一个固定步长以确定及移动到下一个中继位置。
本实施例中的基于固定步长的移动中继最佳中继位置搜寻系统的移动中继、源端、目的端实现各自功能的具体过程，请参见上述图1所示实施例中描述的具体内容，此处不再赘述。
本发明实施例中，通过利用固定的扰动步长及通信性能强度来搜寻移动中继的最佳中继位置，可提高中继通信的性能，而不需要依赖源端和目的端的位置信息，无需多天线，且只需目的端反馈一比特信息给移动中继控制其搜寻最佳中继位置，应用范围更广，适用性更强且受限小，提高确定最佳中继位置的效率和准确性。
本领域技术人员可以理解实现上述实施例方法中的全部或部分步骤是可以通过程序来指令相关的硬件完成，所述的程序可以存储于一种计算机可读存储介质中，上述提到的存储介质可以是只读存储器，磁盘或光盘等。
在上述实施例中，对各个实施例的描述都各有侧重，某个实施例中没有详述的部分，可以参见其它实施例的相关描述。
以上对本发明所提供的基于固定步长的移动中继最佳中继位置搜寻方法及系统进行了详细介绍，对于本领域的技术人员，依据本发明实施例的思想，在具体实施方式及应用范围上均会有改变之处，综上所述，本说明书内容不应理解为对本发明的限制。

Claims (10)

  1. 一种基于固定步长的移动中继最佳中继位置搜寻方法，其特征在于，所述搜寻方法步骤包括：
    步骤A，移动中继在固定轨道的任意位置上，接收来自源端发送的测试信号，并放大转发至目的端；
    步骤B，所述目的端接收所述移动中继发来的信号并计算本次通信性能，所述通信性能包括信噪比、误码率，并根据计算结果与已保存的最佳已知中继位置的通信性能进行比较，并生成一比特信息反馈至所述移动中继，所述一比特信息表示当前通信性能与已保存的最佳已知中继位置的通信性能的比较结果，所述最佳已知中继位置为已测试的通信性能最好的位置；
    步骤C，所述移动中继记录当前位置信息并根据所述一比特信息及预置的固定步长移动到下一个中继位置，并返回步骤A，直至最终确定最佳中继位置，所述最佳中继位置为：在预设的搜寻时长内通信性能最好的位置，或者，所述移动中继移动完整个所述固定轨道时通信性能最好的位置，或者，所述通信性能满足系统设定要求的位置。
  2. 如权利要求1所述的搜寻方法，其特征在于，所述方法还包括：
    以yR表示所述移动中继接收到的所述测试信号，则：
    Figure PCTCN2015096738-appb-100001
    其中x表示源端发射的测试信号，PS表示源端发射功率，LS，R表示所述源端到所述移动中继的第一跳通信的自由空间路径损耗，n1表示所述第一跳通信的加性高斯白噪声；
    在进行最佳中继位置搜寻前，所述移动中继初始化其位置信息，并接收来自所述源端发射的所述测试信号并放大转发至所述目的端；
    所述目的端计算通信性能，并将计算结果保存为初始记录。
  3. 如权利要求1所述的搜寻方法，其特征在于，所述方法还包括：
    以yD表示目的端接收到的信号，则：
    yD＝yRGLR，D+n2，其中yR表示移动中继接收的信号，G表示中继增益，LR，D表示所述移动中继到所述目的端的第二跳通信的自由空间路径损耗，n2表示所 述第二条跳通信的加性高斯白噪声。
  4. 如权利要求1所述的搜寻方法，其特征在于，所述步骤C中，移动中继记录当前位置信息并根据所述一比特信息及预置的固定步长确定移动到下一个中继位置，包括：
    若所述一比特信息表示当前通信性能大于所述最佳已知中继位置的通信性能，则将当前位置记录为最佳已知位置，并随机增加一个所述固定步长以确定及移动到所述下一个中继位置，所述随机增加是指随机选取正负符号进行增加；
    若所述一比特信息表示当前通信性能小于所述最佳已知中继位置的通信性能，则所述移动中继先返回到上一次的位置，再随机增加一个所述固定步长以确定及移动到下一个中继位置。
  5. 如权利要求1所述的搜寻方法，其特征在于，所述步骤C中，移动中继记录当前位置信息并根据所述一比特信息及预置的固定步长移动到下一个中继位置，包括：
    步骤C1，所述移动中继记录其当前位置
    Figure PCTCN2015096738-appb-100002
    n表示时隙数；
    步骤C2，所述移动中继根据所述固定步长计算下一位置并移动到所述下一位置，以
    Figure PCTCN2015096738-appb-100003
    表示所述下一位置，以δ(n)＝±δ0表示随机增加步长，δ0表示所述固定步长，则：
    Figure PCTCN2015096738-appb-100004
    θ(n)表示最佳已知中继位置。
  6. 如权利要求5所述的搜寻方法，其特征在于，所述步骤B还包括：
    所述目的端根据当前通信性能与已保存的最佳已知中继位置的通信性能的比较结果，更新内存中的最佳已知接收信号通信性能。
  7. 如权利要求6所述的搜寻方法，其特征在于，所述方法还包括：
    所述移动中继对所述一比特信息进行判断；
    当判断为接收信号性能提高时，将当前位置记录为最佳已知位置θ(n+1)＝θ(n)+δ(n)，当判断为接收信号性能未提高时，则返回上一时隙的位置，θ(n+1)＝θ(n)，并返回步骤A。
  8. 一种基于固定步长的移动中继最佳中继位置搜寻系统，其特征在于，所 述搜寻系统包括移动中继、源端和目的端；
    其中，所述移动中继在固定轨道的任意位置上，接收来自所述源端发送的测试信号，并放大转发至所述目的端；
    所述目的端接收所述移动中继发来的信号并计算本次通信性能，所述通信性能包括信噪比、误码率，并根据计算结果与已保存的最佳已知中继位置的通信性能进行比较，并生成一比特信息反馈至所述移动中继，所述一比特信息表示当前通信性能与已保存的最佳已知中继位置的通信性能的比较结果，所述最佳已知中继位置为已测试的通信性能最好的位置；
    所述移动中继记录当前位置信息并根据所述一比特信息及预置的固定步长移动到下一个中继位置，并返回执行步骤移动中继在固定轨道的任意位置上，接收来自所述源端发送的测试信号，并放大转发至所述目的端，直至最终确定最佳中继位置，所述最佳中继位置为：在预设的搜寻时长内通信性能最好的位置，或者，所述移动中继移动完整个所述固定轨道时通信性能最好的位置，或者，所述通信性能满足系统设定要求的位置。
  9. 根据权利要求8所述的搜寻系统，其特征在于，
    所述移动中继在进行最佳中继位置搜寻前，初始化其位置信息，并接收来自所述源端发射的所述测试信号并放大转发至所述目的端。
  10. 根据权利要求8或9所述的搜寻系统，其特征在于，
    若所述一比特信息表示当前通信性能大于所述最佳已知中继位置的通信性能，则所述移动中继将当前位置记录为最佳已知位置，并随机移动一个所述固定步长以确定及移动到所述下一个中继位置；
    若所述一比特信息表示当前通信性能小于所述最佳已知中继位置的通信性能，则所述移动中继先返回到上一次的位置，再随机移动一个所述固定步长以确定及移动到下一个中继位置。
PCT/CN2015/096738 2015-12-08 2015-12-08 基于固定步长的移动中继最佳中继位置搜寻方法及系统 Ceased WO2017096541A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2015/096738 WO2017096541A1 (zh) 2015-12-08 2015-12-08 基于固定步长的移动中继最佳中继位置搜寻方法及系统

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2015/096738 WO2017096541A1 (zh) 2015-12-08 2015-12-08 基于固定步长的移动中继最佳中继位置搜寻方法及系统

Publications (1)

Publication Number Publication Date
WO2017096541A1 true WO2017096541A1 (zh) 2017-06-15

Family

ID=59012564

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/096738 Ceased WO2017096541A1 (zh) 2015-12-08 2015-12-08 基于固定步长的移动中继最佳中继位置搜寻方法及系统

Country Status (1)

Country Link
WO (1) WO2017096541A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021031757A1 (zh) * 2019-08-22 2021-02-25 中兴通讯股份有限公司 一种配置光网络中继的方法、装置及计算机可读存储介质
CN115379562A (zh) * 2022-10-25 2022-11-22 杭州华橙软件技术有限公司 供网位置的确定方法、装置、存储介质及电子装置

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105491637A (zh) * 2015-12-08 2016-04-13 深圳大学 基于固定步长的移动中继最佳中继位置搜寻方法及系统

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105491637A (zh) * 2015-12-08 2016-04-13 深圳大学 基于固定步长的移动中继最佳中继位置搜寻方法及系统

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
CHAMSEDDINE, ABBAS ET AL.: "Optimal position seeking for unmanned aerial vehicle communication relay using only signal strength and angle of arrival", 53RD IEEE CONFERENCE ON DECISION AND CONTROL, 17 December 2014 (2014-12-17), XP032734087, Retrieved from the Internet <URL:DOI:10.1109/CDC.2014.7039508> *
LIN, MIN ET AL.: "Optimal design and performance analysis for two-hop wireless links with UAV relaying", SYSTEMS ENGINEERING AND ELECTRONICS, vol. 37, no. 6, 30 June 2015 (2015-06-30), pages 1391 - 1398, ISSN: 1001-506X, Retrieved from the Internet <URL:http://caod.oriprobe.com/articles/45514306/Optimal_design_and_performance_analysis_for_two_hop_wireless_links_wit.htm> *
ZHAN, PENGCHENG ET AL.: "Wireless Relay Communication using an Unmanned Aerial Vehicle", 2006 IEEE 7TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, 5 July 2006 (2006-07-05), pages 1 - 5, XP055542835, ISSN: 1948-3244, Retrieved from the Internet <URL:DOI:10.1109/SPAWC.2006.346492> *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021031757A1 (zh) * 2019-08-22 2021-02-25 中兴通讯股份有限公司 一种配置光网络中继的方法、装置及计算机可读存储介质
CN112422306A (zh) * 2019-08-22 2021-02-26 中兴通讯股份有限公司 一种配置光网络中继的方法及装置
CN112422306B (zh) * 2019-08-22 2023-03-24 中兴通讯股份有限公司 一种配置光网络中继的方法及装置
CN115379562A (zh) * 2022-10-25 2022-11-22 杭州华橙软件技术有限公司 供网位置的确定方法、装置、存储介质及电子装置
CN115379562B (zh) * 2022-10-25 2023-02-28 杭州华橙软件技术有限公司 供网位置的确定方法、装置、存储介质及电子装置

Similar Documents

Publication Publication Date Title
CN105491637B (zh) 基于固定步长的移动中继最佳中继位置搜寻方法及系统
EP4055890B1 (en) Estimating locations of signal shadowing obstructions and signal reflectors in a wireless communications network
CN114667773B (zh) 无线通信网络中基于连通性的定位确定
US20200183426A1 (en) Method and system of measuring radio wave distribution of a radio signal source and estimating corresponding radio characteristics by using a flying vehicle
CN105554843B (zh) 基于连续负反馈变步长的最佳中继位置搜寻方法及系统
CN105554842B (zh) 一种多移动中继最佳通信位置的搜寻方法及搜寻系统
CN102665274B (zh) 传感器网络节点的定位方法及装置
Saeed et al. Analysis of 3D localization in underwater optical wireless networks with uncertain anchor positions
US12126425B2 (en) Managing a network of radio frequency (RF) repeater devices
CN105553537A (zh) 基于累加正反馈变步长的最佳中继位置搜寻方法与系统
JP2016144194A (ja) 無線通信装置および無線通信システム、並びに無線通信方法
CN105356930B (zh) 基于定时机制的全局最优中继位置搜寻方法及系统
CN104410442B (zh) 无线信号发射方法、发射装置及无人机
WO2017096541A1 (zh) 基于固定步长的移动中继最佳中继位置搜寻方法及系统
CN105554840B (zh) 基于反向补偿机制的最佳中继位置的搜寻方法及系统
CN105554841B (zh) 一种基于步长阈值机制的最佳中继位置搜寻方法及系统
WO2017096540A1 (zh) 基于连续负反馈变步长的最佳中继位置搜寻方法及系统
JP6959533B2 (ja) 干渉源探索方法及び干渉源探索装置
WO2017096539A1 (zh) 一种多移动中继最佳通信位置的搜寻方法及搜寻系统
WO2017096543A1 (zh) 基于反向补偿机制的最佳中继位置的搜寻方法及系统
WO2017096542A1 (zh) 基于累加正反馈变步长的最佳中继位置搜寻方法与系统
CN113406611B (zh) 一种毫米波非视线场景定位的系统及方法
KR102308982B1 (ko) Uav 셀룰러 네트워크를 위한 스케일러블 시퀀스 생성, 검출 방법 및 그 장치
KR20250012628A (ko) 빔 제어 방법, 정보 획득 방법, 통신 노드 및 매체
WO2017096545A1 (zh) 一种基于定时机制的最佳中继位置搜寻方法及系统

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15910016

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 24/10/2018)

122 Ep: pct application non-entry in european phase

Ref document number: 15910016

Country of ref document: EP

Kind code of ref document: A1