Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Prabodini Semasinghe

dblp:146/6995 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 5 · 4 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
3 papers
Cellular and mobile networks · 58% Network optimization and economics · 30% Physical-layer communications · 12%
Theoretical computer science
2 papers
Algorithmic game theory and mechanism design · 100%

Topics — the 11 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
small cell networks
0.632018
Cheat-Proof Distributed Power Control in Full-Duplex Small Cell Networks: A Repeated Game With Imperfect Public Monitoring · IEEE Trans. Commun. 2018
Downlink Power Control in Self-Organizing Dense Small Cells Underlaying Macrocells: A Mean Field Game · IEEE Trans. Mob. Comput. 2016
An Evolutionary Game for Distributed Resource Allocation in Self-Organizing Small Cells · IEEE Trans. Mob. Comput. 2015
Network optimization and economics
resource allocation
0.522018
Cheat-Proof Distributed Power Control in Full-Duplex Small Cell Networks: A Repeated Game With Imperfect Public Monitoring · IEEE Trans. Commun. 2018
An Evolutionary Game for Distributed Resource Allocation in Self-Organizing Small Cells · IEEE Trans. Mob. Comput. 2015
Cellular and mobile networks › power control
distributed power control
0.312018
Cheat-Proof Distributed Power Control in Full-Duplex Small Cell Networks: A Repeated Game With Imperfect Public Monitoring · IEEE Trans. Commun. 2018
Physical-layer communications
full-duplex
0.312018
Cheat-Proof Distributed Power Control in Full-Duplex Small Cell Networks: A Repeated Game With Imperfect Public Monitoring · IEEE Trans. Commun. 2018
Cellular and mobile networks
power control
0.312018
Cheat-Proof Distributed Power Control in Full-Duplex Small Cell Networks: A Repeated Game With Imperfect Public Monitoring · IEEE Trans. Commun. 2018
Cellular and mobile networks › power control
downlink power control
0.212016
Downlink Power Control in Self-Organizing Dense Small Cells Underlaying Macrocells: A Mean Field Game · IEEE Trans. Mob. Comput. 2016
Network optimization and economics › resource allocation
distributed resource allocation
0.212015
An Evolutionary Game for Distributed Resource Allocation in Self-Organizing Small Cells · IEEE Trans. Mob. Comput. 2015
Algorithmic game theory and mechanism design
repeated games
0.112018
Cheat-Proof Distributed Power Control in Full-Duplex Small Cell Networks: A Repeated Game With Imperfect Public Monitoring · IEEE Trans. Commun. 2018
Network optimization and economics › game theory › dynamic game
mean field game
0.112016
Downlink Power Control in Self-Organizing Dense Small Cells Underlaying Macrocells: A Mean Field Game · IEEE Trans. Mob. Comput. 2016
Cellular and mobile networks
self-organizing networks
0.112016
Downlink Power Control in Self-Organizing Dense Small Cells Underlaying Macrocells: A Mean Field Game · IEEE Trans. Mob. Comput. 2016
Algorithmic game theory and mechanism design
evolutionary game theory
0.112015
An Evolutionary Game for Distributed Resource Allocation in Self-Organizing Small Cells · IEEE Trans. Mob. Comput. 2015

Methods — techniques the papers use, named apart from their topics

