Packet Delivery Research Articles

Delay management for heterogeneous traffic in vehicular sensor networks using packet fragmentation of low priority data

AbstractVehicular sensor networks (VSNs) are expected to revolutionize the transportation systems through automated decision‐making. These networks function on the communication between vehicles, traffic infrastructure, and people. One of the major challenges of VSNs is to deal with heterogeneous traffic due to the diverse nature of information and data generated by different types of sensors and devices within the vehicular environment. To ensure an effective operation of the network, it is crucial to offer a differentiated quality of service to each traffic class. Media access control (MAC) protocols offer an opportunity to provide differentiated channel access to the traffic of different priorities. This work is focused on offering comparison of recent MAC schemes in terms of their performance for heterogeneous traffic generated by VSNs. Two protocols FROG‐MAC and UrgMAC have been selected: FROG‐MAC is developed using a simple concept of packet fragmentation, where the packets of lower priority are fragmented to offer an early transmission opportunity to urgent traffic; on the other hand, urgMAC is designed using advanced cross‐layer techniques of two‐tiered service differentiation mechanism, adaptive data rate adjustment mechanism, urgency‐based contention window size adaptation, traffic type adaptive duty cycle, and multimedia message passing. It has been found that the FROG‐MAC outperforms urgMAC in terms of delay, energy consumption and packet delivery ratio.

A Q-Learning-Based Approach to Design an Energy-Efficient MAC Protocol for UWSNs Through Collision Avoidance

Deploying and effectively utilizing wireless sensor networks (WSNs) in underwater habitats remains a challenging task. In underwater wireless sensors networks (UWSNs), the availability of a continuous energy source for communicating with nodes is either very costly or is prohibited due to the marine life law enforcement agencies. So, in order to address this issue, we present a Q-learning-based approach to designing an energy-efficient medium access control (MAC) protocol for UWSNs through collision avoidance. The main goal is to prolong the network’s lifespan by optimizing the communication methods, specifically focusing on improving the energy efficiency of the MAC protocols. Factors affecting the energy consumption in communication are adjustments to the interference ranges, i.e., changing frequencies repeatedly to obtain optimal communication; data packet retransmissions in case of a false acknowledgment; and data packet collision occurrences in the channel. Our chosen protocol stands out by enabling sensor (Rx) nodes to avoid collisions without needing extra communication or prior interference knowledge. According to the results obtained through simulations, our protocol may increase the network’s performance in terms of network throughput by up to 23% when compared to benchmark protocols depending on the typical traffic load. It simultaneously decreases end-to-end latency, increases the packet delivery ratio (PDR), boosts channel usage, and lessens packet collisions by over 38%. All these gains result in minimizing the network’s energy consumption, with a proportional gain.

An efficient neural network LEACH protocol to extended lifetime of wireless sensor networks

This paper presents NN_ILEACH, a novel neural network-based routing protocol designed to enhance the energy efficiency and longevity of Wireless Sensor Networks (WSNs). By integrating the Energy Hole Removing Mechanism (EHORM) with a sophisticated neural network for cluster head selection, NN_ILEACH effectively addresses the energy depletion challenges associated with traditional protocols like LEACH and ILEACH. Our extensive simulations demonstrate that NN_ILEACH significantly outperforms these classical protocols. Specifically, NN_ILEACH extends the network lifetime to an impressive 11,361 rounds, compared to only 505 rounds achieved by LEACH under identical conditions—representing a more than 20-fold improvement. Additionally, NN_ILEACH achieves a 30% increase in throughput and a 25% enhancement in packet delivery ratio, while reducing overall energy consumption by 40%. These results underscore the protocol’s potential to optimize energy usage and maintain network stability, paving the way for more resilient IoT systems in dynamic environments. Future work will explore further integration of machine learning techniques to enhance adaptability and performance in WSNs.

ExAq-MSPP: An Energy-Efficient Mobile Sink Path Planning Using Extended Aquila Optimization Algorithm

