For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to act completely against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. This paper investigates the effect of controlling the decoding delay to reduce the completion time below its currently best-known solution in both perfect and imperfect feedback with persistent erasure channels. To solve the problem, the decodingdelay- dependent expressions of the users’ and overall completion times are derived in the complete feedback scenario. Although using such expressions to find the optimal overall completion time is NP-hard, the paper proposes two novel heuristics that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Afterward, the paper extends the study to the imperfect feedback scenario in which uncertainties at the sender affects its ability to anticipate accurately the decoding delay increase at each user. The paper formulates the problem in such environment and derives the expression of the minimum increase in the completion time. Simulation results show the performance of the proposed solutions and suggest that both heuristics achieves a lower mean completion time as compared to the best-known heuristics for the completion time reduction in perfect and imperfect feedback. The gap in performance becomes more significant as the erasure of the channel increases.

This paper considers the downlink of a cognitive radio (CR) network formed by multiple primary and secondary transmitters, where each multi-antenna transmitter serves a pre-known set of single-antenna users. The paper assumes that the secondary and primary transmitters can transmit simultaneously their data over the same frequency bands, so as to achieve a high system spectrum efficiency. The paper considers the downlink balancing problem of maximizing the minimum signal-to-interference-plus noise ratio (SINR) of the secondary transmitters subject to both total power constraint of the secondary transmitters, and maximum interference constraint at each primary user due to secondary transmissions. The paper proposes solving the problem using the alternating direction method of multipliers (ADMM), which leads to a distributed implementation through limited information exchange across the coupled secondary transmitters. The paper additionally proposes a solution that guarantees feasibility at each iteration. Simulation results demonstrate that the proposed solution converges to the centralized solution in a reasonable number of iterations.

High-speed railway system equipped with moving relay stations placed on the middle of the ceiling of each train wagon is investigated. The users inside the train are served in two hops via the orthogonal frequency-division multiple access (OFDMA) technology. In this work, we first focus on minimizing the total downlink power consumption of the base station (BS) and the moving relays while respecting specific quality of service (QoS) constraints. We first derive the optimal resource allocation solution in terms of OFDMA subcarriers and power allocation using the dual decomposition method. Then, we propose an efficient algorithm based on the Hungarian method in order to find a suboptimal but low complexity solution. Moreover, we propose an OFDMA planning solution for high-speed train by finding the maximal inter-BS distance given the required user data rates in order to perform seamless handover. Our simulation results illustrate the performance of the proposed resource allocation schemes in the case of the 3GPP Long Term Evolution-Advanced (LTE-A) and compare them with previously developed algorithms as well as with the direct transmission scenario. Our results also highlight the significant planning gain obtained thanks to the use of multiple relays instead of the conventional single relay scenario.