Blockchain technology and raft consensus for secure physician prescriptions and improved diagnoses in electronic healthcare systems.

With electronic healthcare systems undergoing rapid change, optimizing the crucial process of recording physician prescriptions is a task with major implications for patient care. The power of blockchain technology and the precision of the Raft consensus algorithm are combined in this article to create a revolutionary solution for this problem. In addition to addressing these issues, the proposed framework, by focusing on the challenges associated with physician prescriptions, is a breakthrough in a new era of security and dependability for the healthcare sector. The Raft algorithm is a cornerstone that improves the diagnostic decision-making process, increases confidence in patients, and sets a new standard for robust healthcare systems. In the proposed consensus algorithm, a weighted sum of two influencing factors including the physician acceptability and inter-physicians' reliability is used for selecting the participating physicians. An investigation is conducted to see how well the Raft algorithm performs in overcoming prescription-related roadblocks that support a compelling argument for improved patient care. Apart from its technological benefits, the proposed approach seeks to revolutionize the healthcare system by fostering trust between patients and providers. Raft's ability to communicate presents the proposed solution as an effective way to deal with healthcare issues and ensure security.

A cluster-tree-based trusted routing algorithm using Grasshopper Optimization Algorithm (GOA) in Wireless Sensor Networks (WSNs).

In wireless sensor networks (WSNs), existing routing protocols mainly consider energy efficiency or security separately. However, these protocols must be more comprehensive because many applications should guarantee security and energy efficiency, simultaneously. Due to the limited energy of sensor nodes, these protocols should make a trade-off between network lifetime and security. This paper proposes a cluster-tree-based trusted routing method using the grasshopper optimization algorithm (GOA) called CTTRG in WSNs. This routing scheme includes a distributed time-variant trust (TVT) model to analyze the behavior of sensor nodes according to three trust criteria, including the black hole, sink hole, and gray hole probability, the wormhole probability, and the flooding probability. Furthermore, CTTRG suggests a GOA-based trusted routing tree (GTRT) to construct secure and stable communication paths between sensor nodes and base station. To evaluate each GTRT, a multi-objective fitness function is designed based on three parameters, namely the distance between cluster heads and their parent node, the trust level, and the energy of cluster heads. The evaluation results prove that CTTRG has a suitable and successful performance in terms of the detection speed of malicious nodes, packet loss rate, and end-to-end delay.

A cluster-based trusted routing method using fire hawk optimizer (FHO) in wireless sensor networks (WSNs).

Today, wireless sensor networks (WSNs) are growing rapidly and provide a lot of comfort to human life. Due to the use of WSNs in various areas, like health care and battlefield, security is an important concern in the data transfer procedure to prevent data manipulation. Trust management is an affective scheme to solve these problems by building trust relationships between sensor nodes. In this paper, a cluster-based trusted routing technique using fire hawk optimizer called CTRF is presented to improve network security by considering the limited energy of nodes in WSNs. It includes a weighted trust mechanism (WTM) designed based on interactive behavior between sensor nodes. The main feature of this trust mechanism is to consider the exponential coefficients for the trust parameters, namely weighted reception rate, weighted redundancy rate, and energy state so that the trust level of sensor nodes is exponentially reduced or increased based on their hostile or friendly behaviors. Moreover, the proposed approach creates a fire hawk optimizer-based clustering mechanism to select cluster heads from a candidate set, which includes sensor nodes whose remaining energy and trust levels are greater than the average remaining energy and the average trust level of all network nodes, respectively. In this clustering method, a new cost function is proposed based on four objectives, including cluster head location, cluster head energy, distance from the cluster head to the base station, and cluster size. Finally, CTRF decides on inter-cluster routing paths through a trusted routing algorithm and uses these routes to transmit data from cluster heads to the base station. In the route construction process, CTRF regards various parameters such as energy of the route, quality of the route, reliability of the route, and number of hops. CTRF runs on the network simulator version 2 (NS2), and its performance is compared with other secure routing approaches with regard to energy, throughput, packet loss rate, latency, detection ratio, and accuracy. This evaluation proves the superior and successful performance of CTRF compared to other methods.

A fuzzy logic-based secure hierarchical routing scheme using firefly algorithm in Internet of Things for healthcare.

