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

Yuhui Dong

dblp:45/10039 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2026
0000-0002-4422-4685ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Computer 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
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › free-space optical communication
deep-space optical communication
0.312018
Overview of deep space laser communication · Sci. China Inf. Sci. 2018
Physical-layer communications
free-space optical communication
0.312018
Overview of deep space laser communication · Sci. China Inf. Sci. 2018
Physical-layer communications › optical communication
laser communication
0.112018
Overview of deep space laser communication · Sci. China Inf. Sci. 2018
YearPublicationVenuePosition
2026 PtychoDiffusion: Diffusion Posterior Sampling with Relaxed Projection for Stable Ptychographic Reconstruction
Yumeng Jiang, Yuhui Dong, Huibin Chang
ICIC (17)6
2018 Overview of deep space laser communication
Xiangnan Liu, Yuhui Dong
Sci. China Inf. Sci.5
2015 Cross-layer optimized routing in wireless sensor networks with duty cycle and energy harvesting
abstract
Abstract In this paper, we propose a cross‐layer optimized geographic node‐disjoint multipath routing algorithm, that is, two‐phase geographic greedy forwarding plus. To optimize the system as a whole, our algorithm is designed on the basis of multiple layers' interactions, taking into account the following. First is the physical layer, where sensor nodes are developed to scavenge the energy from environment, that is, node rechargeable operation (a kind of idle charging process to nodes). Each node can adjust its transmission power depending on its current energy level (the main object for nodes with energy harvesting is to avoid the routing hole when implementing the routing algorithm). Second is the sleep scheduling layer, where an energy‐balanced sleep scheduling scheme, that is, duty cycle (a kind of node sleep schedule that aims at putting the idle listening nodes in the network into sleep state such that the nodes will be awake only when they are needed), and energy‐consumption‐based connectedk‐neighborhood is applied to allow sensor nodes to have enough time to recharge energy, which takes nodes' current energy level as the parameter to dynamically schedule nodes to be active or asleep. Third is the routing layer, in which a forwarding node chooses the next‐hop node based on 2‐hop neighbor information rather than 1‐hop. Performance of two‐phase geographic greedy forwarding plus algorithm is evaluated under three different forwarding policies, to meet different application requirements. Our extensive simulations show that by cross‐layer optimization, more shorter paths are found, resulting in shorter average path length, yet without causing much energy consumption. On top of these, a considerable increase of the network sleep rate is achieved. Copyright © 2014 John Wiley & Sons, Ltd.
Guangjie Han, Yuhui Dong, Hui Guo 0006, Lei Shu 0001, Dapeng Oliver Wu
Wirel. Commun. Mob. Comput.2