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.

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.

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.

Designing Proportional-Integral Consensus Protocols for Second-Order Multi-Agent Systems Using Delayed and Memorized State Information

This paper is concerned with consensus of a secondorder linear time-invariant multi-agent system in the situation that there exists a communication delay among the agents in the network.A proportional-integral consensus protocol is designed by using delayed and memorized state information.Under the proportional-integral consensus protocol,the consensus problem of the multi-agent system is transformed into the problem of asymptotic stability of the corresponding linear time-invariant time-delay system.Note that the location of the eigenvalues of the corresponding characteristic function of the linear time-invariant time-delay system not only determines the stability of the system,but also plays a critical role in the dynamic performance of the system.In this paper,based on recent results on the distribution of roots of quasi-polynomials,several necessary conditions for Hurwitz stability for a class of quasi-polynomials are first derived.Then allowable regions of consensus protocol parameters are estimated.Some necessary and sufficient conditions for determining effective protocol parameters are provided.The designed protocol can achieve consensus and improve the dynamic performance of the second-order multi-agent system.Moreover,the effects of delays on consensus of systems of harmonic oscillators/double integrators under proportional-integral consensus protocols are investigated.Furthermore,some results on proportional-integral consensus are derived for a class of high-order linear time-invariant multi-agent systems.

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.

Distributed Fault Estimation for Nonlinear Systems With Sensor Saturation and Deception Attacks Using Stochastic Communication Protocols

This paper is aimed at the distributed fault estimation issue associated with the potential loss of actuator efficiency for a type of discrete-time nonlinear systems with sensor saturation.For the distributed estimation structure under consideration,an estimation center is not necessary,and the estimator derives its information from itself and neighboring nodes,which fuses the state vector and the measurement vector.In an effort to cut down data conflicts in communication networks,the stochastic communication protocol(SCP)is employed so that the output signals from sensors can be selected.Additionally,a recursive security estimator scheme is created since attackers randomly inject malicious signals into the selected data.On this basis,sufficient conditions for a fault estimator with less conservatism are presented which ensure an upper bound of the estimation error covariance and the mean-square exponential boundedness of the estimating error.Finally,a numerical example is used to show the reliability and effectiveness of the considered distributed estimation algorithm.

Research trends of clinical studies on acupuncture protocols over the past 20 years:a bibliometric analysis

Background:Acupuncture protocols are essential as they guide study design and improve the quality of clinical trial,thus preventing avoid research waste.Given the increasing number of publications on acupuncture protocols,this study aimed to assess the publications trends of acupuncture protocols over the past two decades and provided an overview for future research directions.Methods:Publications focusing on acupuncture protocols in clinical settings were retrieved and compiled from the Web of Science Core Collection spanning the period from 2004 to 2023.CiteSpace and Microsoft Excel software were used to analyze the relationship of publication with countries,institutions,authors,co-cited author,journals,references,keywords and other literature aspects.Results:This study analyzed 721 articles encompassing acupuncture protocols.A continuous yet fluctuating growth in publications volume were observed from 2004 to 2023.Notably,China stands at the forefront in contributing to acupuncture protocols,publishing 513 papers and demonstrating a high centrality score of 1.07 in cooperative network.Furthermore,China has fostered close collaborations with the USA and South Korea.Beijing University of Chinese Medicine(89),Zhishun Liu(36)and Trials(306)emerged as the top contributors in terms of institution,author,and journal,respectively.However,inter-institutional and author collaboration was relatively weak.Macpherson H was the most frequently cited author.High-frequency keywords included“randomized controlled trials”,“acupuncture”,“management”,“study protocol”,“quality of life”.Analysis of timeline diagram of keywords indicated that“functional dyspepsia”,“stroke”,“electroacupuncture”,and“colorectal cancer”were the research development trends and focus.Conclusion:Clinical acupuncture protocols have experienced robust development over the past two decades,with current research hotspots focusing on disease management and quality of life,which remain key research concerns.Moreover,we advocate for researchers to publish acupuncture protocols,which remain key research concerns.This approach allows for thorough pre-study planning of methodologies and objectives,enhancing scientific rigor through peer review,thereby laying the foundation for conducting high-quality research.

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.

Diagnosis,treatment protocols,and outcomes of liver transplant recipients infected with COVID-19

Several cases of fatal pneumonia during November 2019 were linked initially to severe acute respiratory syndrome coronavirus 2,which the World Health Organization later designated as coronavirus disease 2019(COVID-19).The World Health Organization declared COVID-19 as a pandemic on March 11,2020.In the general population,COVID-19 severity can range from asymptomatic/mild symptoms to seriously ill.Its mortality rate could be as high as 49%.The Centers for Disease Control and Prevention have acknowledged that people with specific underlying medical conditions,among those who need immunosuppression after solid organ transplantation(SOT),are at an increased risk of developing severe illness from COVID-19.Liver transplantation is the second most prevalent SOT globally.Due to their immunosuppressed state,liver transplant(LT)recipients are more susceptible to serious infections.Therefore,comorbidities and prolonged immunosuppression among SOT recipients enhance the likelihood of severe COVID-19.It is crucial to comprehend the clinical picture,immunosuppressive management,prognosis,and prophylaxis of COVID-19 infection because it may pose a danger to transplant recipients.This review described the clinical and laboratory findings of COVID-19 in LT recipients and the risk factors for severe disease in this population group.In the following sections,we discussed current COVID-19 therapy choices,reviewed standard practice in modifying immunosuppressant regimens,and outlined the safety and efficacy of currently licensed drugs for inpatient and outpatient management.Additionally,we explored the clinical outcomes of COVID-19 in LT recipients and mentioned the efficacy and safety of vaccination use.

