Jingxian Wu

Jingxian Wu

Auto-generated profile, based on publicly available information

Jingxian Wu

Department of Electrical Engineering, University of Arkansas, Fayetteville, AR, USA

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
29 November 2017 in IEEE Transactions on Green Communications and Networking
Verified
Journal Article
Open access
XWXianwen Wu
Xianwen Wu
JYJing Yang
Jing Yang
JWJingxian Wu
Jingxian Wu
In this paper, we consider a scenario where an energy harvesting sensor continuously monitors a system and sends time-stamped status updates to a destination. The destination keeps track of the system status through the received updates. We use the metric Age of Information (AoI), the time that has elapsed since the last received update was generated, to measure the “freshness” of the status information available at the destination. Our objective is to design optimal online status update policies to minimize the long-term average AoI, subject to the energy causality constraint at the sensor. We consider three scenarios, i.e., the battery size is infinite, finite, and one unit only, respectively. For the infinite battery scenario, we adopt a best-effort uniform status update policy and show that it minimizes the long-term average AoI. For the finite battery scenario, we adopt an energy-aware adaptive status update policy, and prove that it is asymptotically optimal when the battery size goes to infinity. For the last scenario where the battery size is one, we first show that within a broadly defined class of online policies, the optimal policy should have a renewal structure. We then focus on a renewal interval, and prove that the optimal policy should have a threshold structure, i.e., if the AoI in the system is below a threshold when an energy arrival enters an empty battery, the sensor should store the energy first and then update when the AoI reaches the threshold; otherwise, it updates the status immediately. Simulation results corroborate the theoretical bounds.

1 January 2016 in IEEE Access
Verified
Journal Article
Open access
JWJingxian Wu
Jingxian Wu
PFPingzhi Fan
Pingzhi Fan
Providing reliable broadband wireless communications in high mobility environments, such as high-speed railway systems, remains one of the main challenges faced by the development of the next generation wireless systems. This paper provides a systematic review of high mobility communications. We first summarize a list of key challenges and opportunities in high mobility communication systems, then provide comprehensive reviews of techniques that can address these challenges and utilize the unique opportunities. The review covers a wide spectrum of communication operations, including the accurate modeling of high mobility channels, the transceiver structures that can exploit the properties of high mobility environments, the signal processing techniques that can harvest the benefits (e.g., Doppler diversity) and mitigate the impairments (e.g., carrier frequency offset, intercarrier interference, channel estimation errors) in high mobility systems, and the mobility management and network architectures that are designed specifically for high mobility systems. The survey focuses primarily on physical layer operations, which are affected the most by the mobile environment, with some additional discussions on higher layer operations, such as handover management and control-plane/user-plane decoupling, which are essential to high mobility operations. Future research directions on high mobility communications are summarized at the end of this paper.

23 July 2007 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
NMNeelesh B. Mehta
Neelesh B. Mehta
JWJingxian Wu
Jingxian Wu
AMAndreas F. Molisch
Andreas F. Molisch
JZJin Zhang
Jin Zhang
A simple, novel, and general method is presented in this paper for approximating the sum of independent or arbitrarily correlated lognormal random variables (RV) by a single lognormal RV. The method is also shown to be applicable for approximating the sum of lognormal-Rice and Suzuki RVs by a single lognormal RV. A sum consisting of a mixture of the above distributions can also be easily handled. The method uses the moment generating function (MGF) as a tool in the approximation and does so without the extremely precise numerical computations at a large number of points that were required by the previously proposed methods in the literature. Unlike popular approximation methods such as the Fenton-Wilkinson method and the Schwartz-Yeh method, which have their own respective short-comings, the proposed method provides the parametric flexibility to accurately approximate different portions of the lognormal sum distribution. The accuracy of the method is measured both visually, as has been done in the literature, as well as quantitatively, using curve-fitting metrics. An upper bound on the sensitivity of the method is also provided.