Wireless sensor networks play a crucial role in gathering data from remote or hard-to-reach locations, enabling real-time monitoring and decision-making in a wide range of industries and applications. The mobile sink path planning (MSPP) enables mobile sinks (e.g., drones or rovers) to navigate through the environment, collecting data from different sensor nodes, ensuring comprehensive coverage, and adaptively addressing changing conditions. Still, the energy-efficient routing with minimal delay is the challenging aspect. This research focuses on improving data gathering in wireless sensor networks by introducing an efficient routing protocol. In this proposed protocol, sensor nodes are initially deployed using Voronoi diagrams to ensure uniform network coverage. The network is then divided into clusters using the low-energy adaptive clustering hierarchy (LEACH) algorithm for energy-efficient routing. To optimize the path planning of a mobile sink for data collection, we introduce the extended Aquila (ExAq) optimization algorithm, which uses a multi-objective fitness function considering factors such as delay, residual energy, link quality, priority, and distance. Simulation results demonstrate the effectiveness of the proposed ExAq-MSPP protocol in terms of reduced delay, improved network lifetime, higher packet delivery ratio, enhanced residual energy, and increased throughput compared to existing protocols with the values of 1.169, 99.857, 99.920, 0.997, and 255.306, respectively. Thus, the energy-efficient routing and optimizing path planning for mobile sinks, the proposed ExAq-MSPP protocol can extend network lifetime, increase data accuracy, and provide more robust performance under changing environmental conditions.

Inverse Coupled Simulated Annealing for Enhanced OSPF Convergence in IoT Networks

The current Internet of Things (IoT) network structure is evolving from small-scale distributed systems to a large-scale hierarchical collaboration between backbone and access networks. In this context, the dynamic changes in backbone node connections and the surge in service demands, coupled with sluggish fault detection speeds, significantly shorten effective service transmission time. To address this issue, this paper proposes an inverse coupled simulated annealing for enhanced OSPF route convergence in IoT networks (OSPF-ICSA). Initially, the link state is derived from the statistical characteristics of Hello packets, while the aggregated characteristics of the link state are employed to characterize the node state, providing data support for the reverse coupled simulated annealing algorithm. Subsequently, the Hello packet is refined, and a mechanism is designed to synchronize OSPF intervals and transmit node states. This ensures that nodes within the same subnet synchronize their sending intervals and fault detection times while sharing their node states. Finally, building upon this foundation, the reverse coupled simulated annealing algorithm is introduced to jointly optimize the Hello packet sending interval and fault detection time. Compared to the traditional AODV protocol, OSPF-ICSA reduces the average fault detection time by over 37.38%, improves the average fault detection accuracy by more than 3.1%, decreases the average routing overhead by over 20%, and increases the average packet delivery rate by over 5.1%.

Hybrid Optimization With Deep Spiking Equilibrium Neural Network for Software Defined Network Based Congestion Prevention Routing

ABSTRACTIn the Internet of Things (IoT) network, within a period of time it constructs a huge network of millions and billions of things that incorporate with each other, leading to various technical and application problems. Also, on‐time delivery of packets is significant in software‐defined networks. In the current software‐defined network, the bandwidth overhead is not considered when an enormous amount of traffic enters the network; this may lead to network congestion. To overcome this issue, a novel method is proposed to detect network congestion based on hybrid optimization, namely, the Hybrid Gannet with Pelican Optimization (HGPO) algorithm. The node‐level congestions and the link‐level congestions, which means the buffer overflow and the multiple nodes trying to utilize the channel at the same time, must be controlled efficiently. Once the network congestion gets controlled, the shortest route path selection and congestion prevention are performed perfectly with the aid of the proposed Deep Spiking Equilibrium Neural Network (DSENN). A few route discovery frequency vectors, such as the interroute discovery time and route discovery time of each node, are determined to prevent congestion. Finally, it is implemented in the Python platform successfully, and the achieved throughput, delay, packet loss ratio, packet delivery ratio, end‐to‐end delay, and performance measures of the proposed method are 140 Mbit/s, 17 ms, 3.8%, 0.35 s, and 100%, respectively, which outperforms the other compared traditional algorithms.