The Internet of Things (IoT) is a universal network to supervise the physical world through sensors installed on different devices. The network can improve many areas, including healthcare because IoT technology has the potential to reduce pressure caused by aging and chronic diseases on healthcare systems. For this reason, researchers attempt to solve the challenges of this technology in healthcare. In this paper, a fuzzy logic-based secure hierarchical routing scheme using the firefly algorithm (FSRF) is presented for IoT-based healthcare systems. FSRF comprises three main frameworks: fuzzy trust framework, firefly algorithm-based clustering framework, and inter-cluster routing framework. A fuzzy logic-based trust framework is responsible for evaluating the trust of IoT devices on the network. This framework identifies and prevents routing attacks like black hole, flooding, wormhole, sinkhole, and selective forwarding. Moreover, FSRF supports a clustering framework based on the firefly algorithm. It presents a fitness function that evaluates the chance of IoT devices to be cluster head nodes. The design of this function is based on trust level, residual energy, hop count, communication radius, and centrality. Also, FSRF involves an on-demand routing framework to decide on reliable and energy-efficient paths that can send the data to the destination faster. Finally, FSRF is compared to the energy-efficient multi-level secure routing protocol (EEMSR) and the enhanced balanced energy-efficient network-integrated super heterogeneous (E-BEENISH) routing method based on network lifetime, energy stored in IoT devices, and packet delivery rate (PDR). These results prove that FSRF improves network longevity by 10.34% and 56.35% and the energy stored in the nodes by 10.79% and 28.51% compared to EEMSR and E-BEENISH, respectively. However, FSRF is weaker than EEMSR in terms of security. Furthermore, PDR in this method has dropped slightly (almost 1.4%) compared to that in EEMSR.

An energy-aware routing method using firefly algorithm for flying ad hoc networks.

Flying ad-hoc networks (FANETs) include a large number of drones, which communicate with each other based on an ad hoc model. These networks provide new opportunities for various applications such as military, industrial, and civilian applications. However, FANETs have faced with many challenges like high-speed nodes, low density, and rapid changes in the topology. As a result, routing is a challenging issue in these networks. In this paper, we propose an energy-aware routing scheme in FANETs. This scheme is inspired by the optimized link state routing (OLSR). In the proposed routing scheme, we estimate the connection quality between two flying nodes using a new technique, which utilizes two parameters, including ratio of sent/received of hello packets and connection time. Also, our proposed method selects multipoint relays (MPRs) using the firefly algorithm. It chooses a node with high residual energy, high connection quality, more neighborhood degree, and higher willingness as MPR. Finally, our proposed scheme creates routes between different nodes based on energy and connection quality. Our proposed routing scheme is simulated using the network simulator version 3 (NS3). We compare its simulation results with the greedy optimized link state routing (G-OLSR) and the optimized link state routing (OLSR). These results show that our method outperforms G-OLSR and OLSR in terms of delay, packet delivery rate, throughput, and energy consumption. However, our proposed routing scheme increases slightly routing overhead compared to G-OLSR.

A Q-learning-based routing scheme for smart air quality monitoring system using flying ad hoc networks.

Air pollution has changed ecosystem and atmosphere. It is dangerous for environment, human health, and other living creatures. This contamination is due to various industrial and chemical pollutants, which reduce air, water, and soil quality. Therefore, air quality monitoring is essential. Flying ad hoc networks (FANETs) are an effective solution for intelligent air quality monitoring and evaluation. A FANET-based air quality monitoring system uses unmanned aerial vehicles (UAVs) to measure air pollutants. Therefore, these systems have particular features, such as the movement of UAVs in three-dimensional area, high dynamism, quick topological changes, constrained resources, and low density of UAVs in the network. Therefore, the routing issue is a fundamental challenge in these systems. In this paper, we introduce a Q-learning-based routing method called QFAN for intelligent air quality monitoring systems. The proposed method consists of two parts: route discovery and route maintenance. In the part one, a Q-learning-based route discovery mechanism is designed. Also, we propose a filtering parameter to filter some UAVs in the network and restrict the search space. In the route maintenance phase, QFAN seeks to detect and correct the paths near to breakdown. Moreover, QFAN can quickly identify and replace the failed paths. Finally, QFAN is simulated using NS2 to assess its performance. The simulation results show that QFAN surpasses other routing approaches with regard to end-to-end delay, packet delivery ratio, energy consumption, and network lifetime. However, communication overhead has been increased slightly in QFAN.