Jianping Zhu

Dr. Jianping Zhu


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
30 January 2011 in Wireless Personal Communications
Verified
Journal Article
Closed access
PDF file
JZJianping Zhu
Jianping Zhu
ZTZhengsu Tao
Zhengsu Tao
CLChunfeng Lv
Chunfeng Lv

19 April 2012 in Sensors
Verified
Journal Article
Open access
PDF file
JZJianping Zhu
Jianping Zhu
ZTZhengsu Tao
Zhengsu Tao
CLChunfeng Lv
Chunfeng Lv
Studies of the IEEE 802.15.4 Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) scheme have been received considerable attention recently, with most of these studies focusing on homogeneous or saturated traffic. Two novel transmission schemes—OSTS/BSTS (One Service a Time Scheme/Bulk Service a Time Scheme)—are proposed in this paper to improve the behaviors of time-critical buffered networks with heterogeneous unsaturated traffic. First, we propose a model which contains two modified semi-Markov chains and a macro-Markov chain combined with the theory of M/G/1/K queues to evaluate the characteristics of these two improved CSMA/CA schemes, in which traffic arrivals and accessing packets are bestowed with non-preemptive priority over each other, instead of prioritization. Then, throughput, packet delay and energy consumption of unsaturated, unacknowledged IEEE 802.15.4 beacon-enabled networks are predicted based on the overall point of view which takes the dependent interactions of different types of nodes into account. Moreover, performance comparisons of these two schemes with other non-priority schemes are also proposed. Analysis and simulation results show that delay and fairness of our schemes are superior to those of other schemes, while throughput and energy efficiency are superior to others in more heterogeneous situations. Comprehensive simulations demonstrate that the analysis results of these models match well with the simulation results.

1 June 2013 in IET Wireless Sensor Systems
Verified
Journal Article
Open access
PDF file
JZJianping Zhu
Jianping Zhu
ZTZhengsu Tao
Zhengsu Tao
CLChunfeng Lv
Chunfeng Lv
The hidden‐terminal problem and routing establishment or maintenance bring about a tremendous amount of energy consumption in multi‐hop wireless sensor networks (WSNs). In this study, the authors propose a carrier sense multiple access with collision avoidance (CSMA/CA) scheme MultiCSMA for multi‐hop WSNs adopting two strategies which refer to a novel hidden‐terminal list algorithm to avoid the impact of hidden terminals and a parallel access scheme to dispense with taking the routing overhead into account. The accurate statistical performance metrics of throughput and delay of unsaturated, unacknowledged IEEE 802.15.4 beacon enabled networks for one‐hop and two‐hop scenarios are predicted based on Markov models adopting these two improved strategies, in which nodes are assumed to locate randomly over a circle plane according to Poisson distribution. Comprehensive simulations demonstrate that the analysis results match well with the simulation results, and delay performance of the authors schemes is superior to those of other schemes, whereas throughput is superior to others for relative higher node density.