Spiking Quantum Fire Hawk Network Based Reliable Scheduling for Lifetime Maximization of Wireless Sensor Network

ABSTRACTManaging energy consumption poses a substantial challenge within Wireless Sensor Networks (WSN) due to frequent communication among sensor nodes. A reliable scheduling framework presents a promising solution for maximizing WSN lifetime, minimizing energy consumption, and ensuring robust communication. Despite various proposed methods for reliable scheduling, energy consumption remains high. To address this, a spiking quantum fire hawk network‐based reliable scheduling in WSN is introduced. This research incorporates clustering, duty‐cycle management, and reliable routing to enhance energy efficiency. An improved Nutcracker Optimization‐based Cluster Head (CH) election and Spiking Quantum Fire Hawk Network duty cycling contribute to optimal CH selection and increased network lifetime. Additionally, a Link Quality‐based Energy Aware Proficient Trusted Routing Protocol (LQEAP‐TRP) minimizes data transmission delay, offering reliable routing. Finally, the data communication is done in the reliable route. The developed approach is executed in Network Simulator and validated with the existing protocols. The results of the simulations indicate that the proposed approach achieves a network lifetime of 99.34% and a packet delivery ratio of 99.95%.

Traffic Prevention and Security Enhancement in VANET Using Deep Learning With Trusted Routing Aided Blockchain Technology

ABSTRACTVehicular ad hoc networks (VANETs) in portable broadband networks are a revolutionary concept with enormous potential for developing safe and efficient transportation systems. Because VANETs are open networks that require regular information sharing, it might be difficult to ensure the security of data delivered through VANETs as well as driver privacy. This paper proposes a blockchain technology that supports trusted routing and deep learning for traffic prevention and security enhancement in VANETs. Initially, the proposed Feature Attention‐based Extended Convolutional Capsule Network (FA_ECCN) model predicts the driver's behaviors such as normal, drowsy, distracted, fatigued, aggressive, and impaired. Next, the Binary Fire Hawks‐based Optimized Link State Routing Protocol (BFH_OLSRP) is used to route traffic after trust values have been assessed. Furthermore, Binary Fire Hawks Optimization (BFHO) determines the best routing path based on criteria such as link stability and node stability degree. Finally, blockchain storage is supported by the Interplanetary File System (IPFS) technology to improve the security of VANET data. Additionally, the validation process is established by using Delegated Practical Byzantine Fault Tolerance (DPBFT). As a result, the proposed study employs the blockchain system to securely send data to neighboring vehicles via trust‐based routing, thereby accurately predicting the driver's behavior. The proposed method achieves a better outcome in terms of latency, packet delivery ratio (PDR), overhead packets, throughputs, end‐to‐end delay, transmission overhead, and computational cost. According to simulation results and efficiency evaluation, the proposed approach outperforms existing approaches and enhances vehicle communication security in an effective manner.

Reconfigurable data intensive service for low latency cyber-physical systems and IoT communication

<span>The fourth industrial revolution is realized through the many developments in cyber-physical systems (CPS) made possible by the widespread use of the internet of things (IoT). CPS sensor networks must enable mobile and wireless CPSs with their specific flexibility and heterogeneity needs without compromising quality of service (QoS). The research article focuses on reconfigurable data communication hardware for numerous IoT-supporting infrastructures and performance estimation using delay, power, throughput, and packet delivery ratio (PDR) for different IoT node configurations. Tree topology-based network configuration from cloud data to sensor fog organizers, sensor network directors, and IoT-embedded sensors is supported. Functional simulation is performed in iFoGSim, Xilinx ISE, and Modelsim 10.0 with a maximum of 64 variable nodes programmed for data communication and interplay verification with a minimum delay of 9.1 ns, maximum frequency of 319 MHz, power of 7.5 mW, throughput of 0.280, and maximum PDR=1. The simulation is applicable for fog computing and CPS processed from different alters in specific topologies.</span>

