Demo Data from EDBT 2026 / reviewers in the wild / expert
Baoji Wang
dblp:148/1448
· DBLP profile ↗
7ranked-venue papers
5as first author
1since 2021 · last 2025
0000-0003-3930-3829ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 7 · 5 first-author · 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.
| Theoretical computer science
1 paper |
Coding theory · 79% Information theory · 21% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory
channel capacity |
0.9 | 1 | 2025 | New Upper Bounds for Noisy Permutation Channels · IEEE Trans. Commun. 2025 |
Coding theory
channel coding |
0.9 | 1 | 2025 | New Upper Bounds for Noisy Permutation Channels · IEEE Trans. Commun. 2025 |
Coding theory › error-correcting codes › error probability analysis
finite blocklength analysis |
0.9 | 1 | 2025 | New Upper Bounds for Noisy Permutation Channels · IEEE Trans. Commun. 2025 |
Coding theory › channel coding › strong converse
meta-converse |
0.9 | 1 | 2025 | New Upper Bounds for Noisy Permutation Channels · IEEE Trans. Commun. 2025 |
Coding theory › channel coding › error exponent
second-order asymptotics |
0.9 | 1 | 2025 | New Upper Bounds for Noisy Permutation Channels · IEEE Trans. Commun. 2025 |
Coding theory › channel coding
strong converse |
0.9 | 1 | 2025 | New Upper Bounds for Noisy Permutation Channels · IEEE Trans. Commun. 2025 |
Methods — techniques the papers use, named apart from their topics
symbol relaxation · 0.9minimax meta-converse · 0.9divergence covering · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | New Upper Bounds for Noisy Permutation ChannelsabstractThenoisy permutation channelis a useful abstraction introduced by Makur for point-to-point communication networks and biological storage. While the asymptotic capacity results exist for this model, the characterization of the second-order asymptotics is not available. Therefore, we analyze the converse bounds for the noisy permutation channel in thefinite blocklengthregime. To do this, we present a modified minimax meta-converse for noisy permutation channels by symbol relaxation and construct an auxiliary distribution for this bound usingdivergence covering. We then show the strong converse and refined asymptotic expansions. These two conclusions hold for noisy permutation channels with strictly positive matrices (entry-wise). In addition, we obtain computable bounds for the noisy permutation channel with the binary symmetric channel (BSC), including the original computable converse bound based on the modified minimax meta-converse, the asymptotic expansion, and the$\epsilon $-capacityresult. Finally, numerical results show that the normal approximation shows remarkable precision, and our new converse bound is stronger than existing bounds. Lugaoze Feng, Baoji Wang, Guocheng Lv, Xunan Li, Luhua Wang |
IEEE Trans. Commun. | 2 |
| 2020 | Graph-Based File Dispatching Protocol With D2D-Aided UAV-NOMA Communications in Large-Scale NetworksabstractUnmanned aerial vehicle (UAV)-assisted communications are expected to become an important part of the next generation mobile communication systems, due to the high mobility of the UAVs. Non-orthogonal multiple access (NOMA) is regarded as a rosy technology in the fifth generation (5G) mobile communication systems, since it can effectively improve the spectral efficiency. In this paper, we combine the advantages of the UAV-assisted communications and NOMA, and propose a device-to-device (D2D)-enhanced UAV-NOMA network architecture, in which D2D is introduced to increase the file dispatching efficiency. Resource reuse based on spatial reuse is also allowed to further improve the spectral efficiency. Then, we propose a graph-based file dispatching (GFD) protocol to control the interference and minimize the UAV-assisted file dispatching mission time. Simulation results verify the advantages of our proposed D2D-enhanced UAV-NOMA network architecture and the efficiency of our designed GFD protocol. Baoji Wang, Rongqing Zhang 0001, Chen Chen 0002, Xiang Cheng 0001, Liuqing Yang 0001 |
WCNC | 1 |
| 2020 | Density-aware deployment with multi-layer UAV-V2X communication networksabstractUnmanned aerial vehicle (UAV)‐assisted communications have been regarded as a promising technology, which can be used in dynamic heterogeneous networks, since the UAVs can be applied as mobile base stations (MBSs). It is more efficient to set the UAVs as MBSs in different layers according to their functions. Due to the ability in communicating with other vehicles or facilities, vehicle‐to‐everything (V2X) makes the information required by the vehicles be efficiently transmitted and processed, so as to increase the safety of driving. However, because of the rapid change of topology and the huge demand of data transmission, it is hard to guarantee the efficient coverage of all the vehicles only by the support of terrestrial wireless communication networks. Considering this, this study combines UAV and V2X communications together, and proposes a multi‐layer aerial‐road vehicular (MLARV) architecture. The UAVs in the higher layer are in charge of overall monitoring, while the UAVs in the lower layer are responsible for hot‐spot area coverage. To solve the throughput maximisation problem, the authors further propose a density‐aware deployment (DAD) scheme with an iterative three‐dimensional matching resource allocation algorithm. Simulation results show that the proposed DAD scheme with the MLARV architecture outperforms the traditional UAV‐assisted V2X communications with single layer architecture. Baoji Wang, Rongqing Zhang 0001, Chen Chen 0002, Xiang Cheng 0001 |
IET Commun. | 1 |
| 2020 | Graph-Based File Dispatching Protocol With D2D-Enhanced UAV-NOMA Communications in Large-Scale NetworksabstractAs a newly emerging communication assistant equipment, unmanned aerial vehicles (UAVs) can be exploited to dispatch data files quickly to specific areas and support rapid deployment of communication links in complex terrain, which is of great significance for specific communication demands in disaster and remote areas. Nonorthogonal multiple access (NOMA), as a rosy technology in the fifth generation (5G) and future mobile communication systems, has been widely studied because of its ability in improving spectral efficiency and reducing transmission latency to enhance the overall Quality of Service (QoS) and meet the strict communication requirements. Based on these, in this article, we propose a device-to-device (D2D)-enhanced UAV-NOMA network architecture, in which D2D is introduced to increase the file dispatching efficiency. In our proposed D2D-enhanced UAV-NOMA network, the ground users (GUEs) that have already received file blocks (FBs) are allowed to reuse the time-frequency resources assigned to NOMA links to share their FBs with other GUEs, which significantly improves the efficiency of file dispatching. But this also leads to a complicated interference environment. In order to effectively manage the interference and minimize the UAV-assisted file dispatching mission time, we propose a graph-based file dispatching (GFD) protocol, in which the complicated joint optimization problem is decomposed to be solved efficiently and graph theory-based algorithms are proposed for resource allocation. The simulation results verify the advantages of our proposed D2D-enhanced UAV-NOMA network architecture and the efficiency of our designed GFD protocol in minimizing the total UAV-assisted file dispatching mission time. Baoji Wang, Rongqing Zhang 0001, Chen Chen 0002, Xiang Cheng 0001, Liuqing Yang 0001, Hang Li 0003 |
IEEE Internet Things J. | 1 |
| 2019 | Interference Hypergraph-Based 3D Matching Resource Allocation Protocol for NOMA-V2X NetworksabstractVehicle-to-everything (V2X) communications are regarded as the key technology in future vehicular networks due to its ability in improving the traffic efficiency and safety, and reducing congestion. Recently, non-orthogonal multiple access (NOMA), as a promising solution in the fifth generation (5G) mobile communication systems, has drawn much attention because it can significantly improve the network throughput and lower the accessing and transmission latency to meet the requirements of many 5G-enabled applications. Noticing these, in this paper, we propose to introduce NOMA in device-to-device (D2D)-enhanced V2X networks, where D2D-enabled resource sharing based on spatial reuse for different V2X communication groups are permitted through centralized resource management. Such an enhanced NOMA-V2X architecture results in a more complicated and challenging interference scenario. In order to efficiently solve the interference management and resource allocation problem in the NOMA-V2X network, we construct a weighted 3-partite interference hypergraph to model the relationships among different communication groups. Then, based on the constructed hypergraph, we further propose an interference hypergraph-based 3-dimensional matching (IHG-3DM) resource allocation protocol with a greedy 3DM algorithm. Simulation results verify the efficiency of our proposed IHG-3DM resource allocation protocol for NOMA-V2X communications in improving the network throughput. Baoji Wang, Rongqing Zhang 0001, Chen Chen 0002, Xiang Cheng 0001, Liuqing Yang 0001 |
ICC | 1 |
| 2019 | Interference Hypergraph-Based Resource Allocation (IHG-RA) for NOMA-Integrated V2X NetworksabstractVehicular communication network is a core application scenario in the fifth generation (5G) mobile communication system which requires ultrahigh data rate and ultralow latency. Most recently, nonorthogonal multiple access (NOMA) has been regarded as a promising technique for future 5G systems due to its capability in significantly improving the spectral efficiency and reducing the data transmission latency. In this paper, we propose to introduce NOMA in device-to-device-enhanced vehicle-to-everything (V2X) networks, where resource sharing based on spatial reuse for different V2X communications are permitted through centralized resource management. Considering the complicated interference scenario caused by NOMA and spatial reuse-based resource sharing in the investigated NOMA-integrated V2X (NOMA-V2X) networks, we construct an interference hypergraph (IHG) to model the interference relationships among different communication groups. In addition, based on the constructed IHG, we further propose an IHG-based resource allocation (IHG-RA) scheme with cluster coloring algorithm, which can lead to both effective and efficient resource block assignment with low computational complexity. Simulation results verify the efficiency of our proposed IHG-RA scheme for NOMA-V2X communications in improving the network sum rate. Chen Chen 0002, Baoji Wang, Rongqing Zhang 0001 |
IEEE Internet Things J. | 2 |
| 2018 | Interference Hypergraph-Based Resource Allocation (IHG-RA) for NOMA-Integrated V2X NetworksabstractVehicular communication network is a core application scenario in the fifth generation (5G) mobile communication system which requires ultra high data rate and ultra low latency. Most recently, non-orthogonal multiple access (NOMA) has been regarded as a promising technique for future 5G systems due to its capability in significantly improving the spectral efficiency and reducing the data transmission latency. In this paper, we propose to introduce NOMA in D2D-enabled V2X networks, where resource sharing based on spatial reuse for different V2X communications are permitted through centralized resource management. Considering the complicated interference scenario caused by NOMA and spatial reuse-based resource sharing in the investigated NOMA-integrated V2X networks, we construct an interference hypergraph to model the interference relationships among different communication groups. In addition, based on the constructed hypergraph, we further propose an interference hypergraph-based resource allocation (IHG-RA) scheme with cluster coloring algorithm, which can lead to both effective and efficient QoS-guaranteed resource block (RB) assignment with low computational complexity. Simulation results verify the efficiency of our proposed IHG-RA scheme for NOMA-integrated V2X communications in improving the network sum rate. Baoji Wang, Rongqing Zhang 0001, Chen Chen 0002, Xiang Cheng 0001, Liuqing Yang 0001 |
GLOBECOM | 1 |