Falcon Optimization Algorithm-Based Energy Efficient Communication Protocol for Cluster-Based Vehicular Networks

Rapid development in Information Technology(IT)has allowed several novel application regions like large outdoor vehicular networks for Vehicle-to-Vehicle(V2V)transmission.Vehicular networks give a safe and more effective driving experience by presenting time-sensitive and location-aware data.The communication occurs directly between V2V and Base Station(BS)units such as the Road Side Unit(RSU),named as a Vehicle to Infrastructure(V2I).However,the frequent topology alterations in VANETs generate several problems with data transmission as the vehicle velocity differs with time.Therefore,the scheme of an effectual routing protocol for reliable and stable communications is significant.Current research demonstrates that clustering is an intelligent method for effectual routing in a mobile environment.Therefore,this article presents a Falcon Optimization Algorithm-based Energy Efficient Communication Protocol for Cluster-based Routing(FOA-EECPCR)technique in VANETS.The FOA-EECPCR technique intends to group the vehicles and determine the shortest route in the VANET.To accomplish this,the FOA-EECPCR technique initially clusters the vehicles using FOA with fitness functions comprising energy,distance,and trust level.For the routing process,the Sparrow Search Algorithm(SSA)is derived with a fitness function that encompasses two variables,namely,energy and distance.A series of experiments have been conducted to exhibit the enhanced performance of the FOA-EECPCR method.The experimental outcomes demonstrate the enhanced performance of the FOA-EECPCR approach over other current methods.

A Formal Model for Analyzing Fair Exchange Protocols Based on Event Logic

Fair exchange protocols play a critical role in enabling two distrustful entities to conduct electronic data exchanges in a fair and secure manner.These protocols are widely used in electronic payment systems and electronic contract signing,ensuring the reliability and security of network transactions.In order to address the limitations of current research methods and enhance the analytical capabilities for fair exchange protocols,this paper proposes a formal model for analyzing such protocols.The proposed model begins with a thorough analysis of fair exchange protocols,followed by the formal definition of fairness.This definition accurately captures the inherent requirements of fair exchange protocols.Building upon event logic,the model incorporates the time factor into predicates and introduces knowledge set axioms.This enhancement empowers the improved logic to effectively describe the state and knowledge of protocol participants at different time points,facilitating reasoning about their acquired knowledge.To maximize the intruder’s capabilities,channel errors are translated into the behaviors of the intruder.The participants are further categorized into honest participants and malicious participants,enabling a comprehensive evaluation of the intruder’s potential impact.By employing a typical fair exchange protocol as an illustrative example,this paper demonstrates the detailed steps of utilizing the proposed model for protocol analysis.The entire process of protocol execution under attack scenarios is presented,shedding light on the underlying reasons for the attacks and proposing corresponding countermeasures.The developedmodel enhances the ability to reason about and evaluate the security properties of fair exchange protocols,thereby contributing to the advancement of secure network transactions.

Hyperbolic Tangent Function-Based Protocols for Global/Semi-Global Finite-Time Consensus of Multi-Agent Systems

This paper investigates the problem of global/semi-global finite-time consensus for integrator-type multi-agent sys-tems.New hyperbolic tangent function-based protocols are pro-posed to achieve global and semi-global finite-time consensus for both single-integrator and double-integrator multi-agent systems with leaderless undirected and leader-following directed commu-nication topologies.These new protocols not only provide an explicit upper-bound estimate for the settling time,but also have a user-prescribed bounded control level.In addition,compared to some existing results based on the saturation function,the pro-posed approach considerably simplifies the protocol design and the stability analysis.Illustrative examples and an application demonstrate the effectiveness of the proposed protocols.

A Secure Blockchain-Based Vehicular Collision Avoidance Protocol: Detecting and Preventing Blackhole Attacks

This work aims to examine the vulnerabilities and threats in the applications of intelligent transport systems,especially collision avoidance protocols.It focuses on achieving the availability of network communication among traveling vehicles.Finally,it aims to find a secure solution to prevent blackhole attacks on vehicular network communications.The proposed solution relies on authenticating vehicles by joining a blockchain network.This technology provides identification information and receives cryptography keys.Moreover,the ad hoc on-demand distance vector(AODV)protocol is used for route discovery and ensuring reliable node communication.The system activates an adaptive mode for monitoring communications and continually adjusts trust scores based on packet delivery performance.From the experimental study,we can infer that the proposed protocol has successfully detected and prevented blackhole attacks for different numbers of simulated vehicles and at different traveling speeds.This reduces accident rates by 60%and increases the packet delivery ratio and the throughput of the connecting network by 40%and 20%,respectively.However,extra overheads in delay and memory are required to create and initialize the blockchain network.

