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

Spyros Papafragkos

dblp:149/4614 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2016
0000-0002-1393-4414ORCID · corroborated

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

Computer networks · 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
Cellular and mobile networks · 50% Physical-layer communications · 25% Network performance modeling · 25%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › multiple access
CDMA systems
0.212016
Resource pooling in CDMA cell-based systems through uplink power control · INFOCOM 2016
Network performance modeling › delay analysis
queueing delay
0.212016
Resource pooling in CDMA cell-based systems through uplink power control · INFOCOM 2016
Cellular and mobile networks
radio resource management
0.212016
Resource pooling in CDMA cell-based systems through uplink power control · INFOCOM 2016
Cellular and mobile networks › power control
uplink power control
0.212016
Resource pooling in CDMA cell-based systems through uplink power control · INFOCOM 2016

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

simulation · 0.2
YearPublicationVenuePosition
2016 Resource pooling in CDMA cell-based systems through uplink power control
abstract
For CDMA cell-based systems we propose an uplink power control scheme for low data packet queueing delay. The scheme can be seen as a simple extension to the Foschini-Miljanic algorithm which takes the transmit queue sizes at the mobile stations into account. The proposed scheme minimizes the draining time compared to all other policies with the same power consumption. This is because of resource pooling effects which arise when all queues empty at the same time. Although in CDMA systems there is no idle capacity as in wired systems, greater cummulative service is obtained by simultaneous transmissions than through time-sharing. Simulations exhibit significant reductions in queueing delay compared to other power control schemes proposed in the literature.
Antonis Dimakis, Spyros Papafragkos
INFOCOM2
2014 Optimizing queueing cost and energy efficiency in a wireless network
abstract
We consider the joint minimization of queueing cost and power consumption in a wireless network, over all power control policies at the transmitters. Approximately optimal policies are derived through the use of a comparison to a single link system offering lower bounds for both performance metrics. The derived policies are of a simple form: the total power consumed at any instant is a monotonic function of a linear combination of the queue backlogs at that instant, while the portions of power allocated to each transmitter are such that the resulting link speeds are proportional to the queue backlogs. Simulations show that the lower bounds become tight -and so the policies become optimal- as the average power approaches the lowest value for which stability is maintained. Moreover, these policies are shown to perform better than gradient projection -based power adaptive algorithms such those arising in formulations using static optimization problems.
Antonis Dimakis, Spyros Papafragkos
WiOpt2