An Energy-efficient Routing Protocol Based on Elephant Herding Optimization in MANET

Background: A mobile ad hoc network (MANET) is a collection of self-organizing mobile nodes creating an ad hoc network without fixed infrastructure. Routing is a major issue in mobile networks that may reduce network performance due to frequent network topology changes. Routing protocols are so important in dynamic multi-hop networks that many studies have focused on the routing problem in MANETs. Methods: In this research work, a proposed ad hoc on-demand distance vector (AODV) with an elephant herding optimization (EHO) called AODVEHO is used as an optimal path selection method that creates a set of best paths between destination and source. Results: To validate the performance of proposed AODVEHO, AntHocNet, AODV, and designation sequence distance vector (DSDV). Various performance measures are considered to validate our proposed research work, such as packet delivery ratio (PDR), end-to-end delay (E2ED), and average energy consumption (AEC). Conclusion: Experimental results are indicated that the AODVEHO achieved a higher routing overhead (73 %), PDR (89.87 %), low E2ED rate (95.22 %), AEC (75.60 %), and dead nodes (75%) when compared to other routing schemes.

Implementation of A Delay-Tolerant Routing Protocol in the Network Simulator NS-3

The paper explores the implementation of the Epidemic Routing Protocol using the NS-3 simulator, focusing on its application in intermittently connected networks like Mobile Adhoc Networks (MANETs). The Epidemic Protocol maximizes message delivery by flooding the network with multiple copies, ensuring reliability even in sparse or highly mobile environments. Through NS-3 simulations, the study examines the protocol’s performance, considering factors such as network size, node mobility, and message Time-To-Live (TTL). The simulation, which models an ad-hoc wireless network using IEEE 802.11b, demonstrates that the protocol achieves a 100-percentage packet delivery ratio with minimal latency. Tools like NetAnim provide detailed insights into node interactions and message dissemination, highlighting the protocol’s effectiveness in maintaining communication under challenging conditions. The paper concludes that while the Epidemic Protocol is resource- intensive, it is highly effective for scenarios where traditional routing methods fail, offering a reliable solution for dynamic and partitioned network.

Deep Reinforcement Learning for UAV-Based SDWSN Data Collection

Recent advancements in Unmanned Aerial Vehicle (UAV) technology have made them effective platforms for data capture in applications like environmental monitoring. UAVs, acting as mobile data ferries, can significantly improve ground network performance by involving ground network representatives in data collection. These representatives communicate opportunistically with accessible UAVs. Emerging technologies such as Software Defined Wireless Sensor Networks (SDWSN), wherein the role/function of sensor nodes is defined via software, can offer a flexible operation for UAV data-gathering approaches. In this paper, we introduce the “UAV Fuzzy Travel Path”, a novel approach that utilizes Deep Reinforcement Learning (DRL) algorithms, which is a subfield of machine learning, for optimal UAV trajectory planning. The approach also involves the integration between UAV and SDWSN wherein nodes acting as gateways (GWs) receive data from the flexibly formulated group members via software definition. A UAV is then dispatched to capture data from GWs along a planned trajectory within a fuzzy span. Our dual objectives are to minimize the total energy consumption of the UAV system during each data collection round and to enhance the communication bit rate on the UAV-Ground connectivity. We formulate this problem as a constrained combinatorial optimization problem, jointly planning the UAV path with improved communication performance. To tackle the NP-hard nature of this problem, we propose a novel DRL technique based on Deep Q-Learning. By learning from UAV path policy experiences, our approach efficiently reduces energy consumption while maximizing packet delivery.

Cross-Layer Routing Protocol Based on Channel Quality for Underwater Acoustic Communication Networks

