Chao Sha

Dr. Chao Sha

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
29 June 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
PWPengfei Wu
Pengfei Wu
FXFu Xiao
Fu Xiao
Haiping HuangHaiping Huang
Haiping Huang
CSChao Sha
Chao Sha
SYShui Yu
Shui Yu
This paper studies a multiple unmanned aerial vehicles (multi-UAVs) enabled wireless powered Internet of Things (IoT), where a group of UAVs is dispatched as mobile power sources to charge a set of ground IoT devices. Different from the conventional radio frequency (RF) wireless power transfer (WPT) systems, magnetic resonance-coupled (MRC) WPT systems can guarantee high power transfer efficiency without the complete alignment, which is remarkable. In this paper, we extend the charging range by the wired connection between the energy receiving systems and IoT devices. Due to the restriction of carriable energy on the UAVs, designing the shortest possible trajectory for each UAV is necessary. We formulate it as a multi-depots multi-UAVs trajectory optimization problem, jointly with constraints of the UAV’s energy capacity and the area of the target region, to maximize the resource utilization of UAVs. To tackle this non-convex problem, we decompose it into two subproblems, i.e., hovering locations selection and multi-UAVs trajectory optimization. For the first subproblem, we propose two approximation algorithms to obtain the near-optimal solution in the sparse networks. Then we adopt a heuristic algorithm, Memetic Algorithm based Variable Neighborhood Search (MAVNS), to achieve the quasi-optimal trajectory rapidly. Finally, extensive numerical results are provided to evaluate the performance of the proposed algorithms. New insights are investigated on the estimation of feasibility that whether the given UAVs with energy capacity constraint can fully charge ground IoT devices within open areas.

15 March 2010 in Sensors
Verified
Journal Article
Open access
PDF file
GFGaojuan Fan
Gaojuan Fan
RWRuchuan Wang
Ruchuan Wang
Haiping HuangHaiping Huang
Haiping Huang
LSLijuan Sun
Lijuan Sun
CSChao Sha
Chao Sha
Deployment quality and cost are two conflicting aspects in wireless sensor networks. Random deployment, where the monitored field is covered by randomly and uniformly deployed sensor nodes, is an appropriate approach for large-scale network applications. However, their successful applications depend considerably on the deployment quality that uses the minimum number of sensors to achieve a desired coverage. Currently, the number of sensors required to meet the desired coverage is based on asymptotic analysis, which cannot meet deployment quality due to coverage overestimation in real applications. In this paper, we first investigate the coverage overestimation and address the challenge of designing coverage-guaranteed deployment strategies. To overcome this problem, we propose two deployment strategies, namely, the Expected-area Coverage Deployment (ECD) and BOundary Assistant Deployment (BOAD). The deployment quality of the two strategies is analyzed mathematically. Under the analysis, a lower bound on the number of deployed sensor nodes is given to satisfy the desired deployment quality. We justify the correctness of our analysis through rigorous proof, and validate the effectiveness of the two strategies through extensive simulation experiments. The simulation results show that both strategies alleviate the coverage overestimation significantly. In addition, we also evaluate two proposed strategies in the context of target detection application. The comparison results demonstrate that if the target appears at the boundary of monitored region in a given random deployment, the average intrusion distance of BOAD is considerably shorter than that of ECD with the same desired deployment quality. In contrast, ECD has better performance in terms of the average intrusion distance when the invasion of intruder is from the inside of monitored region.

6 June 2017 in Sensors
Verified
Journal Article
Open access
PDF file
PWPeng-Fei Wu
Peng-Fei Wu
FXFu Xiao
Fu Xiao
CSChao Sha
Chao Sha
Haiping HuangHaiping Huang
Haiping Huang
RWRuchuan Wang
Ruchuan Wang
Neal XiongNeal Xiong
Neal Xiong
Unlike conventional scalar sensors, camera sensors at different positions can capture a variety of views of an object. Based on this intrinsic property, a novel model called full-view coverage was proposed. We study the problem that how to select the minimum number of sensors to guarantee the full-view coverage for the given region of interest (ROI). To tackle this issue, we derive the constraint condition of the sensor positions for full-view neighborhood coverage with the minimum number of nodes around the point. Next, we prove that the full-view area coverage can be approximately guaranteed, as long as the regular hexagons decided by the virtual grid are seamlessly stitched. Then we present two solutions for camera sensor networks in two different deployment strategies. By computing the theoretically optimal length of the virtual grids, we put forward the deployment pattern algorithm (DPA) in the deterministic implementation. To reduce the redundancy in random deployment, we come up with a local neighboring-optimal selection algorithm (LNSA) for achieving the full-view coverage. Finally, extensive simulation results show the feasibility of our proposed solutions.

3 February 2020 in IEEE Access
Verified
Journal Article
Open access
WWWenming Wang
Wenming Wang
Haiping HuangHaiping Huang
Haiping Huang
QLQi Li
Qi Li
FHFan He
Fan He
CSChao Sha
Chao Sha
Intrusion detection as one of the most important approaches to guarantee wireless sensing network security has been studied adequately in previous work. However, with the development of electronic anti-reconnaissance technology, the intruder may obtain the location information of detection nodes and perform path planning to avoid being detected. Such intruder is defined as an “empowered intruder” who will bring new challenges for traditional intrusion detection methods. Moreover, some subareas may have coverage holes due to random initial deployment of detection nodes, the desired effect of detection cannot be achieved. To address these issues, we propose a vehicle collaboration sensing network model, where mobile sensing vehicles and static sensor nodes cooperate to provide intrusion detection against empowered intruders. Our proposal (named as IDEI) consists of a target pursuit algorithm of mobile sensing vehicles and a sleep-scheduling strategy of static nodes. Mobile sensing vehicles will track the empowered intruder and fill up the coverage breaches, while static nodes follow a sleep-scheduling mechanism and will be awakened by detection nodes nearby when the intruder is detected. Simulation experiments are conducted to compare our proposal with existing methods such as KMsn and MTTA in terms of intrusion detection performance, energy consumption and moving distance of sensor nodes. The parameter sensitivity of IDEI is also studied with extensive simulations. The theoretical analysis and simulation results indicate that our proposal can achieve better efficiency and availability.

28 August 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
CSChao Sha
Chao Sha
DSDandan Song
Dandan Song
RMReza Malekian
Reza Malekian
The issue of using vehicles to wirelessly recharge nodes for energy supplement in Wireless Sensor Networks has become a research hotspot in recent works. Unfortunately, most of the researches did not consider the rationality of the recharging request threshold and also overlooked the difference of node’s power consumption, which may lead to premature death of nodes as well as low efficiency of Wireless Charging Vehicles(WCVs). In order to solve the above problems, a Periodic and Distributed Energy Supplement Method based on maximum recharging benefit (PDESM) is proposed in this paper. Firstly, to avoid frequent recharging requests from nodes, we put forward an annuluses based cost-balanced data uploading strategy under deterministic deployment. Then, one WCV in each annulus periodically selects and recharges nodes located in this region which send the energy supplement requests. In addition, the predicted value of power consumption of nodes are calculated out according to the real-time energy consumption rate, and thus the most appropriate recharging request threshold is obtained. Finally, a moving path optimization scheme based on Minimum Spanning Tree is constructed for distributed recharging. Simulation results show that, PDESM performs well on enhancing the proportion of the alive nodes as well as the wireless recharging efficiency compared with NFAOC and FCFS. Moreover, it also has advantage in balancing the energy consumption of WCVs.

30 December 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
CSChao Sha
Chao Sha
YSYang Sun
Yang Sun
RMReza Malekian
Reza Malekian