stochastic geometry · 0.7perturbed markov chains · 0.7page-hinckley test · 0.7nash equilibrium analysis · 0.7replicator dynamics · 0.4evolutionary game theory · 0.4mean field game · 0.2lax-friedrichs scheme · 0.2lagrange relaxation · 0.2finite difference algorithm · 0.2
YearPublicationVenuePosition
2018 Cheat-Proof Distributed Power Control in Full-Duplex Small Cell Networks: A Repeated Game With Imperfect Public Monitoring
abstract
We address the problem of distributed power control in a two-tier cellular network, where full-duplex small cells underlay a macro cell in a co-channel deployment scenario. We first formulate the distributed power control problem as a non-cooperative game and then extend it to a repeated game with imperfect public monitoring. The repeated game formulation prevents deceitful small cells from deviating from the social optimal solution for their own benefit. We establish the existence and uniqueness of the Nash equilibrium in the formulated non-cooperative game. We also characterize the set of public perfect equilibrium for the repeated game. A two-phase distributed algorithm is proposed to achieve and enforce a Pareto optimal transmit power profile. The solution obtained by this algorithm is also social optimal. Phase 1 of the algorithm is a fully distributed learning phase based on perturbed Markov chains, where each base station individually learns a Pareto optimal operating point. Phase 2 is composed of two rules: 1) a detection rule based on Page-Hinckley test to detect cheating and 2) a punishment rule to motivate cheating base stations to cooperate. Through theoretical analysis, we prove that the proposed distributed power control mechanism achieves a public perfect equilibrium point of the formulated repeated game. The power control algorithm is also cheat-proof and needs only a small amount of information exchange among network nodes. The effectiveness of the algorithm is shown through numerical analysis. Our proposed model, algorithm, and analysis are also valid for a half-duplex system as a special case.
Prabodini Semasinghe, Ekram Hossain 0001, Setareh Maghsudi
IEEE Trans. Commun.1
2017 Distributed Interference and Energy-Aware Power Control for Ultra-Dense D2D Networks: A Mean Field Game
abstract
Device-to-device (D2D) communications can enhance spectrum and energy efficiency due to direct proximity communication and frequency reuse. However, such performance enhancement is limited by mutual interference and energy availability, especially when the deployment of D2D links is ultra-dense. In this paper, we present a distributed power control method for ultra-dense D2D communications underlying cellular communications. In this power control method, in addition to the remaining battery energy of the D2D transmitter, we consider the effects of both the interference caused by the generic D2D transmitter to others and the interference from all others caused to the generic D2D receiver. We formulate a mean-field game (MFG) theoretic framework with the interference mean-field approximation. We design the cost function combining both the performance of the D2D communication and cost for transmit power at the D2D transmitter. Within the MFG framework, we derive the related Hamilton-Jacobi-Bellman and Fokker-Planck-Kolmogorov equations. Then, a novel energy and interference aware power control policy is proposed, which is based on the Lax-Friedrichs scheme and the Lagrange relaxation. The numerical results are presented to demonstrate the spectrum and energy efficiency performances of our proposed approach.
Chungang Yang, Jiandong Li 0001, Prabodini Semasinghe, Ekram Hossain 0001, Samir Perlaza, Zhu Han 0001
IEEE Trans. Wirel. Commun.3
2016 A cheat-proof power control policy for self-organizing full-duplex small cells
abstract
Distributed resource allocation is considered as a significant feature of future self-organizing wireless networks. On the other hand, full-duplex transmission is an emerging technology which can theoretically double the data rate. and hence enhance the performance of wireless networks significantly. In this work, we address the problem of distributed power control in a two-tier network with full-duplex small cells underlaying one macro cell in a co-channel deployment scenario. We first formulate the corresponding distributed power control problem as a non-cooperative game and then extend it to a repeated game with imperfect public monitoring. The repeated game setting is used as it can withstand cheating. We show the existence and uniqueness of the Nash equilibrium of the formulated non-cooperative game and characterize the set of perfect public equilibrium for the repeated game. A two phase distributed algorithm is then proposed to achieve a power profile which is also a perfect public equilibrium. The power control algorithm is cheat-proof and needs only a small amount of information exchange among network nodes. The effectiveness of the algorithm is shown using numerical results. Our proposed algorithm and analysis are also valid for a half-duplex system as it is a special case of the full-duplex model presented in the paper.
Prabodini Semasinghe, Ekram Hossain 0001
ICC1
2016 Downlink Power Control in Self-Organizing Dense Small Cells Underlaying Macrocells: A Mean Field Game
abstract
A novel distributed power control paradigm is proposed for dense small cell networks co-existing with a traditional macrocellular network. The power control problem is first modeled as a stochastic game and the existence of the Nash Equilibrium is proven. Then, we extend the formulated stochastic game to a mean field game (MFG) considering a highly dense network. An MFG is a special type of differential game which is ideal for modeling the interactions among a large number of entities. We analyze the performance of two different cost functions for the mean field game formulation. Both of these cost functions are designed using stochastic geometry analysis in such a way that the cost functions are valid for the MFG setting. A finite difference algorithm is then developed based on the Lax-Friedrichs scheme and Lagrange relaxation to solve the corresponding MFG. Each small cell base station can independently execute the proposed algorithm offline, i.e., prior to data transmission. The output of the algorithm shows how each small cell base station should adjust its transmit power in order to minimize the cost over a predefined period of time. Moreover, sufficient conditions for the uniqueness of the mean field equilibrium for a generic cost function are also given. The effectiveness of the proposed algorithm is demonstrated via numerical results.
Prabodini Semasinghe, Ekram Hossain 0001
IEEE Trans. Mob. Comput.1
2015 An Evolutionary Game for Distributed Resource Allocation in Self-Organizing Small Cells
abstract
We propose an evolutionary game theory (EGT)-based distributed resource allocation scheme for small cells underlaying a macro cellular network. EGT is a suitable tool to address the problem of resource allocation in self-organizing small cells since it allows the players with bounded-rationality to learn from the environment and take individual decisions for attaining the equilibrium with minimum information exchange. EGT-based resource allocation can also provide fairness among users. We show how EGT can be used for distributed subcarrier and power allocation in orthogonal frequency-division multiple access (OFDMA)-based small cell networks while limiting interference to the macrocell users below given thresholds. Two game models are considered, where the utility of each small cell depends on average achievable signal-to-interference-plus-noise ratio (SINR) and data rate, respectively. Forthe proposed distributed resource allocation method, the average SINR and data rate are obtained based on a stochastic geometry analysis. Replicator dynamics is used to model the strategy adaptation process of the small cell base stations and an evolutionary equilibrium is obtained as the solution. Based on the results obtained using stochastic geometry, the stability of the equilibrium is analyzed. We also extend the formulation by considering information exchange delay and investigate its impact on the convergence of the algorithm. Numerical results are presented to validate ourtheoretical findings and to show the effectiveness of the proposed scheme in comparison to a centralized resource allocation scheme.
Prabodini Semasinghe, Ekram Hossain 0001, Kun Zhu 0001
IEEE Trans. Mob. Comput.1