Priority Based Energy Efficient MAC Protocol by Varying Data Ratefor Wireless Body Area Network

Wireless Body Area Network(WBAN)is a cutting-edge technology that is being used in healthcare applications to monitor critical events in the human body.WBAN is a collection of in-body and on-body sensors that monitor human physical parameters such as temperature,blood pressure,pulse rate,oxygen level,body motion,and so on.They sense the data and communicate it to the Body Area Network(BAN)Coordinator.The main challenge for the WBAN is energy consumption.These issues can be addressed by implementing an effective Medium Access Control(MAC)protocol that reduces energy consumption and increases network lifetime.The purpose of the study is to minimize the energy consumption and minimize the delay using IEEE 802.15.4 standard.In our proposed work,if any critical events have occurred the proposed work is to classify and prioritize the data.We gave priority to the highly critical data to get the Guarantee Tine Slots(GTS)in IEEE 802.15.4 standard superframe to achieve greater energy efficiency.The proposed MAC provides higher data rates for critical data based on the history and current condition and also provides the best reliable service to high critical data and critical data by predicting node similarity.As an outcome,we proposed a MAC protocol for Variable Data Rates(MVDR).When compared to existing MAC protocols,the MVDR performed very well with low energy intake,less interruption,and an enhanced packet-sharing ratio.

A CSMA/CA based MAC protocol for hybrid Power-line/Visible-light communication networks:Design and analysis

Hybrid Power-line/Visible-light Communication(HPVC)network has been one of the most promising Cooperative Communication(CC)technologies for constructing Smart Home due to its superior communication reliability and hardware efficiency.Current research on HPVC networks focuses on the performance analysis and optimization of the Physical(PHY)layer,where the Power Line Communication(PLC)component only serves as the backbone to provide power to light Emitting Diode(LED)devices.So designing a Media Access Control(MAC)protocol remains a great challenge because it allows both PLC and Visible Light Communication(VLC)components to operate data transmission,i.e.,to achieve a true HPVC network CC.To solve this problem,we propose a new HPC network MAC protocol(HPVC MAC)based on Carrier Sense Multiple Access/Collision Avoidance(CSMA/CA)by combining IEEE 802.15.7 and IEEE 1901 standards.Firstly,we add an Additional Assistance(AA)layer to provide the channel selection strategies for sensor stations,so that they can complete data transmission on the selected channel via the specified CSMA/CA mechanism,respectively.Based on this,we give a detailed working principle of the HPVC MAC,followed by the construction of a joint analytical model for mathematicalmathematical validation of the HPVC MAC.In the modeling process,the impacts of PHY layer settings(including channel fading types and additive noise feature),CSMA/CA mechanisms of 802.15.7 and 1901,and practical configurations(such as traffic rate,transit buffer size)are comprehensively taken into consideration.Moreover,we prove the proposed analytical model has the solvability.Finally,through extensive simulations,we characterize the HPVC MAC performance under different system parameters and verify the correctness of the corresponding analytical model with an average error rate of 4.62%between the simulation and analytical results.

A fixed clustering protocol based on random relay strategy for EHWSN

In Energy Harvesting Wireless Sensor Networks(EHWSN),the communication protocol will directly affect the final performance of the network,so it is necessary to study the communication protocol based on EHWSN.In this paper,for the low-cost fixed clustering problem,a fixed clustering protocol RRCEH is based on random relaying.Our proposed RRCEH abandons the inefficient inter-cluster communication method of the traditional fixed clustering protocol.To coordinate the data upload of the cluster head,RRCEH allocates different random relay vectors to each ring area of the network,and combines all the random relay vectors into a random relay matrix of RRCEH.In each communication round,the cluster head node randomly selects its relay target node to send data according to the probability distribution in the random relay vector in the area.For two different cluster head configuration scenarios,by optimizing the random relay matrix,RRCEH can effectively reduce the network's configuration requirements for cluster head energy harvesting capability,thus reducing the deployment cost of EHWSN.

