About

Jingjie Hu is an Assistant Professor in the Department of Mechanical and Aerospace Engineering at NC State University. Her research focuses on the mechanical behavior of biomedical and biological materials, emphasizing the design, fabrication, and characterization of bio-related structures through integrated mechanics, materials, and bioengineering approaches. Her work combines experimental and theoretical tools to enable the prediction of mechanical behaviors at nano-, micro-, and macro-scales. Dr. Hu's research is highly interdisciplinary and aims to impact critical biomedical applications such as cancer detection and vascular embolization. She received her Ph.D. from Princeton University and her B.S.E. from the University of Michigan, both in mechanical engineering. Prior to her current position, she completed postdoctoral training in translational bioengineering at Mayo Clinic.

Research topics

• Computer Science
• Computer network
• Telecommunications
• Parallel computing
• Physics
• Distributed computing
• Mathematics
• Economics
• Mathematical analysis

Selected publications

• Adaptive security protocol for financial management networks in multi-server environments

  Frontiers in Physics · 2025-03-24 · 1 citations

  articleOpen access1st authorCorresponding

  Driven by the digital wave, the security and efficiency of financial management networks are key factors determining the competitiveness and sustainable development of enterprises. Faced with complex and ever-changing network threats in multi-server environments, traditional static security strategies are no longer sufficient to meet the security needs of modern enterprises. It is particularly important to develop a security protocol that can adapt to environmental changes and defend against potential threats. Therefore, we propose a lightweight adaptive security protocol for financial management networks in multi-server environments. This protocol uses a hash function to negotiate session keys at low computation and communication overhead, effectively protecting the transmission security of confidential messages. In addition, informal and formal analysis proves that this protocol has high security and can resist various network attack methods. We demonstrate the efficiency of the protocol in practical applications through performance comparisons. It not only has low communication overhead and good computational efficiency but also achieves lightweight message transmission, making it easy to deploy and use in multi-server environments.

  PublisherOA PDFDOI

• Bi-SIS Epidemics on Graphs - Quantitative Analysis of Coexistence Equilibria

  2022 IEEE 61st Conference on Decision and Control (CDC) · 2022 · 2 citations

  • Computer Science
  • Computer Science
  • Mathematics

  We consider a system in which two viruses of the Susceptible-Infected-Susceptible (SIS) type compete over general, overlaid graphs. While such systems have been the focus of many recent works, they have mostly been studied in the sense of convergence analysis, with no existing results quantifying the non-trivial coexistence equilibria (CE) - that is, when both competing viruses maintain long term presence over the network. In this paper, we prove monotonicity of the CE with respect to effective infection rates of the two viruses, and provide the first quantitative analysis of such equilibria in the form of upper bounds involving spectral radii of the underlying graphs, as well as positive equilibria of related single-virus systems. Our results provide deeper insight into how the long term infection probabilities are affected by system parameters, which we further highlight via numerical results.

  PublisherDOI

• Minimizing File Transfer Time in Opportunistic Spectrum Access Model

  IEEE Transactions on Mobile Computing · 2022-10-10 · 1 citations

  articleOpen access1st authorCorresponding

  We study the file transfer problem in opportunistic spectrum access (OSA) model, which has been widely studied in throughput-oriented applications for max-throughput strategies and in delay-related works that commonly assume identical channel rates and fixed file sizes. Our work explicitly considers minimizing the file transfer time for a given file in a set of heterogeneous-rate Bernoulli channels, showing that max-throughput policy doesn't minimize file transfer time in general. We formulate a mathematical framework for static extend to dynamic policies by mapping our file transfer problem to a stochastic shortest path problem. We analyze the performance of our proposed static and dynamic optimal policies over the max-throughput policy. We propose a mixed-integer programming formulation as an efficient alternative way to obtain the dynamic optimal policy and show a huge reduction in computation time. Then, we propose a heuristic policy that takes into account the performance-complexity tradeoff and consider the online implementation with unknown channel parameters. Furthermore, we present numerical simulations to support our analytical results and discuss the effect of switching delay on different policies. Finally, we extend the file transfer problem to Markovian channels and demonstrate the impact of the correlation of each channel.

  PublisherOA PDFDOI

