z-logo
open-access-imgOpen Access
Position optimisation for multiple mobile relays by utilising one‐bit feedback information
Author(s) -
Xie Ning,
Liang Yuan,
Chen JingKun
Publication year - 2018
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2018.5368
Subject(s) - computer science , position (finance) , scheme (mathematics) , node (physics) , antenna (radio) , relay , energy (signal processing) , algorithm , real time computing , computer engineering , telecommunications , mathematics , power (physics) , mathematical analysis , statistics , physics , structural engineering , finance , quantum mechanics , engineering , economics
This paper investigates the problem of position optimization for multiple mobile relays. The authors propose a new scheme involving multiple mobile relays with fixed orbits to avoid collision risk among the multiple mobile relays and to relax the requirements of the existing approaches, e.g., multiple on‐board antennas and complex feedback signals. The proposed scheme exhibits satisfactory performance with low cost and low complexity, as it requires only a single on‐board antenna and merely a one‐bit feedback signal, which is highly suitable for a scenario in which the source node has limited energy at its disposal, such as in a disaster area. The authors further design three implementation algorithms based on the easy implementation of the proposed scheme. The first algorithm is the simplest one in so far as it utilizes only single positive feedback information, but it exhibits poor performance. The second algorithm achieves better performance by exploiting successive points of negative feedback information. Based on the second algorithm, the third algorithm exhibits the best performance by further exploiting cumulative points of positive feedback information.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here