Coati Optimization-Based Energy Efficient Routing Protocol for Unmanned Aerial Vehicle Communication

With the flexible deployment and high mobility of Unmanned Aerial Vehicles(UAVs)in an open environment,they have generated con-siderable attention in military and civil applications intending to enable ubiquitous connectivity and foster agile communications.The difficulty stems from features other than mobile ad-hoc network(MANET),namely aerial mobility in three-dimensional space and often changing topology.In the UAV network,a single node serves as a forwarding,transmitting,and receiving node at the same time.Typically,the communication path is multi-hop,and routing significantly affects the network’s performance.A lot of effort should be invested in performance analysis for selecting the optimum routing system.With this motivation,this study modelled a new Coati Optimization Algorithm-based Energy-Efficient Routing Process for Unmanned Aerial Vehicle Communication(COAER-UAVC)technique.The presented COAER-UAVC technique establishes effective routes for communication between the UAVs.It is primarily based on the coati characteristics in nature:if attacking and hunting iguanas and escaping from predators.Besides,the presented COAER-UAVC technique concentrates on the design of fitness functions to minimize energy utilization and communication delay.A varied group of simulations was performed to depict the optimum performance of the COAER-UAVC system.The experimental results verified that the COAER-UAVC technique had assured improved performance over other approaches.

Safety and effectiveness of butorphanol in epidural labor analgesia:A protocol for a systematic review and meta-analysis

BACKGROUND Epidural analgesia is the most effective analgesic method during labor.Butorphanol administered epidurally has been shown to be a successful analgesic method during labor.However,no comprehensive study has examined the safety and efficacy of using butorphanol as an epidural analgesic during labor.AIM To assess butorphanol's safety and efficacy for epidural labor analgesia.METHODS The PubMed,Cochrane Library,EMBASE,Web of Science,China National Knowledge Infrastructure,and Google Scholar databases will be searched from inception.Other types of literature,such as conference abstracts and references to pertinent reviews,will also be reviewed.We will include randomized controlled trials comparing butorphanol with other opioids combined with local anesthetics for epidural analgesia during labor.There will be no language restrictions.The primary outcomes will include the visual analog scale score for the first stage of labor,fetal effects,and Apgar score.Two independent reviewers will evaluate the full texts,extract data,and assess the risk of bias.Publication bias will be evaluated using Egger's or Begg's tests as well as visual analysis of a funnel plot,and heterogeneity will be evaluated using the Cochran Q test,P values,and I2 values.Meta-analysis,subgroup analysis,and sensitivity analysis will be performed using RevMan software version 5.4.This protocol was developed in accordance with the Preferred Reporting Items for Systematic Reviews and Meta-Analyses(PRISMA)Protocols statement,and the PRISMA statement will be used for the systematic review.RESULTS This study provides reliable information regarding the safety and efficacy of using butorphanol as an epidural analgesic during labor.CONCLUSION To support clinical practice and development,this study provides evidence-based findings regarding the safety and efficacy of using butorphanol as an epidural analgesic during labor.

Corneal collagen cross-linking in patients with keratoconus from the Dresden protocol to customized solutions:theoretical basis

Keratoconus is an ectatic condition characterized by gradual corneal thinning,corneal protrusion,progressive irregular astigmatism,corneal fibrosis,and visual impairment.The therapeutic options regarding improvement of visual function include glasses or soft contact lenses correction for initial stages,gas-permeable rigid contact lenses,scleral lenses,implantation of intrastromal corneal ring or corneal transplants for most advanced stages.In keratoconus cases showing disease progression corneal collagen crosslinking(CXL)has been proven to be an effective,minimally invasive and safe procedure.CXL consists of a photochemical reaction of corneal collagen by riboflavin stimulation with ultraviolet A radiation,resulting in stromal crosslinks formation.The aim of this review is to carry out an examination of CXL methods based on theoretical basis and mathematical models,from the original Dresden protocol to the most recent developments in the technique,reporting the changes proposed in the last 15y and examining the advantages and disadvantages of the various treatment protocols.Finally,the limits of non-standardized methods and the perspectives offered by a customization of the treatment are highlighted.

