A secure, lightweight, and scalable communication protocol was developed for a 5G-enabled SDN-IoV environment to ensure integrity, trust, and dependability in the SDN-enabled IoV environment.
Abstract
Internet of Vehicle (IoV) uses heterogeneous access technologies to link automobiles and their surroundings. Effective methods are essential for safeguarding data confidentiality and privacy during communication among the roadside unit (RSU), the control room, and vehicles. Many vehicle-to-infrastructure authentication-based approaches have been developed to secure the IoV environment. However, efficiency and security are challenged by instability, decentralization, and transaction-tracking features. To resolve this, a secure, lightweight, and scalable communication protocol was developed for a 5G-enabled SDN-IoV environment. Efficient block verification is achieved through the Joint-Graph Delegated Practical Byzantine Fault Tolerance (JtGr-DPBFT) mechanism, in which validators create subgraphs to reduce communication overhead. JtGr-DPBFT is combined with an Improved Gossip Algorithm (IGA) to minimize message redundancy and optimize bandwidth utilization. Moreover, a lightweight hierarchical authentication mechanism, assisted by a Merkle Tree with Boneh-Lynn-Shacham (HAMT-BLS) signatures, enables compact block verification and minimizes computational and communication costs. The proposed model achieves tamper-proof, efficient, and scalable block verification by incorporating hierarchical authentication with consensus optimization. This approach is simulated in the NS3 tool, and performance is evaluated in terms of propagation delay, transaction confirmation latency, throughput, communication cost, and network delay. Thus, secure and tamper-proof communication is developed to ensure integrity, trust, and dependability in the SDN-enabled IoV environment.
The Internet of Vehicles (IoV) enables vehicles to exchange real-time information using wireless communication and onboard sensors; however, ensuring secure and efficient authentication for large-scale data sharing remains a significant challenge. Current authentication approaches often experience high processing costs, increased memory consumption, and insufficient detection accuracy, making them unsuitable for deployment in large-scale IoV environments. To address these issues, a blockchain-based efficient authentication approach is devised for data sharing amongst the vehicles. The entities included in the proposed system are Road Side Units (RSU), issuers, Vehicles, Traffic Management Authority (TMA), Law enforcement department (LED), and tracers. The steps followed by the proposed model include initialization, key generation, registration, message generation, encryption with data sharing and authentication. TMA initializes the auxiliary and parent blockchain in each region. In key generation, the public and private keys are generated for authentication. Next, the vehicle is registered with the TMA in the registration phase. Then, the message is recorded with blockchain. Once the message is recoded, the encryption and data sharing phase is executed for secure sharing. After that, the authentication is carried out to select a genuine vehicle for data sharing. Performance evaluation is conducted using computation time, detection rate, memory usage, communication overhead, and blockchain transaction latency. For 50 devices, the proposed approach achieves a computation time of 0.065 s. The detection rate reaches 91.455%, showing an improvement of 4.37–10.50%, while memory usage is reduced to 3.792 MB, achieving a reduction of 4.5–15.7%. It also achieves the minimum communication overhead of 2.383 KB, obtaining a reduction of 5.47–45.30%. Similarly, the lowest blockchain transaction latency of 19.655 ms is achieved, corresponding to a reduction of 16.60–43.44%. These results demonstrate that the proposed framework consistently outperforms existing methods in terms of efficiency and scalability for practical IoV applications.
S. Velliangiri, P. Karthikeyan, J. Premalatha· Discover Computing· 0 citations
A lightweight blockchain-based authentication framework for secure communication in Internet of Things (IoT) networks that integrates a permissioned blockchain with ECC-256 to provide mutual authentication, data integrity, and non-repudiation for resource-constrained IoT devices.
A. Abu-Ein, Obaida M. Al-hazaimeh· WSEAS Transactions on Inform...· 0 citations
Elastic Proof-of-Location Byzantine Fault Tolerance is proposed, a privacy-preserving and location-aware blockchain consensus framework for IoT systems that reduces communication overhead and improves consensus efficiency compared with conventional PBFT-based approaches while strengthening resilience against location-based and identity-based attacks.
Yunus Kareem, D. Djenouri, Essam Ghadafi· Future Internet· 0 citations
The Internet of Vehicles (IoV) relies on frequent vehicle-to-roadside-unit (RSU) access over open wireless channels, making efficient authentication and key establishment essential. In many existing authentication and key agreement (AKA) schemes, a target RSU receives and processes a request before an invalid sender is rejected, which can waste roadside computation under dense invalid-request traffic. This paper presents EDAKA-IoV, an elliptic-curve-cryptography-based AKA scheme that separates admission filtering from end-to-end session-key establishment. A trusted authority (TA) performs Lightweight Polynomial-based Pre-Verification (LPPV) to discard invalid authentication requests before they reach the target RSU, while the vehicle and RSU establish the final session key. A current–pending dual-state mechanism prevents permanent de-synchronization during dynamic pseudo-identity renewal without adding another communication round. Formal analysis under an eCK-style model, ProVerif verification, and heuristic analysis evaluate session-key secrecy, injective mutual authentication, privacy, and resistance to the considered attacks. Optional offline precomputation moves two fixed-base scalar multiplications outside the online phase and reduces the non-polynomial online computation component by approximately 48.8%. With fixed-length compressed point encoding, the authentication exchange requires 2336 bits. The workload analysis shows that the RSU-side processing reduction is proportional to the invalid-request ratio, while the TA still performs record lookup, hashing, and degree-dependent polynomial evaluation for every received request. EDAKA-IoV therefore provides a balanced authentication solution for resource-sensitive IoV deployments.
Simulation results show that compared with standard PBFT, Q-PBFT, and APBFT, H-PBFT exhibits significant advantages in consensus latency, throughput, and view switching recovery time, and maintains high system robustness even in complex network environments with malicious nodes.
Zhen-Hua Wang, Jiangang Hu, Xinmeng Wang et al.· Future Internet· 0 citations
