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

Pavol Polacek

dblp:65/10816 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2016
—ORCID · none

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

Computer networks · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
1 paper
Wireless networking · 61% Internet architecture and protocols · 30% Physical-layer communications · 9%

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

TopicWeightPapersLastEvidence papers
Wireless networking
cognitive radio
0.212016
Unified Opportunistic Scheduling for Layered Multicast over Cognitive Radio Networks · IEEE Trans. Mob. Comput. 2016
Internet architecture and protocols › multicast
layered multicast
0.212016
Unified Opportunistic Scheduling for Layered Multicast over Cognitive Radio Networks · IEEE Trans. Mob. Comput. 2016
Wireless networking
opportunistic scheduling
0.212016
Unified Opportunistic Scheduling for Layered Multicast over Cognitive Radio Networks · IEEE Trans. Mob. Comput. 2016
Physical-layer communications › channel coding › adaptive coding › rate-adaptive coding
rateless coding
0.112016
Unified Opportunistic Scheduling for Layered Multicast over Cognitive Radio Networks · IEEE Trans. Mob. Comput. 2016

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

simulation · 0.2optimization · 0.2
YearPublicationVenuePosition
2016 Unified Opportunistic Scheduling for Layered Multicast over Cognitive Radio Networks
abstract
We investigate the multicast of layered multimedia content in single hop cognitive radio (CR) networks and ways of improving the subscriber utility. The proposed unified opportunistic scheduling (UOS) aggressively utilizes diversity potential present in CR by exploiting two types of multiuser diversity (MUD), one between multicast groups and another between data stream subscribers in a group. As a result, the resource usage efficiency is significantly increased, and better utility can be achieved. According to derived effective average subscriber throughput under unified MUD, a scheduling algorithm is designed to approach the theoretical throughput improvement. We specifically introduce controlled competition between multicast groups to balance the increasing resource efficiency and the risk of overstretching the limited available spectrum. The algorithm combines prioritization, rateless coding, and data fragmentation to inherently cope with dynamic spectrum availability in CR. The presented simulation results show improved performance in various situations in comparison to other schemes not taking full advantage of the present MUD potential.
Pavol Polacek, Chih-Wei Huang, Jia-Wei Chiang
IEEE Trans. Mob. Comput.1
2016 Opportunistic multicasting for single frequency networks
abstract
Abstract With the growth of multimedia traffic over mobile networks, multicast becomes one of more effective transmission approaches to be widely considered. The Multimedia Broadcast multicast service Single Frequency Network (MBSFN) has been introduced for long term evolution to improve signal‐to‐interference‐plus‐noise ratio at the cell edges, while selecting efficient modulation and coding schemes (MCS) for transmission is still an open issue. Unlike existing solutions in literature, the opportunistic multicasting concept is adopted in this work to aggressively enhance the spectrum efficiency (SE) of single frequency networks. Based on the derived model of effective SE in extended MCS adaptation intervals, we propose a statistical feedback‐based approach to achieve opportunistic multicasting in MBSFN. The algorithm carefully selects the MCS complying with the adaptation need for channel quality changes and enabling high bottleneck user SE under reduced feedbacks. Comparing with other schemes for a single stream setup, the simulations show up to 340% higher SE over non‐opportunistic method and 25% over the second best method maximizing the average SE. The number of successfully transmitted streams in a multi‐stream scenario increased by 250% over the non‐opportunistic approach and 40% over the average SE maximizing approach. Copyright © 2016 John Wiley & Sons, Ltd.
Pavol Polacek, Ting-Yeu Yang, Chih-Wei Huang
Wirel. Commun. Mob. Comput.1
2012 Rateless code based opportunistic multicasting over cognitive radio networks
abstract
Cognitive radio (CR) represents an exciting new paradigm on spectrum utilization and potentially more bandwidth for exploding multimedia traffic. We focus on the layer encoded video multicast problem over CR and contribute 1) an opportunistic multicasting framework, based on rateless forward error correction (FEC) codes, 2) a mechanism for adaptation of data fragment size to improve transmission efficiency, 3) a joint secondary channel (SC) and video data selection algorithm. By adapting fragment size, tracking video group receiving rate, and adapting transmission parameters, we are able to realize the opportunistic multicasting advantage in a challenging CR environment. The proposed overall SC and video data selection algorithm finds the best rateless FEC code length, physical layer modulation and coding schemes (MCS), fragment size and SC combination to increase the effective throughput and heuristically reach maximum system utility. Favorable results comparing to other algorithms showcase the improved performance.
Pavol Polacek, Chih-Wei Huang
GLOBECOM1
2011 Joint opportunistic spectrum access and scheduling for layered multicasting over cognitive radio networks
abstract
Cognitive radio (CR) represents an exciting new paradigm on spectrum utilization and potentially more bandwidth for exploding multimedia traffic. We focus on the layer encoded video multicast problem over CR and contribute 1) a quality based ranking in opportunistic spectrum access (OSA) for sub-channel selection, and 2) opportunistic layered multicasting (OLM) inspired scheduling designed particularly for CR networks. The 2-step ranking in OSA takes outcomes of periodic sensing and prediction to expand the system-wide throughput while keeping collision rates acceptable. By tracking group receiving rate across CR sub-channels and data expiration time, we are able to realize the OLM advantage under much more challenging CR environments. The overall joint opportunistic spectrum access and scheduling (OSAS) algorithm finds precise transmission parameters to heuristically reach maximum system utility. Favorable results comparing OSAS with not fully opportunistic methods demonstrate OSAS to be the best performing one.
Pavol Polacek, Ting-Yeu Yang, Chih-Wei Huang
MMSP1