Please use this identifier to cite or link to this item:
|Title:||End-to-end outage probability minimization in OFDM based linear multi-hop networks||Authors:||Zhang, X.
|Issue Date:||2008||Citation:||Zhang, X., Tao, M., Jiao, W., Ng, C.S. (2008). End-to-end outage probability minimization in OFDM based linear multi-hop networks. IEEE International Conference on Communications : 4559-4563. ScholarBank@NUS Repository. https://doi.org/10.1109/ICC.2008.855||Abstract:||This paper is concerned with the end-to-end transmission outage in an OFDM based wireless multi-hop network. The network consists of a source node, a destination node, and a set of serial relay nodes. Transmission outage occurs when the end-to-end transmission rate is less than a target rate. Our goal is to find an optimal power and time control policy to minimize the outage probability at a target end-to-end data rate under a long-term total power constraint. The problem is solved in two steps. First, for any given channel realization, we derive the minimum total power required to meet the target rate by varying the transmission power and time allocated to each hop. This is formulated as a convex optimization problem and is solved efficiently. We then compare the required minimum total power for each channel realization with a power threshold. If the threshold is exceeded, the transmission is turned off. The optimal threshold is chosen to meet the long-term total power constraint. Two suboptimal power and time control policies are also presented and compared with the optimal policy by simulation. ©2008 IEEE.||Source Title:||IEEE International Conference on Communications||URI:||http://scholarbank.nus.edu.sg/handle/10635/70161||ISBN:||9781424420742||ISSN:||05361486||DOI:||10.1109/ICC.2008.855|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 28, 2022
WEB OF SCIENCETM
checked on May 20, 2022
checked on May 26, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.