 Electrical and Electronic Engineering  Research Publications
Electrical and Electronic Engineering  Research Publications
Permanent URI for this collection
5 results
Filters
Reset filtersSettings
Statistics
Citations
Search Results
Now showing
1  5 of 5

ItemMaximizing SumRate via Relay Selection and Power Control in DualHop NetworksDayarathna, S ; Senanayake, R ; Evans, J (IEEE, 2022)In this paper, we focus on the sumrate optimization problem in a general dualhop relay network by considering the joint relay selection and power control in the presence of interference. First, we propose a new relay selection algorithm which has better sumrate performance than the existing relay selection techniques. Then we combine relay selection and power control to propose a novel iterative algorithm based on the tight lower bound approximation which maximizes the achievable sumrate. We also prove that for the special case of twouser networks, binary power allocation is optimum for at least two transmitting nodes. Extensive numerical examples are used to compare the performance of the proposed algorithm and to illustrate the accuracy of the analysis.

ItemOptimal Routing for MultiUser MultiHop Relay Networks Via Dynamic ProgrammingDayarathna, S ; Senanayake, R ; Evans, J (IEEEINST ELECTRICAL ELECTRONICS ENGINEERS INC, 20220523)In this letter, we study the relay selection problem in multiuser, multihop relay networks with the objective of minimizing the network outage probability. When only one user is present, it is well known that the optimal relay selection problem can be solved efficiently via dynamic programming. This solution breaks down in the multiuser scenario due to dependence between users. We resolve this challenge using a novel relay aggregation approach. On the expanded trellis, dynamic programming can be used to solve the optimal relay selection problem with computational complexity linear in the number of hops. Numerical examples illustrate the efficient use of this algorithm for relay networks.

ItemSumRate Optimization in Flexible HalfDuplex Networks With Transmitter/Receiver SchedulingDayarathna, S ; Senanayake, R ; Evans, J (IEEEINST ELECTRICAL ELECTRONICS ENGINEERS INC, 202207)In this paper, we focus on the problem of transmitter and receiver scheduling to maximize the achievable sumrate of a flexible halfduplex network where nodes have the flexibility to either transmit, receive or be silent in a given time slot. We consider a network with multiple transmitters and receivers where each transmitter has specific information it needs to send to a set of receiving nodes. First, we conduct some structural analysis and show that the achievable sumrate is maximized when each transmitter only transmits to a single receiver at a given time. Next, we consider one instance of the flexible network and by reducing the symmetric multiple receiver network to a single receiver network, we also show that the achievable sumrate is maximized when either one transmitter or all the transmitters transmit. In fact, there exists a unique received signaltonoise ratio at which the optimality changes from alltoone. Finally, we design a novel lowcost algorithm that gives a suboptimal solution to the achievable sumrate maximization problem in a flexible halfduplex network. We also provide a comprehensive comparison of the proposed algorithm with respect to existing resource allocation techniques, and observe that our proposed algorithm provides significant sumrate gains.

ItemCentralized Scheduling with SumRate optimization in Flexible HalfDuplex NetworksDayarathna, S ; Razlighi, M ; Senanayake, R ; Zlatanov, N ; Evans, J (IEEE, 202005)In this paper, we focus on maximization of the instantaneous sumrate in flexible halfduplex networks, where nodes have the flexibility to choose to either transmit, receive or be silent in a given time slot. Since the corresponding optimization problem is NPhard, we design lowcost algorithms that give suboptimal solutions with good performance. We first consider two existing approximation techniques to simplify the sumrate optimization problem: arithmeticgeometric means inequality and another utilising the tight lower bound approximation. We then propose a novel pattern search algorithm that performs close to exhaustive search but with significantly lower complexity. Comparing the performance of the proposed algorithm with respect to existing resource allocation techniques, we observe that our proposed algorithm provides significant sumrate gains.

ItemBinary Power Optimality for Two Link FullDuplex NetworkDayarathna, S ; Senanayake, R ; Evans, J (IEEE, 202005)In this paper, we analyse the optimality of binary power allocation in a network that includes fullduplex communication links. Considering a network with four communicating nodes, two of them operating in halfduplex mode and the other two in fullduplex mode, we prove that binary power allocation is optimum for the fullduplex nodes when maximizing the sum rate. We also prove that, for halfduplex nodes binary power allocation is not optimum in general. However, for the two special cases, 1) the low signaltonoiseplusinterference (SINR) regime and, 2) the approximation by the arithmetic meangeometric mean inequality, binary power allocation is optimum for the approximated sum rate even for the halfduplex nodes. We further analyse a third special case using a symmetric network for which the optimum power allocation is binary, under a sufficient condition. Numerical examples are included to illustrate the accuracy of the results.