Fast and scalable routing protocols for data center networks

Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.

Upgraded Analytical Protocols in Bauxite Refining Industry Using Composite Sampling Approach to Minimize Laboratory Analysis Load

The laboratories in the bauxite processing industry are always under a heavy workload of sample collection, analysis, and compilation of the results. After size reduction from grinding mills, the samples of bauxite are collected after intervals of 3 to 4 hours. Large bauxite processing industries producing 1 million tons of pure aluminium can have three grinding mills. Thus, the total number of samples to be tested in one day reaches a figure of 18 to 24. The sample of bauxite ore coming from the grinding mill is tested for its particle size and composition. For testing the composition, the bauxite ore sample is first prepared by fusing it with X-ray flux. Then the sample is sent for X-ray fluorescence analysis. Afterwards, the crucibles are washed in ultrasonic baths to be used for the next testing. The whole procedure takes about 2 - 3 hours. With a large number of samples reaching the laboratory, the chances of error in composition analysis increase. In this study, we have used a composite sampling methodology to reduce the number of samples reaching the laboratory without compromising their validity. The results of the average composition of fifteen samples were measured against composite samples. The mean of difference was calculated. The standard deviation and paired t-test values were evaluated against predetermined critical values obtained using a two-tailed test. It was found from the results that paired test-t values were much lower than the critical values thus validating the composition attained through composite sampling. The composite sampling approach not only reduced the number of samples but also the chemicals used in the laboratory. The objective of improved analytical protocol to reduce the number of samples reaching the laboratory was successfully achieved without compromising the quality of analytical results.

Survey on recent advances in IoT application layer protocols and machine learning scope for research directions

The Internet of Things(IoT)has been growing over the past few years due to its flexibility and ease of use in real-time applications.The IoT's foremost task is ensuring that there is proper communication among different types of applications and devices,and that the application layer protocols fulfill this necessity.However,as the number of applications grows,it is necessary to modify or enhance the application layer protocols according to specific IoT applications,allowing specific issues to be addressed,such as dynamic adaption to network conditions and interoperability.Recently,several IoT application layer protocols have been enhanced and modified according to application requirements.However,no existing survey articles focus on these protocols.In this article,we survey traditional and recent advances in IoT application layer protocols,as well as relevant real-time applications and their adapted application layer protocols for improving performance.As changing the nature of protocols for each application is unrealistic,machine learning offers means of making protocols intelligent and is able to adapt dynamically.In this context,we focus on providing open challenges to drive IoT application layer protocols in such a direction.

Event-Based Anomaly Detection for Non-Public Industrial Communication Protocols in SDN-Based Control Systems

As the main communication mediums in industrial control networks,industrial communication protocols are always vulnerable to extreme exploitations,and it is very difficult to take protective measures due to their serious privacy.Based on the SDN(Software Defined Network)technology,this paper proposes a novel event-based anomaly detection approach to identify misbehaviors using non-public industrial communication protocols,and this approach can be installed in SDN switches as a security software appliance in SDN-based control systems.Furthermore,aiming at the unknown protocol specification and message format,this approach first restructures the industrial communication sessions and merges the payloads from industrial communication packets.After that,the feature selection and event sequence extraction can be carried out by using the N-gram model and K-means algorithm.Based on the obtained event sequences,this approach finally trains an event-based HMM(Hidden Markov Model)to identify aberrant industrial communication behaviors.Experimental results clearly show that the proposed approach has obvious advantages of classification accuracy and detection efficiency.

A Recovery Algorithm for Self-Stabilizing Communication Protocols

This paper presents a recovery algorithm for self-stabilizing communication protocols. It first describes some concepts and a formal description method for the algorithm. Then it proposes the algorithm procedures, proves its correctness and analyses its complexity. Finally, it also verifies the availability and efficiency of the algorithm by illustrating an example protocol with multi-processes.

Evaluation of Energy Consumption of Proactive, Reactive, and Hybrid Routing Protocols in Wireless Mesh Networks Using 802.11 Standards

