Indika Anuradha Mendis Balapuwaduge

Dr. Indika Anuradha Mendis Balapuwaduge

Research Fellow, Department of Information and Communication Technology, University of Agder, Kristiansand, Norway
orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 December 2013 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
IBIndika Anuradha Mendis Balapuwaduge
Indika Anuradha Mendis Balapuwaduge
Lei JiaoLei Jiao
Lei Jiao
Vicent PlaVicent Pla
Vicent Pla
FLFrank Y. Li
Frank Y. Li
With the implementation of channel assembling (CA) techniques, higher data rate can be achieved for secondary users in multi-channel cognitive radio networks. Recent studies which are based on loss systems show that maximal capacity can be achieved using dynamic CA strategies. However the channel allocation schemes suffer from high blocking and forced termination when primary users become active. In this paper, we propose to introduce queues for secondary users so that those flows that would otherwise be blocked or forcibly terminated could be buffered and possibly served later. More specifically, in a multi-channel network with heterogeneous traffic, two queues are separately allocated to real-time and elastic users and channel access opportunities are distributed between these two queues in a way that real-time services receive higher priority. Two queuing schemes are introduced based on the delay tolerance of interrupted elastic services. Furthermore, continuous time Markov chain models are developed to evaluate the performance of the proposed CA strategy with queues, and the correctness as well as the preciseness of the derived theoretical models are verified through extensive simulations. Numerical results demonstrate that the integration of queues can further increase the capacity of the secondary network and spectrum utilization while decreasing blocking probability and forced termination probability.

29 February 2024 in IEEE Access
Verified
Journal Article
Open access
HAHusam Mahdi Al-Alwash
Husam Mahdi Al-Alwash
EBEugen Borcoci
Eugen Borcoci
Marius-Constantin VochinMarius-Constantin Vochin
Marius-Constantin Vochin
IBIndika Anuradha Mendis Balapuwaduge
Indika Anuradha Mendis Balapuwaduge
FLFrank Y. Li
Frank Y. Li
Electric vehicles represent a global endeavor towards environmentally friendly transportation, and such a green transition is promoted worldwide, being deployed in many regions nowadays. As the number of electric vehicles has been increasing rapidly for more than a decade, how to meet the need for charging their batteries appears as an important research topic, having received remarkable attention in both industry and research community. Uncoordinated charging of many electric vehicles may lead to congestion at charging stations and unbalanced load of the power supply grid. To address this problem, optimized charging schemes which consider available energy resources and user requirements are required. This paper offers an overview of state-of-the-art charging solutions covering two main categories of approaches, namely, centralized and decentralized charging. In addition to addressing the potential challenges that arise in charging schedule optimization, we cover various optimization techniques that have been proposed for optimizing charging schedules. Furthermore, this paper analyzes the current solutions and identifies their limitations and gaps. Open research issues are identified and several potential research topics are suggested.

25 January 2021 in IEEE Transactions on Communications
Verified
Journal Article
Open access
TWThilina N. Weerasinghe
Thilina N. Weerasinghe
VCVicente Casares-Giner
Vicente Casares-Giner
IBIndika Anuradha Mendis Balapuwaduge
Indika Anuradha Mendis Balapuwaduge
FLFrank Y. Li
Frank Y. Li
Although grant-based mechanisms have been a predominant approach for wireless access for years, the additional latency required for initial handshake message exchange and the extra control overhead for packet transmissions have stimulated the emergence of grant-free (GF) transmission. GF access provides a promising mechanism for carrying low and moderate traffic with small data and fits especially well for massive machine type communications (mMTC) applications. Despite a surge of interest in GF access, how to handle heterogeneous mMTC traffic based on GF mechanisms has not been investigated in depth. In this paper, we propose a priority enabled GF access scheme which performs dynamic slot allocation in each 5G new radio subframe to devices with different priority levels on a subframe-by-subframe basis. While high priority traffic has access privilege for slot occupancy, the remaining slots in the same subframe will be allocated to low priority traffic. To evaluate the performance of the proposed scheme, we develop a two-dimensional Markov chain model which integrates these two types of traffic via a pseudo-aggregated process. Furthermore, the model is validated through simulations and the performance of the scheme is evaluated both analytically and by simulations and compared with two other GF access schemes.

14 November 2017 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
IBIndika Anuradha Mendis Balapuwaduge
Indika Anuradha Mendis Balapuwaduge
FLFrank Yong Li
Frank Yong Li
Vicent PlaVicent Pla
Vicent Pla
Providing channel access opportunities for new service requests and guaranteeing continuous connections for ongoing flows until service completion are two challenges for service provisioning in wireless networks. Channel failures, which are typically caused by hardware and software failures or/and by intrinsic instability in radio transmissions, can easily result in network performance degradation. In cognitive radio networks (CRNs), secondary transmissions are inherently vulnerable to connection breaks due to licensed users’ arrivals as well as channel failures. To explore the advantages of channel reservation on performance improvement in error-prone channels, we propose and analyze a dynamic channel reservation (DCR) algorithm and a dynamic spectrum access (DSA) scheme with three access privilege variations. The key idea of the DCR algorithm is to reserve a dynamically adjustable number of channels for the interrupted services to maintain service retainability for ongoing users or to enhance channel availability for new users. Furthermore, the DCR algorithm is embedded in the DSA scheme enabling spectrum access of primary and secondary users with different access privileges based on access flexibility for licensed shared access. The performance of such a CRN in the presence of homogeneous and heterogeneous channel failures is investigated considering different channel failure and repair rates.

1 September 2020 in Computer Networks
Verified
Journal Article
Open access
TWThilina N. Weerasinghe
Thilina N. Weerasinghe
IBIndika Anuradha Mendis Balapuwaduge
Indika Anuradha Mendis Balapuwaduge
FLFrank Y. Li
Frank Y. Li

26 January 2016 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
IBIndika Anuradha Mendis Balapuwaduge
Indika Anuradha Mendis Balapuwaduge
FLFrank Y. Li
Frank Y. Li
ARAmogh Rajanna
Amogh Rajanna
MKMostafa Kaveh
Mostafa Kaveh
Spectrum leasing has been proposed as an effective approach for enabling more flexible spectrum utilization in CRNs. In CRNs, a primary network (PN) which consists of multiple primary users (PUs) can lease part of the licensed spectrum to secondary users (SUs) in exchange for operational benefits. The focus of this study is to investigate how and to what extent the PN allows spectrum leasing in CRNs, considering the QoS requirements of the PN and the secondary network (SN). Correspondingly, we propose two dynamic spectrum leasing strategies, which can improve the QoS performance of SUs while ensuring sufficient remuneration for PUs. In order to dynamically adjust the portion of leased bandwidth, two forms of leasing algorithms, which are based on channel occupancy of the PN and the SN respectively are proposed. Analytical models are developed to characterize system centric performance metrics including capacity, blocking probability, and forced termination probability in both networks. Furthermore, a dynamic pricing scheme for spectrum leasing and utility-based resource allocation is introduced. Finally the performance of dynamic leasing is compared quantitatively with that of static leasing and approaches without leasing. Numerical results obtained from both analysis and simulations show that dynamically adjusted spectrum leasing improves network performance.