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

Venkata Gadiraju

dblp:303/1380 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

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

Computer networks · 2 · 1 first-author · 2 since 2021

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 · 100%

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

TopicWeightPapersLastEvidence papers
Wireless networking › network deployment
access point deployment
0.812024
Novel Graph-Theoretical Multiple Access-Point/Router Deployment Approach for Full Line-of-Sight Coverage Over Arbitrary Indoor Polygonal/Prismatic Areas · IEEE Trans. Commun. 2024
Wireless networking
WLAN
0.812024
Novel Graph-Theoretical Multiple Access-Point/Router Deployment Approach for Full Line-of-Sight Coverage Over Arbitrary Indoor Polygonal/Prismatic Areas · IEEE Trans. Commun. 2024

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

visibility graph · 0.8graph theory · 0.8
YearPublicationVenuePosition
2025 Novel Computationally Efficient Multiple Access-Point/Router Deployment Approach for Full Line of Sight Coverage Over Arbitrary Indoor Polygonal/Prismatic Fields of Interest
abstract
Nowadays, wireless local-area networks (WLANs) are widely deployed in residential and commercial areas. How to ensure full coverage is always an important challenge during the deployment of access-points (APs) and routers. In this study, we investigate the full Line of Sight (LoS) coverage problem. We will focus on how to achieve the full LoS coverage using a minimal number of APs/routers in an arbitrary polygonal/prismatic field-of-interest, which may be simply or multiply connected subject to a certain restricted link-range. We propose a new visibility-polygon-based approach for doing so. The performance of our proposed new approach is then evaluated in terms of the coverage efficiency, the total number of APs/routers, and the peak link-distance ratio for achieving the full LoS coverage. Meanwhile, we also compare our proposed new approach with the existing schemes. Compared to the existing schemes, our proposed novel visibility-polygon-based approach can achieve the full LoS coverage by requiring the same number of APs/routers but much less computation time.
Hao-Yu Tsai, Venkata Gadiraju, Hsiao-Chun Wu, Scott C.-H. Huang
IEEE Internet Things J.2
2024 Novel Graph-Theoretical Multiple Access-Point/Router Deployment Approach for Full Line-of-Sight Coverage Over Arbitrary Indoor Polygonal/Prismatic Areas
abstract
Nowadays, wireless local-area networks (WLANs) are widely deployed in residential and commercial areas. The coverage quality is essential to users. The full coverage appears to be one of the most crucial problems to be considered during the network and access-point/router deployment (placement). We formulate the light-of-sight (LoS) coverage problem using the visibility-graph framework. In this work, for arbitrary multiply-connected or simply-connected polygonal/prismatic fields-of-interest subject to an arbitrary link-range restriction, we investigate how the full LoS coverage can be achieved by a minimum number of access-points/routers. Based on the new mathematical lemmas we derive, we design a novel graph-theoretical approach accordingly. Our proposed new scheme can be deemed the first-ever systematic approach to the best of our knowledge. Our proposed new approach is also evaluated in terms of the coverage efficiency, the number of access-points/routers, and the peak link-distance ratio for full LoS coverage in comparison with the existing solution to the art gallery problem.
Venkata Gadiraju, Hsiao-Chun Wu, Hao-Yu Tsai, Scott C.-H. Huang, Costas Busch, Prasanga Neupane, Guannan Liu 0001, Shih Yu Chang
IEEE Trans. Commun.1