Abstract

In this paper, we investigate the energy minimization problem with and without network coding (NC) while satisfying the transmission rate requirements in a bidirectional cellular relay network, where a group of mobile users communicate with a base station across a relay node. In particular, we consider the Rayleigh fading channel model and adopt a comprehensive power consumption model in the radio frequency transmission. We show that the problem of minimizing the energy consumption of the bidirectional cellular relay network in NC and non-NC (NNC) schemes can be formulated as a unified sum of fractional programming problem, which is of high complexity to solve in general. Fortunately, we derive the sufficient condition under which the problem is a convex optimization problem, and thus can be solved quite efficiently. In the case that the energy minimizing problem is not convex, we decompose it into two subproblems, and propose an iterative algorithm to solve it. Simulation results show that in NNC and NC schemes, under all configurations of power parameters, the performance of the iterative algorithm is close to the exhaustive search method; but its running time is much shorter than the exhaustive search method. Furthermore, compared with the maximum power transmission policy, the iterative algorithm achieves a maximum energy reduction of 75%–82%. Last but not least, we compare the energy performance of NNC and NC schemes and discuss the effect of the iteration number and the relay node placement.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.