Wentao Zhao

Wentao Zhao

Auto-generated profile, based on publicly available information

Wentao Zhao

Shanghai Jiao Tong University

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 June 2013 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
SWShaowei Wang
Shaowei Wang
MGMengyao Ge
Mengyao Ge
WZWentao Zhao
Wentao Zhao
In this paper, we investigate the energy-efficient resource allocation in orthogonal frequency division multiplexing (OFDM)-based cognitive radio (CR) networks, where we try to maximize the system energy-efficiency under the consideration of many practical limitations, such as transmission power budget of the CR system, interference threshold of primary users and traffic demands of secondary users. Our general objective formulation leads to a challenging mixed integer programming problem that is hard to solve. To make it computationally tractable, we employ a time-sharing method to transform it into a non-linear fractional programming problem, which can be further converted into an equivalent convex optimization problem by using its hypogragh form. Based on these transformations, it is possible to obtain (near) optimal solution by standard optimization technique. However, the complexity of the standard technique is too high for this real-time optimization task. By exploiting the structure of the problem extensively, we develop an efficient barrier method to work out the (near) optimal solution with a reasonable complexity, significantly better than the standard technique. Numerical results show that our proposal can maximize the energy efficiency of the CR system, whilst the proposed algorithm performs quickly and stably.

1 April 2014
Verified
Conference Paper
Closed access
WZWentao Zhao
Wentao Zhao
SWShaowei Wang
Shaowei Wang
CWChonggang Wang
Chonggang Wang
XWXiaobing Wu
Xiaobing Wu
Low-power access points, such as pico base stations (BSs), femto BSs, and relays are introduced to the next generation cellular systems to enhance coverage and improve system capacity. Deploying low-power access points to offload the conventional macro BSs is deemed as a spectrum- and cost-efficient way to meet the sharp increase of traffic requirements of cellular networks. However, it also leads to heterogeneous network framework and raises new challenges for cell planning. In this paper, we study the minimum cost cell planning problem in such a heterogeneous network. Our optimization task is to select a subset of candidate sites to lay BSs, including macro BSs, pico BSs and relays, to minimize the total deployment cost while satisfying the rate requirements of the demand nodes (DNs) served by the cellular network. We prove that the general case of the formulated problem is APX-hard, where a DN is constrained to be associated with only one BS. However, if each DN can be served by multiple BSs, which is a reasonable case for practical cellular systems, we show it is not APX-hard and develop an approximation algorithm to work out promising solutions. Our proposed algorithm guarantees an approximation ratio of O(logR) to the global optimum, where R is the maximum achievable capacity of the BSs. Numerical results indicate that our proposal can significantly reduce the deployment cost of the cellular network with given rate requirements of DNs compared to other cell planning schemes.

30 October 2024
Verified
Book Chapter
Closed access
PDF file
YWYanbo Wang
Yanbo Wang
WZWentao Zhao
Wentao Zhao
CCChuan Cao
Chuan Cao
TDTianchen Deng
Tianchen Deng
JWJingchuan Wang
Jingchuan Wang
WCWeidong Chen
Weidong Chen

18 December 2025 in CAAI Transactions on Intelligence Technology
Verified
Journal Article
Open access
WZWentao Zhao
Wentao Zhao
YNYihe Niu
Yihe Niu
YWYanbo Wang
Yanbo Wang
TDTianchen Deng
Tianchen Deng
SYShenghai Yuan
Shenghai Yuan
JWJingchuan Wang
Jingchuan Wang
This work presents UNO, a unified monocular visual odometry framework that enables robust and adaptable pose estimation across diverse environments, platforms and motion patterns. Unlike traditional methods that rely on deployment‐specific tuning or predefined motion priors, our approach generalises effectively across a wide range of real‐world scenarios, including autonomous vehicles, aerial drones, mobile robots and handheld devices. To this end, we introduce a mixture‐of‐experts strategy for local state estimation, with several specialised decoders that each handle a distinct class of ego‐motion patterns. Moreover, we introduce a fully differentiable Gumbel‐softmax module that constructs a robust inter‐frame correlation graph, selects the optimal expert decoder and prunes erroneous estimates. These cues are then fed into a unified back‐end that combines pretrained scale‐independent depth priors with a lightweight bundling adjustment to enforce geometric consistency. We extensively evaluate our method on three major benchmark datasets: KITTI (outdoor/autonomous driving), EuRoC‐MAV (indoor/aerial drones) and TUM‐RGBD (indoor/handheld), demonstrating state‐of‐the‐art performance.

30 June 2020 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
WZWentao Zhao
Wentao Zhao
PDPing Dong
Ping Dong
MGMin Guo
Min Guo
YZYuyang Zhang
Yuyang Zhang
XCXuehong Chen
Xuehong Chen
In the scenario of mobile fog computing (MFC), communication between vehicles and fog layer, which is called vehicle-to-fog (V2F) communication, needs to use bandwidth resources as much as possible with low delay and high tolerance for errors. In order to adapt to these harsh scenarios, there are important technical challenges concerning the combination of network coding (NC) and multipath transmission to construct high-quality V2F communication for cloud-aware MFC. Most NC schemes exhibit poor reliability in burst errors that often occur in high-speed movement scenarios. These can be improved by using interleaving technology. However, most traditional interleaving schemes for multipath transmission are designed based on round robin (RR) or weighted round robin (WRR), in practice, which can waste a lot of bandwidth resources. In order to solve those problems, this paper proposes a novel multipath transmission scheme for cloud-aware MFC, which is called Bidirectional Selection Scheduling (BSS) scheme. Under the premise of realizing interleaving, since BSS can be used in conjunction with a lot of path scheduling algorithms based on Earliest Delivery Path First (EDPF), it can make better use of bandwidth resources. As a result, BSS has high reliability and bandwidth utilization in harsh scenarios. It can meet the high-quality requirements of cloud-aware MFC for transmission.

1 January 2026 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
WZWentao Zhao
Wentao Zhao
YNYihe Niu
Yihe Niu
ZCZikun Chen
Zikun Chen
RLRui Li
Rui Li
YWYanbo Wang
Yanbo Wang
JWJingchuan Wang
Jingchuan Wang