Jianping Pan

Jianping Pan

Auto-generated profile, based on publicly available information

Jianping Pan

University of Victoria

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

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

Representative Publications

View All Publications
14 September 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
XDXia Deng
Xia Deng
LCLe Chang
Le Chang
SZShouyuan Zeng
Shouyuan Zeng
LCLin Cai
Lin Cai
JPJianping Pan
Jianping Pan
Featuring wide coverage and high data rate, LEO satellite networks will be an important supplement to the traditional terrestrial networks, enabling the space-air-ground integrated network service. However, effective load balancing routing strategies for LEO satellite networks need to be designed, due to the bursty characteristic of the network traffic and imbalanced regional communication load. To achieve that, we propose a Distance-based Back-Pressure Routing (DBPR) strategy for LEO satellite networks. DBPR calculates the link weights based on a novel distance-based metric, which can select uncongested short-distance paths to the destinations and distribute network traffic dynamically with low delay. To control the number of forwardings in the network, we restrict the transmission range to a rectangle region between each source-destination pair. We design DBPR in the distributed fashion without collecting the global network load information, which is suitable for LEO satellite networks with limited resources, long propagation delay, dynamic topology, etc. We analyze the network stability and prove the throughput optimality of DBPR. Simulation results demonstrate that DBPR can achieve higher throughput and lower delay, compared with the state-of-the-art strategies, especially in the environments with limited cache resource.

20 November 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JWJingrong Wang
Jingrong Wang
Kaiyang LiuKaiyang Liu
Kaiyang Liu
JPJianping Pan
Jianping Pan
Mobile edge computing has been considered as a promising technology to handle computation-intensive and delay-sensitive tasks in the Internet of Things (IoT) ecosystem such as smart city and smart tourism. However, due to user mobility, edge servers with fixed deployment are not flexible enough to handle time-varying user tasks in hot-spot areas. In this paper, a novel online unmanned aerial vehicle (UAV)-mounted edge server dispatching scheme is proposed to provide flexible mobile-to-mobile edge computing services. UAVs are dispatched to the appropriate hover locations by geographically merging tasks into several hot-spot areas. Theoretical analysis guarantees the worst-case performance bound. Extensive evaluation driven by real-world mobile requests shows that while maintaining a good latency fairness, the mobile server dispatching scheme can serve more UEs as well as achieving a high resource utilization. Moreover, the hybrid scheme can satisfy even more user demands while dispatching fewer UAVs with a higher server utilization.

11 April 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JHJianping He
Jianping He
LCLin Cai
Lin Cai
PCPeng Cheng
Peng Cheng
JPJianping Pan
Jianping Pan
LSLing Shi
Ling Shi
Privacy-preserving data aggregation (DA) in ad hoc networks is a challenging problem, considering the distributed communication and control requirement, dynamic network topology, unreliable communication links, etc. Different from the widely used cryptographic approaches, in this paper, we address this challenging problem by exploiting the distributed consensus technique. We first propose a secure consensus-based DA algorithm that guarantees an accurate sum aggregation while preserving the privacy of sensitive data. Then, we prove that the proposed algorithm converges accurately and is $(\epsilon, \sigma)$ -data privacy, and the mathematical relationship between $\epsilon$ and $\sigma$ is provided. Extensive simulations have shown that the proposed algorithm has high accuracy and low complexity, and they are robust against network dynamics.