This paper provides a deep evaluation of the energy consumption of routing protocols. The evaluation is done along with other metrics such as throughput and packet delivery ratio (PDR). We introduce two more metrics to capture the efficiency of the energy consumption: e-throughput and e-PDR. Both are ratios in relation to the energy. We consider the three low layers of the stack. Three types of routing protocols are used: proactive, reactive, and hybrid. At the MAC and PHY layer, three radio types are considered: 802.11a/b/g. Finally, the number of nodes is varying in random topologies, with nodes being static or mobile. Simulations are conducted using NS3. The parameters of a real network interface card are used. From the results in mobile position scenarios, no protocol is outperforming the others;even if OLSR has the lowest energy consumption, most of the time. However, in constant position scenarios, AODV consumed a lower energy, apart from the scenarios using the 802.11a standard where HWMP energy consumption is the lowest. Regarding the energy efficiency, AODV protocols provided the best e-throughput and OLSR the best e-PDR in overall configurations. A framework for selecting energy-efficient routing protocol depending on network characteristics is proposed at the end.

Game-Based Automated Security Proofs for Cryptographic Protocols

Provable security has become a popular approach for analyzing the security of cryptographic protocols.However,writing and verifying proofs by hand are prone to errors.This paper advocates the automatic security proof framework with sequences of games.We make slight modifications to Blanchet's calculus to make it easy for parsing the initial game.The main contribution of this work is that it introduces algebraic properties with observational equivalences to automatic security proofs,and thus can deal with some practical cryptographic schemes with hard problems.We illustrate the use of algebraic properties in the framework by proving the semantic security of the ElGamal encryption scheme.

Model Checking Electronic CommerceSecurity Protocols Based on CTL

We present a model based on Computational Temporal Logic (CTL) methods forverifying security requirements of electronic commerce, protocols. The model describes formally theauthentication, confidentiality integrity, non-repudiation) denial of serviee and access control ofthe e-lectronic commerce protocols. We illustrate as case study a variant of the Lu-Smolka protocolproposed by Lu-Smolka Moreover, we have discovered two attacks that allow a dishonest user topurchase a good debiting the amountto another user. And also, we compared our work with relativeresearch works and found lhat the formal way of this paper is more general to specify securityprotocols for E-Commerce.

A survey on communication protocols and performance evaluations for Internet of Things

The Internet of Things (IoT) is a large-scale network of devices capable of sensing, data processing, and communicating with each other through different communication protocols. In today's technology ecosystem, IoT interacts with many application areas such as smart city, smart building, security, traffic, remote monitoring, health, energy, disaster, agriculture, industry. The IoT network in these scenarios comprises tiny devices, gateways, and cloud platforms. An IoT network is able to keep these fundamental components in transmission under many conditions with lightweight communication protocols taking into account the limited hardware features (memory, processor, energy, etc.) of tiny devices. These lightweight communication protocols affect the network traffic, reliability, bandwidth, and energy consumption of the IoT application. Therefore, determining the most proper communication protocol for application developers emerges as an important engineering problem. This paper presents a straightforward overview of the lightweight communication protocols, technological advancements in application layer for the IoT ecosystem. The survey then analyzes various recent lightweight communication protocols and reviews their strengths and limitations. In addition, the paper explains the experimental comparison of Constrained Applications Protocol (CoAP), Message Queuing Telemetry (MQTT), and WebSocket protocols, more convenient for tiny IoT devices. Finally, we discuss future research directions of communication protocols for IoT.

Mathematical Model Validation of Search Protocols in MP2P Networks

Broadcasting is a basic technique in Mobile ad-hoc network(MANET),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive flooding technique,floods the network with query messages,while the random walk technique operates by contacting the subsets of every node’s neighbors at each step,thereby restricting the search space.One of the key challenges in an ad-hoc network is the resource or content discovery problem which is about locating the queried resource.Many earlier works have mainly focused on the simulation-based analysis of flooding,and its variants under a wired network.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of P2P systems running over MANET.In this paper,we describe how P2P resource discovery protocols perform badly over MANETs.To address the limitations,we propose a new protocol named ABRW(Address Broadcast Random Walk),which is a lightweight search approach,designed considering the underlay topology aimed to better suit the unstructured architecture.We provide the mathematical model,measuring the performance of our proposed search scheme with different widely popular benchmarked search techniques.Further,we also derive three relevant search performance metrics,i.e.,mean no.of steps needed to find a resource,the probability of finding a resource,and the mean no.of message overhead.We validated the analytical expressions through simulations.The simulation results closely matched with our analyticalmodel,justifying our findings.Our proposed search algorithm under such highly dynamic self-evolving networks performed better,as it reduced the search latency,decreased the overall message overhead,and still equally had a good success rate.

Analysis and Improvement on Routing Protocols for Wireless Sensor Networks

Routing protocols are perceived to be growing hotspots and required to devote more time and work to studying it. Research on routing protocols of wireless sensor networks is significantly important to accurately guide the application. Theoretical analysis and comparison are one of the key steps in the protocol research. Restricted by irreversible factors of power and others, lifetime of wireless sensor networks is very short. In this paper, we analyze and compare the characteristics and application fields of existing protocols. On the basis of that, this paper mainly proposes an improved directed diffusion exploring the phase of reinforcing path, which chooses the way to strengthen the path after evaluating the critical factors. It was determined by simulation that improved directed diffusion has a higher transmission rate, and it satisfies the requirements, which balancing the energy consumption and prolonging the lifetime.