PSAP-WSN:A Provably Secure Authentication Protocol for 5G-Based Wireless Sensor Networks

Nowadays,the widespread application of 5G has promoted rapid development in different areas,particularly in the Internet of Things(IoT),where 5G provides the advantages of higher data transfer rate,lower latency,and widespread connections.Wireless sensor networks(WSNs),which comprise various sensors,are crucial components of IoT.The main functions of WSN include providing users with real-time monitoring information,deploying regional information collection,and synchronizing with the Internet.Security in WSNs is becoming increasingly essential because of the across-the-board nature of wireless technology in many fields.Recently,Yu et al.proposed a user authentication protocol forWSN.However,their design is vulnerable to sensor capture and temporary information disclosure attacks.Thus,in this study,an improved protocol called PSAP-WSNis proposed.The security of PSAP-WSN is demonstrated by employing the ROR model,BAN logic,and ProVerif tool for the analysis.The experimental evaluation shows that our design is more efficient and suitable forWSN environments.

CF-BFT:A Dual-Mode Byzantine Fault-Tolerant Protocol Based on Node Authentication

The consensus protocol is one of the core technologies in blockchain,which plays a crucial role in ensuring the block generation rate,consistency,and safety of the blockchain system.Blockchain systems mainly adopt the Byzantine Fault Tolerance(BFT)protocol,which often suffers fromslow consensus speed and high communication consumption to prevent Byzantine nodes from disrupting the consensus.In this paper,this paper proposes a new dual-mode consensus protocol based on node identity authentication.It divides the consensus process into two subprotocols:Check_BFT and Fast_BFT.In Check_BFT,the replicas authenticate the primary’s identity by monitoring its behaviors.First,assume that the systemis in a pessimistic environment,Check_BFT protocol detects whether the current environment is safe and whether the primary is an honest node;Enter the fast consensus stage after confirming the environmental safety,and implement Fast_BFT protocol.It is assumed that there are 3f+1 nodes in total.If more than 2f+1 nodes identify that the primary is honest,it will enter the Fast_BFT process.In Fast_BFT,the primary is allowed to handle transactions alone,and the replicas can only receive the messages sent by the primary.The experimental results show that the CF-BFT protocol significantly reduces the communication overhead and improves the throughput and scalability of the consensus protocol.Compared with the SAZyzz protocol,the throughput is increased by 3 times in the best case and 60%in the worst case.

Advanced DAG-Based Ranking(ADR)Protocol for Blockchain Scalability

In the past decade,blockchain has evolved as a promising solution to develop secure distributed ledgers and has gained massive attention.However,current blockchain systems face the problems of limited throughput,poor scalability,and high latency.Due to the failure of consensus algorithms in managing nodes’identities,blockchain technology is considered inappropriate for many applications,e.g.,in IoT environments,because of poor scalability.This paper proposes a blockchain consensus mechanism called the Advanced DAG-based Ranking(ADR)protocol to improve blockchain scalability and throughput.The ADR protocol uses the directed acyclic graph ledger,where nodes are placed according to their ranking positions in the graph.It allows honest nodes to use theDirect Acyclic Graph(DAG)topology to write blocks and verify transactions instead of a chain of blocks.By using a three-step strategy,this protocol ensures that the system is secured against doublespending attacks and allows for higher throughput and scalability.The first step involves the safe entry of nodes into the system by verifying their private and public keys.The next step involves developing an advanced DAG ledger so nodes can start block production and verify transactions.In the third step,a ranking algorithm is developed to separate the nodes created by attackers.After eliminating attacker nodes,the nodes are ranked according to their performance in the system,and true nodes are arranged in blocks in topological order.As a result,the ADR protocol is suitable for applications in the Internet of Things(IoT).We evaluated ADR on EC2 clusters with more than 100 nodes and achieved better transaction throughput and liveness of the network while adding malicious nodes.Based on the simulation results,this research determined that the transaction’s performance was significantly improved over blockchains like Internet of Things Applications(IOTA)and ByteBall.

Cell replacement with stem cell-derived retinal ganglion cells from different protocols

