Electrical and Electronic Engineering - Research Publications

Permanent URI for this collection

Search Results

Now showing 1 - 10 of 26
  • Item
    No Preview Available
    Differential MPSK with n-Bit Phase Quantization
    Gayan, S ; Inaltekin, H ; Senanayake, R ; Evans, J (IEEE, 2023-01-01)
  • Item
    No Preview Available
    Joint Relay Selection and Power Control to Maximize Sum-Rate in Multi-Hop Networks
    Dayarathna, S ; Senanayake, R ; Evans, J (IEEE, 2023-01-01)
  • Item
    No Preview Available
  • Item
    No Preview Available
    CFMA for Gaussian MIMO Multiple Access Channels
    Zhang, L ; Evans, J ; Zhu, J (IEEE, 2023-01-01)
  • Item
    No Preview Available
    Hardware-Limited Non-Uniform Task-Based Quantizers
    Bernardo, NI ; Zhu, J ; Eldar, YC ; Evans, J (IEEE, 2023-01-01)
  • Item
    No Preview Available
    Flex-Net: A Graph Neural Network Approach to Resource Management in Flexible Duplex Networks
    Perera, T ; Atapattu, S ; Fang, Y ; Dharmawansa, P ; Evans, J (IEEE, 2023)
  • Item
    Thumbnail Image
    Maximizing Sum-Rate via Relay Selection and Power Control in Dual-Hop Networks
    Dayarathna, S ; Senanayake, R ; Evans, J (IEEE, 2022)
    In this paper, we focus on the sum-rate optimization problem in a general dual-hop 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 sum-rate 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 sum-rate. We also prove that for the special case of two-user 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.
  • Item
    Thumbnail Image
    Chemical Reactions-based Detection Mechanism for Molecular Communications
    Cao, TN ; Jamali, V ; Wicke, W ; Yeoh, PL ; Zlatanov, N ; Evans, J ; Schober, R (IEEE, 2020-05)
    In molecular communications, the direct detection of signaling molecules may be challenging due to the lack of suitable sensors and interference from co-existing substances in the environment. Motivated by examples in nature, we investigate an indirect detection mechanism using chemical reactions between the signaling molecules and a molecular probe to produce an easy-to-measure product at the receiver. The underlying reaction-diffusion equations that describe the concentrations of the reactant and product molecules in the system are non-linear and coupled, and cannot be solved in closed-form. To analyze these molecule concentrations, we develop an efficient iterative algorithm by discretizing the time variable and solving for the space variables in each time step. We also derive insightful closed-form solutions for a special case. The accuracy of the proposed algorithm is verified by particle-based simulations. Our results show that the concentration of the product molecules has a similar characteristic over time as the concentration of the signaling molecules. We analyze the bit error rate (BER) for a threshold detector and highlight that significant improvements in the BER can be achieved by carefully choosing the molecular probe and optimizing the detection threshold.
  • Item
    Thumbnail Image
    Centralized Scheduling with Sum-Rate optimization in Flexible Half-Duplex Networks
    Dayarathna, S ; Razlighi, M ; Senanayake, R ; Zlatanov, N ; Evans, J (IEEE, 2020-05)
    In this paper, we focus on maximization of the instantaneous sum-rate in flexible half-duplex 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 NP-hard, we design low-cost algorithms that give sub-optimal solutions with good performance. We first consider two existing approximation techniques to simplify the sum-rate optimization problem: arithmetic-geometric 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 sum-rate gains.
  • Item
    Thumbnail Image
    Binary Power Optimality for Two Link Full-Duplex Network
    Dayarathna, S ; Senanayake, R ; Evans, J (IEEE, 2020-05)
    In this paper, we analyse the optimality of binary power allocation in a network that includes full-duplex communication links. Considering a network with four communicating nodes, two of them operating in half-duplex mode and the other two in full-duplex mode, we prove that binary power allocation is optimum for the full-duplex nodes when maximizing the sum rate. We also prove that, for half-duplex nodes binary power allocation is not optimum in general. However, for the two special cases, 1) the low signal-to-noise-plus-interference (SINR) regime and, 2) the approximation by the arithmetic mean-geometric mean inequality, binary power allocation is optimum for the approximated sum rate even for the half-duplex 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.