Jianhui Zhang

Jianhui Zhang


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
15 October 2016 in Peer-to-Peer Networking and Applications
Verified
Journal Article
Closed access
PDF file
ZLZhi Li
Zhi Li
JZJianhui Zhang
Jianhui Zhang
XSXingfa Shen
Xingfa Shen
JFJin Fan
Jin Fan

8 October 2014 in The Computer Journal
Verified
Journal Article
Closed access
PDF file
JZJianhui Zhang
Jianhui Zhang
ZLZhi Li
Zhi Li
FXFeng Xia
Feng Xia
STShaojie Tang
Shaojie Tang
XSXingfa Shen
Xingfa Shen
BZBei Zhao
Bei Zhao
To support the sustainable operation of wireless sensor networks using limited energy, duty cycling is a promising solution. However, it is a challenge to guarantee each node communicating with its neighbors under duty cycle when the network is asynchronous. The challenge becomes bigger when nodes’ duty cycles are required to be adjusted separately according to their demands to save energy and achieve high channel utilization. Existing low power listening- and contention-based protocols are not energy-efficient and cannot ensure high channel utility. Additionally, synchronization-based media access control (MAC) protocols suffer from extra energy consumption and low synchronization precision. This paper proposes a localized and on-demand (LOD) duty cycling scheme based on a specifically designed semi-quorum system. LOD can adjust duty cycle of each node adaptively according to its demand so as to avoid channel contention, consequently achieving high channel utilization. This allows the fairness for channel access within asynchronous sensor networks. Extensive experiments are conducted on a real test-bed of 100 TelosB nodes to evaluate the performance of LOD. As compared with B-MAC, LOD substantially reduces contention for channel access and the energy consumption, thus improving the network throughput significantly.

1 January 2014 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
HZHong Zeng
Hong Zeng
JZJianhui Zhang
Jianhui Zhang
GDGuojun Dai
Guojun Dai
ZGZhigang Gao
Zhigang Gao
HHHaiyang Hu
Haiyang Hu
This paper presents a security visiting guiding system SVG composed of RFID, smart phone, and Wi-Fi signal widely available. The SVG system can provide visitors with the map of a given building, so that the visitor can easily find the target under its guide. It can also protect user's privacy location information by cryptographic two-dimension code and RFID. The two-dimension code can be easily obtained by a mobile phone and it authorizes a visitor to obtain the navigation service of SVG. The visitor receives the permission from his host and makes a date through SVG. Then, SVG will navigate both the persons to meet at any place in the building. Furthermore, this paper demonstrates and evaluates the SVG security scheme. We conduct an attacker model and test the ability of the scheme in protecting user's location security.

30 May 2020 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
PDF file
BZBei Zhao
Bei Zhao
SZSiwen Zheng
Siwen Zheng
JZJianhui Zhang
Jianhui Zhang
The mobile crowdsourcing technology has been widely researched and applied with the wide popularity of smartphones in recent years. In the applications, the smartphone and its user act as a whole, which called as the composite node in this article. Since smartphone is usually under the operation of its user, the user’s participation cannot be excluded out the applications. But there are a few works noticed that humans and their smartphones depend on each other. In this article, we first present the relation between the smartphone and its user as the conditional decision and sensing. Under this relation, the composite node performs the sensing decision of the smartphone which based on its user’s decision. Then, this article studies the performance of the composite sensing process under the scenario which composes of an application server, some objects, and users. In the progress of the composite sensing, users report their sensing results to the server. Then, the server returns rewards to some users to maximize the overall reward. Under this scenario, this article maps the composite sensing process as the partially observable Markov decision process, and designs a composite sensing solution for the process to maximize the overall reward. The solution includes optimal and myopic policies. Besides, we provide necessary theoretical analysis, which ensures the optimality of the optimal algorithm. In the end, we conduct some experiments to evaluate the performance of our two policies in terms of the average quality, the sensing ratio, the success report ratio, and the approximate ratio. In addition, the delay and the progress proportion of optimal policy are analyzed. In all, the experiments show that both policies we provide are obviously superior to the random policy.

26 November 2015 in arXiv
Verified
Preprint
Open access
PDF file
JZJianhui Zhang
Jianhui Zhang
The energy-harvested Wireless Sensor Networks (WSNs) may operate perpetually with the extra energy supply from ambient natural energy, such as solar energy. Nevertheless, the harvested energy is still limited so it's not able to support the perpetual network operation with full duty cycle. To achieve the perpetual network operation and process the data with high importance, measured by Value of Information (VoI), the network has to operate under partial duty cycle and to improve the efficiency to consume the harvested energy. The challenging problem is how to deal with the stochastic feature of the natural energy and the variable data VoI. We consider the energy consumption during storing and the diversity of the data process including sampling, transmitting and receiving, which consume different power levels. The problem is then mapped as the budget-dynamic Multi-Arm Bandit (MAB) problem by treating the energy as the budget and the data process as arm pulling. This paper proposes an Opportunistic Duty Cycling (ODC) scheme to improve the energy efficiency while satisfying the perpetual network operation. ODC chooses the proper opportunities to store the harvested energy or to spend it on the data process based on the historical information of the energy harvesting and the VoI of the processed data. With this scheme, each sensor node need only estimate the ambient natural energy in short term so as to reduce the computation and the storage for the historical information. It also can distributively adjust its own duty cycle according to its local historical information. This paper also conducts the extensive analysis on the performance of our scheme ODC, and the theoretical results validate the regret, which is the difference between the optimal scheme and ours. Our experimental results also manifest the promising performance of ODC.

10 December 2015 in arXiv
Verified
Preprint
Open access
PDF file
JZJianhui Zhang
Jianhui Zhang
MWMengmeng Wang
Mengmeng Wang
ZLZhi Li
Zhi Li
In recent years, there have been several kinds of energy harvesting networks containing some tiny devices, such as ambient backscatter, ring and renewable sensor networks. During energy harvesting, such networks suffer from the energy heterogeneity, dynamics and prediction hardness because the access to natural resources is often spatiotemporal different and timely changing among the devices. Meanwhile, the charging efficiency is quite low especially when the power of the harvested energy is weak. It results in the energy waste to store the harvested energy indirectly. These features bring challenging and interesting issues on efficient allocation of the harvested energy. This paper studies the \emph{stochastic duty cycling} by considering these features with the objective characterized by maximizing the common active time. We consider two cases: offline and online stochastic duty cycling. For the offline case, we design an optimal solution: offline duty cycling algorithm. For the online case, we design an online duty cycling algorithm, which achieves the approximation ratio with at least $1-e^{-\gamma^2}$, where $\gamma$ is the probability able to harvest energy. We also evaluate our algorithms with the experiment on a real energy harvesting network. The experiment results show that the performance of the online algorithm can be very close to the offline algorithm.