Jelena Mišić
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jelena Mišić has a total of 92 co-authors. Here are the top co-authors by number of shared publications:
- Vojislav B. Misic
Department of Computer Science, Toronto Metropolitan University, Toronto, ON, Canada
81 shared publications - Xiaolin Chang
Beijing Jiaotong University
49 shared publications - Junchao Fan
Beijing Jiaotong University
9 shared publications Vojislav B. Misic
9 shared publications- Runkai Yang
Beijing Key Laboratory of Security and Privacy in Intelligent Transportation, Beijing Jiaotong University, Beijing, China
7 shared publications - Hongyue Kang
Dept Intelligent Supply Chain, JD Logist, Beijing, China
6 shared publications
Latest Publications
- 8 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 9223-9246
Multi-Tier Sharding Architecture for Permissioned Blockchains
Sharding is a technique to divide a blockchain network into smaller segments or “shards,” with the aim of improving scalability and performance by allowing each shard to independently process transactions. Existing sharding approaches face challenges with cross-shard transactions, which add significant overhead and compromise the integrity and consistency of transactions, thus impacting overall performance. To address these issues, we introduce a novel multi-tier sharding blockchain architecture that enhances scalability and efficiency. In this approach, transactions in which all participating nodes belong to the same shard are validated locally in that shard, whereas transactions where those nodes belong to different shards are validated at both the local and higher levels. At all levels, validation is achieved through separate Practical Byzantine Fault Tolerance (PBFT) consensus rounds, which ensures balanced processing and improves transaction throughput across the network. We demonstrate the efficiency of our model through analytical models, which show marked improvements in response times and throughput, while maintaining the fundamental attributes of security and decentralization in blockchain technology.
- 8 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 9223-9246
Multi-Tier Sharding Architecture for Permissioned Blockchains
Sharding is a technique to divide a blockchain network into smaller segments or “shards,” with the aim of improving scalability and performance by allowing each shard to independently process transactions. Existing sharding approaches face challenges with cross-shard transactions, which add significant overhead and compromise the integrity and consistency of transactions, thus impacting overall performance. To address these issues, we introduce a novel multi-tier sharding blockchain architecture that enhances scalability and efficiency. In this approach, transactions in which all participating nodes belong to the same shard are validated locally in that shard, whereas transactions where those nodes belong to different shards are validated at both the local and higher levels. At all levels, validation is achieved through separate Practical Byzantine Fault Tolerance (PBFT) consensus rounds, which ensures balanced processing and improves transaction throughput across the network. We demonstrate the efficiency of our model through analytical models, which show marked improvements in response times and throughput, while maintaining the fundamental attributes of security and decentralization in blockchain technology.
- 8 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 9155-9169
Analysis of QoS in Networks of Quantum Repeaters
In this work we consider a quantum network consisting of multiple interconnected quantum repeaters. In this network, data plane of communication is achieved by photon transmission over fibre cables, while the control plane which transmits results of measurements and control information is implemented over classical Internet. Important part of the control plane is the server which distributes connection requests and entanglement resources to nodes involved in the path. Together, data and control plane establish reliable multi hop links over the network deploying purification and swapping operations. We analyze the performance of such a network using probabilistic model of communication time between repeaters, rather than slotted time. We consider random arrivals of connection requests to each repeater and variable path lengths. We model a single repeater using theory of $M^{[x]}/G/m+r$ queues where each batch request encompasses heralding, purification, and swapping times pertaining to a single repeater node. To model the network, we have used the concept of Jackson's network over repeater nodes in the path. This model allows derivation of end-to-end entanglement delivery time as random distribution and calculation of probability of decoherence of qubits stored in quantum memories over the path. We considered different numbers of entanglements per request and different types of quantum memories. Results of this analysis are useful for dimensioning capacities of quantum repeaters, memories and links in order to avoid decoherence of quantum memories.
- 8 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 9155-9169
Analysis of QoS in Networks of Quantum Repeaters
In this work we consider a quantum network consisting of multiple interconnected quantum repeaters. In this network, data plane of communication is achieved by photon transmission over fibre cables, while the control plane which transmits results of measurements and control information is implemented over classical Internet. Important part of the control plane is the server which distributes connection requests and entanglement resources to nodes involved in the path. Together, data and control plane establish reliable multi hop links over the network deploying purification and swapping operations. We analyze the performance of such a network using probabilistic model of communication time between repeaters, rather than slotted time. We consider random arrivals of connection requests to each repeater and variable path lengths. We model a single repeater using theory of $M^{[x]}/G/m+r$ queues where each batch request encompasses heralding, purification, and swapping times pertaining to a single repeater node. To model the network, we have used the concept of Jackson's network over repeater nodes in the path. This model allows derivation of end-to-end entanglement delivery time as random distribution and calculation of probability of decoherence of qubits stored in quantum memories over the path. We considered different numbers of entanglements per request and different types of quantum memories. Results of this analysis are useful for dimensioning capacities of quantum repeaters, memories and links in order to avoid decoherence of quantum memories.
- 24 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (12) , 26408-26423
Performance Evaluation of Communication With a UAV as a LoRaWAN Bridge
The integration of low-power wide-area networks (LPWANs) with uncrewed aerial vehicles (UAVs) is a viable solution to address connectivity challenges in remote or disaster-affected areas. In this article, we introduce and model a scheme, where a UAV with a LoRaWAN interface interconnects two distant clusters of nodes. We present a mathematical performance evaluation of the network under varying spreading factors (SFs) and packet-arrival rates. Our results reveal that increasing packet-arrival rates and SFs enhances success probability up to a certain threshold, beyond which congestion effects degrade network performance. Furthermore, we show the effect of UAV mobility on the network in multivacation scenarios. These insights contribute to optimizing UAV-assisted LPWAN deployments, particularly in the Internet of Things (IoT) applications for emergency response and remote monitoring.
- 24 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (12) , 26408-26423
Performance Evaluation of Communication With a UAV as a LoRaWAN Bridge
The integration of low-power wide-area networks (LPWANs) with uncrewed aerial vehicles (UAVs) is a viable solution to address connectivity challenges in remote or disaster-affected areas. In this article, we introduce and model a scheme, where a UAV with a LoRaWAN interface interconnects two distant clusters of nodes. We present a mathematical performance evaluation of the network under varying spreading factors (SFs) and packet-arrival rates. Our results reveal that increasing packet-arrival rates and SFs enhances success probability up to a certain threshold, beyond which congestion effects degrade network performance. Furthermore, we show the effect of UAV mobility on the network in multivacation scenarios. These insights contribute to optimizing UAV-assisted LPWAN deployments, particularly in the Internet of Things (IoT) applications for emergency response and remote monitoring.
- 17 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 7718-7736
Multimessage Paxos With Priorities and Aging for Blockchain Applications
This paper extends the Paxos consensus algorithm by introducing preemptive priority scheduling with support for multiple proposal priorities, alongside an aging-based promotion mechanism to restore fairness and prevent starvation of lower-priority proposals. These enhancements address scenarios where proposals have heterogeneous urgency levels, which are common in blockchain and real-time distributed systems. Introducing priorities allows the protocol to expedite time-sensitive requests, while aging ensures that long-waiting low-priority proposals are eventually processed, thus improving fairness without compromising safety or liveness guarantees. We introduce a novel preemption-based aging mechanism that improves fairness based on actual contention dynamics rather than time. We analytically model the operation of the proposed algorithm using preemptive priority queueing disciplines, particularly the preemptive repeat different model, allowing for flexible and realistic handling of urgent proposals with variable service times. Our results demonstrate that multimessage handling combined with aging significantly improves both fairness and efficiency in consensus operation, especially under high-load conditions.
- 17 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 7718-7736
Multimessage Paxos With Priorities and Aging for Blockchain Applications
This paper extends the Paxos consensus algorithm by introducing preemptive priority scheduling with support for multiple proposal priorities, alongside an aging-based promotion mechanism to restore fairness and prevent starvation of lower-priority proposals. These enhancements address scenarios where proposals have heterogeneous urgency levels, which are common in blockchain and real-time distributed systems. Introducing priorities allows the protocol to expedite time-sensitive requests, while aging ensures that long-waiting low-priority proposals are eventually processed, thus improving fairness without compromising safety or liveness guarantees. We introduce a novel preemption-based aging mechanism that improves fairness based on actual contention dynamics rather than time. We analytically model the operation of the proposed algorithm using preemptive priority queueing disciplines, particularly the preemptive repeat different model, allowing for flexible and realistic handling of urgent proposals with variable service times. Our results demonstrate that multimessage handling combined with aging significantly improves both fairness and efficiency in consensus operation, especially under high-load conditions.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 6826-6835
Deadline-Aware SRPT Scheduling for Paxos Consensus
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 6826-6835
Deadline-Aware SRPT Scheduling for Paxos Consensus
- 22 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (24) , 52644-52657
Lightweight Certificateless Authentication Scheme With Enhanced Privacy for CAVs
Connected autonomous vehicles (CAVs) represent a transformative advancement in transportation, offering enhanced safety, improved traffic efficiency, and reduced environmental impact through intelligent driving. As CAVs operate without human intervention, they heavily rely on secure vehicle-to-vehicle (V2V) communication for cooperative perception and coordinated decision-making. These real-time inter-vehicle exchanges underpin safe coordination, dynamic decision-making, and collision avoidance. To ensure trust in such communication, robust and efficient authentication mechanisms are essential. However, existing schemes often fall short in terms of security resilience and operational practicality. In this article, we propose a novel certificateless signature scheme with conditional privacy-preserving authentication (CLSS-CPPA) tailored to CAV environments. The proposed scheme addresses three fundamental limitations in existing schemes: signature forgery vulnerabilities, single-authority dependency, and lack of dynamic revocation capability. Our approach employs distributed key generation to prevent signature forgery attacks, uses prefix tree structures for efficient dynamic key revocation, and implements dual-agency pseudonym management with mutual authority constraints to prevent single-entity power abuse. Lightweight cryptographic operations are also adopted to suit resource-constrained vehicular systems. Formal security analysis and extensive evaluations demonstrate that CLSS-CPPA enhances privacy preserving and reduces signing and verifying costs by 20%–90% compared to state-of-the-art schemes, making it a promising solution for real-world CAV deployments.
- 22 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (24) , 52644-52657
Lightweight Certificateless Authentication Scheme With Enhanced Privacy for CAVs
Connected autonomous vehicles (CAVs) represent a transformative advancement in transportation, offering enhanced safety, improved traffic efficiency, and reduced environmental impact through intelligent driving. As CAVs operate without human intervention, they heavily rely on secure vehicle-to-vehicle (V2V) communication for cooperative perception and coordinated decision-making. These real-time inter-vehicle exchanges underpin safe coordination, dynamic decision-making, and collision avoidance. To ensure trust in such communication, robust and efficient authentication mechanisms are essential. However, existing schemes often fall short in terms of security resilience and operational practicality. In this article, we propose a novel certificateless signature scheme with conditional privacy-preserving authentication (CLSS-CPPA) tailored to CAV environments. The proposed scheme addresses three fundamental limitations in existing schemes: signature forgery vulnerabilities, single-authority dependency, and lack of dynamic revocation capability. Our approach employs distributed key generation to prevent signature forgery attacks, uses prefix tree structures for efficient dynamic key revocation, and implements dual-agency pseudonym management with mutual authority constraints to prevent single-entity power abuse. Lightweight cryptographic operations are also adopted to suit resource-constrained vehicular systems. Formal security analysis and extensive evaluations demonstrate that CLSS-CPPA enhances privacy preserving and reduces signing and verifying costs by 20%–90% compared to state-of-the-art schemes, making it a promising solution for real-world CAV deployments.
- 5 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 1406-1422
Multi-Authorized, Privacy-Protected, and Traceable Driverless Taxi Data Sharing in Internet of Vehicles
Advanced wireless communication and artificial intelligence technologies are significantly facilitating the deployment of driverless taxis (DTs). To ensure high-quality of DT services, data sharing among DTs is essential during service provision. However, at least three key challenges are then raised in terms of security and privacy: 1) guaranteeing data authenticity with traceability; 2) enabling flexible data authorization and preserving privacy amid complex data ownership; and 3) protecting DT privacy under frequent data sharing. Most existing works address only one aspect, such as data authenticity, privacy preservation, or single-entity authorization. To address these challenges, we propose a novel Multi-authorized, Privacy-protected, and Traceable Data Sharing (MPTDS) scheme for DTs. Firstly, MPTDS upholds data privacy preservation by designing the data sharing credential for each DT and the data access credential for each service provider. Data sharing credential also ensures anonymity and unlinkability of DTs. Secondly, MPTDS ensures data integrity and origin authentication by designing the credential-based authentication technique for DT, which also enables the traceability. Additionally, MPTDS facilitates the data multi-authorization by designing the data sharing credential multi-party issuance technique without sacrificing the non-frameabiltiy. We conduct security analyses and performance evaluations to validate the security properties and practicality of MPTDS.
- 5 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 1406-1422
Multi-Authorized, Privacy-Protected, and Traceable Driverless Taxi Data Sharing in Internet of Vehicles
Advanced wireless communication and artificial intelligence technologies are significantly facilitating the deployment of driverless taxis (DTs). To ensure high-quality of DT services, data sharing among DTs is essential during service provision. However, at least three key challenges are then raised in terms of security and privacy: 1) guaranteeing data authenticity with traceability; 2) enabling flexible data authorization and preserving privacy amid complex data ownership; and 3) protecting DT privacy under frequent data sharing. Most existing works address only one aspect, such as data authenticity, privacy preservation, or single-entity authorization. To address these challenges, we propose a novel Multi-authorized, Privacy-protected, and Traceable Data Sharing (MPTDS) scheme for DTs. Firstly, MPTDS upholds data privacy preservation by designing the data sharing credential for each DT and the data access credential for each service provider. Data sharing credential also ensures anonymity and unlinkability of DTs. Secondly, MPTDS ensures data integrity and origin authentication by designing the credential-based authentication technique for DT, which also enables the traceability. Additionally, MPTDS facilitates the data multi-authorization by designing the data sharing credential multi-party issuance technique without sacrificing the non-frameabiltiy. We conduct security analyses and performance evaluations to validate the security properties and practicality of MPTDS.
- 17 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (11) , 20249-20263
A2E: Attribute-Based Anonymity-Enhanced Authentication for Accessing Driverless Taxi Service
Driverless taxis (DTs) are gaining attention for their potential to improve urban transportation efficiency. However, unforeseen incidents caused by unsupervised users and the personalized needs of passengers in DTs highlight the need for authenticating user identities and attributes. Additionally, protecting user privacy while enabling rapid traceability of malicious users remains a challenge for the widespread adoption of DTs. This paper proposes a novel Attribute-based Anonymity Enhanced (A2E) authentication scheme for users to access DT services. The security capabilities of A2E include: 1) A2E is attribute-based authentication, which is achieved by designing a user attribute credential. Meanwhile, this attribute credential also satisfies unlinkability. And 2) A2E has enhanced anonymity, which is achieved by designing a decentralized credential issuance mechanism, safeguarding user attributes from association with anonymous identities. Moreover, this mechanism provides traceability and non-frameability to users. From the performance aspect, A2E causes low overhead when tracing malicious users and updating credentials. Besides, both scalability and lightweight are satisfied, which contributes to A2E’s practicability. We conduct security and performance analysis to validate these capabilities.
- 17 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (11) , 20249-20263
A2E: Attribute-Based Anonymity-Enhanced Authentication for Accessing Driverless Taxi Service
Driverless taxis (DTs) are gaining attention for their potential to improve urban transportation efficiency. However, unforeseen incidents caused by unsupervised users and the personalized needs of passengers in DTs highlight the need for authenticating user identities and attributes. Additionally, protecting user privacy while enabling rapid traceability of malicious users remains a challenge for the widespread adoption of DTs. This paper proposes a novel Attribute-based Anonymity Enhanced (A2E) authentication scheme for users to access DT services. The security capabilities of A2E include: 1) A2E is attribute-based authentication, which is achieved by designing a user attribute credential. Meanwhile, this attribute credential also satisfies unlinkability. And 2) A2E has enhanced anonymity, which is achieved by designing a decentralized credential issuance mechanism, safeguarding user attributes from association with anonymous identities. Moreover, this mechanism provides traceability and non-frameability to users. From the performance aspect, A2E causes low overhead when tracing malicious users and updating credentials. Besides, both scalability and lightweight are satisfied, which contributes to A2E’s practicability. We conduct security and performance analysis to validate these capabilities.
- 28 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (5) , 4681-4693
Paxos With Priorities for Blockchain Applications
Paxos is a well known protocol for state machine replication and consensus in face of crash faults. However, it suffers from inefficiencies in request handling, particularly in scenarios requiring preemptive prioritization. To address this, we propose a priority-aware extension similar to MultiPaxos and evaluate its performance using a queuing model, and show the improvement in performance metrics such as mean completion and waiting times. Our results demonstrate that integrating prioritization mechanisms into Paxos reduces latency for high-priority requests while ensuring fairness. The aging-based approach maintains correctness of the consensus process while adding flexibility to manage time-sensitive distributed applications such as permissioned blockchains.
- 28 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (5) , 4681-4693
Paxos With Priorities for Blockchain Applications
Paxos is a well known protocol for state machine replication and consensus in face of crash faults. However, it suffers from inefficiencies in request handling, particularly in scenarios requiring preemptive prioritization. To address this, we propose a priority-aware extension similar to MultiPaxos and evaluate its performance using a queuing model, and show the improvement in performance metrics such as mean completion and waiting times. Our results demonstrate that integrating prioritization mechanisms into Paxos reduces latency for high-priority requests while ensuring fairness. The aging-based approach maintains correctness of the consensus process while adding flexibility to manage time-sensitive distributed applications such as permissioned blockchains.