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

Karunakaran Kumar

dblp:200/9433 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

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

Computer networks · 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
Internet of things and sensor networks · 39% Cellular and mobile networks · 30% Wireless networking · 30%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › self-organizing networks
cell zooming
0.312017
Joint Cell Zooming and Channel Allocation Using C-SAP for Large Action Sets · IEEE Trans. Mob. Comput. 2017
Wireless networking
channel assignment
0.312017
Joint Cell Zooming and Channel Allocation Using C-SAP for Large Action Sets · IEEE Trans. Mob. Comput. 2017
Internet of things and sensor networks › energy efficiency
energy-efficient cellular networks
0.312017
Joint Cell Zooming and Channel Allocation Using C-SAP for Large Action Sets · IEEE Trans. Mob. Comput. 2017
Internet of things and sensor networks › energy efficiency › energy-efficient networking
throughput-energy tradeoff
0.112017
Joint Cell Zooming and Channel Allocation Using C-SAP for Large Action Sets · IEEE Trans. Mob. Comput. 2017

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

heuristic search · 0.3combinatorial optimization · 0.3
YearPublicationVenuePosition
2017 Joint Cell Zooming and Channel Allocation Using C-SAP for Large Action Sets
abstract
Optimizing energy consumption is paramount to sustain the growth of cellular networks. One of the approaches to reduce energy consumption is traffic dependent operation of networks. The traffic demand experienced by the network fluctuates over the duration of a day. Therefore, during the periods of low traffic, we may re-configure the network to trade the excess capacity for energy reduction. For example, we may modulate the BS transmit power (Cell Zooming) so as to maintain the desired QoS. However, determining an optimal network configuration is known to be computationally hard. Along with Cell Zooming, it is essential to also consider channel re-assignment, for, when the transmit powers of BSs are changed, the channels allocated to BSs must also be suitably changed. Considering therefore channel allocations also as state variables, the search space over which the optimization should be performed blows up, further complicating the problem. In this paper, we propose a framework to address this problem. The proposed algorithm is suitable for such large search spaces, while the framework is general enough to admit several QoS requirements and sophisticated power consumption models. The underlying mathematical formulation is also applicable in other contexts, and is of independent interest as well.
Karunakaran Kumar, Prasanna Chaporkar, Abhay Karandikar
IEEE Trans. Mob. Comput.1