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

Dongqing Geng

dblp:278/8783 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0007-1400-0502ORCID · corroborated

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

Computer networks · 2 · 2 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
Edge and fog computing · 77% Physical-layer communications · 23%

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

TopicWeightPapersLastEvidence papers
Edge and fog computing
collaborative edge computing
0.912025
H-MIMO-Assisted Task Offloading for Distributed Edge Computing · IEEE Trans. Commun. 2025
Edge and fog computing › mobile edge computing
computation offloading
0.912025
H-MIMO-Assisted Task Offloading for Distributed Edge Computing · IEEE Trans. Commun. 2025
Physical-layer communications › MIMO › massive MIMO › extremely large-scale MIMO
holographic MIMO
0.312025
H-MIMO-Assisted Task Offloading for Distributed Edge Computing · IEEE Trans. Commun. 2025
Physical-layer communications
MIMO
0.312025
H-MIMO-Assisted Task Offloading for Distributed Edge Computing · IEEE Trans. Commun. 2025
YearPublicationVenuePosition
2025 H-MIMO-Assisted Task Offloading for Distributed Edge Computing
Dongqing Geng, Wenhe Zhang, Richeng Jin, Xiaofan He
IEEE Trans. Commun.1
2024 Dynamic Power Control for Delay-Optimal Coded Edge Computing
abstract
Coded edge computing is envisioned as a promising solution to cope with the ever-increasing large-scale and computation-intensive mobile applications. Besides alleviating the computation straggling issue, task encoding in coded edge computing is also beneficial to the transmission of computation results. Nonetheless, existing pioneering works in this direction mainly take an information-theoretical perspective and assume the ideal scenarios of high signal-to-noise ratio. To the best of our knowledge, the issue of power control still remains largely unexplored for coded edge computing. In this work, two novel power control schemes are developed for coded edge computing in dynamic wireless environments, which apply to the repetition encoded task computing and the general linearly encoded task computing, respectively. However, the corresponding optimization problems turn out to be non-convex and highly non-trivial. To this end, by exploiting the underlying structural property, a novel partition-based iterative optimization method is developed to obtain the closed-form expression of the optimal dynamic power control strategy for repetition encoded task computing. For the case of more general linearly encoded task computing, the corresponding problem is transformed into a sum-of-ratio problem and then solved iteratively. Simulations are conducted to corroborate the effectiveness of the proposed schemes.
Dongqing Geng, Xiaofan He, Richeng Jin, Huaiyu Dai
IEEE Trans. Wirel. Commun.1