Due to the physical characteristics of acoustic channels, the performance of underwater acoustic communication networks (UACNs) is more susceptible to the impacts of multipath and Doppler effects. Channel quality can serve as a measure of the reliability of underwater communication links. A cross-layer routing protocol based on channel quality (CLCQ) is proposed to improve the overall network performance and resource utilization. First, the BELLHOP ray model is used to calculate the channel impulse response combined with the winter sound speed profile data of a specific sea area. Then, the channel impulse response is integrated into the communication system to evaluate the channel quality between nodes based on the bit error rate (BER). Finally, during the selection of the next hop node, a reinforcement learning algorithm is employed to facilitate cross-layer interaction within the protocol stack. The optimal relay node is determined by the channel quality index (BER) from the physical layer, the buffer state from the data link layer, and the node residual energy. To enhance the algorithm’s convergence speed, a forwarding candidate set selection method is proposed which takes into account node depth, residual energy, and buffer state. Simulation results show that the packet delivery rate (PDR) of the CLCQ is significantly higher than that of Q-Learning-Based Energy-Efficient and Lifetime-Extended Adaptive Routing (QELAR) and Geographic and Opportunistic Routing (GEDAR).

Deep Artificial Immune System With Malicious Node Detection and Secure Routing Protocol in MANET

ABSTRACTIn the context of Mobile Ad Hoc Networks (MANETs), the dynamic and decentralized topology poses significant challenges like unreliable connectivity, limited bandwidth, node mobility, and vulnerability to security threats from malicious nodes. Ensuring secure and energy‐efficient data transmission in such environments is crucial for mission‐critical applications. This research addresses these pressing challenges by introducing a robust routing protocol capable of detecting and mitigating malicious nodes, thereby enhancing MANET's Quality of Service (QoS). The proposed approach, the Dendritic Cell with Adaptive Trust Q‐learning Protocol (dDC‐ATQP), integrates several innovative techniques to tackle these issues. Firstly, the trust evaluation mechanism assesses the behavior of nodes to identify potential malicious actors, mitigating the effect of malicious nodes on system execution. Secondly, the adaptive routing strategy optimizes data transmission paths based on real‐time network conditions, reducing latency and packet loss. To evaluate the effectiveness of this approach, extensive simulations are conducted using a range of performance metrics. The results demonstrate significant improvements over existing methods, including a throughput increase of (79.2% in 50 s), lower end‐to‐end‐delay (0.075 s for 20 nodes), energy consumption of (38.55/J), higher packet delivery ratio (98% for 20 nodes), reduced packet loss ratio (5% for 100 nodes), enhanced security (80% for 70 nodes).

FMORT: The Meta-Heuristic routing method by integrating index parameters to optimize energy consumption and real execution time using FANET

Decreasing energy consumption in Unmanned Aerial Vehicles (UAVs) while simultaneously enhancing their reliability and processing capabilities is considered a fundamental challenge. The routing mechanisms employed in Flying Ad Hoc Networks (FANETs) are more complex compared to those in Mobile Ad Hoc Networks (MANETs) and Vehicular Ad Hoc Networks (VANETs), a challenge addressed by the FMORT method. To tackle these complex routing challenges, clustering techniques that utilize hybrid Meta-heuristic algorithms can be applied. Data analysis within the FMORT framework identified factors influencing service integration, leading to a reduction in redundant request transmissions and overall redundancy in the proposed method. The identification of food sources in the hybrid Meta-heuristic algorithm of the FMORT method is achieved through the integration of the Sparrow and Dragonfly algorithms. These algorithms work simultaneously to increase energy efficiency and increase network lifetime. This strategy optimizes information exchange by selecting an intelligent threshold detector and categorizing inputs, thereby minimizing node mobility. As a result, it improves performance metrics and decreases delivery costs, energy consumption, and delays. In the proposed method, a balanced performance is achieved by comparing existing methods in terms of transmission delay, Packet Delivery Ratio( PDR), throughput, and energy consumption. Simulation results show that the FMORT approach provides effective and stable outcomes in terms of reliability, decreased delays, and improved packet delivery rates. The FMORT framework includes principles for neighbor selection, determining suitable cluster heads, and scoring based on the average Euclidean distance. Additionally, it manages topology access, ensures proper distribution, guarantees data connectivity, and accurately categorizes inputs. By optimizing the sensitivity rate, this method minimizes the average delays and meekly values input data through effective load balancing. Key parameters considered for real time optimization of overall performance include the number of cluster heads during re-clustering, the ratio of request-to-acknowledgment packet transmission, node, and network lifetime, end-to-end delay, and energy consumption. Ultimately, the simulation results show that compared to the MWCRSF algorithm, the average optimization of index parameters,% 0.73 decrease in energy consumption,% 2.23 network lifetime, 1.35 re-cluster construction time and also% 0.11 re-cluster lifetime has increased.

