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.

Dongming Bian

dblp:56/10675 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · conflict

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

Computer networks · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 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
2 papers
Physical-layer communications · 41% Vehicular, aerial and satellite networks · 26% Network optimization and economics · 18%

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

TopicWeightPapersLastEvidence papers
Vehicular, aerial and satellite networks
satellite networks
0.912025
A survey on communication and computing resources allocation and management for cohesive clustered satellites systems · Sci. China Inf. Sci. 2025
Physical-layer communications › MIMO
multiuser MIMO
0.712023
User Selection in ZF Precoding Multi-User Satellite MIMO Downlink With QoS Constraints · IEEE Trans. Commun. 2023
Physical-layer communications › MIMO
precoding
0.712023
User Selection in ZF Precoding Multi-User Satellite MIMO Downlink With QoS Constraints · IEEE Trans. Commun. 2023
Cellular and mobile networks › multiuser scheduling
user selection
0.712023
User Selection in ZF Precoding Multi-User Satellite MIMO Downlink With QoS Constraints · IEEE Trans. Commun. 2023
Physical-layer communications › beamforming › linear beamforming
zero-forcing beamforming
0.712023
User Selection in ZF Precoding Multi-User Satellite MIMO Downlink With QoS Constraints · IEEE Trans. Commun. 2023
Vehicular, aerial and satellite networks › satellite transmission
multibeam satellite downlink
0.212023
User Selection in ZF Precoding Multi-User Satellite MIMO Downlink With QoS Constraints · IEEE Trans. Commun. 2023
Vehicular, aerial and satellite networks
satellite communication
0.212023
User Selection in ZF Precoding Multi-User Satellite MIMO Downlink With QoS Constraints · IEEE Trans. Commun. 2023

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

survey · 0.9swap operation · 0.7heuristic search · 0.7greedy algorithm · 0.7
YearPublicationVenuePosition
2025 A survey on communication and computing resources allocation and management for cohesive clustered satellites systems
Wanjing Li, Haojun Liu, Dongming Bian
Sci. China Inf. Sci.5
2023 User Selection in ZF Precoding Multi-User Satellite MIMO Downlink With QoS Constraints
abstract
In this paper, the user selection problem is investigated in the multi-user satellite multiple-input multiple-output (MIMO) downlink, which includes a multi-beam geostationary earth orbit (GEO) satellite in space and multiple terrestrial users on the ground. Considering that the number of users is much larger than that of beams or feeds, user selection should be performed so that multiple users can be served successively in different time slots. In order to meet the quality of service (QoS) requirements of users and maximize the system sum rate, three user selection algorithms are proposed: greedy user selection (GUS) algorithm, add swap user selection (AS) algorithm, and random add swap user selection (RAS) algorithm. Among the three algorithms, only the “add” operation is adopted in the GUS algorithm, both the “add”, and “swap” operations are considered in the AS algorithm. On this basis, heuristic search and “random swap” operation are introduced and the RAS algorithm is obtained. The complexity of the above three algorithms is analyzed analytically and the RAS algorithm is found to have the highest complexity. Besides, the performance of the three algorithms is analyzed and compared through simulations, where the random user selection (RUS) algorithm is taken as a benchmark. Numerical results show that the system sum rate and energy efficiency are greatly improved by the proposed algorithms and the RAS algorithm has the best performance.
Hongpeng Zhu, Yinxia Zhu, Dongming Bian, Guangxia Li
IEEE Trans. Commun.6
2017 Bundle Protocol Over Highly Asymmetric Deep-Space Channels
abstract
Bundle protocol (BP) is the main protocol of delay/disruption-tolerant networking which is developed to provide reliable data delivery services in a stressed communications environment. A typical application of BP is for data delivery in a challenging deep-space communication environment. However, little work has been done in analyzing the performance of BP in deep-space communications, especially in presence of highly channel-rate asymmetry. In this paper, we present analytical modeling of the transmission performance of BP over deep-space communication channels characterized by highly asymmetric channel rates. The model is built to estimate the expected file delivery time (and goodput) of the protocol for reliable data delivery in a deep-space transmission scenario. The model is validated by conducting data transfer experiments using a PC-based experimental test bed.
Alaa Sabbagh, Ruhai Wang, Kanglian Zhao, Dongming Bian
IEEE Trans. Wirel. Commun.4
2003 A smart blind channel estimation algorithm of uplink for MC-CDMA
abstract
A blind channel estimation algorithm is proposed in this paper by analyzing the received signal of uplink for MC-CDMA system. The proposed algorithm uses the second order statistics of the received signal and the user spreading sequences to separate the user information and to estimate the channel response. Then PIC technique is used to improve the performance of the algorithm. The proposed algorithm has nothing to do with the type of noise. And the results of computer simulation show the proposed algorithm has excellent performance in wireless channel.
Dongming Bian, Chongsen Ran, Xinying Yi
PIMRC1