Glaucoma,characterized by a degenerative loss of retinal ganglion cells,is the second leading cause of blindness worldwide.There is currently no cure for vision loss in glaucoma because retinal ganglion cells do not regenerate and are not replaced after injury.Human stem cell-derived retinal ganglion cell transplant is a potential therapeutic strategy for retinal ganglion cell degenerative diseases.In this review,we first discuss a 2D protocol for retinal ganglion cell differentiation from human stem cell culture,including a rapid protocol that can generate retinal ganglion cells in less than two weeks and focus on their transplantation outcomes.Next,we discuss using 3D retinal organoids for retinal ganglion cell transplantation,comparing cell suspensions and clusters.This review provides insight into current knowledge on human stem cell-derived retinal ganglion cell differentiation and transplantation,with an impact on the field of regenerative medicine and especially retinal ganglion cell degenerative diseases such as glaucoma and other optic neuropathies.

Honey Badger Algorithm Based Clustering with Routing Protocol for Wireless Sensor Networks

Wireless sensor network(WSN)includes a set of self-organizing and homogenous nodes employed for data collection and tracking applications.It comprises a massive set of nodes with restricted energy and processing abilities.Energy dissipation is a major concern involved in the design of WSN.Clustering and routing protocols are considered effective ways to reduce the quantity of energy dissipation using metaheuristic algorithms.In order to design an energy aware cluster-based route planning scheme,this study introduces a novel Honey Badger Based Clustering with African Vulture Optimization based Routing(HBAC-AVOR)protocol for WSN.The presented HBAC-AVOR model mainly aims to cluster the nodes in WSN effectually and organize the routes in an energy-efficient way.The presented HBAC-AVOR model follows a two stage process.At the initial stage,the HBAC technique is exploited to choose an opti-mal set of cluster heads(CHs)utilizing afitness function involving many input parameters.Next,the AVOR approach was executed for determining the optimal routes to BS and thereby lengthens the lifetime of WSN.A detailed simulation analysis was executed to highlight the increased outcomes of the HBAC-AVOR protocol.On comparing with existing techniques,the HBAC-AVOR model has outperformed existing techniques with maximum lifetime.

An Enhanced Group Key-Based Security Protocol to Protect 5G SON Against FBS

Network operators are attempting many innovations and changes in 5G using self-organizing networks(SON).The SON operates on the measurement reports(MR),which are obtained from user equipment(UE)and secured against malware and userspace programs.However,the synchronization signal block that the UE relies on to measure the wireless environment configured by a base station is not authenticated.As a result,the UE will likely gauge the wrong wireless environment configured by a false base station(FBS)and transmit the corresponding MR to the serving base station,which poisons the data used for 5G SONs.Therefore,the serving base stations must verify the authenticity of the MR.The 3GPP has advocated numerous solutions for this issue,including the use of public key certificates,identity-based keys,and group keys.Although the solution leveraging group keys have better efficiency and practicality than the other two,they are vulnerable to security threats caused by key leaks via insiders or malicious UE.In this paper,we analyze these security issues and propose an improved group key protocol that uses a new network function,called a broadcast message authentication network function(BMANF),which validates broadcasted messages on behalf of the UE.The protocol operates in two phases:initial and verification.During the initial phase,the 5G core network distributes a shared secret key to the BMANF and UE,allowing the latter to request an authentication ticket from the former.During the verification phase,the UE requests the BMANF to validate the broadcasted messages received from base stations using the ticket and its corresponding shared key.For evaluation,we formally verified the proposed protocol,which was then compared with alternative methods in terms of computing cost.As a result,the proposed protocol fulfills the security requirements and shows a lower overhead than the alternatives.

A Contention-Based MAC and Routing Protocol for Wireless Sensor Network

Advance development of wireless technologies and micro-sensor systems have enabled Wireless Sensor Network (WSN) to emerge as a leading solution in many crucial sensor-based applications. WSN deploys numerous resource-constrained sensor nodes which have limited power supply, memory and computation capability in a harsh environment. Inefficient routing strategy results in degraded network performance in terms of reliability, latency and energy efficiency. In this paper, a cross-layer design, Contention-based MAC and Routing protocol is proposed, termed Contention/SNIR-Based Forwarding (CSBF) protocol. CSBF utilizes the geographical information of sensor nodes to effectively guide the routing direction towards destination node, thereby enhancing reliability. Furthermore, Signal-to-Noise-plus-Interference Ratio (SNIR) metric is used as a routing parameter to guarantee high quality link for data transmission. A Contention-Winner Relay scheme is utilized to reduce the delays caused by the contention procedure. Energy efficiency is also improved by introducing sleep mode technique in CSBF. The simulation work is carried out via OMNeT++ network simulator. The performance of CSBF is compared with other existing routing protocols such as AODV and DSDV in terms of packet delivery ratio (PDR), average end-to-end (ETE) delay and energy consumption per packet. Simulation results highlight that CSBF outperforms AODV and DSDV protocols in respect of PDR and energy efficiency. CSBF also has the most consistent overall network performance.