Dynamic clustering based risk aware congestion control technique for vehicular network

In order to improve road safety and offer extra services to cars and their users, vehicular ad hoc networks, or VANETs, are essential parts of intelligent transportation systems (ITS). The primary aim of this research is to suggest and assess a new approach for mitigating network congestion in VANET technology through the implementation of dynamic grouping of vehicles for safety (DGVS). To do this, virtual regions are created around cars using the DBSCAN and K Mean method. This allows vehicles to communicate directly with others within the same DGVS, eliminating the need to broadcast messages across the entire network.The ultimate goal is to drastically decrease traffic while preserving vital data transfer for VANET traffic control and safety. The suggested technique determines the optimal transmission rate in accordance with the existing channel circumstances, yielding a balanced performance concerning both packet delivery and channel congestion. With this novel method, cars may only talk to other vehicles that are in the same DGVS, thus there’s no need to broadcast messages to the whole network. With the use of this technique, the efficacy of DGVS in reducing VANET congestion and enhancing network performance will be thoroughly assessed. The study’s conclusions demonstrate how well the suggested dynamic grouping of vehicles for safety (DGVS) technique works to reduce VANET congestion. It was shown through simulation-based studies that, in comparison to current approaches, DGVS dramatically decrease network congestion, resulting in notable gains in network performance and decreased communication delay. Additionally, the study found a number of possible uses for DGVS in the transportation industry, such as emergency response, traffic management, and accident prevention.

Collision Avoidance Adaptive Data Rate Algorithm for LoRaWAN

Long-Range Wide-Area Network (LoRaWAN) technology offers efficient connectivity for numerous end devices over a wide coverage area in the Internet of Things (IoT) network, enabling the exchange of data over the Internet between even the most minor Internet-connected devices and systems. One of LoRaWAN’s hallmark features is the Adaptive Data Rate (ADR) algorithm. ADR is a resource allocation function which dynamically adjusts the network’s data rate, airtime, and energy dissipation to optimise its performance. The allocation of spreading factors plays a critical function in defining the throughput of the end device and its robustness to interference. However, in practical deployments, LoRaWAN networks experience considerable interference, severely affecting the packet delivery ratio, energy utilisation, and general network performance. To address this, we present a novel ADR framework, SSFIR-ADR, which utilises randomised spreading factor allocation to minimise energy consumption and packet collisions while maintaining optimal network performance. We implement a LoRa network composed of a single gateway that connects loads of end nodes to a network server. In terms of energy use, packet delivery rate, and interference rate (IR), our simulation implementation does better than LoRaWAN’s legacy ADR scheme for a range of application data intervals.

Scalability Analysis of LoRa and Sigfox in Congested Environment and Calculation of Optimum Number of Nodes.

Low-power wide area network (LPWAN) technologies as part of IoT are gaining a lot of attention as they provide affordable communication over large areas. LoRa and Sigfox as part of LPWAN have emerged as highly effective and promising non-3GPP unlicensed band IoT technologies while challenging the supremacy of cellular technologies for machine-to-machine-(M2M)-based use cases. This paper presents the design goals of LoRa and Sigfox while throwing light on their suitability in congested environments. A practical traffic generator of both LoRa and Sigfox is introduced and further interpolated for understanding simultaneous operation of 100 to 10,000 such nodes in close vicinity while establishing deep understanding on effects of collision, re-transmissions, and link behaviour. Previous work in this field have overlooked simultaneous deployment, collision issues, effects of re-transmission, and propagation profile while arriving at a number of successful receptions. This work uses packet error rate (PER) and delivery ratio, which are correct metrics to calculate successful transmissions. The obtained results show that a maximum of 100 LoRa and 200 Sigfox nodes can be deployed in a fixed transmission use case over an area of up to 1 km. As part of the future scope, solutions have been suggested to increase the effectiveness of LoRa and Sigfox networks.

