Chaonong Xu

Chaonong Xu

Auto-generated profile, based on publicly available information

Chaonong Xu

China University of Petroleum-Beijing

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

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

Representative Publications

View All Publications
30 December 2009 in IEEE Transactions on Industrial Electronics
Verified
Journal Article
Closed access
ZAZhulin An
Zhulin An
HZHongsong Zhu
Hongsong Zhu
Xinrong LiXinrong Li
Xinrong Li
CXChaonong Xu
Chaonong Xu
YXYongjun Xu
Yongjun Xu
XLXiaowei Li
Xiaowei Li
Similar to other cyber infrastructure systems, as wireless sensor networks become larger and more complex, many classic algorithms may no longer work efficiently. This paper presents a wireless sensor network time synchronization model that was initially inspired by synchronous flashing of fireflies. Synchronous flashing of fireflies is an interesting phenomenon that has been studied for decades. A variety of models have been proposed to explain this phenomenon, among which is the pulse-coupled oscillators model that models fireflies as oscillators. The oscillators in such a model interact only through discrete pulses, similar to the flashing of fireflies. In this paper, we propose a new nonidentical linear pulse-coupled oscillators model and use the model to analyze synchronization of pulse-coupled oscillators with different frequencies. The conditions to achieve and maintain synchronization are derived, and then, the results are used to prove that the oscillators in the model can achieve synchronization eventually, except for a set of frequencies with zero Lebesgue measure. Furthermore, through simulations and implementation on a wireless sensor network testbed, we demonstrate that the proposed nonidentical linear pulse-coupled oscillators model can be used in designing lightweight scalable time synchronization protocols for distributed systems.

18 July 2019 in IEEE Systems Journal
Verified
Journal Article
Closed access
CXChaonong Xu
Chaonong Xu
MWMianze Wu
Mianze Wu
YXYongjun Xu
Yongjun Xu
YFYuguang Fang
Yuguang Fang
The power-domain non-orthogonal multiple access (NOMA) supports multiple packet reception, which can be leveraged for delay-bounded applications in industrial wireless networks (IWNs). However, it suffers from high power consumption on transmitters, which poses challenges for battery-powered wireless sensors. Given the delay bound for NOMA-based IWNs, the problem of minimizing aggregate power consumption of transmitters is therefore of great value. In a previous paper, we have addressed the problem under the model of perfect k-successive interference cancellation (k-SIC). In this paper, we study the same problem, however, under the model of imperfect k-SIC, which is more general in theory and more realistic in practice. For the existence of the optimal solution, we first present an explicit sufficient and necessary condition, which correlates three key parameters of network system together. We also propose a polynomial-time optimal algorithm with complexity O(n 2 ). We further consider the same problem with discrete transmit powers, and present an approximation algorithm with complexity O(n 2 ). Performance evaluation reveals that the delay bound requirement has tremendous impacts on both the aggregate power consumption and the maximum transmit power. Relative to the perfect SIC, the residual error caused by imperfect SIC results in extra power consumption of transmitters. However, the extra power consumption is gradually diminished with the further relaxation of the delay bound.

26 February 2020 in IEEE Systems Journal
Verified
Journal Article
Closed access
CXChaonong Xu
Chaonong Xu
MWMianze Wu
Mianze Wu
YXYida Xu
Yida Xu
YXYongjun Xu
Yongjun Xu
The power-domain nonorthogonal multiple access (NOMA) based on successive interference cancellation (SIC) provides opportunities for fast media access in industrial wireless networks. In this article, given the traffic loads of wireless sensors, we study the shortest uplink scheduling (SUS) problem by joint power allocation and wireless sensor (WS) scheduling. A key term named maximum decoded level (MDL), which models the transmitting characteristics of WSs under SIC, and thus, lays the foundations for revealing a sufficient and necessary condition for successive transmissions under SIC, is presented in the first step. Then, guided by the theoretical condition that decouples WS scheduling from power allocation, we present a two-step greedy algorithm for the SUS problem in the case of continuous transmit powers. We also prove that the proposed algorithm is optimal for two regular cases. One is for any traffic loads under 2-SIC, the other is for unit traffic load under ${k}$ -SIC. Furthermore, in the case of discrete transmit powers, we further propose an optimal algorithm under 2-SIC and an approximation algorithm under ${k}$ -SIC by adapting the above-mentioned greedy algorithm for the case of discrete transmit powers. Experimental evaluations reveal the effectiveness of the three algorithms.

4 December 2017 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
CXChaonong Xu
Chaonong Xu
KMKaichi Ma
Kaichi Ma
YXYida Xu
Yida Xu
YXYongjun Xu
Yongjun Xu
YFYuguang Fang
Yuguang Fang
The $k$-SIC (Successive Interference Cancellation) technology can support at most k parallel transmissions, and thus fast media access can be provided, which is vital for real-time industrial wireless networks. However, it suffers from high power consumption because high interference caused by parallel transmissions has to be overcome. In this paper, given the real-time performance requirements, we consider a network supporting $k$-SIC, and study how to minimize aggregate power consumptions of user equipments for uplink transmissions by jointly addressing power allocation and user scheduling. We show that the problem is solvable in polynomial time in the case of continuous transmit powers by an algorithm with complexity of O(nlog(n)), where n is the number of user equipments. In the case of discrete transmit powers, the problem is shown to be polynomially solvable for 2-SIC, and we also propose an approximation algorithm for $k$-SIC where k > 2. Experimental evaluations reveal that the real-time performances have tremendous impacts on both the aggregate power consumption and the maximum of the transmit powers of user equipments. Besides, the usability of SIC in low-power applications is also shown by experimental evaluations.

1 January 1997 in IEEE Communications Magazine
Verified
Journal Article
Closed access
DLD. Lee
D. Lee
CXC. Xu
C. Xu
The wireless local loop (WLL) system is a local telephone system without wireline connection. It is believed to be a fast and cost-effective means to provide local phone service in rural areas and third world countries. WLL is a fixed radio communication system; narrowbeam antennas can be employed at both the base station and subscriber's side at high spots so that the propagation between base station and house is very close to free space propagation. This gives the WLL system many inherent advantages over the traditional cellular system, such as bigger coverage area, low power, reduced interference, higher capacity, no fast fading, and no handoff. In this article ideal multiple-tier hexagonal cells are used to derive the capacity of a CDMA WLL system. First, the reverse link interference from each tier to the center cell is calculated separately. Then, the interference ratio of reverse links in a WLL system is analytically derived as a function of total tier number. The result shows that interference from other cells is proportional to the beam width of the house antenna. The authors also found that tier number plays a vital role in system capacity in a free-space propagation (20 dB/dec) environment. At the extreme, the system capacity will drop to zero for an infinite-tier cell structure. A WLL simulator is also built to verify the authors' analytical solution

1 March 2018 in Computer Networks
Verified
Journal Article
Closed access
CXChaonong Xu
Chaonong Xu
KMKaichi Ma
Kaichi Ma
YXYongjun Xu
Yongjun Xu