12 December 2022 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
GCGuangji Chen
Guangji Chen
QWQingqing Wu
Qingqing Wu
RLRuiqi Liu
Ruiqi Liu
JWJingxian Wu
Jingxian Wu
Chao FangChao Fang
Chao Fang
In this paper, we develop a unified dynamic intelligent reflecting surface (IRS) beamforming framework to boost the sum computation rate of an IRS-aided mobile edge computing (MEC) system, where each device follows a binary offloading policy. Specifically, the task of each device has to be either executed locally or offloaded to MEC servers as a whole with the aid of given number of IRS beamforming vectors available. By flexibly controlling the number of times for IRS reconfiguring phase-shifts, the system can achieve a balance between the performance and associated signalling overhead. We aim to maximize the sum computation rate by jointly optimizing the computational mode selection for each device, offloading time allocation, and IRS beamforming vectors across time. Since the resulting optimization problem is non-convex and NP-hard, there are generally no standard methods to solve it optimally. To tackle this problem, we first propose a penalty-based successive convex approximation algorithm, where all the associated variables in the inner-layer iterations are optimized simultaneously and the obtained solution is guaranteed to be locally optimal. Then, we further derive the offloading activation condition for each device by deeply exploiting the intrinsic structure of the original optimization problem. According to the offloading activation condition, a low-complexity algorithm based on the successive refinement method is proposed to obtain high-quality suboptimal solutions, which are more appealing for practical systems with a large number of devices and IRS elements. Moreover, the optimal condition for the proposed low-complexity algorithm is revealed. The effectiveness of the proposed algorithms is demonstrated through numerical examples. In addition, the results illustrate the practical significance of the IRS in MEC systems for achieving coverage extension and supporting multiple energy-limited devices for task offloading, and also unveil the fundamental performance-cost tradeoff embedded in the proposed dynamic IRS beamforming framework.

2 March 2020 in IEEE Transactions on Engineering Management
Verified
Journal Article
Closed access
YLYaze Li
Yaze Li
JWJingxian Wu
Jingxian Wu
This article discusses optimum designs of photovoltaic (PV) systems with battery energy storage system (BESS) by using real-world data. Specifically, we identify the optimum size of PV panels, the optimum capacity of BESS, and the optimum scheduling of BESS charging/discharging, such that the long-term overall cost, including both utility bills and the PV system, is minimized. The optimization is performed by considering a plethora of parameters, such as energy usage, energy cost, weather, geographic location, inflation, and the cost, efficiency, and aging effects of solar panels and BESS. To capture the impacts of long-term factors such as aging effects, inflation, and discounted economic returns, the problem is formulated as a mixed integer nonlinear programming (MINLP) problem over the time horizon covering the entire life cycles of solar panels and BESS of the order of ten years or longer, whereas almost all existing works on PV system designs consider much shorter time horizons of the order of days or weeks. The MINLP is transformed into mixed integer linear programming (MILP) and solved by branch-and-bound (B&B) algorithm. The complexity of MILP is high due to the long time horizon. A new low-complexity algorithm is then proposed by using dynamic programming, where it is shown that the MINLP problem can be transformed into one that satisfies Bellman’s principal of optimality. Applying the newly developed algorithms on real-world data from a commercial user in San Francisco reveals that the system achieves the break-even point at the 66th month and achieves a 29.3% reduction in total system cost.

9 November 2015 in IEEE Communications Magazine
Verified
Journal Article
Closed access
YZYahong Rosa Zheng
Yahong Rosa Zheng
JWJingxian Wu
Jingxian Wu
CXChengshan Xiao
Chengshan Xiao
Recent research in underwater acoustic communications has taken advantage of MIMO technologies to achieve reliable communication with 10-100 times increase of data rate in comparison to traditional systems. The powerful turbo equalization and FEC coding techniques enable both single-carrier modulation and OFDM systems to combat triply selective UWA channels. This article reviews the time-domain and frequency-domain turbo equalizer schemes for MIMO SCM systems. Low-complexity techniques are presented with both turbo linear equalizers and turbo soft decision feedback equalizers in both the time and frequency domains. Although results are shown specifically for UWA channels, these turbo equalizer techniques are also suitable for terrestrial RF communication systems.