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

Thaya Thanabalasingham

dblp:21/8860 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none

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

Computer networks · 1 · 1 first-authorTheory of computation · 1

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
1 paper
Physical-layer communications · 62% Network optimization and economics · 38%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › multiple access › multicarrier multiple access
OFDMA
0.112009
Dynamic allocation of subcarriers and transmit powers in an OFDMA cellular network · IEEE Trans. Inf. Theory 2009
Physical-layer communications › outage probability
outage probability minimization
0.112009
Dynamic allocation of subcarriers and transmit powers in an OFDMA cellular network · IEEE Trans. Inf. Theory 2009
Physical-layer communications
power allocation
0.112009
Dynamic allocation of subcarriers and transmit powers in an OFDMA cellular network · IEEE Trans. Inf. Theory 2009
Network optimization and economics
resource allocation
0.112009
Dynamic allocation of subcarriers and transmit powers in an OFDMA cellular network · IEEE Trans. Inf. Theory 2009
Network optimization and economics › resource allocation › OFDMA resource allocation
subcarrier allocation
0.112009
Dynamic allocation of subcarriers and transmit powers in an OFDMA cellular network · IEEE Trans. Inf. Theory 2009
Physical-layer communications › fading channels
frequency-selective fading
0.012009
Dynamic allocation of subcarriers and transmit powers in an OFDMA cellular network · IEEE Trans. Inf. Theory 2009

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

subchannel allocation · 0.1min-max optimization · 0.1
YearPublicationVenuePosition
2009 Dynamic allocation of subcarriers and transmit powers in an OFDMA cellular network
abstract
This paper considers the problem of minimizing outage probabilities in the downlink of a multiuser, multicell orthogonal frequency division multiple access (OFDMA) cellular network with frequency selective fading, imperfect channel state information, and frequency hopping. The task is to determine the allocation of powers and subcarriers for users to ensure that the user outage probabilities are as low as possible. We formulate a min-max outage probability problem and solve it under the constraint that the transmit power spectrum at each base station is flat. In particular, we obtain a subchannel allocation algorithm that has complexityO(LlogL) inL, the number of users in the cell. We also consider suboptimal but implementable approaches with and without the flat transmit power spectrum constraint. We conclude that the flat transmit spectrum approach has merit, and warrants further study.
Stephen Vaughan Hanly, Lachlan L. H. Andrew, Thaya Thanabalasingham
IEEE Trans. Inf. Theory3
2006 Joint Allocation of Subcarriers and Transmit Powers in a Multiuser OFDM Cellular Network
abstract
In the present paper, we consider the problem of joint bandwidth (subcarriers) and power allocation for the downlink of a multi-user multi-cell OFDM cellular network. This resource allocation problem is formulated as a power minimization problem, subject to meeting the target rates of all users in the network. We develop a distributed solution to find the globally optimal allocation which determines the subcarrier and power allocation dynamically. In addition, we investigate the impact of reducing the complexity by reducing the number of degrees of freedom available in the optimization. In particular, we consider a static bandwidth allocation scheme, and a static power allocation scheme. The numerical results show that the penalty on network performance due to the reduction in the available degrees of freedom is not significant.
Thaya Thanabalasingham, Stephen Vaughan Hanly, Lachlan L. H. Andrew, John Papandriopoulos
ICC1