Qing Zhao

Qing Zhao

Auto-generated profile, based on publicly available information

Qing Zhao

Beijing Fibrlink Communications Co., Ltd., Beijing, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
1 January 2021 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
HWHuijiao Wang
Huijiao Wang
LWLin Wu
Lin Wu
QZQing Zhao
Qing Zhao
YWYongzhuang Wei
Yongzhuang Wei
HJHua Jiang
Hua Jiang
Source location privacy, one of the core contents of Wireless Sensor Network (WSN) security, has a significant impact on extensive application of WSNs. In this paper, a novel location privacy protection routing scheme called Energy Balanced Branch Tree (EBBT) is proposed by using multibranch and fake sources. This scheme has three phases. In the first place, the data of the source are randomly sent to a certain intermediate node. Then, a minimum hop routing (MHR) from the intermediate node to the base station is formed. Then, branch paths with fake sources are generated dynamically from some nodes on the MHR path. Finally, a tree‐shaped structure from real source nodes and fake source nodes to the base station is achieved. In difference to the previous schemes, the location of the real source in the EBBT scheme does not affect the location and the number of fake sources. During the formation of the tree‐shaped multibranch paths, the residual energy of nodes is considered sufficiently, and the control of the direction of each branch path is also involved. The influence of the number and length of branches on the network lifetime and network security is also investigated. Experimental results show that the proposed algorithm has the advantages of long network security period and lifetime, as well as high path diversity. Our simulation further illustrates that the EBBT scheme has favorable privacy of the source location without changing the network lifetime.

1 October 2011
Verified
Conference Paper
Closed access
WRWei Ren
Wei Ren
QZQ. Zhao
Q. Zhao
RRR. Ramanathan
R. Ramanathan
JGJ. Gao
J. Gao
ASA. Swami
A. Swami
PBP. Basu
P. Basu
We consider the broadcasting problem in multi-radio multi-channel ad hoc networks. The objective is to minimize the total broadcast cost, where the cost can be of any form that is summable over all the transmissions (e.g., the transmission and reception energy, the price for accessing a specific channel). Our technical approach is based on a simplicial complex model that allows us to capture the broadcast nature of the wireless medium and the heterogeneity across radios and channels. Specifically, we show that broadcasting in multi-radio multi-channel ad hoc networks can be formulated as a minimum spanning problem in simplicial complexes. We establish the NP-completeness of the minimum spanning problem and propose two approximation algorithms with order-optimal performance guarantee. These two algorithms offer tradeoffs between performance and time complexity. In a broader context, this work appears to be the first that studies the minimum spanning problem in simplicial complexes and weighted minimum connected set cover problem.

1 November 2007 in Asilomar Conference on Signals, Systems & Computers
Verified
Conference Paper
Closed access
QZQing Zhao
Qing Zhao
WRWei Ren
Wei Ren
ASAnanthram Swami
Ananthram Swami
We consider spectrum opportunity detection in cognitive radio networks for spectrum overlay. We highlight the differences between detecting primary signals and detecting spectrum opportunities. We show that besides noise and fading, the geographic distribution and traffic pattern of primary users have significant impact on the performance of spectrum opportunity detection. A necessary and sufficient condition for the equivalence between primary signal detection and spectrum opportunity detection is obtained, and the performance of listen-before- talk in a Poisson primary network with uniform traffic pattern is analyzed. Furthermore, we study the translation from the physical layer opportunity detection performance to the MAC layer performance. This issue is crucial in examining the impact of sensing errors on the design of higher layers and in choosing the optimal operating characteristics of the spectrum sensor. We demonstrate the complex dependency of the relationship between PHY and MAC on the applications and the use of MAC handshaking signaling such as RTS/CTS.

4 October 2006
Verified
Conference Paper
Closed access
QZQing Zhao
Qing Zhao
LTLang Tong
Lang Tong
We propose a hybrid networking strategy for large-scale energy constrained ad hoc networks. Referred to as energy-aware geolocation aided routing (EAGER), this protocol optimally blends proactive and reactive routing strategies for energy efficiency. Specifically, EAGER partitions the network into cells and performs intracell proactive routing and inter-cell reactive routing. The cell size and transmission range are optimized analytically for energy efficiency. Furthermore, by gluing cells around the hot spots in the network, EAGER is capable of adapting to time-varying heterogenous traffic patterns.

1 September 2009
Verified
Report
Open access
PDF file
WRWei Ren
Wei Ren
QZQing Zhao
Qing Zhao
ASAnanthram Swami
Ananthram Swami
We analyze the multihop delay of ad hoc cognitive radio networks, where the transmission delay of each hop consists of the propagation delay and the waiting time for the availability of the communication channel (i.e., the occurrence of a spectrum opportunity at this hop). Using theories and techniques from continuum percolation and ergodicity, we establish the scaling law of the minimum multihop delay with respect to the source-destination distance in cognitive radio networks. When the propagation delay is negligible, we show the starkly different scaling behavior of the minimum multihop delay in instantaneously connected networks as compared to networks that are only intermittently connected due to scarcity of spectrum opportunities. Specifically, if the network is instantaneously connected the minimum multihop delay is asymptotically independent of the distance; if the network is only intermittently connected, the minimum multihop delay scales linearly with the distance. When the propagation delay is nonnegligible but small, we show that although the scaling order is always linear the scaling rate for an instantaneously connected network can be orders of magnitude smaller than the one for an intermittently connected network.

1 September 2021 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
BWBen Wang
Ben Wang
QZQing Zhao
Qing Zhao
SYShuai Yuan
Shuai Yuan
With the development of intelligent networking system for electric vehicles, the communication between intelligent electric vehicles has attracted more and more attention, and how to use multi-channel communication to realize data distribution is one of the research focuses. Firstly, the communication channel is modeled by Markov chain, and a discrete-time channel model is established, which is used for estimating and predicting the channel state. At the same time, using the idea of multi-channel and time synchronization, a concurrent transmission mechanism based on time synchronization is proposed to realize the synchronous transmission of data from multiple intelligent networks on multiple channels. Finally, the simulation results show that the average delay in the network can be reduced by about 30%. Therefore, the feasibility of the method is verified, and the method can effectively improve the performance of the communication network. This paper also gives a feasible solution to the overall architecture of vehicle communication network from the perspective of integration of WAVE and WiMAX technologies, and uses cross-layer integration design criteria and optimization methods to improve the performance of the new vehicle communication network.