Home Monitoring of Estrone-3-Glucuronide (E1-3G) Levels in Two Different Ovarian Stimulation Protocols: A Pilot Study

Background: Studies have shown a strong correlation between the growth of E2 in serum and estrone-3-glucuronide (E1-3G) in urine during ovarian stimulation. Thus, we developed theoretical models for using urinary E1-3G in ovarian stimulation and focused on their experimental verification and analysis. Methods: A prospective, observational pilot study was conducted involving 54 patients who underwent 54 cycles of ovarian stimulation. The goal was to establish the growth rate of urinary E1-3G during the course of stimulation and to determine the daily upper and lower limits of growth rates at which stimulation is appropriate and safe. Controlled ovarian stimulation was performed using two different stimulation protocols—an antagonist protocol in 25 cases and a progestin-primed ovarian stimulation protocol (PPOS) in 29 cases, with fixed doses of gonadotropins. From the second day of stimulation, patients self-measured their daily urine E1-3G levels at home using a portable analyzer. In parallel, a standard ultrasound follow-up protocol accompanied by a determination of E2, LH, and P levels was applied to optimally control stimulation. Results: The average daily growth rates in both groups were about 50%. The daily increase in E1-3G for the antagonist protocol ranged from 14% to 79%, while they were 28% to 79% for the PPOS protocol. Conclusion: This is the first study to analyze the dynamics of E1-3G in two different protocols and to estimate the limits of its increase during the entire course of the stimulation. The results confirm our theoretical model for the viability of using urinary E1-3G for monitoring ovarian stimulation.

Design of an Efficient and Provable Secure Key Exchange Protocol for HTTP Cookies

Cookies are considered a fundamental means of web application services for authenticating various Hypertext Transfer Protocol(HTTP)requests andmaintains the states of clients’information over the Internet.HTTP cookies are exploited to carry client patterns observed by a website.These client patterns facilitate the particular client’s future visit to the corresponding website.However,security and privacy are the primary concerns owing to the value of information over public channels and the storage of client information on the browser.Several protocols have been introduced that maintain HTTP cookies,but many of those fail to achieve the required security,or require a lot of resource overheads.In this article,we have introduced a lightweight Elliptic Curve Cryptographic(ECC)based protocol for authenticating client and server transactions to maintain the privacy and security of HTTP cookies.Our proposed protocol uses a secret key embedded within a cookie.The proposed protocol ismore efficient and lightweight than related protocols because of its reduced computation,storage,and communication costs.Moreover,the analysis presented in this paper confirms that proposed protocol resists various known attacks.

Enhancing Network Design through Statistical Evaluation of MANET Routing Protocols

This paper contributes a sophisticated statistical method for the assessment of performance in routing protocols salient Mobile Ad Hoc Network(MANET)routing protocols:Destination Sequenced Distance Vector(DSDV),Ad hoc On-Demand Distance Vector(AODV),Dynamic Source Routing(DSR),and Zone Routing Protocol(ZRP).In this paper,the evaluation will be carried out using complete sets of statistical tests such as Kruskal-Wallis,Mann-Whitney,and Friedman.It articulates a systematic evaluation of how the performance of the previous protocols varies with the number of nodes and the mobility patterns.The study is premised upon the Quality of Service(QoS)metrics of throughput,packet delivery ratio,and end-to-end delay to gain an adequate understanding of the operational efficiency of each protocol under different network scenarios.The findings explained significant differences in the performance of different routing protocols;as a result,decisions for the selection and optimization of routing protocols can be taken effectively according to different network requirements.This paper is a step forward in the general understanding of the routing dynamics of MANETs and contributes significantly to the strategic deployment of robust and efficient network infrastructures.