• Performance Analysis and Improvement on DSRC Application for V2V Communication

  arXiv (Cornell University) · 2021-02-13

  preprintOpen access

  In this paper, we focus on the performance of vehicle-to-vehicle (V2V) communication adopting the Dedicated Short Range Communication (DSRC) application in periodic broadcast mode. An analytical model is studied and a fixed point method is used to analyze the packet delivery ratio (PDR) and mean delay based on the IEEE 802.11p standard in a fully connected network under the assumption of perfect PHY performance. With the characteristics of V2V communication, we develop the Semi-persistent Contention Density Control (SpCDC) scheme to improve the DSRC performance. We use Monte Carlo simulation to verify the results obtained by the analytical model. The simulation results show that the packet delivery ratio in SpCDC scheme increases more than 10% compared with IEEE 802.11p in heavy vehicle load scenarios. Meanwhile, the mean reception delay decreases more than 50%, which provides more reliable road safety.

  PublisherOA PDFDOI

• Opportunistic Spectrum Access: Does Maximizing Throughput Minimize File Transfer Time?

  2021 · 1 citations

  1st authorCorresponding
  • Computer Science
  • Computer Science
  • Distributed computing

  The Opportunistic Spectrum Access (OSA) model has been developed for the secondary users (SUs) to exploit the stochastic dynamics of licensed channels for file transfer in an opportunistic manner. Common approaches to design channel sensing strategies for throughput-oriented applications tend to maximize the long-term throughput, with the hope that it provides reduced file transfer time as well. In this paper, we show that this is not correct in general, especially for small files. Unlike prior delay-related works that seldom consider the heterogeneous channel rate and bursty incoming packets, our work explicitly considers minimizing the file transfer time of a single file consisting of multiple packets in a set of heterogeneous channels. We formulate a mathematical framework for the static policy, and extend to dynamic policy by mapping our file transfer problem to the stochastic shortest path problem. We analyze the performance of our proposed static optimal and dynamic optimal policies over the policy that maximizes long-term throughput. We then propose a heuristic policy that takes into account the performance-complexity tradeoff and an extension to online implementation with unknown channel parameters, and also present the regret bound for our online algorithm. We also present numerical simulations that reflect our analytical results.

  PublisherOA PDFDOI

• Opportunistic Spectrum Access: Does Maximizing Throughput Minimize File Transfer Time?

  arXiv (Cornell University) · 2021-09-23

  preprintOpen access1st authorCorresponding

  The Opportunistic Spectrum Access (OSA) model has been developed for the secondary users (SUs) to exploit the stochastic dynamics of licensed channels for file transfer in an opportunistic manner. Common approaches to design channel sensing strategies for throughput-oriented applications tend to maximize the long-term throughput, with the hope that it provides reduced file transfer time as well. In this paper, we show that this is not correct in general, especially for small files. Unlike prior delay-related works that seldom consider the heterogeneous channel rate and bursty incoming packets, our work explicitly considers minimizing the file transfer time of a single file consisting of multiple packets in a set of heterogeneous channels. We formulate a mathematical framework for the static policy, and extend to dynamic policy by mapping our file transfer problem to the stochastic shortest path problem. We analyze the performance of our proposed static optimal and dynamic optimal policies over the policy that maximizes long-term throughput. We then propose a heuristic policy that takes into account the performance-complexity tradeoff and an extension to online implementation with unknown channel parameters, and also present the regret bound for our online algorithm. We also present numerical simulations that reflect our analytical results.

  PublisherDOI

• Performance Analysis and Improvement on DSRC Application for V2V Communication

  2020 · 25 citations

  • Computer Science
  • Computer Science
  • Computer network

  In this paper, we focus on the performance of vehicle-to-vehicle (V2V) communication adopting the Dedicated Short Range Communication (DSRC) application in periodic broadcast mode. An analytical model is studied and a fixed point method is used to analyze the packet delivery ratio (PDR) and mean delay based on the IEEE 802.11p standard in a fully connected network under the assumption of perfect PHY performance. With the characteristics of V2V communication, we develop the Semi-persistent Contention Density Control (SpCDC) scheme to improve the DSRC performance. We use Monte Carlo simulation to verify the results obtained by the analytical model. The simulation results show that the packet delivery ratio in SpCDC scheme increases more than 10% compared with IEEE 802.11p in heavy vehicle load scenarios. Meanwhile, the mean reception delay decreases more than 50%, which provides more reliable road safety.

  PublisherDOI

