Foto dell'editore

Resource Allocation in Adaptive Parallel Relay Networks

Aimal Khan

ISBN 10: 3844024034 / ISBN 13: 9783844024036
Editore: Shaker Verlag Dez 2013, 2013
Nuovi Condizione: Neu Buch
Da Rhein-Team Lörrach Ivano Narducci e.K. (Lörrach, Germania)

Libreria AbeBooks dal 11 gennaio 2012

Valutazione Libreria 5 stelle

Quantità: 1

Compra nuovo
Prezzo consigliato:
Prezzo: EUR 49,80 Convertire valuta
Spedizione: EUR 12,00 Da: Germania a: U.S.A. Destinazione, tempi e costi
Aggiungere al carrello

Riguardo questo articolo

Neuware - In order to successfully transmit a message from a source to a receiver without the cooperation of other nodes over a long distance results in a high energy consumption. Cooperative relaying protocols have the potential to save energy and enhance the throughput by utilizing the broadcast nature of the wireless medium. Therefore, it is believed that cooperative relaying strategies will play a crucial role in future wireless communication systems. In an orthogonal multiple access scheme, the relays use exclusive time-slots or frequency-bands. Thus, efficient resource allocation is critical for the enhancement of throughput in a relay network with orthogonal multiple access scheme. The present thesis addresses the issue of resource allocation in a parallel relay network. These resources include time-slots or frequency-bands, power (energy), and the code rate. Moreover, the main consideration of this thesis is a network with adaptive relays, i.e., the relays change their processing behavior w.r.t. the reliability of the received signal from the source. Allocation of channel resources such as number of time-slots or frequency-bands is dealt by proposing different optimal and sub-optimal solutions in Chapter 3. A novel allocation scheme termed as marginal returns based resource allocation is introduced to allocate the number of time-slots or frequency-bands. The computational complexity of these algorithms is determined using simulations. The results show that the suboptimal solution has very small computational complexity as compared to the optimal solution, nevertheless the performance of the proposed sub-optimal solution is similar to the optimal solution. Furthermore, results show that though efficient resource allocation requires channel state information it can significantly improve the performance of the considered cooperative relay network as compared to the fixed time-slots allocation. It is also observed that the allocation of the optimal number of time-slots to the source is necessary for better performance. For power allocation, the convex optimization technique the method of Lagrangian multipliers is used in Chapter 4. In the context of power allocation, the impact of power minimization on the throughput and vice versa are also discussed. These results also show that the proposed technique significantly save more energy as compared to a strategy with uniform power allocation and non-cooperative case. Furthermore, it is shown that the throughput maximization has deep impact on the sum power minimization and vice versa. The concept of resource allocation with marginal returns is extended and applied to the rate allocation for relaying protocols with repetition coding and coded cooperation in Chapter 5. It is evident from the simulation results that though coded cooperation requires the activated relays to decode successfully, still its performance is much better than that of the relaying protocols based on repetition coding and non-cooperative case. Moreover, it is found in Chapter 3 that for channel resources allocation it is important to optimize the number of time-slots (frequency-bands) allocated to the source. However, for rate optimization, it is optimal to allocate only a single time-slot or frequency-band to the source. Furthermore, it is found that most of the times only relays with decode-and-forward are activated and relays with amplify-and-forward are used rarely in conjunction with rate optimization. The devised resource allocation solutions assume perfect channel state information and Shannon's capacity achieving codes. Both of these suppositions are not possible in practice. Therefore, strategies for power allocation with imperfect channel knowledge and practical codes are also proposed in Chapter 6. 230 pp. Englisch. Codice inventario libreria 9783844024036

Fare una domanda alla libreria

Dati bibliografici

Titolo: Resource Allocation in Adaptive Parallel ...

Casa editrice: Shaker Verlag Dez 2013

Data di pubblicazione: 2013

Legatura: Buch

Condizione libro:Neu

Descrizione libreria

Visita la pagina della libreria

Condizioni di vendita:

Allgemeine Geschäftsbedingungen (abebooks.de)

Rhein-Team Lörrach, Inhaber Ivano Narducci e.K., Mühlestr. 1
D-79539 Lörrach, nachfolgend als Verkäufer bezeichnet.

§ 1 Allgemeines, Begriffsbestimmungen

(1) Der Verkäufer bietet unter dem Nutzernamen rhein-team unter der Plattform abebooks.de insbesondere Bücher an. Die folgenden Allgemeinen Geschäftsbedingungen (AGB) gelten für die Geschäftsbeziehung zwischen dem Verkäufer und dem Kunden in ihrer zum Zeitpunkt der Bestellung gültigen Fassung. Ferne...

Ulteriori informazioni
Condizioni di spedizione:

Die Ware wird innerhalb von 1-3 Tagen nach Bestelleingang verschickt. Bitte entnehmen Sie den voraussichtlichen Liefertermin Ihrer Bestellbestätigung. Die Versandkostenpauschalen basieren auf Durchschnittswerten für 1 kg schwere Bücher. Über abweichende Kosten (z.B. wegen eines sehr schweren Buches) werden Sie gegebenenfalls vom Verkäufer informiert.


Informazioni dettagliate sul venditore

Tutti i libri della libreria

Metodi di pagamento
accettati dalla libreria

Visa Mastercard American Express Carte Bleue

Assegno PayPal