Recently, D.T. Chiang and R.F. Chiang (1986) considered a relayed mobile communication system with evenly spaced mobile relay stations (spacecraft) moving at the same speed from an origin towards a destination. Such a system can be considered as a consecutive-k-out-of-n line. They gave equations for computing the mean number of stations needed for a successful relay and studied the optimal choice of k to minimize the mean number. In the present work, the authors show that it is always better to replace a consecutive-k-out-of-n line by a consecutive-1-out-of-n line, but with k redundancy. The problem of choosing an optimal k still has no closed-form solution, but it is much more tractable than the original problem studied by Chiang and Chiang. Exact solutions are provided for a wide range of parameters.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Optimal relayed mobile communication systems


    Weitere Titelangaben:

    Optimale Relais-Stationen mobiler Kommunikationssysteme


    Beteiligte:
    Hwang, F.K. (Autor:in) / Shi, D. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1989


    Format / Umfang :

    3 Seiten, 4 Quellen



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    Relayed communication via consecutive-k-out-of-n:F system

    Chiang, D.T. / Chiang, R. | Tema Archiv | 1986


    Exact MGF-Based Performance Analysis of Dual-Hop AF-Relayed Optical Wireless Communication Systems

    Aggarwal, M. / Garg, P. / Puri, P. | British Library Online Contents | 2015



    Exact MGF-Based Performance Analysis of Dual-Hop AF-Relayed Optical Wireless Communication Systems

    Aggarwal, Mona / Garg, Parul / Puri, Parul | British Library Online Contents | 2015


    Method and apparatus for relayed on-demand localized video sharing

    MCQUILLEN MICHAEL / MAKLED DANIEL A / SURNILLA GOPICHANDRA | Europäisches Patentamt | 2023

    Freier Zugriff