• NB-IoT Technology based on Cellular Network

  2017-01-01 · 2 citations

  articleOpen access

  Narrowband Internet of Things has great advantage over low speed rate, which is a new cellular technology based on 3GPP Release 13 standard. NB-IoT plays an extremely important role in the era of all things interconnected as a technology of low power consumption and wide area coverage of LPWAN (Low Power Wide Area Network). This paper mainly discusses the technical superiority, standard and technical principle of NB-IoT, and proposes a set of research area based on agriculture applications.

  PublisherOA PDFDOI

• Research Data: Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks

  ePrints Soton (University of Southampton) · 2016-01-01

  datasetOpen access

  This DOI contains the datasets of Figures 7,8,12-17 of the paper titled "Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks". Each folder is named according to the corresponding figure, where the dataset of each curve is stored in a .dat file. To regenerate the figures please use the command "gle Figure_Name.gle" (Graphics Layout Engine -GLE- should be installed on your machine). Paper Abstract: The widespread use of mobile networking devices, such as smart phones and tablets, has substantially increased the number of nodes in the the operational networks. These devices often suffer from the lack of power and bandwidth. Hence, we have to optimize their message-routing for the sake of maximizing their capabilities. However, the optimal routing typically relies on a delicate balance of diverse and often conflicting objectives, such as the route's delay and power consumption. The network design also has to consider the nodes' user-centric social behavior. Hence, the employment of socially-aware load balancing becomes imperative for avoiding the potential formation of bottlenecks in the network's packet-flow. In this treatise, we propose a novel algorithm, referred to as the \emph{Multi-Objective Decomposition Quantum Optimization} (MODQO) algorithm, which exploits the Quantum Parallelism to its full potential by reducing the database correlations for performing multi-objective routing optimization, while at the same time balancing the tele-traffic load among the nodes without imposing a substantial degradation on the network's delay and power consumption. Furthermore, we introduce a novel socially aware load balancing metric, namely the normalized entropy of the normalized composite betweenness of the associated socially-aware network, for striking a better trade-off between the network's delay and power consumption. We analytically prove that the MODQO algorithm achieves the full-search based accuracy at a significantly reduced complexity, which is several orders of magnitude lower than that of the full-search. Finally, we compare the MODQO algorithm to the classic NSGA-II evolutionary algorithm and demonstrate that the MODQO succeeds in halving the network's average delay, whilst simultaneously reducing the network's average power consumption by 6 dB without increasing the computational complexity.

  PublisherOA PDFDOI

• Spanning Tree Protocol (STP) Application of the Inter-Chassis Communication Protocol (ICCP)

  2016-01-01 · 5 citations

  reportSenior author

  The Inter-Chassis Communication Protocol (ICCP) supports an inter- chassis redundancy mechanism that is used to support high network availability. In this document, Provider Edge (PE) devices in a Redundancy Group (RG) running ICCP are used to offer multihomed connectivity to Spanning Tree Protocol (STP) networks to improve availability of the STP networks. The ICCP TLVs and usage for the ICCP STP application are defined.

  PublisherDOI

Frequent coauthors

• Zhenjie Wang

  Heilongjiang Earthquake Agency

  4 shared

• Ying Wang

  Hainan University

  4 shared

• Do Young Eun

  North Carolina State University

  4 shared

• Vishwaraj Doshi

  IQVIA (United Kingdom)

  4 shared

• M.B. Steer

  North Carolina State University

  4 shared

• Yueju Xue

  South China Agricultural University

  4 shared

• Xing Xu

  Zhangzhou Normal University

  4 shared

• Kevin G. Gard

  Analog Devices (United States)

  3 shared

Education

• Ph.D., Electrical and Computer Engineering

  North Carolina State University

  2025

• M.S., Electrical Engineering and Computer Science

  Northwestern University

  2019

• B.E., Communication Engineering

  Wuhan University of Technology

  2016