20 November 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YNYuanzhi Ni
Yuanzhi Ni
JHJianping He
Jianping He
LCLin Cai
Lin Cai
JPJianping Pan
Jianping Pan
YBYuming Bo
Yuming Bo
Internet of vehicles (IoV) is a promising Internet of Things (IoT) application, where Roadside Unit (RSU) plays an important role for network service provisioning. How to select the number and locations of RSUs to deploy and allocate the traffic load to them is a critical and practical open problem. Most of the existing work focused on one-dimensional (1D) scenarios assuming unlimited RSU capacity, while a more practical 2D case with limited RSU capacity has not been fully considered yet. In this paper, we investigate an RSU deployment problem for 2D IoV networks considering the expected delivery delay requirements and task assignment. We formulate a novel utility-based maximization problem to solve the RSU deployment problem, where the utility function indicates the total benefit from the RSU deployment. We observe that each RSU has an irregular service area, which makes the problem much more difficult than the traditional facility location problem. Then, we design a utility-based RSU deployment algorithm (URDA), a Linear Programming (LP) based clustering algorithm, to solve the problem. The gap between URDA and the optimal solution has been analyzed, which proved that the proposed URDA is near optimal if the deployment cost is low. Extensive simulations have been conducted to demonstrate the effectiveness and superiority of the proposed solution for IoV network service guarantee over other approaches.

15 February 2023 in IEEE Transactions on Green Communications and Networking
Verified
Journal Article
Closed access
Yixin HeYixin He
Yixin He
Dawei WangDawei Wang
Dawei Wang
FHFanghui Huang
Fanghui Huang
Ruonan ZhangRuonan Zhang
Ruonan Zhang
XGXin Gu
Xin Gu
JPJianping Pan
Jianping Pan
Providing reliable and flexible emergency communications for the Internet of Vehicles (IoV) is challenging in post-disaster scenarios, especially when communications infrastructures are unavailable or seriously damaged. Under such circumstances, it is highly demanded to deploy the air base station (ABS) to restore connectivity in disaster areas. Although the ABS can offer improved performance, the massive access of communications devices and the rising demand for many emergency-related services will bring new challenges to the ABS-aided IoV. In this paper, we propose a vehicle-to-infrastructure (V2I) and vehicle-to-vehicle (V2V) collaboration framework to support emergency communications. Specifically, we incorporate non-orthogonal multiple access (NOMA) into the ABS-aided IoV. By using the successive interference cancellation (SIC) technique, V2I and V2V links can operate in four spectrum reuse modes, which are the extension of the conventional underlaying reuse mode. To fully exploit the advantages of the NOMA enhanced collaboration framework, we formulate a total power consumption minimization problem by jointly considering the mode selection, power control, and the channel state information (CSI) latency. The formulated problem is constrained by the reliability and rate requirements, and the decoding threshold of the SIC technique. Due to the NP-hard characteristics of the formulated problem, we decouple it first, and then adopt the graphical method to derive the analytical solution of optimal power control policies. Afterwards, we can get every feasible spectrum reuse mode. Among the feasible modes, we select the mode with minimum power consumption as the optimal mode. Finally, simulation results demonstrate that our proposed algorithm outperforms the current works in term of the total power consumption, e.g., by adopting the ABS and the NOMA technology, the total power consumption can be reduced by 22.3% and 40.9%, respectively.

9 May 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JHJianping He
Jianping He
LCLin Cai
Lin Cai
PCPeng Cheng
Peng Cheng
JPJianping Pan
Jianping Pan
LSLing Shi
Ling Shi
Privacy-preserving data aggregation in network systems, e.g., Internet of Things (IoT), is a challenging problem, considering the dynamic network topology, limited computing capacity and energy supply of IoT devices, etc. The difficulty is exaggerated when there exist dishonest nodes, and how to ensure privacy, accuracy, and robustness of the data aggregation process against dishonest nodes remains an open issue. Different from the widely investigated cryptographic approaches, in this paper, we address this challenging problem by exploiting the distributed consensus technique. To mitigate the pollution from dishonest nodes, we propose an enhanced secure consensus-based data aggregation (E-SCDA) algorithm that allows neighbors to detect dishonest nodes, and derive the error bound when there are undetectable dishonest nodes. We prove the convergence of the E-SCDA and show that the algorithm can preserve the privacy associated to nodes’ initial states. Extensive simulations have shown that the proposed algorithm has a high convergence accuracy and low complexity, even when there exist dishonest nodes in the network.