Design of an Efficient QOS Aware Trust-Based Security Model with Bioinspired Sidechains for Healthcare Deployments

Increased adoption of blockchain technology in healthcare systems has paved the way for transparent and secure data management. However, the inherent difficulties of scalability, performance, and security in blockchain networks necessitate the development of efficient models to ensure Quality of Service (QoS) and reliability. In this paper, we propose a novel QoS-aware trust-based security model for healthcare blockchain deployments that addresses these challenges by taking temporal energy consumption, temporal delay, temporal throughput, and temporal Packet Delivery Ratio (PDR) levels into account when selecting miner nodes. For efficient miner node selection, our model employs trust-based analysis. While for the formation of sidechains an efficient Grey Wolf Optimizer (GWO) Model is used, which is a metaheuristic technique inspired by hunting behaviour of Wolves in real-time scenarios. Effectively balancing the trade-off between exploration and exploitation, the GWO algorithm enables the selection of optimal miner nodes that meet the desired QoS requirements. By incorporating temporal metrics, our model adapts dynamically to changing network conditions, ensuring optimal resource utilization and enhanced network performance levels. To assess the efficacy of our proposed model, we ran extensive simulations and compared its performance to that of existing sidechaining models. The outcomes demonstrate significant enhancements in multiple aspects. In comparison to state-of-the-art sidechaining models, our model achieves an impressive 8.5% reduction in delay, 3.9% reduction in energy consumption, 4.5% increase in throughput, and 2.5% improvement in PDR levels. These enhancements demonstrate the efficacy and efficiency of our healthcare blockchain deployment models. The proposed model has applications in a variety of real-time healthcare scenarios. It can be used in electronic health record (EHR) systems where data integrity, confidentiality, and accessibility are crucial. By ensuring QoS-aware miner node selection, our model contributes to dependable and efficient data management, allowing for streamlined access to patient records while maintaining the necessary security standards. Moreover, the trust-based approach of our model improves the overall security of healthcare blockchain deployments. Our model reduces the risks associated with malicious or compromised miner nodes by incorporating trustworthiness metrics such as reputation and behavior analysis. This is especially important in the healthcare industry, where the sensitive nature of patient data necessitates stringent security measures.

New routing method based on sticky bacteria algorithm and link stability for VANET

With the rapid development of Telematics, the role of edge computing (Mobile Edge Computing, MEC) is becoming more and more significant. Mobile users can obtain massive computing and storage resources in a local way, thus effectively solving the congestion problem of the core network. However, in general urban edge network scenarios of VANET (Vehicular Ad-hoc Network), due to low node density and poor connectivity, there are few chances to encounter suitable forwarding nodes. In order to avoid the above situation and adapt to sparse scenarios, we propose new link-stabilized routing method & protocol based on sticky bacteria algorithm in this paper. The new idea and the significant findings of this proposed algorithm in enhancing the routing protocol is as follows: five factors affecting routing decision are identified: evaluation distance, deflection angle, number of neighboring nodes, rate difference, and the traffic of the road section at which it is located, and then these five factors are comprehensively evaluated by using the our designed Analytic Hierarchy Process (AHP) strategy, so as to determine the score of each node and the candidate routing paths; And the best routing path between two communicating nodes is found through the stronger global exploration capability of the sticky bacteria algorithm. Our experiments (that are based on our developed C++ programs) have proved that the method proposed in this paper has stronger link stability and the highest packet delivery rate. And the experiments and their results has enhanced our new method credibility in the field of ad hoc networks.