Water covers a greater part of the earth's surface. Even though we know very little about the underwater world as most parts of it remain unexplored. Oceans including other water bodies hold huge natural resources and also the aquatic lives. These are mostly unexplored and very few of those are known due to unsuited and hazardous environments for the human to explore. This vast underwater world can be monitored remotely from a distant location with much ease and less risk. To monitor water-bodies remotely in real-time, sensor networking has been playing a great role. It is needed to deploy a wireless sensor network over the volume which we want to surveil. For vast water bodies like oceans, rivers and large lakes, data is collected from the different heights of the water level which is sent to the surface sink. Unlike terrestrial communication, radio waves and other conventional mediums can't serve the purpose of underwater communication as they pose high attenuation and very reduced transmission range. Rather an acoustic medium can transmit data more efficiently and reliably in comparison to other mediums. To transmit data reliably from the bottom of the sea to the sinks at the surface, multi-hop communication is needed which must involve a certain scheme. For seabed to surface sink communication, leading researchers have proposed different routing protocols. The goal of these routing protocols is to make underwater communication more reliable, energy-efficient and delay efficient thus to improve the performance of the overall communication. This paper surveys the advancement and applications of the routing protocols which eventually helps in finding the most efficient routing protocol for the Underwater Wireless Sensor Network (UWSN).

Opportunistic routing is the latest technique that uses the broadcasting nature of the wireless medium to increase the number of potential forwarding nodes in the network. This, in turn improves the delivery rate and reliability of data transmission in the network. Compared to all previous classes of routing protocols, opportunistic routing offers numerous advantages which is exploited by the latest applications for efficient communication and resource sharing in dynamic ad hoc networks. These applications provide dynamic communication in disaster recovery environments. The objective of this research work is to review and classify all the major opportunistic routing protocols proposed for dynamic ad hoc networks. Further the issues and challenges with each of these existing protocol is discussed and future research directions are put forward

Opportunistic routing uses the broadcasting nature of the wireless medium to increase the number of potential forwarding nodes in the network. This, in turn improves the delivery rate and reliability of data transmission in the network. Compared to all previous classes of protocols, opportunistic routing offers numerous advantages which is exploited by the latest applications for efficient communication and resource sharing in dynamic ad hoc networks. The objective of this research work is to review and classify all the major opportunistic routing protocols proposed for dynamic ad hoc networks. Further the issues and challenges with each of these existing protocol is discussed and future research directions are put forward.

Due to the broadening of services from industrial enterprises to customers, the industrial network has gained more significance than what is really thought. As a part of this revolution, this paper tried to introduce the best suitable routing option for the healthcare, banking and internet services industries to optimize the routing department of their enterprises. RIP is not associated with this study, being out of favor in the industries due to hop count limitation. The idea behind doing such a thing is to avoid improper implantation of routing inside the enterprises which causes lack of optimization in routing department. The method which is selected for this paper is qualitative case study of banking, healthcare and internet services industries with unstructured interviews of IT experts of the respected industries in an open-ended questions fashion. The results were illustrated based on the stories and the discussion of the stories is the main contributor to the result of the study. The evaluation results of the stories have illustrated, that EIGRP is a suitable routing option for health care and banking, while OSPF can be suitable for the internet services industry. The implication of the study can be optimized network of industries such as healthcare, banking and internet services and it introduces the best suitable routing option for the demanded industries with the case study method and narrative analysis of the stories, which start from load balancing type and ends to demanded routing protocol, while reaching to demanded routing protocol, it introduces the best suitable routing option of that industry

Little has been written in literature about the clinical comparison of the single use of chlorhexidine (CHX) rather than its combination with cetylpyridinium chloride (CPC). The purpose of this study was to compare the clinical effectiveness of two at-home antiseptic regimens. Healthy subjects scheduled for dental surgery were enrolled. After the surgery, patients were randomly allocated in a first group (Group A) which received a manual ultra soft toothbrush (Mentadent Professional®), an antiseptic toothpaste with 0,12% CHX and Vitamin B3 (Mentadent Professional Azione Intensiva Gengive®) and an antiseptic mouthwash with 0,12% CHX and 0,07% CPC. The second group (Group B) received solely an antiseptic mouthwash with 0,2% in conjunction with Anti Discoloration System (Curasept ADS/DNA®) and were encouraged to use their usual toothbrush and toothpaste. Patients were instructed to use the products twice a day and to rinse for 30 seconds. On day 7, patients were examined for the Early Healing Score, Visual Plaque Index of the sutures, Numerical Rating Scale and mouthwash taste. Group A showed a statistically significant levels of EHS and taste satisfaction. The regimen based on CHX associate with vitamin B3 in the toothpaste and CPC in the mouthwash resulted in superior clinical outcomes and satisfaction compared to solely CHX.

This study outlines the development of an innovative method utilizing UHPLC-PDA for the simultaneous identification of polyphenols and bitter acids (alpha-acids, beta-acids, and iso-alpha-acids) in beer samples. The resulting chemical profiles were leveraged to distinguish the characteristics of four bergamot-flavored beers, each representing distinct styles (IPA, Lager, Blanche, and ALE), produced on a pilot-scale plant. In a streamlined 29-minute analysis, twenty-nine polyphenols and fourteen bitter acids were successfully identified under optimized separation conditions. Rigorous validation, encompassing parameters such as Limit of Detection (LOD), Limit of Quantification (LOQ), R-squared (R2), repeatability, and reproducibility, was conducted for polyphenol quantification using constructed calibration curves with seven levels. Exploring polyphenolic components as potential discriminators among different beer styles, a total of thirty-two polyphenolic compounds were identified and quantified, including characteristic bergamot peel polyphenols like neoeriocitrin, naringin, and neohesperidin. The determination of bitter units and total phenols further aided in style differentiation. Multivariate analysis provided additional insights into variations among specific beer styles, revealing discrepancies in the presence or relative concentrations of specific compounds linked to brewing ingredients and processes. This research enhances to trace the fingerprinting of the chemistry governing beer quality through a straightforward and cost-effective analytical approach, readily applicable in common laboratories.

Reservoir routing has been a routine procedure in hydrology, hydraulics and water management. It is typically based on the mass balance (continuity equation) and a conceptual equation relating storage and outflow. If the latter is linear, then there exists an analytical solution of the resulting differential equation, which can directly be utilized to find the outflow from known inflow, and to obtain macroscopic characteristics of the process, such as response and residence times, and their distribution functions. Here we streamline the reservoir routing framework and extend it to find approximate solutions for nonlinear cases. The proposed framework can also be useful for climatic tasks, such as describing the mass balance of atmospheric carbon dioxide and determining characteristic residence times, which have been an issue of controversy. Application of the theoretical framework results in excellent agreement with real world data. In this manner, we easily quantify the atmospheric carbon exchanges, and obtain reliable and intuitive results, without the need to resort to complex climate models. The mean residence time of atmospheric carbon dioxide turns out to be no more than four years and the response time is smaller than that, thus opposing the much longer mainstream estimates.

Histones are keys to many epigenetic events and their complexes have therapeutic and diagnostic importance. The determination of the structures of histone complexes is fundamental in the design of new drugs. Computational molecular docking is widely used for the prediction of target-ligand complexes. Large, linear peptides like the tail regions of histones are challenging ligands for docking due to their large conformational flexibility, extensive hydration, and weak interactions with the shallow binding pockets of their reader proteins. Thus, fast docking methods often fail to produce complex structures of such peptide ligands at a level appropriate for drug design. To answer this challenge, and improve the structural quality of the docked complexes, post-docking refinement has been applied using various molecular dynamics (MD) approaches. However, a final consensus has not been reached on the desired MD refinement protocol. In the present study, MD refinement strategies were systematically explored on a set of problematic complexes of histone peptide ligands with relatively large errors in their docked geometries. Six protocols were compared that differ in their MD simulation parameters. In all cases, pre-MD hydration of the complex interface regions was applied to avoid the unwanted presence of empty cavities. The best-performing protocol achieved a median of 32 % improvement over the docked structures in terms of the change of root mean squared deviations from the experimental references. The influence of structural factors and explicit hydration on the performance of post-docking MD refinements was also discussed to help their implementation in future methods and applications.

The IoT is recognized as one of the most important areas of future technology and is gaining vast attention from a wide range of industries. Although, after 20 years from the first published literature (2002) the technology (as a whole) is not yet mature. In this study we will review the basics of IoT with a general approach, by addressing the problems of a standard architecture, vulnerabilities and use cases of this promising technology. Moreover, we will review some of the communication protocols that have invented especially for IoT technology, security threats and general implementation challenges.

Transportation contributes significantly to greenhouse gas emissions, with electrification offering a promising solution. This study evaluates the degradation of State of Health (SOH) over 2.5 years for electrified buses under different charging protocols: DC Fast charging and Flash charging. The vehicles’ models, charging protocols, and financial implications are discussed. High-level simulations reveal that after 2.5 years, the Flash charging vehicle’s SOH reaches 88.93%, while the DC fast charging vehicle reaches 89.46%, showing a 0.47% difference. This slight variance is attributed to Flash charging vehicles avoiding full charge/discharge cycles, reducing battery aging impact. Considering this minimal SOH degradation difference, the choice between DC Fast charging and Flash charging primarily hinges on capital expenditure disparities. Flash charging, with its lower initial battery capacity and reduced capital costs, presents a compelling alternative for city busoperators seeking to electrify their fleets.

This retrospective study aimed to evaluate the performance of the hormone treatment protocols, determine the factors associated with pregnancy success after hormone treatment, and compare the cost-efficiencies of two types of hormone treatment among cyclic and noncyclic anestrous dairy cows. The clinical records of 279 anestrous cows who received hormone treatment for artificial insemination (AI) from 64 herds in the western region of Thailand were obtained from Kasetsart University Veterinary Teaching Hospital from January to August 2017. The performance of the hormone treatment protocols, fixed-time AI (TAI) and estrus detection before AI (EAI), showed that the pregnancy risk for the TAI protocol was higher than for the EAI protocol, but pregnancy per AI did not differ significantly between the two protocols in cyclic and noncyclic cows. Multivariate logistic regression analysis showed that cows receiving the TAI protocol were more likely to be pregnant compared to those treated with the EAI protocol. Cows with a 3.00 body condition score (BCS) <3.75 after treatment and loose-housing cows were more likely to become pregnant. Treatment during winter showed higher pregnancy success than in the summer and rainy seasons. The cost-efficiency analysis showed that the TAI protocol was the most cost-efficient option for noncyclic cows, whereas the EAI protocol was the most cost-efficient option for cyclic cows.

The Internet of Things (IoT) has become one of the most attractive domains nowadays. It works by creating a special network between physical devices such as vehicles, home equipment, and other items. In recent days, the common technologies of communication such as Wi-Fi and 2G/3G/4G cellular are insufficient for the IoT networks because they are designed to serve appliances with immense processing capabilities such as laptops and PCs. Moreover, most of these technologies are centralized and use an existing infrastructure. Currently, the new communication technologies such as Z-Wave, 6LowPAN, and Thread are dedicated to the IoT and have been developed to meet its requirements. These technologies can handle many factors such as range, data requirements, security, power demands, and battery life. Nevertheless, the security issues in IoT systems have major concerns and matters because vulnerabilities in such systems may result in fatal catastrophes. In this paper, an enhanced IoT security framework for authentication and authorization is proposed and implemented to protect the IoT protocols from different types of attacks such as man-in-the-middle attack, reply attack, and brute force attack. The proposed framework combines an enhanced token authentication that has identity verification capabilities and a new sender verification mechanism on the IoT device side based on time stamp, which in turn can mitigate the need for local identity verification methods in IoT devices. The proposed IoT security framework is tested using security analysis with different types of attacks compared with previous related frameworks. The analysis shows the high capability of the proposed framework to protect IoT networks against many types of attacks compared with current available security frameworks. Finally, the proposed framework is developed using Windows application to simulate the framework phases, check its validity through the real network, and calculate the payload time is adds.

The relentless challenges posed by the COVID-19 pandemic have placed immense pressure on densely populated regions, such as Hong Kong, particularly in the context of an aging population. The burgeoning demand for healthcare services has necessitated the optimization of resource al-location within healthcare systems. This research presents an innovative analytical queueing model specifically tailored to address the intricate gridlock dynamics prevalent in healthcare systems, with a focused application in the challenging landscape of COVID-19 management. Hong Kong, like numerous other regions, has experienced a demo-graphic transition leading to heightened healthcare demands. Traditional methodologies for scrutinizing gridlock issues in healthcare settings, including simulation models, often prove suboptimal within the context of sophisticated optimization frameworks. This study, however, delves into analytical queueing models, offering a more efficient and effective approach. These models have been underexplored, primarily due to the intricacies involved in modeling gridlock propagation within restricted capacity, a critical concern magnified by the COVID-19 pandemic. The novel Queueing Model introduced in this research incorporates the maintenance of queue capacities and topological aspects as exogenous parameters, rendering it exceptionally adaptable for diverse gridlock-related applications. This adaptability is especially pertinent to healthcare management during the COVID-19 crisis. The model meticulously integrates the concept of gridlock, furnishing a comprehensive comprehension of its origins and repercussions. Validation of this model involves rigorous comparison with established methodologies, exact results, and simulation data, consistently high-lighting its versatility and precision. By applying the model to healthcare management, we scrutinize the dynamics of patient flow within a Hong Kong hospital, placing specific emphasis on the critical issue of bed blockage, further exacerbated by the COVID-19 pandemic. The model's gridlock decomposition unearths the nuanced impact of bed blockage on distinct hospital units, addressing the imperative requirement for quantifying in-patient bed blockage within healthcare systems during a pandemic.

In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node or link failure. He then shows that “whether there is a protection routing to the destination” is NP-complete. Tapolcai find that two completely independent spanning trees, abbreviated as CISTs, can be used to configure the protection routing. In this paper, we propose dual protection routing trees, denoted as dual-PRTs to replace CISTs, which are less restrictive than CISTs. Next, we propose a transformation algorithm that uses dual-PRTs to configure the protection routing. Taking complete graphs Kn, complete bipartite graphs Km,n, hypercubes Qn, locally twisted cubes LTQn as examples, we provide a recursive method to construct dual-PRTs on them. This article will show that there are no two CISTs on K3,3, Q3, and LTQ3, but there exist dual-PRTs that can be used to configure the protection routing. As shown in the performance evaluation of simulation results, for both Qn and LTQn, we get the average path length of protection routing configured by dual-PRTs is shorter than that by two CISTs.

Routing a person through a traffic network presents a tension between selecting a fixed route that is easy to navigate and selecting an aggressively adaptive route that minimizes the expected travel time. We propose to create non-aggressive adaptive routes in the middle-ground seeking the best of both these extremes. Specifically, these routes still adapt to changing traffic conditions, however we limit the number of adjustments made in the route. This improves the user experience, by providing a continuum of options between saving travel time and minimizing navigation. We design strategies to model single and multiple route adjustments, and investigate enumerative techniques to solve these models. To alleviate the intractability with handling real-life traffic data, we develop efficient algorithms with easily computable lower and upper bounds. We finally present computational experiments highlighting the benefits of limited adaptability in terms of reducing the expected travel time.

This study introduces and demonstrates a comprehensive, accurate, unbiased approach to robust quantitative comparison of Electronic Nicotine Delivery Systems (ENDS) appropriate for establishing substantial equivalence (or lack thereof) between tobacco products. The approach is demonstrated across a family of thirteen pen- and pod-style ENDS products. Methods employed consist of formulating a robust emissions surface regression model, quantifying the empirical accuracy of the model as applied to each product, evaluating relationships between product design characteristics and maximum emissions characteristics, and presenting results in formats useful to researchers, regulators, and consumers. Results provide a response surface to characterize emissions (total particulate matter and constituents thereof) from each ENDS appropriate for use in a computer model and for conducting quantitative exposure comparisons between products. Results demonstrate that emissions vary as a function of puff duration, flow rate, E-Liquid composition, and device operating power. Further, results indicate that regulating design characteristics of ENDS devices and consumables may not achieve desired public health outcomes; it is more effective to regulate maximum permissible emissions directly. Three emissions outcome measures (yield per puff, mass concentration and constituent mass ratio) are recommended for adoption as standard quantities for reporting by manufacturers and research laboratories. The approach provides a means of (a) quantifying and comparing maximal emissions from ENDS products spanning their entire operating envelope, (b) comparative evaluation of ENDS devices and consumable design characteristics, and (c) establishing comparative equivalence of maximal emissions from ENDS. A consumer-oriented product emissions dashboard is proposed for comparative evaluation of ENDS exposure potential. Maximum achievable power dissipated in the coil of ENDS is identified as a potentially effective regulatory parameter.

Internet of things (IoT) is a network of smart things. This indicates the ability of these physical things to transfer information with other physical things. The characteristics of these networks, such as topology dynamicity and energy constraint, challenges the routing problem in these networks. Previous routing methods could not achieve the required performance in this type of network. Therefore, developers of this network designed and developed specific methods in order to satisfy the requirements of these networks. One of the routing methods is utilization of multi-path protocols which send data to its destination using routes with separate links. One of such protocols is AOMDV routing protocol. In this paper, this method is improved using gray system theory which chooses the best paths used for separate routes to send packets. To do this, AOMDV packet format is altered and some fields are added to it so that energy criteria, link expiration time, and signal to noise ratio can also be considered while selecting the best route. The proposed method named RMPGST-IoT is introduced which chooses the routes with highest rank for concurrent transmission of data, using a specific routine based on the gray system theory. In order to evaluate and report the results, the proposed RMPGST-IoT method is compared to the ERGID and ADRM-IoT approaches with regard to throughput, packet receiving rate, packet loss rate, average remaining energy, and network lifetime. The results demonstrate the superior performance of the proposed RMPGST-IoT compared to the ERGID and ADRM-IoT approaches.

Typhoid fever is a major public health burden which causes substantial global morbidity and mortality due to lack of decisive diagnostic protocols. The capacity of commonly use diagnostic test to validate the absence of typhoid fever is controversial. This study explores to evaluate new techniques for typhoid diagnosis and proposed a harmonised suitable standardized composite reference to be adopted. Published peer-reviewed articles indexed in PubMed, MEDLINE and Google scholar were reviewed for hospital-based studies. This study reveals new typhoid diagnostic techniques such as proteomics, serology, Rapid Diagnostic tests (RDTs), transcriptomics, genomics, and metabolomics. 34.4% of the studies use prospective study design. The study result establishes that, Widal test has a moderate diagnostic accuracy with average percentage sensitivity (52.9%), specificity (54%), positive predictive value (PPV) (56.8%) as well as negative predictive value (NPV) (55.6%) when compared with 29.4%, 28%, 29.5%, and 27.8% of Typhidot respectively. The findings showed a statistically significant difference on the sensitivity between Widal and Typhidot t (40) = 2.639, p = 0.012 at p<0.05 using independent sample t-test. When there is no perfect reference standard that has an optimal diagnostic accuracy, the need for a harmonised suitable standardized composite reference is essential. Hence, this study recommends that, peripheral blood culture with established sensitivity of 60% and Widal test with average sensitivity of 52.9% be adopted as a consensus composite reference standard for typhoid fever diagnosis in other to improve confidence in prevalence estimates.

In this work we study the energy consumption by various modern secured hash functions (MD2, MD5, SHA-1, and SHA-2) and modern symmetric key encryption protocols (Blowfish, DES, 3DES, and AES) from the algorithmic perspective. We identify various parameters that moderate energy consumption of these hashes and protocols. Our work is directed towards redesigning or modifying these algorithms to make them consume lesser energy. As a first step, we try to determine the applicability of the asymptotic energy complexity model by Roy et. al. on these hashes and protocols. Specifically, we try to observe whether parallelizing the access of blocks of data in these algorithms reduces their energy consumption based on the energy model. Our results confirm the applicability of the energy model on these hashes and protocols. Our work is motivated by the relevance and importance of cryptographic hashes and symmetric key protocols for modern ICT (Information and Communication Technology), and ICT enabled industry to keep them protected from dynamically changing threat scenarios. Hence the design of more energy efficient hashes and protocols will definitely contribute in reducing the ICT energy consumption that is continuously increasing.

Routing quantum information among different nodes in a network is a fundamental prerequisite for a quantum internet. While single-qubit routing has been largely addressed, many-qubit routing protocols have not been intensively investigated so far. Building on the many-excitation transfer protocol in Ref. , we apply the perturbative transfer scheme to a two-excitation routing protocol on a network where multiple two-receivers block are coupled to a linear chain. We address both the case of switchable and permanent couplings between the receivers and the chain. We find that the protocol allows for efficient two-excitation routing on a fermionic network, although for a spin-12 network only a limited region of the network is suitable for high-quality routing.

The generalization of Farey graphs and extended Farey graphs are all originated from Farey graph and scale-free and small-world simultaneously. We propose a labeling of the vertices for it that allows determining all the shortest paths routing between any two vertices only based on their labels. The maximum number of shortest paths between any two vertices is huge as the product of two Fibonacci numbers, however, the label-based routing algorithm runs in linear time O(n). The existence of an efficient routing protocol for Farey-type models should help the understanding of several physical dynamic processes on it.

Over the last decade the blockchain technology has emerged to provide solutions to the complexity and privacy challenges of using distributed databases. It reduces the cost for customers by eliminating intermediaries and builds the trust in peer-to-peer communications. Over this time, the concept of blockchain has shifted greatly due to its potential in business growth for enterprises and the rapidly evolving applications in a collaborative smart cities' ecosystem, healthcare, and governance. Many platforms, with different architectures and consensus protocols, have been introduced. Consequently, it becomes challenging for an application developer to choose the right platform. Furthermore, blockchain has misaligned with the goals for efficient green collaborative digital ecosystem. Therefore, it becomes critical to address this gap and to build new frameworks to align blockchain with those goals. In this paper, we discuss the evolution of blockchain architecture and consensus protocols, bringing a retrospective analysis and discussing the rationale of the evolution of the various architectures and protocols, as well as capturing the assumptions conducting to their development and contributions to building collaborative applications. We introduce a classification of those architectures helping developers to choose a suitable platform for applications and providing insights for future research directions in the field to build new frameworks.

African swine fever (ASF) is a notifiable viral disease of domestic and wild suids. Despite intensive re-search efforts, the pathogenesis of the disease is still far from being understood. Analysis of biomarkers in different body fluids may supplement traditional pathogenesis studies. As reliable protocols are often es-tablished in laboratories with lower biosafety, reliable inactivation of samples is crucial. The objective of this study was to find a procedure that inactivates the virus while preserving the biomarkers for down-stream analyses. To this means, three different inactivation protocols were employed, namely Tergitol-type NP-40 (NP-40) and polyoxyethylene-p-t-octylphenol (Triton X-100), respectively, and one with 95 °C heating. It could be demonstrated that all samples treated with 0.5% (v/v) concentration of both deter-gents showed absence of virus infectivity. The same was true for heated samples. However, heated serum was not suitable for analyses. Next, the treatment impact on biomarker readouts was assessed. While all protocols had an impact on the detection of biomarkers, correlation was retained. Especially NP-40 could be the desired detergent for more accurate measurements while achieving efficient virus inactivation. Based on these studies, samples can be reliably inactivated for most biomarker analyses and thus broader interdisciplinary cooperation is possible.

From ancient time, electric grid system developed as one way direction in which users get the electricity from generators to far end. However, it is not the consumer centric as its one way process and consumer have no way to communicate to the server. Thus, with the development of digital revolution, the grid converted to smart grid and meter converted to smart meter. In smart grid, the protocol follows the bidirectional way of communication with support of consumers in the system. Recently in 2016, Jo et al. proposed the scheme for smart grid system using privacy preserving model and claimed to be efficient and secure. However, in this paper we have analyzed the scheme of Jo et al. and proved that the scheme is vulnerable to Replay attack and afterwards shows the change in protocol to withstand against this attack.

"Industry 5.0” is the latest industrial revolution. A variety of cutting-edge technologies, including artificial intelligence, the Internet of Things (IoT), and others, come together to form it. This new era will bring about significant changes in the way businesses operate, allowing them to become more cost-effective, more efficient, and produce higher-quality goods and services. Because sen-sors are getting better, 5G networks are being put in place, and more industrial equipment and machinery are becoming available, the manufacturing sector is going through a significant period of transition right now. These newly scalable opportunities make it possible to use and spread blockchain architectures on the shop floor, which is made possible by the ever-decreasing costs associated with implementing blockchain technology. Even though modern production models make use of the cloud (both internal and external services), networks and systems can take ad-vantage of the cloud's relatively low cost, scalability, increased computational power, real-time communication, and data transfer capabilities to create much smarter and more autonomous systems. This paper presents the results of an investigation into how blockchain services for large-scale industry networks could benefit from increased levels of security, transparency, and efficiency. We discuss the ways in which decentralized networks that make use of protocols and meshes might make things better with these technologies, which are not going away anytime soon. We emphasize the significance of new design in regards to cybersecurity, data integrity, and storage by using straightforward examples that have the potential to lead to the excellence of distributed systems.

This paper introduces a new routing and touring service both for outdoor and indoor places of touristic and cultural interest designed to be used in the wider area of ​​Attica, Greece. This service is the result of the work done in OPTORER project and it aspires to offer a range of innovative and thematic routes to several specified points of interest in the selected area of Attica, encouraging the combination of indoors and outdoors routes in a single tour. The aim is to optimize the user experience while promoting specific, user-centric features with safety and social welfare being a priority for every designed tour resulting in enhancing the touristic experience in the area. Using a common smartphone device, as well as common wearable devices (i.e., smartwatches), the OPTORER service will provide an end-to-end solution by developing the algorithms and end-user applications, together with an orchestration platform responsible for managing, operating and executing the service that produces and presents to the end user results derived from solving dynamically complex optimization problems.

This paper presents an in-depth contextualized tutorial on Agricultural IoT (Agri-IoT), covering the fundamental concepts, assessment of routing architectures and protocols, and performance optimization techniques via systematic survey and synthesis of related literature. The negative impacts of climate change and the increasing global population on food security and unemployment threats have motivated the adoption of the wireless sensor network (WSN)-based Agri-IoT as an indispensable underlying technology in precision agriculture and greenhouses to improve food production capacities and quality. However, most related Agri-IoT testbed solutions have failed to achieve their performance expectations due to the lack of an in-depth and contextualized reference tutorial that provides a holistic overview of communication technologies, routing architectures, and performance optimization modalities based on users’ expectations. Thus, although IoT applications are founded on a common idea, each use case (e.g., Agri-IoT) varies based on specific performance and users expectations as well as its technological, architectural, and deployment requirements. Likewise, the agricultural setting is a unique and hostile area where conventional IoT technologies do not apply, hence the need for this tutorial. Consequently, this tutorial addresses these via the following contributions: (1) a systematic overview of the fundamental concepts, technologies, and architectural standards of WSN-based Agri-IoT, (2) an evaluation of the technical design requirements of a robust, location-independent, and affordable Agri-IoT, (3) a comprehensive survey of the benchmarking fault tolerance techniques, communication standards, routing and medium access control (MAC) protocols, and WSN-based Agri-IoT testbed solutions, and (4) an in-depth case study on how to design a self-healing, energy-efficient, affordable, adaptive, stable, autonomous, and cluster-based WSN-specific Agri-IoT from a proposed taxonomy of multi-objective optimization (MOO) metrics that can guarantee an optimized network performance. Furthermore, this tutorial established new taxonomies of faults, architectural layers, and MOO metrics for cluster-based Agri-IoT (CA-IoT) networks and a 3-tier objective framework with remedial measures for designing an efficient associated supervisory protocol for cluster-based Agri-IoT networks.

We aimed to directly compare the cost-effectiveness of the NELSON and NLST screening protocols, two trials influencing lung cancer screening implementation internationally. A decision-analytic model analyzing the cost-effectiveness of the NELSON protocols was manipulated to reflect the protocols of the NLST, while maintaining features specific to the Hungarian healthcare setting. In the NELSON protocol, there are three possible outcomes to the initial round of screening: positive, negative, or indeterminate, indicating an uncertain degree of suspicion for lung cancer. This pro-tocol differs from the NLST protocol, in which the only possible screening outcomes are positive or negative, with no indeterminate option. The NLST pathway for smokers aged 55-74 resulted in a 43 € increase in total average lifetime costs compared to the Hungarian screening pathway and re-sulted in a lifetime gain of 0.006 QALYs. The incremental costs and QALYs yield an ICER of 7875 €/QALY. Our results demonstrate that assigning any suspicious LDCT screen as a positive result (NLST protocol) rather than indeterminate (NELSON protocol) can yield a slight QALY gain that is worth the additional use of resources according to Hungary’s willingness to pay threshold. Our study provides insight on the cost-effectiveness, advantages, and disadvantages of various LDCT screening protocols for lung cancer and can assist other countries as they implement their screening programs.

The widespread proliferation of sensor nodes in the era of Internet of Things (IoT) coupled with increasing usage of wireless spectrums especially the ISM band makes it difficult to deploy real-life IoT. Currently, the cognitive radio technology enables sensor nodes communicate with each other through the licensed spectrum bands as well as the free ISM bands. Cognitive radio networks (CRSNs) are considered as a promising solution to the problem of spectrum under utilization and artificial radio spectrum scarcity. The paradigm of dynamic spectrum access allows secondary users (SUs) to utilize wireless spectrum resources which belong to primary users (PUs) with minimal interference to PUs. Due to the dynamic spectrum availability and quality, routing for SUs in multi-hop CRSNs is a challenge. In this paper, we introduce novel routing metrics that estimate both the future spectrum availability and the average transmission time with the consideration of both the global statistical spectrum usage and local instant spectrum resources. In our novel routing metrics, one retransmission is allowed and considered to reduce the probability of rerouting upon PU's arrival. Then, we propose two routing algorithms for multi-hop CRSNs. Finally, we conduct simulations, whose results show that our proposed algorithms lead to a significant performance improvement over the reference algorithm.

After the great success of Mobile wallet, the Internet of Things (IoT) leaves the door wide open for consumers to use their connected devices to access their bank accounts and perform routine banking activities from anywhere, anytime and with any device. However, consumers need to feel safe when interacting with IoT-based payment systems, and their personal information should be protected as much as possible. Unlike as usually done in the literature, in this paper, we introduce two lightweight and secure IoT-based payment protocols based on an identity-based signature scheme. We adopt a server-aided verification technique to construct the first scheme. This technique allows to outsource the heavy computation overhead on the sensor node to a cloud server while maintaining the user's privacy. The second scheme is built upon a pairing-free ECC-based security protocol to avoid the heavy computational complexity of bilinear pairing operations. The security reduction results of both schemes are held in the Random Oracle Model (ROM) under the discrete logarithm and computational Diffie-Hellman assumptions. Finally, we experimentally compare the proposed schemes against each other and against the original scheme on the most commonly used IoT devices: a smartphone, a smartwatch and the embedded device Raspberry Pi. Compared with existing schemes, our proposed schemes achieve significant efficiency in the term of communication and computational overheads

Versatility, sensitivity and accuracy have made the real-time polymerase chain reaction (qPCR) a crucial tool for research as well as diagnostic applications. However, for point-of-care (PoC) use traditional qPCR faces two main challenges: long run times mean results are not available for half an hour or more and the requisite high-temperature denaturation requires more robust and pow-er-demanding instrumentation. This study addresses both issues and revised primer and probe designs, modified buffers and low ∆T protocols which, together, speed up qPCR on conventional qPCR instruments and will allow the development of robust, point-of-care devices. Our approach, called "FlashPCR", also allows efficient reverse transcription as part of a one-step RT-qPCR pro-tocol, making it universally applicable for both rapid research and diagnostic applications.

The Soil and Water Assessment Tool (SWAT) is one of the most widely used hydrologic models. SWAT has been undergoing constant changes since its development. However, compartment review and testing of SWAT are comparably limited, especially the flood routing functions. In this study, the daily flood routing subroutines of different SWAT versions were reviewed and tested using a well observed segment of the Weser river located in Germany. Results show several problems with the flood routing subroutines of SWAT. The variable storage subroutine of SWAT (revision 664) does not transform the flood wave. Unphysical results could be obtained with the variable storage routing of SWAT (revision 528). The Muskingum subroutine of SWAT (revisions 664 and 528) overestimates channel evaporation (resulting in a bias of 14\% to 19% in streamflow) and underestimates transmission losses. Simulated results show that the timing and shape of the flood wave could be improved with a corrected Muskingum subroutine. Based on the results of this study, we suggest the SWAT user community to review their existing SWAT models to see how the aforementioned issues will affect their methods, findings and conclusions.

The reliability of Underwater Wireless Sensor Networks (UWSNs) is measured in terms of energy consumption (EC), end-to-end delay(E2E) and packet delivery ratio (PDR). The adverse effects of channel may cause data loss. Reducing delay up to possible extend improves the reliability of the network, also increasing the number of nodes in a particular network increase reliability. Besides, increasing the number of nodes improve reliability but also increase power consumption. In order to overcome these shortcomings, the two routing protocols are proposed in this paper, namely Delay and Reliability Aware Routing (DRAR) protocol and Cooperative Delay and Reliability Aware Routing (Co-DRAR) protocol for UWSNs. In DRAR protocol, network is divided into two equal regions where two sink nodes(SNs) are positioned at upper region of the network and two SNs are placed at the mid region of the network. The protocol choose the relay node based on residual energy (RE), distance and Bit Error Rate (BER). These parameters protect the data packets from corruption and also provide stable path (where nodes remain active for longer period and do not die quickly). The protocol uses single link and may get worse sometimes while changing channel circumstances. To address this problem, cooperative routing scheme is added to DRAR protocol in order to developed its enhanced version known as Co-DRAR protocol. The protocol works by allowing the destination to receive multiple copies of data packets in order to decide the quality of packets. The proposed protocols DRAR and Co-DRAR perform routing irrespective to geographical position of sensors nodes conversely to the some of conventional routing protocols that's way our propose protocol better perform than the well-known protocol i.e. Depth base routing (DBR) in terms of EC, E2E, PDR, dead nodes, packet drop ratio and number of alive nodes (ANs).

A new variant of two-echelon routing problem is investigated, where the truck and the drone are used to cooperatively complete the deliveries of all parcels. The truck not only acts as a tool for parcel delivery, but also serves as a moving depot for the drone. The drone can carry several parcels and take off from the truck, while returning to the truck after completing the delivery. The energy consumption model for the routing process of the drone is analyzed, when it is utilized to deliver multiple parcels. A two-stage route-based modelling approach is proposed to optimize both the truck’s main route and the drone’s adjoint flying routes. A hybrid heuristic integrating nearest neighbor and cost saving strategies is developed to quickly construct a feasible solution. The simulated annealing algorithm is applied to improve the quality of the solution, where a Tabu list is employed to improve the search efficiency. Random instances at different scales are used to test the performance of the proposed algorithm. A case study based on the practical road network in Changsha, China, is presented, through which the sensitivity analysis is conducted with respect to some critical factors.

This paper proposes an electric vehicle routing problem with considering states of charging stations and suggests solution strategies. Charging of electric vehicles is a main issue in the field of electric vehicle routing problem. There are many studies to find locations of charging stations, recharging functions for batteries of vehicles, and so on. However, states of charging stations significantly affect the routes of electric vehicles, which is not much explored. The states may include open or close of charging stations, occupied or empty of charging slots, and so on. This paper investigates how the states of charging stations are estimated and routing strategies are determined. We formulate a mixed integer programming model and suggest how to solve the problem with exact method. Numerical examples provide the optimal routing strategies of electric vehicles in the changing environments of the states of charging stations.

River flood routing computes changes in shape of a flood wave over time as it travels downstream along a river. Conventional flood routing models, especially hydrodynamic models require high quality and quantity of input data such as measured hydrologic time series, geometric data, hydraulic structures and hydrological parameters. Unlike physically based models, machine learning algorithms, which are data driven models, do not require much knowledge about underlying physical processes and can identify complex nonlinearity between inputs and outputs. Due to the higher performance, less complexity, and low computation cost, novel machine learning methods as a single application or hybrid application were introduced by researchers to achieve more accurate and efficient flood routing. This paper reviews the recent application of machine learning methods in river flood routing.

Transportation is a crucial component of supply chain management, responsible for delivering goods and services to customers. This paper explores the application of game theory concepts, precisely the Shapley value, to cost allocation in transportation operations involving drones and trucks. Our focus is on shortest-path games in which agents own nodes in a network and seek to transport items between nodes at the lowest possible cost. We provide a comprehensive literature review of the Shapley value and its use in shortest-path games, with particular emphasis on transportation networks. Our proposed model includes sets of customers, drones, and trucks and uses binary decision variables to indicate whether a drone or truck serves a given customer. The objective is to minimize the total cost of serving all customers while adhering to capacity and synchronization constraints. We use the Shapley value to determine the contribution and cost-sharing of each drone and truck in serving the customers. Through a combination of denitions, theorems, and examples, we explore the formal meaning of the Shapley value and its relationship to shortest-path games in transportation networks. We highlight exceptional cases and considerations that must be taken into account when applying the Shapley value in such scenarios.

The purpose of this paper is to develop a theoretical predictive model for LNG shipping routes selection process. Strategic decisions about shipping costs could be improved if a deeper knowledge about products economic value is provided. Developments made on the extraction and industrial processes related to this fossil fuel are driving the natural gas sector towards a unique globalised market. Moreover, data analytics applications as well as machine learning are topics presented as perfect catalysers for achieving an unprecedented natural gas globalised market. Additionally, this paper aims at showing the state of the art of new techniques used in transportation engineering that might have synergies with other industries (eg. commodities cost reduction, energy supply…). Finally, this paper aims to provide foundation for further research and development using more sophisticated data and algorithms that will help to close the gap between theoretical and practical scope of this techniques.

Opportunistic Routing is a promising paradigm that has been proposed for efficient and reliable transfer of data packets in mobile ad hoc networks. This routing strategy takes advantage of the broadcasting nature of the wireless medium to increase the number of probable forwarding devices and improves the reliability of data transfer in the network. Opportunistic Routing utilizes the reception of the same broadcasted packet at multiple devices in the network and selects one best forwarder dynamically from the set of multiple receivers. A number of opportunistic routing protocols have been proposed over these years for effective data delivery in ad hoc networks. But as the speed and mobility of devices increases in the network, performances of the existing opportunistic routing protocols degrade considerably, leading to reduced Quality of Service and poor transmission efficiency. The exceptional potential of opportunistic routing is thus underutilized. In this research we introduce Optimized Opportunistic Routing (OOR) strategy that guarantee excellent Quality of Service and high transmission efficiency to the latest applications using opportunistic routing for communication in highly dynamic ad hoc networks. Simulation results show that our method achieve significant performance improvements compared to all other existing opportunistic routing protocols in highly dynamic mobile ad hoc networks.

Standardized protocols were specifically designed and developed for clinical information collection and obtaining trio genomic information from infants affected with congenital anomalies (CA) and their parents, as well as securing human biological resources. Two large areas of these protocols include clinical and genomic information collection on CA which were difficult to diagnose using pre-existing screening methods. The following are three essential items for the clinical information collection protocol: establishment of a consent system for collecting and utilizing research resources, establishment of criteria for target patient selection, and collection of clinical and epidemiological information. A total of 138 cases consisting of 45 families of infants with CA and their parent trios have provided human-derived resources and genomic information. Whole genome sequencing data have been generated for all participants, and standardized protocols for resource collection and manufacturing have been developed. Phenotype information according to the Human Phenotype Ontology term and major test findings were recorded. It is important to keep updating and recording clinical symptoms and genetic diagnosis that are newly added or changed over time. The unique significance of this study is to develop a protocol that enables long-term tracking by adding growth and development tests that reflect important characteristics of newborns. By using these clinical and genetic information collection protocols for CA, it will be possible to establish an essential platform for early genetic diagnosis and diagnostic research, and further present new genetic diagnostic guidelines in the near future.

Ovarian cancer is the most frequent cause of deaths in gynecologic malignancies. Many possible mechanisms have been proposed via RNAseq and DNAseq technique recently. However, the driving factors are still obscure. The possible reasons are attributed to the incomplete human reference. This study integrated the canonical mapping-based and mapping-free protocols to extract reliable variations and novel events. We eventually obtained 450 reliable SNVs from the WES data and novel events from the RNAseq data, including 154 SNVs, 462 intron events, two repeats and six splice events. We identified six differentially expressed genes and six contigs that are significantly related to survival prognosis. The recurrent SNVs in significantly differentially expressed genes can be validated in an independent cohort of 20 Chinese ovarian cancer patients.

Vehicle-to-Vehicle (V2V) communication plays a pivotal role in modern intelligent transportation systems, enabling seamless information exchange among vehicles to enhance road safety, traffic efficiency, and overall driving experience. However, the secure transmission of sensitive data between vehicles remains a critical concern due to potential security threats and vulnerabilities. This research paper focuses on investigating the security protocols employed in Vehicle-to-Vehicle communication systems. A comprehensive review and analysis of relevant literature and research papers is conducted to gather information on existing V2V communication security protocols and techniques. The analysis encompasses key areas, including authentication mechanisms, encryption algorithms, key management protocols, and intrusion detection systems specifically applicable to V2V communication networks. Within the context of real-world V2V environments, this study delves into the challenges and limitations associated with implementing these protocols. Moreover, to foster a deeper understanding, the paper investigates present communication protocols in the field of Internet of Things (IoT) that are tailored for V2V. Various parameters, such as band-width consumption, energy consumption, latency, and message size, are considered during the evaluation of these protocols to gauge their effectiveness. The research outcomes aim to provide a comprehensive understanding of the strengths and weaknesses of the current V2V communication security protocols. Furthermore, based on the findings, this paper will propose improvements and recommendations to enhance the security measures of the V2V communication protocol. Ultimately, this research will contribute to the development of more secure and reliable V2V communication systems, propelling the advancement of intelligent transportation technology.

Background: The study assessed men’s role in the preparedness against emerging pandemic of Ebola Virus Disease in Ogun State, Nigeria. It examined the changes in men’s hygiene practices as response to the news of the outbreak of Ebola Virus Disease. Methods: The data were extracted from a 2015 Cross-Sectional Survey on wellness, knowledge, attitude and practices towards the control and prevention of Ebola Virus Disease. The respondents (466 male) in the main survey were selected using simple random sampling technique within two enumeration areas (EAs). Results: The results revealed high level of knowledge of EVD but over 70% were not aware of centre for EVD treatment, 60.2% believed they are not susceptible to EVD. The practice of handshaking reduced, eating of hunted animals decreased only marginally by 6.9% and washing with soap increased by 4%. Conclusion: The study provides helpful information for public health policy especially in terms of behavioral risk factors that are prone to Ebola virus infections or other communicable diseases. It emphasises regular hand washing with soap and sanitizing agents and recommended that availability of treatment centres and vaccines that can enhance effective response in curtailing further health emergencies.

With the continuous improvement and observable benefits of electric vehicles (EVs), major logistic companies are introducing more EVs into their conventional fleets. This gives rise to a new type of vehicle routing problem with mixed vehicles, where heterogeneous internal combustion vehicles (ICVs) and electric vehicles are considered in route planning. In addition, certain deliveries that are not efficient on any type of vehicles, are outsourced to third-party common carriers. In this paper, we define this problem as a mixed vehicle routing problem with common carriers (MVRPC). The objective of such problems is to minimize the transportation costs by considering routes with ICVs and EVs, the possibility of visiting recharging stations, outsourcing options, and drivers’ layover regulations. This variant of the vehicle routing problems has many practical applications, particularly in the design of long-haul transportation and last-mile delivery services. Effective MVRPC solutions play a key role in promoting the going Green image and optimally allocating resources. The problem has received limited attention in the literature likely because addressing all the needed aspects is especially challenging. To solve the large-scale problem, we develop a branch-and-cut pricing framework that relies on strong cuts and customized labeling algorithms. Numerical experiments highlight the effectiveness of our algorithm. This success can be attributed to tailored critical resources, dynamically bounded bidirectional labeling procedures, strong dominance criteria, and implementation strategies.

Unmanned aerial vehicle (UAV), or drone is recognized for its potential to improve efficiency and address last-mile delivery issues. As a result, there has been a lot of activity in recent years in the field of drone scheduling and routing. Unlike the vehicle routing problem, drone route design is difficult due to several operational characteristics, such as speed optimization, multitrip operation, and energy consumption estimation. On the one hand, drone energy consumption is a complex nonlinear function of both speed and payload in practice. On the other hand, the high operating speed of drones can significantly curtail the drone range, thereby limiting the efficiency of drone delivery systems. Most of the existing drone delivery models either assume constant drone speed or do not consider the effect of drone speed and parcel weight on energy consumption, leading to costly or energy-infeasible routes. This paper addresses the trade-off between speed and flight range in a multi-trip drone routing problem with variable flight speeds (DRP-VFS), in which a team of homogeneous drones is employed for delivery services. We propose a new model to particularly consider energy constraints using a nonlinear energy consumption model and treat drone speeds as decision variables so that various drone speeds can be adopted in applications. The DRP-VFS is initially formulated as mixed-integer linear programming (MILP) to minimize total energy consumption. To solve large-scale instances, we propose a three-phase adaptive large neighborhood search (ALNS) algorithm. The experimental results demonstrate that suboptimal solutions can be found effectively in practical scenarios using the proposed method. Furthermore, results indicate that operating drones at variable speeds leads to about 21% of energy savings compared to fixed speeds, boasting advantages in cost-savings and range extensions.

Internet of things (IoT) is a network of smart things. This indicates the ability of these physical things to transfer information with other physical things. The characteristics of these networks, such as topology dynamicity and energy constraint, challenges the routing problem in these networks. Previous routing methods could not achieve the required performance in this type of network. Therefore, developers of this network designed and developed specific methods in order to satisfy the requirements of these networks. One of the routing methods is utilization of multipath protocols which send data to its destination using routes with separate links. One of such protocols is RPL routing protocol. In this paper, this method is improved using composite metrics which chooses the best paths used for separate routes to send packets. We propose Energy and Load aware RPL (ELaM-IoT) protocol, which is an enhancement of RPL protocol. It uses a composite metric, calculated based on remaining energy, hop count, Link Expiration Time (LET), load and battery depletion index (BDI) for the route selection. In order to evaluate and report the results, the proposed ELaM-IoT method is compared to the ERGID and ADRM-IoT approaches with regard to average remaining energy, and network lifetime. The results demonstrate the superior performance of the proposed ELaM-IoT compared to the ERGID and ADRM-IoT approaches.

The sensor nodes have limited computation, sensing, communication capabilities and generally operated by batteries in a harsh atmosphere with non-replenish able power sources. These limitations force the sensor network subject to failure because most of the energy is spent on sensing, computing and data transmission. This paper introduces an Energy Efficient Clustering and Shortest-Path Routing Protocol (EECSRP) to assist Wireless Sensor Networks (WSNs) by (a) extending the lifespan of the network (b) effectively using the battery power (c) decreasing the network overhead and (d) ensuring a high packet transmission ratio with minimal delay. The delay time-based Cluster Head (CH) is elected based on the node degree, residual energy and Received Signal Strength (RSS) to accomplish the goal. Additionally, the RSS-based network partitioning is implemented to evaluate the gradient based on demand routing between source (sensing node) and destination (BS). Whenever the current CH residual energy goes under the threshold level, the proposed protocol performs the clustering process, reducing the exchange of control packets. However, the BS periodically gathers the data from every single CH which helps to reduce the collision and Medium Access Control (MAC) layer conflict. From the simulation results, it is the evident that the proposed protocol performance in terms of average end-to-end latency, packet delivery ratio, average energy consumption and control overhead is better than the well-known current protocols.

Fast convergence routing is an important issue for LEO constellation network, due to its dynamical topology changing and time varying transmission requests. Most of existing research focus on the OSPF routing algorithm, which cannot handle the frequently links state changing of network. In this paper, we propose a Fast-Convergence Reinforcement Learning Satellite Routing Algorithm (FRL-SR) for LEO satellite networks, in which the satellite gets the network links status fast and adjusts its routing strategy. In FRL-SR, each satellite node is regarded as an agent. The agent selects the port for packet forwarding according to its own routing policy. When the satellite network state changes, agent would send ’hello’ packets to the neighbor node to update the neighbor node’s routing policy. Compared with traditional reinforcement learning, FRL-SR can perceive network information faster, and then converge faster. Also, FRL-SR can mask the dynamics of satellite network topology and adaptively adjust the forwarding strategy according to the link state. Various simulation is constructed, the results show that the proposed FRL-SR algorithm out performance the Dijkstra algorithm in performance of average delay, packet arriving ratio, network load balance.

Flood routing in flood forecasting issue, calculation the height of flood bands, determining the river boundaries, and estimation of protective facilities for flood –exposed building is applicable. In many cases, due to the lack of measuring stations, the status of the upstream flood generating hydrograph is not known. The purpose of this study is to present an integrated method comprising of an optimization model and a hydrodynamic numerical model for flood modeling to determine the upstream hydrograph using the provided hydrograph at the downstream measuring station of a river. The routing procedure consists of three steps: (1) generating a hypothetical upstream hydrograph using genetic algorithm method; (2) hydrodynamic modeling using a numerical simulation model for flood routing according to the hypothetical hydrograph which is generated in the first step; (3) compare the calculated and observed hydrograph in downstream by using a fitness function. This recommended procedure was named as Reverse Flood Routing Method (RFRM) and was then applied to Karun River, the largest river in Iran. Comparing the generated upstream hydrograph by the RFRM model with the corresponding measured hydrograph at Ahvaz hydrometric station, as an ungauged river location, shows the high accuracy of the recommended model in this study.

With the constant growth of Software Defined Radio (SDR) technologies in wireless communications related fields the need for efficient ways to test and evaluate the Physical Layer (PHY) protocols developed for these technologies in real life traffic scenarios become more critical. This paper proposes a software testbed that enhances the creation of network environments that allow feeding GNU Radio applications with test traffic in a simple way and through an interoperable interface. This makes possible the use of any traffic generator, existent one or custom built to evaluate the GNU Radio application. In addition, the paper proposes an efficient way to collect PHY layer specific monitoring data that improves the performance of the critical components of the message delivery path by employing the Protocol Buffers library. The paper considers the entire testing and evaluation ecosystem and demonstrates how PHY layer specific monitoring information is collected, handled, stored, and processed as time series allowing complex visualization and real time monitoring.

For Attention Deficit/Hyperactivity Disorder (ADHD) youth transitioning from child to adult services, protocols that guide the transition process are necessary. While some guidelines are available, they do not always consider effective workload and scarce resources. In Italy, there are currently very few guidelines available, and they do not adhere to common standards, possibly leading to a non-uniform use. The present study analyzes 6 protocols collected from different services for ADHD patients that took part in the TransiDEA (Transitioning in Diabetes, Epilepsy, and ADHD patients) Project. Their content is described in parallel to the National Institute for Clinical Health and Excellence (NICE) guidelines. While there are some strong points and several common core elements, a need emerges to standardize practices and to make them more adherent to patients’ needs and to the resources available to clinicians.

The increase and diversity of low-cost Air Quality (AQ) sensors, as well as their flexibility and low power consumption, offers us the opportunity to integrate them into a broad AQ wireless sensor networks with the aim of enabling real-time monitoring and higher spatial sampling density of pollution in all parts of the cities. Considering that the vast majority of the population lives in these cities and the increase in respiratory/allergic problems in a large part of the population, it is of great interest to offer services and applications to improve their quality of life. In the ECO4RUPA project we focus on this kind of service, proposing an inclusive and intelligent routing ecosystem carried out by using a network of low-cost AQ sensors with the support of 5G communications along with official AQ monitoring stations, assisted with artificial intelligence to improve the AQ monitoring data and by spatial interpolation techniques to enhance its spatial resolution. The goal of this service is to calculate healthy walking and/or cycling routes according to the particular citizen’s profile and needs. We provide and analyse the results of the proposed route planner under different scenarios (different time tables, congestion road traffic and routes) and different user’s profiles, with special interest on citizens with asthma and pregnant women, since both require special needs. In summary, our approach can lead to an approximately average reduction in pollution exposure of 17.82%, while experiencing an approximately average increase in distance travelled of 9.8 %.

A novel high-voltage powerline inspection system is investigated, which consists of the cooperated ground vehicle and drone. The ground vehicle acts as a mobile platform that can launch and recycle the drone, while the drone can fly over the powerline for inspection within limited endurance. This inspection system enables the drone to inspect powerline networks in a very large area. Both vehicle’ route in the road network and drone’s routes along the powerline network have to be optimized for improving the inspection efficiency, which generates a new two-layer point-arc routing problem. Two constructive heuristics are designed based on “Cluster First, Rank Second” and “Rank First, Split Second”. Then local search strategies are developed to further improve the quality of the solution. To test the performance of the proposed algorithms, practical cases with different-scale are designed based on the road network and powerline network of Ji’an, China. Sensitivity analysis on the parameters related with the drone’s inspection speed and battery capacity is conducted. Computational results indicate that technical improvement on the inspection sensor is more important for the cooperated ground vehicle and drone system.

COVID-19 has become a pandemic which resulted in measures being taken for health and safety of people. The spreading of the disease was particularly evident in indoor spaces, where people tend to get overcrowded. One such place is the airport where a plethora of passengers flow to common places, such as coffee shops, duty free shops as well as toilets and gates. Guiding the passengers to less overcrowded places within the airport may be a solution to less spreading. In this paper we suggest a passenger routing algorithm whereby the passengers are guided to less crowded places by using a weighting factor, which is minimised to accomplish the desired goal. We modeled a number of shops in an airport using the AnyLogic software and we tested the algorithm showing that the exposure time is less with routing and that the people get appropriately spread to the common spaces, thus, preventing overcrowding.

Wireless sensor networks (WSNs) are a critical research area with numerous practical applications. WSNs are utilized in real-life scenarios, including environmental monitoring, healthcare, industrial automation, smart homes, and agriculture. As WSNs advance and become more sophisticated, they offer limitless opportunities for innovative solutions in various fields. However, due to their unattended nature, it is essential to develop strategies to improve their performance without draining the battery power of the sensor nodes, which is their most valuable resource. This paper proposes a novel sink mobility model based on constructing a bipartite graph from a deployed wireless sensor network. Using the bipartite graph’s properties, the mobile sink node can visit stationary sensor nodes in an optimal way to collect data and transmit it to the base station. We evaluated the proposed approach through simulations using the NS-2 simulator to investigate the performance of wireless sensor networks when adopting this mobility model. Our results show that using the proposed approach can significantly enhance the performance of wireless sensor networks while conserving the energy of the sensor nodes.

Delay-tolerant networks (DTN) is an approach to deal with scarce network connectivity found in sparse mobile ad-hoc networks (MANETs) which makes the problem of routing messages a challenging task. DTNs have find their usefulness in many challenging environments such as tactical networks, underwater sensor networks, wildlife monitoring, disaster recovery etc. Pocket Switched Networks (PSNs) have emerged as a new application of the delay tolerant networks where network nodes are computing devices carried by humans. Hence, the study of how humans interact in their day-to-day life, the places they visit frequently, the people they meet frequently, the social groups in which they participate on regular basis etc. can help improve routing process in PSNs. This type of routing inspired from the way humans interact with each other is referred to as social based routing and had been a recent topic of research in the field of DTNs. This paper presents a comprehensive survey of the various social-based algorithms that have been designed for Delay Tolerant Networks.

Wireless Body Area Networks are composed of sensor nodes that may be implanted in the body or worn on it. A node is composed of a sensing unit, a processor and a radio unit. One of the nodes, the sink, acts as a gateway between the body area network and other networks such as the Internet. We propose a routing protocol that constructs paths between nodes such that the final network topology is a tree rooted at the sink. The protocol's aim is to increase network lifetime and reliability, and to adapt to network conditions dynamically. Moreover, the protocol enables communications between nodes and sink both in the upstream direction, from nodes to sink, and in the downstream direction from sink to nodes. When the network tree is constructed, a node chooses its parent, i.e., next hop to sink, by using one of various criteria. Namely, these are the number of hops between parent and sink, energy level of parent, received signal strength from parent, number of current parent's children, and a fuzzy logic function that combines multiple criteria. Moreover, as time progresses the tree structure may dynamically change to adapt to conditions such as the near-depletion of a routing node's energy. Simulation results show improvements in network lifetime and energy consumption over the older version of the protocol.

Demand responsive transport (DRT) is operated according to flexible routes, dispatch intervals, and dynamic demand, is attracting a lot of attention. The biggest characteristic of DRT service is that the vehicle routes and schedules are operated optimally based on real-time travel requests of using passengers without fixed operating schedules. Today, the smart-city era has arrived, particularly because of progress in the wireless communications technology and technology related to location information service and real-time passenger demands and requests, and services that change the vehicles’ operating schedules in real-time according to dynamic demand have attracted more attention. In this study, we analyze the effects of the DRT system to solve the first mile/last mile problem based on a proposed DRT routing algorithm considering real-time travel behavior. The algorithm is modified from the dynamic vehicle routing problem (DVRP), in which a DRT-based routing algorithm tends to minimize users’ cost and providers’ operation cost. So far, the DVRP has only been able to serve a single request per vehicle at a time. However, this needs to be extended for the purpose of DRT, wherein several passengers board a vehicle at the same time. The routing algorithm can serve multiple requests at a time and schedule picks ups, drop offs, and rides according to the requests and as calculated by the dispatch algorithm. The basic principle of routing is as follows. The DRT vehicle moves on an attractive path and picks up a passenger if boarding is requested, but it does not simply hang around as a DVRP would. In this step, if another DRT vehicle is present near another passenger, the vehicle that would minimize that passenger’s total travel time picks up the passenger. The optimal routing algorithm developed in this study is applied to the activity-based model; that is, a microscopic traffic demand estimation method is implemented through an activity-based model by using an open-source, activity-based model package called Multi-Agent Transport Simulation (MATSim). MATSim is used for the simulation, because it combines a multi-modal traffic flow simulation with a scoring model for agents, and it provides co-evolutionary algorithms that can alter agents’ daily routines. This process is applied to a type of mode choice and route choice repeatedly over several iterations until some form of user equilibrium has been reached. This study analyzed the feasibility of implementing the DRT service by analyzing the benefits for the users and cost of the operator from the effects of increasing public transportation use and providing personalized mobility service based on DRT implementation by the introduction of DRT will be analyzed according to the scale of DRT supply. Through the simulation, the DRT is expected to provide convenient, fast, and cost-effective mobility services to customers; provide an optimal vehicle scale to providers; and, ultimately, achieve a safe and efficient transportation system.

The recent provision of energy-harvesting capabilities to wireless sensor networks has entailed the redefinition of design objectives. Specifically, the traditional goal of maximizing network lifetime has been replaced by optimizing network performance, namely delay and throughput. The present paper contributes to this reformulation by considering the routing problem for the class of time-driven energy-harvesting WSN (EH-WSN) under regular or quasi-periodic energy sources. In particular, this paper shows that the minimum hop count (MHC) criterion maximizes the average duty cycle that can be sustained by nodes in this type of scenarios. This is a primary objective in EH-WSN, since large duty cycles lead to enhanced performance. Based on a previous result, a general expression is first obtained which gives mathematical form to the relationship between duty cycle and traffic load for any node in a time-driven EH-WSN fed by a regular energy source. This expression reveals that the duty cycle achievable by a node decreases as its traffic load increases. Then, it is shown that MHC minimizes the average traffic load over the network, and thus it maximizes the average duty cycle of nodes. This result is numerically validated via simulation by comparison with other well-known routing strategies. Accordingly, this paper suggests assigning top priority to the MHC criterion in the development of routing protocols for time-driven EH-WSN under regular energy sources.

Computed tomography (CT) is a widely employed imaging modality with diverse clinical applications in pediatric and adult populations, offering numerous advantages. Despite several alternatives to imaging modalities with ionising radiation, CT scans have demonstrated persistent global popularity, contributing to a substantial amount of effective radiation doses for patients. This exposure results in hazards, including stochastic effects that amplify the radiation-induced cancer risk proportionally to the radiation dose received. CT-related radiation comprises a substantial portion of cumulative effective doses within diagnostic radiology, specifically impacting younger patient cohorts undergoing repeated investigations for chronic diseases over time. Scientific literature over recent decades has explored various methods to mitigate radiation doses during medical imaging. One notable strategy involves implementing low-dose and ultralow-dose CT protocols, maintaining diagnostic efficacy in acute and non-acute medical and surgical conditions. Utilising innovative image reconstruction algorithms, such as iterative reconstruction and emerging deep-learning algorithms based on artificial intelligence, plays a pivotal role in achieving an approximately 80% reduction in patient radiation compared to standard doses. This review article discusses the significance of low-dose protocols across a spectrum of acute and chronic medical conditions affecting different body systems.

In the quest for robust and efficient digital communication, this paper introduces cutting-edge key exchange protocols leveraging tropical semirings’ computational prowess and block matrices’ structural resilience. Moving away from the conventional use of finite fields, these protocols deliver markedly faster processing speeds and heightened security. We present two implementations of our concept, each utilizing a different platform for the set of commuting matrices: one employing tropical polynomials of matrices and the other employing Linde-de la Puente matrices. The inherent simplicity of tropical semirings leads to a decrease in operational complexity, and using block matrices enhances our protocols’ security profile. The security of these protocols relies on the Matrix Decomposition Problem. We also provide a comparative analysis of our protocols against existing matrix block-based protocols in finite fields. This research marks a significant shift in cryptographic protocol design, specifically tailored for demanding engineering applications, and sets a new standard in secure and efficient digital communication.

Blockchain technology has been gaining great interest from a variety of sectors including healthcare, supply chain, and cryptocurrencies. However, Blockchain suffers from its limited ability to scale (i.e. low throughput and high latency). Several solutions have been proposed to tackle this. In particular, sharding proved that it is one of the most promising solutions to Blockchain’s scalability issue. Sharding can be divided into two major categories: (1) Sharding-based Proof-of-Work (PoW) Blockchain protocols, and (2) Sharding-based Proof-of-Stake (PoS) Blockchain protocols. The two categories achieve good performances (i.e. good throughput with a reasonable latency), but raise security issues. This article focuses on the second category. In this paper, we start by introducing the key components of sharding-based PoS Blockchain protocols. Then, we briefly introduce two consensus mechanisms, namely PoS and practical Byzantine Fault Tolerance (pBFT), and discuss their use and limitations in the context of sharding-based Blockchain protocols. Next, we provide a probabilistic model to analyze the security of these protocols. More specifically, we compute the probability of committing a faulty block and measure the security by computing the number of years to fail. Finally, we evaluate the effectiveness of the proposed model via numerical analysis.

Private Set Intersection Cardinality(PSI-CA) is a cryptographic method in secure multi-party computation that allows entities to identify cardinality of the intersection without revealing their private data.Traditional approaches assume similar-sized datasets and equal computational power, overlooking practical imbalances.In real-world applications, dataset sizes and computational capacities often vary, particularly in the Internet of Things and mobile scenarios where device limitations restrict computational types. Traditional PSI-CA protocols are inefficient here, as computational and communication complexities correlate with the size of larger datasets. Thus, adapting PSI-CA protocols to these imbalances is crucial.This paper explores unbalanced scenarios where one party (the receiver) has a relatively small dataset and limited computational power, while the other party (the sender) has a large amount of data and strong computational capabilities.This paper, based on the concept of commutative encryption, introduces Cuckoo filter, cloud computing technology, homomorphic encryption, among other technologies, to construct three novel solutions for unbalanced Private Set Intersection Cardinality (PSI-CA): an unbalanced PSI-CA protocol based on Cuckoo filter, an unbalanced PSI-CA protocol based on single cloud assistance, and an unbalanced PSI-CA protocol based on dual cloud assistance. Depending on performance and security requirements, different protocols can be employed for various applications.

Cellular Vehicle-to-Everything (C-V2X) is a communication technology that supports various safety, mobility, and environmental applications given its higher reliability properties compared to other communication technologies. The performance of these C-V2X-enabled Intelligent Transportation System (ITS) applications is affected by the performance of the C-V2X communication technology (mainly packet loss). Similarly, the performance of the C-V2X communication is dependent on the vehicular traffic density which is affected by the traffic mobility patterns, and vehicle routing strategies. Consequently, it is critical to develop a tool that can simulate, analyze, and evaluate the mutual interactions of the transportation and communication systems at the application level and to the evaluate the benefits of the C-V2X enabled ITS applications. In this paper, we demonstrate the benefits gained when using C-V2X Vehicle-to-Infrastructure (V2I) communication technology in an energy-efficient dynamic routing application. Specifically, we develop a Connected Energy-Efficient Dynamic Routing (C-EEDR) application using C-V2X as a communication medium in an integrated vehicular traffic and communication simulator (INTEGRATION). The results demonstrate that the C-EEDR application achieves fuel savings of up to 16.6% and 14.7% in the IDEAL and C-V2X communication cases, respectively for a peak hour demand on the downtown Los Angeles network considering a 50% level of market penetration of connected vehicles. The results demonstrate that the fuel savings increase with increasing levels of market penetration at lower traffic demand levels (25% and 50% the peak demand). At higher traffic demand levels (75% and 100%) the fuel savings increase with increasing levels of market penetration with maximum benefits at a 50% market penetration rate. Although the communication system is affected by the high density of vehicles at the high traffic demand levels (75% and 100% the peak demand), the C-EEDR application manages to perform reliably producing system-wide fuel consumption savings.The C-EEDR application achieves fuel savings of 15.2% and 11.7% for the IDEAL communication and 14% and 9% for the C-V2X communication at the 75% and 100% market penetration rates, respectively. Finally, the paper demonstrates that the C-V2X communication constraints only affect the performance of the C-EEDR application at the full demand level when the market penetration of connected vehicles exceeds 25%. This degradation, however is minimal (less than a 2.5% reduction in fuel savings).

In recent years, the management of health systems is a main concern of governments and decision makers. Home health care is one of the newest methods of providing services to patients in developed societies that can respond to the individual lifestyle of modern age and the increase of life expectancy. The home health care routing and scheduling problem is a generalized version of the vehicle routing problem, which is extended to a complex problem by adding special features and constraints of health care problems. In this problem, there are multiple stakeholders such as nurses for which an increase of their satisfaction level is very important. In this study, a mathematical model is developed to expand traditional home health care routing and scheduling models to downgrading cost aspects by adding the objective of minimizing the difference between the actual and potential skills of the nurses. Downgrading can lead to a dissatisfaction of the nurses. In addition, skillful nurses have higher salaries and high-level services increase equipment costs and need more expensive trainings and nursing certificates. Therefore, downgrading can enforce hidden huge costs to the managers of a company. To solve the bi-objective model, an -constraint based approach is suggested and the model applicability and its ability to solve the problem in various sizes are discussed. A sensitivity analysis on the Epsilon parameter is conducted to analyze the effect of this parameter on the problem. Finally, some managerial insights are presented to help the managers in this field, and some directions for future studies are mentioned as well.

Following the rapid spread of COVID-19 across the globe, the intense response that was demanded of diagnostic centers and research laboratories prompted the use of numerous products and protocols for the management of SARS-CoV-2 specimens. In these settings, proper handling of such infectious specimen is necessary to ensure the safety of personnel and to reduce the risk of active transmission. Our aim was to evaluate the inactivation efficacy of different inactivating methods, notably from commercial lysis buffers available in diagnostic kits. Heat and sodium dodecyl sulfate detergent were also included in our investigations. A cell culture-based assay was used, and supported by molecular qRT-PCR detection, to show in vitro infectivity reduction after inactivation treatment. Overall, all the investigated methods were successful in inactivating SARS-CoV-2. Ten minutes of contact with the commercial buffers completely stopped in vitro SARS-CoV-2 infectivity. Fifteen minutes at 68°C and 30 minutes at 56°C as well as one hour with sodium dodecyl sulfate detergent at 2, 1, 0.5, and 0.1% yielded the same results. These findings demonstrate the reliability of these protocols with regards to biosafety. Inactivation by heat and sodium dodecyl sulfate detergent are rather simple and can be readily available methods for rendering an infectious SARS-CoV-2 specimen inactive, especially in settings where commercial buffers are not available.

To facilitate wireless communication, ocean exploration, and various environmental and research applications, the underwater Internet of Things has been developed with an infrastructure of acoustic sensor networks. There has been a significant increase in failures and a decrease in the efficiency of the network due to the fluid and challenging underwater environment. Consequently, achieving quality of service (QoS) in underwater networks remains a research area. Supporting QoS in underwater sensor networks is challenging due to resource limitations such as processing power, memory, bandwidth, and power sources. The purpose of this study was to examine the service quality requirements as well as protocols that have been implemented in recent years. Finally, based on quality criteria, we have presented a routing solution based on fuzzy logic, which is more efficient than other recent methods regarding energy consumption rate, JFI, efficiency, and reliability.

Oceans cover about 70% of the Earth's surface, and about 95% remain unexplored for various reasons. Underwater wireless communication has been revolutionised with the help of Internet of Things networks. Recently, applications such as collecting marine data, marine monitoring, disaster prevention, historical exploration, oil and gas exploration, shipwreck exploration, maritime security, and monitoring of aquatic species and water pollution, and several applications have become possible. However, the problem of routing, information transfer, and resource preservation in the fluid underwater environment remains unsolved. In this research, we were looking for a solution to make routing more efficient, considering the various and practical criteria for the quality of service of the underwater IoT network. One of the outstanding features of this research is the possibility of dynamically weighing the parameters involved in routing and taking optimal and distributed decisions between network components. The proposed method has achieved acceptable results in terms of quality of service compared to recent methods.

Cluster-based routing in Mobile Ad-Hoc Networks is considered one of the convenient methods of routing. The existence of Cluster Head (CH) in a group of nodes for data forwarding improves the performance of routing in terms of routing overhead and power consumption. In this paper, a clustering algorithm using hierarchical routing for mobile ad hoc networks is proposed. In the proposed method, first, clusters are formed by the FLOC clustering method with low overlapping. Then, according to the most important network criteria, including hop count, noise ratio, distance, remaining energy, and link expiration time, head clusters are selected based on the weighting algorithm. To transfer data in the proposed method, two types of communication are used, e.g., inter-cluster communication and intra-cluster communication in which the shortest path to the target cluster is selected. The proposed P-METHOD technique is based on hierarchy and clustering as well as using a weighted algorithm that reduces delay in data transmission on the network. Moreover, P-METHOD is evaluated here via extensive simulations carried out in NS-2. The simulation results indicate that the MANET network performance metrics are improved in terms of average throughput, Packet Delivery Ratio (PDR), delay, residual energy, and lifetime.

Several factors influence traffic congestion and overall traffic dynamics. Simulation modeling has been utilized to understand the traffic performance parameters during traffic congestions. This paper focuses on driver behavior of route selection by differentiating three distinguishable decisions, which are shortest distance routing, shortest time routing and less crowded road routing. This research generated 864 different scenarios to capture various traffic dynamics under collective driving behavior of route selection. Factors such as vehicle arrival rate, behaviors at system boundary and traffic light phasing were considered. The simulation results revealed that shortest time routing scenario offered the best solution considering all forms of interactions among the factors. Overall, this routing behavior reduces traffic wait time and total time (by 69.5% and 65.72%) compared to shortest distance routing.

The advent of Sixth Generation (6G) wireless technologies introduces challenges and opportunities for Mobile Ad Hoc Networks (MANETs) and Vehicular Ad Hoc Networks (VANETs), necessitating a reevaluation of traditional routing protocols. This paper introduces the Multi-Metric Scoring Dynamic Source Routing (MMS-DSR), a novel enhancement of the Dynamic Source Routing (DSR) protocol, designed to meet the demands of 6G-enabled MANETs and the dynamic environments of VANETs. MMS-DSR integrates advanced technologies and methodologies to enhance routing performance in dynamic scenarios. Key among these is the use of a CNN-LSTM based beamforming algorithm, which optimizes beamforming vectors dynamically, exploiting spatial-temporal variations characteristic of 6G channels. This enables MMS-DSR to adapt beam directions in real-time based on evolving network conditions, improving link reliability and throughput. Furthermore, MMS-DSR incorporates a multi-metric scoring mechanism that evaluates routes based on multiple QoS parameters, including latency, bandwidth, and reliability, enhanced by the capabilities of Massive MIMO and the IEEE 802.11ax standard. This ensures route selection is context-aware and adaptive to changing dynamics, making it effective in urban settings where vehicular and mobile nodes coexist. Additionally, the protocol uses machine learning techniques to predict future route performance, enabling proactive adjustments in routing decisions. The integration of dynamic beamforming and machine learning allows MMS-DSR to effectively handle the high mobility and variability of 6G networks, offering a robust solution for future wireless communications, particularly in smart cities.

The role of DNA mismatch repair (MMR) tumor testing in colon and endometrial carcinomas is well-established, yet the universal application of this testing faces challenges due to limited data on its efficacy in diverse populations. This retrospective study at a community hospital in Northern Indiana examined MMR immunohistochemistry (IHC) results across 549 cases. Our analysis found intact MMR expression in 469 cases, while 80 demonstrated MMR deficiency, translating to MMR deficiency rates of 10% in colon cancers and 22% in uterine carcinomas. Notably, only 16 patients (2.9%) were categorized as high microsatellite instability (MSI-H), a rate significantly lower than the 3-5-fold higher incidences reported in other Midwestern populations, including Ohio. These findings suggest that the benefits of universal cascade methylation testing, particularly in MLH1/PMS2 IHC-negative tumors, may vary significantly based on regional demographics. Given the notably lower MSI-H incidence in this study, re-evaluating reflex testing protocols in low-resource settings could lead to more targeted, cost-effective approaches without compromising diagnostic accuracy. This study challenges the one-size-fits-all approach to MMR testing, highlighting the need for tailored strategies that consider regional variations in cancer genetics.

Wireless Mesh Networks (WMN) are a solution with a reasonable cost/benefit ratio when provid-ing broadband internet access. The concept is being used not only in IEEE networks but also in other wireless networks such as cellular networks (4G/5G) and Low Power Wide Area Network (LPWAN). IEEE 802.11s is the facto standard and is well known for working with WMN. The standard defines Hybrid Wireless Mesh Protocol (HWMP) as a layer 2 routing protocol. The met-ric proposed by the protocol is Air Time Link (ALM), and the IEEE 802.11 standard proposes an equation for its calculation. This work proposes a new methodology for the calculation of ALM which has been developed in the following way: through several scripts, which simulate various WMN scenarios in NS-3, collect information in several databases, and then take the data to RStu-dio, where different statistical tests are developed, such as linear models (LM), generalized linear models (GLM), and other statistical tests for both the original and new model proposals. The result is a new methodology for the calculation of metrics, using statistical techniques in the selection and validation of model regressors, presenting an a priori tool to improve the per-formance of the WMS's.

Power systems have been going through a barrage of transformations due to the recent developments in the field, such as deregulation and restructuring of the electric power supply chain, the proliferation of distributed generation (DG), and advancements in information and communications technologies. These have significantly impacted the approach to the planning, design, and operation of active distribution networks or systems. Due to this constant change, the system has become more complex to plan, maintain, and control. In this paper, the benefits, and challenges of active distribution systems relative to traditional passive and active distribution systems are evaluated and investigated while the management and operational characteristics of demand-side resources in Active Distribution Systems (ADS) are studied. In a typical ADS, there exist several vulnerabilities and threats that eventually pose a challenge in the control and automation of substations. These vulnerabilities and threats are reviewed, and potential mitigation measures are suggested. Also in this paper, the communication technologies, and their implementation in terms of control and automation capabilities in active distribution networks are also studied. From this work, it is concluded that communication technologies play an integral role in the realization of a more active distribution networks and that the internet of energy (IoE) is a major player in ADS in the reduction of faults due to human error, fast responses, and improving the stability of power supply. Cyber threats are also and will still be a continuous challenge in smart metering technologies and in substation automation systems (SAS) which will require frequent evaluation and mitigation measures so as not to prevent the power supply system from collapsing.

In this paper, we present a novel Two-Echelon Ground Vehicle and Its Mounted Unmanned Aerial Vehicle Cooperated Routing Problem (2E-GUCRP). The 2E-GUCRP arises in the field of Unmanned Aerial Vehicle (UAV) Routing Problem such as those encountered in the context of city logistics. In a typical cooperated system, the UAV is launched from the Ground Vehicle (GV) and automatically flies to the designated target. Meanwhile, acting as a mobile base station, the GV can charge or change the UAV’s battery on the designated landing points to enable the UAV to continue its mission. The objective is to design efficient GV and UAV routes to minimize the total mission time while meeting the operational constraints. A Mixed Integer Programming (MIP) model, which could be solved by commercial software, is constructed to describe this problem. In order to quickly solve the medium-scale problems, two existing heuristics to solve 2E-VRP are improved. The computational experiments are set up to compare our model with the 2E-VRP. The results indicate that the 2E-GUCRP obtains a better efficiency. Further discussion of the practical instance points out that the increase in efficiency is related to the speed relationship between the GV and the UAV.

The Internet of Things (IoT) is a promising technology for sensing and monitoring the environment to reduce disaster impact. Energy is one of the major concerns for IoT devices, as sensors used in IoT devices are battery-operated. Thus, it is important to reduce energy consumption, especially during data transmission in disaster-adverse situations. Clustering-based communication helps reduce a node’s energy decay during data transmission and enhances the network’s lifetime. Many hybrid combination algorithms are proposed for clustering and the routing protocol to improve the network lifetime in disaster scenarios. However, the performance of these protocols is widely varied based on the underlying network configuration and the optimisation parameters considered. In this research, we have used the clustering parameters that are most relevant to disaster scenarios, such as the node’s residual energy, distance to sink, and network coverage. Then, we proposed a bio-inspired hybrid (BAO-PSO) algorithm where the Butterfly Optimisation Algorithm (BOA) is used for clustering and Particle Swarm Optimisation (PSO) is used for the routing protocol. The performance of the proposed algorithm is compared with the benchmark protocols LEACH, DEEC, PSO, PSO-GA, and PSO-HAS. Residual energy, network throughput, and network lifetime are considered performance matrices. The simulation result showed that the proposed algorithm increases network lifetime by 10%-20% by comparison with the benchmark algorithm.

Unmanned delivery technology using unmanned aerial vehicles (UAVs) has the potential to solve issues such as traffic congestion and labor shortages. We investigated a method to construct a route between the source and destination nodes in a wireless multi-hop network by installing a radio terminal in each house. If the relay functions of all nodes in the network are in operation, the number of control messages for route construction increases, and the message relay forwarding load of each node increases. Keeping all node pairs multi-hop connectivity, we establish a method to operate the relay function with as few nodes as possible. End nodes that have not activated the relay function connect to the relay node with the closest physical distance. In this paper, we propose methods for selecting nodes to operate the relay function. Specifically, one method is based on random selection, another method is based on the number of adjacent nodes, and a third method is based on the Multipoint Relay (MPR) of the Optimized Link State Routing Protocol (OLSR). For each method, we evaluate whether the route construction is available, the number of relay nodes, the total distance of constructed routes, and the distance in population-dense regions. We clarify the characteristics of each method, and the method based on MPR is the best for constructing a network suitable for UAV navigation routes. In addition, the smaller the number of relay nodes, the more unexpected collisions on the links due to route conflicts. We clarify the minimum node density required to apply the MPR method which reduces the number of relay nodes suppressing route conflicts.

The Mine Internet of Things (MIoT), as a key technology for reconstructing post-disaster communication networks, enables to realize the safety monitoring and controlling of the affected roadway. However, due to the challenging underground mine environment, the MIoT suffers from severe signal attenuation, vulnerable nodes, and limited energy, which result in low network reliability of the post-disaster MIoT. To improve the transmission reliability as well as to reduce energy consumption, a directional-area-forwarding-based energy-efficient opportunistic routing (DEOR) for the post-disaster MIoT is proposed. DEOR defines a forwarding zone (FZ) for each node to route packets toward the sink. The candidate forwarding set (CFS) is constructed by the nodes within the FZ that satisfy the energy constraint and the neighboring node degree constraint. The nodes in CFS are prioritized based on the routing quality evaluation by taking the local attributes of nodes into consideration, such as the directional angle, transmission distance, and residual energy. DEOR adopts a recovery mechanism to address the issue of void nodes. The simulation results validate that the proposed DEOR outperforms ORR, OBRN and ECSOR in terms of energy consumption, average hop count, packet delivery rate, and network lifetime.

The Coastal Patrol and Surveillance Application (CPSA) is developed and deployed to detect, track and monitor water vessel traffic using automated devices. Latest advancements of marine technologies, including the Automatic Underwater Vehicles, have allowed the development of this type of applications. To facilitate their operations, installation of a Coastal Patrol and Surveillance Network (CPSN) is mandatory. One of the primary design objectives of this network is to deliver adequate amount of data within an effective time period. This is particularly essential for reporting a detection and notifying the current status of an intruder’s vessel through the adverse underwater communication channels. Additionally, intermittent connectivity of the nodes remain another important obstacle to overcome to allow smooth functioning of CPSA. Taking these objectives and obstacles into account, this work proposes a new protocol, named UDTN-RS, which is developed by ensembling forward error correction technique (namely Reed-Solomon codes or RS) in Underwater Delay Tolerant Network (UDTN) routing protocol with probabilistic spraying technique. In addition, the existing binary packet spraying technique is enhanced for supporting encoded packet exchange between the contacting nodes. A comprehensive simulation campaign is performed in identifying the effectiveness of the proposed protocol. The obtained results suggest that the proposed UDTN-RS protocol can be considered a suitable alternative of the existing protocols for sparse networks like CPSN.

The proliferation of mobile and IoT devices, coupled with the advances in the wireless communication capabilities of these devices, have urged the need for novel communication paradigms for such heterogeneous hybrid networks. Researchers have proposed opportunistic routing as a means to leverage the potentials offered by such heterogeneous networks. While several proposals for multiple opportunistic routing protocols exist, only a few have explored fuzzy logic to evaluate wireless links status in the network to construct stable and faster paths towards the destinations. We propose FQ-AGO, a novel Fuzzy Logic Q-learning Based Asymmetric Link Aware and Geographic Opportunistic Routing scheme that leverages the presence of long-range transmission links to assign forwarding candidates towards a given destination. The proposed routing scheme utilizes fuzzy logic to evaluate whether a wireless link is useful or not by capturing multiple network metrics, the available bandwidth, link quality, node transmission power, and distance progress. Based on the fuzzy logic evaluation, the proposed routing scheme employs a Q-learning algorithm to select the best candidate set toward the destination. We implement FQ-AGO on the NS-3 simulator and compare the performance of the proposed routing scheme with three other relevant protocols: AODV, DSDV, and GOR. For precise analysis, we consider various network metrics to compare the performance of the routing protocols. Our simulation result validates our analysis and demonstrates remarkable performance improvements in terms of total network throughput, packet delivery ration, and end-to-end delay.

Fructose consumption has been growing exponentially and, concomitant with this, the increase in the incidence of obesity and associated complications has followed the same behavior. Studies indicate that fructose may be a carbohydrate with greater obesogenic potential than other sugars. In this context, the liver seems to be a key organ for understanding the deleterious health effects promoted by fructose consumption. Fructose promotes complications in glucose metabolism, accumulation of triacylglycerol in the hepatocytes and alterations in the lipid profile, which, associated with an inflammatory response and alterations in the redox state, will imply a systemic picture of insulin resistance. However, physical exercise has been indicated for the treatment of several chronic diseases. In this review, we show how each exercise protocol (aerobic, strength or a combination of both) promote improvements in the obesogenic state created by fructose consumption as an improvement in the serum and liver lipid profile (HDL increase and decrease TG and LDL levels) and a reduction of markers of inflammation caused by an excess of fructose. Therefore, it is concluded that the practice of aerobic physical exercise, strength or a combination of both is essential for attenuating the complications developed by the consumption of fructose.

The aim was to evaluate the effect of different whitening toothpastes on the enamel surface roughness and color variation. Twenty-four molars were sectioned and divided into eight groups (n = 3), considering the two factors under study: toothpaste type (Colgate® Total Original, Oral B® 3D White Luxe Perfection, Curaprox® Black is White, and Signal® White Now) and brushing protocol (short-term and a long-term). Surface roughness was examined by atomic force microscopy (AFM), and color change (ΔE) was measured using the CIE L*a*b* system. Data were statistically analyzed using comparative parametric tests at a 5% significance level. In the short-term protocol, only the Signal® White Now toothpaste increased surface roughness (p = 0.038) compared to the Colgate® Total Original group. No significant differences (p > 0.05) were observed in surface roughness in the long-term protocol. Regarding color variation, no statistically significant differences (p > 0.05) were observed in either protocol. Overall, the whitening toothpastes did not affect enamel surface roughness or color, except for Signal® White Now causing increased roughness in the short-term protocol. However, all toothpastes induced a visual change in color.

The evolution and miniaturization of the technologies for processing, storage, and communication have enabled computer systems to process a high volume of information and make decisions without human intervention. Within this context, several systems architectures and models have gained prominences, such as the Internet of Things (IoT) and Smart Grids (SGs). SGs use communication protocols to exchange information, among which the Open Smart Grid Protocol (OSGP) stands out. In contrast, this protocol does not have integration support with IoT systems that use some already consolidated communication protocols, such as the Constrained Application Protocol (CoAP). Thus, this work develops the integration of the protocols OSGP and CoAP to allow the communication between conventional IoT systems and systems dedicated to SGs. Results demonstrate the effectiveness of this integration, with the minimum impact on the flow of commands and data, making possible the use of the developed CoAP-OSGP Interface for Internet of Things (COIIoT).

Opportunistic networks, an evolution of mobile Ad Hoc networks (MANETs), offer decentralized communication without relying on preinstalled infrastructure, enabling nodes to route packets through different mobile nodes dynamically. However, due to the absence of complete paths and rapidly changing connectivity, routing in opportunistic networks presents unique challenges. This paper proposes a novel probabilistic routing model for opportunistic networks, leveraging nodes' meeting probabilities to route packets towards their destinations. The model dynamically builds routes based on the likelihood of encountering the destination node, considering factors such as last meeting time and acknowledgment tables to manage network overload. Additionally, an efficient message detection scheme is introduced to alleviate high overhead by selectively deleting messages from buffers during congestion. Furthermore, the proposed model incorporates cross-layer optimization techniques, integrating optimization strategies across multiple protocol layers to maximize energy efficiency, adaptability, and message delivery reliability. Through extensive simulations, the effectiveness of the proposed model is demonstrated, showing improved message delivery probability while maintaining reasonable overhead and latency. This research contributes to the advancement of opportunistic networks, particularly in enhancing connectivity and efficiency for Internet of Things (IoT) applications deployed in challenging environments.

Underwater wireless sensor networks (UWSN) have recently been proposed as a way to monitor and explore the water depths' environments. Efficiently delivering the data is still a challenging problem in these networks because of the weaknesses in the acoustic transmission. To tackle such a problem, we propose a novel algorithm provides controlling mechanisms for critical long-term data forwarding underwater sensor networks, called Hop by Hop Power-Efficient Routing Protocol (Hⁿ-PERP). The proposed Hⁿ-PERP is a centralized full-control model that enhances the network's throughput and energy efficiency by a set of solutions depend on power monitoring in UWSN nodes. In particular, the model provides a guaranteed mechanism for scheduling and processing data transmission based on number of nodes, hops between the nodes, energy level and congestion within each node to minimize energy levels or power consumption by avoiding disconnected probability for any node, which in turn maximizing the network lifetime. Simulation results show that our proposed model is consistent with energy level and congestion, and is more accurate for enabling routing and data transmission. Therefore, the data packet delivery ratio and overall throughput also achieves robust scenarios of very sparse or/and weak networks, to keep on Performance stability in UWSN via adjusting hop-by-hop delay and energy consumption during packages delivery.

Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult. For message forwarding in networks, a planar graph is used to prevent looping, and because long edges are removed by planarization and the resulting planar graph is composed of short edges, messages are forwarded along multiple nodes connected by them even though they can be forwarded directly. To solve this, face routing using information on all nodes within 2-hop range was adopted to forward messages directly to the farthest node within radio range. However, as the density of the nodes increases, network performance plunges because message transfer nodes receive and process increased node information. To deal with this problem, we propose a new face routing using the planar graphs of neighboring nodes to improve transfer efficiency. It forwards a message directly to the farthest neighbor and reduces loads and processing time by distributing network graph construction and planarization to the neighbors. It also decreases the amount of location information to be transmitted by sending information on the planar graph nodes rather than on all neighboring nodes. Simulation results show that it significantly improves transfer efficiency.

Bandung and Lembang are the cities that are chosen by many tourists (local and foreign) as their destinations. Geographically, these cities are placed side-by-side and each city has its own characteristics. As in Bandung, there are many hotels and culinary spots, meanwhile, in Lembang, there are many scenery tourism spots. Tourists usually have limited time to visit all the destinations on holiday, which makes them choose several tourist destinations to visit. In this paper, the tourism itinerary recommendation system is proposed by calculating the most optimal route between destinations and approaching the Vehicle Routing Problem with Time Windows. The optimal route is defined by using Dijkstra the shortest path algorithm by using the collaboration between the road information (road length, traffic condition, travel time, and weather condition) and criteria weight that is determined using the Analytics Hierarchy Process as the graph weights. According to the simulation results, the criteria weights are 6.9%, 62.7%, 18.6%, and 11.9% for Route Length, Traffic Condition, Travel Time, and Weather Condition respectively. Moreover, the optimal number of tourism itinerary plans for the tourist in this research is 4 destinations. As the usage of computational resources, it takes 31.8% of CPU and 61.9% of Memory usage. For the time processing, it increases exponentially as the increment of number of requested stops. The output of this research is expected to be a solution to the tourist itinerary plan, especially in Bandung and Lembang.

In this paper, a model of the hub covering the location-routing problem with simultaneous delivery and pickup should be designed in order to minimize the total costs, minimize the maximum vehicles travel time and minimize the amount of CO_2 gas emissions. Two-stage stochastic programming is used in this paper to control the uncertainty parameters of the problem. The mathematical model aims to decide the appropriate location of hubs and vehicle routing for simultaneous delivery and pickup of products. In this regard, the results obtained from the LP-Metric method show that there is a conflict between the objective functions, and with the reduction of the amount of CO_2 gas emissions and the reduction of the maximum vehicles travel time, the total costs have increased. On the other hand, by examining the economical factor, it was observed that by reducing this factor, the robustness factors are changed and the total costs of the network are reduced. MOIWO and MOALO were used to solve the problem in large scale, the result of which was the existence of a significant difference between the calculation time averages. Also, the efficiency of these methods was very high compared to the LP-Metric method and the maximum relative difference was less than 2.83%. The results of numerical examples show a higher efficiency of the MOALO than the MOIWO.

A lot of previous research have proposed various frameworks and algorithms to optimize routes to reduce the total transportation cost, which accounts for over 70% of overall logistics cost. However, it is very hard to find the cases applied the mathematical models or algorithms to the practical business environment cases, especially daily operating logistics services like convenient stores. Most of previous research have considered the developing an optimal algorithm which can solve the mathematical problem within the practical time while satisfying all constraints such as the capacity of delivery and pick-up, and time windows. For the daily pick-up and delivery service like supporting several convenient stores, it is required to consider the unit transporting container as well as the demand, capacity of trucks, traveling distance and traffic congestion. Especially, the reusable transporting container, trays, should be regarded as the important asset of logistics center. However, if the mathematical model focuses on only satisfying constraints related delivery and not considering the cost of trays, it is often to leave the empty trays on the pick-up points when there is not enough space in the track. In this research, it has been proposed to build the mathematical model for optimizing pick-up and delivery plans by extending the general vehicle routing problem of simultaneous delivery and pickup with time windows while considering left-over cost. With the numerical experiments, it has been proved that the proposed model may reduce the total delivery cost. It may be possible to apply the proposed approach to the various logistics business which uses the reusable transporting container like shipping containers, refrigerating containers, trays, and pallets.

Although the jellyfish species that inhabit the Mediterranean coastal waters are not lethal, their sting can cause severe pain and systemic effects that pose a health risk to humans. Despite the frequent occurrence of jellyfish stings, currently no consensus exists regarding the most appropriate first aid protocol among the scientific community. Over the years, several different rinse solutions have been proposed of which vinegar, or acetic acid, is one of the most noticeable as a rinse solution with efficacy data published. We investigated the effect of vinegar and seawater on the nematocyst discharge process in species representative of the Mediterranean region such as Pelagia noctiluca (Scyphozoa) and Carybdea marsupialis (Cubozoa) by means of: (1) direct observation on the nematocyst discharge by light microscope (Tentacle solution assay) and (2) the quantification of hemolytic area (Tentacle skin blood agarose assay). The nematocyst discharge of both species was not stimulated by seawater, and it was classified as a neutral solution. In P. noctiluca, vinegar produced nematocyst discharge per ser while inhibiting the nematocyst discharge of C. marsupilais. These results suggest that the use of vinegar cannot be universally recommended. While in case of a cubozoan C. marsupialis sting, the inhibitory effect of vinegar makes it the best rinse solution par excellence, in case of a scyphozoan P. noctiluca sting, its application can be counterproductive, worsening the pain and discomfort of the stung area.

Novel sensing technologies for liquid biopsies offer a promising prospect for the early detection of metabolic conditions through -omics techniques. Indeed, high-field NMR facilities are routinely used for metabolomics investigations on a range of biofluids in order to rapidly recognize unusual metabolic patterns in patients suffering from a range of diseases. However, these techniques are restricted by the prohibitively large size and cost of such facilities, suggesting a possible role for smaller, low-field NMR instruments in biofluid analysis. Herein we describe selected biomolecule validation on a low-field benchtop NMR spectrometer (60 MHz), and present an associated protocol for the analysis of biofluids on compact NMR instruments. We successfully detect common markers of diabetic control at low-to-medium concentrations through optimized experiments, including glucose (≤ 2.6 mmol./L) and acetone (25 μmol./L), and additionally in readily-accessible biofluids. We present a combined protocol for the analysis of these biofluids with low-field NMR spectrometers for metabolomics, and offer a perspective on the future of this technique appealing to point-of-care applications.

Underwater acoustic sensor network (UASN) plays a crucial role in collecting real-time data from remote areas of the ocean. However, deploying the UASN is a challenging problem due to the harsh environment and high deployment cost. Therefore, it is essential to design an appropriate routing protocol to effectively address the issues of routing void, packet delivery delay, and energy utilization. In this paper, an adaptive support-vector-machine-based routing (ASVMR) protocol is proposed for the UASN to prolong the network lifetime and reduce the end-to-end packet delivery delay. The proposed protocol employs a distributed routing approach that dynamically optimizes the routing path in real-time by considering four types of node state information. Moreover, the ASVMR protocol establishes a "routing vector" spanning from the current node to the sink node, and selects a suitable pipe radius according to the packet delivery ratio (PDR). In addition, the ASVMR protocol incorporates future states of sensor nodes into the decision-making process, along with the adoption of a waiting time mechanism and routing void recovery mechanism. Extensive simulation results demonstrate that the proposed ASVMR protocol performs well, in terms of the PDR, the hop count, the end-to-end delay, and the energy efficiency in dynamic underwater environments.

The high-speed railway operation environment monitoring network system has a wide variety of sensors and inconsistent business requirements, which have certain requirements for data transmission delay and network life. Most of the previous research focuses only on prolonging network lifetime or reducing data transmission delays when designing or optimizing routing protocols, without co-designing the two. In addition, due to the harsh operating environment of high-speed railways, when the network changes dynamically, the traditional routing algorithm will generate unnecessary redesigns and lead to high overhead. Based on the actual needs of high-speed railway operation environment monitoring, this paper proposes a novel Double Q-values adaptive model combined with the existing reinforcement learning method, which considers the energy balance of the network and real-time data transmission, and constructs energy saving and delay. The two-dimensional reward avoids the extra overhead of maintaining a global routing table while capturing network dynamics. In addition, the adaptive weight coefficient is used to ensure the adaptability of the model to each business of the high-speed railway operation environment monitoring system. Finally, simulations and performance evaluations are carried out and compared with previous studies.Finally, simulations and performance evaluations are carried out and compared with previous studies. The results show that the proposed routing algorithm successfully extends the network’s life cycle and gets good real-time data performance. It also saves energy and has fewer delays than the other three routing protocols in different situations.

This paper presents a cooperative parallel tabu search meta-heuristic for the vehicle routing problem with time windows. It is based on the scheme in which several search threads cooperate by asynchronously exchanging information on the best solutions identified. The exchanges are performed through a mechanism called adaptive memory which holds and manages a pool of solutions. This enforces the asynchronous strategy of information exchanges and ensures the independence of the individual search threads. Each of these independent threads implements a tabu search meta-heuristic. Comprehensive computational experiments and comparisons to best known solutions show that the proposed cooperative parallel tabu search algorithm is able to achieve 48 new best solutions on VRPTW benchmark instances.

Wireless Sensor Networks (WSNs) continue to provide essential services for various applications such as surveillance, data gathering, and data transmission from the hazardous environments to safer destinations. This has been enhanced by the energy-efficient routing protocols that are mostly designed for such purposes. Gateway-based Energy-Aware Multi-hop Routing protocol (MGEAR) is one of the homogenous routing schemes that was recently designed to more efficiently reduce the energy consumption of distant nodes. However, it has been found that the protocol has a high energy consumption rate, lower stability period, less data transmission to the Base station (BS). In this paper, an enhanced Heterogeneous Gateway-based Energy-Aware multi-hop routing protocol ( HMGEAR) is proposed. The proposed routing scheme is based on the introduction of heterogeneous nodes in the existing scheme, selection of the head based on the residual energy, introduction of multi-hop communication strategy in all the regions of the network, and implementation of energy hole elimination technique. Results show that the proposed routing scheme outperforms two existing ones.

Underwater Wireless Sensor Networks (UWSN) enables various oceanic applications which require effective packet transmission. In this case, sparse node distribution, dynamic network topology and inappropriate selection of relay nodes cause void holes. Addressing this problem, we present a Relay based Void Hole Prevention and Repair protocol (ReVOHPR) by multiple Autonomous Underwater Vehicles (AUV) for UWSN. ReVOHPR efficiently identifies and avoids void holes and trap relay nodes to avoid it. ReVOHPR adopts the following operations as Ocean Depth (levels) based Equal Cluster Formation, Dynamic Sleep Scheduling, Virtual Graph based Routing, and Relay Assisted Void Hole Repair. For energy efficient cluster forming, Entropy based Eligibility Ranking (E2R) is presented which elects stable cluster heads (CHs). Then, dynamic sleep scheduling is implemented Dynamic Kernel Kalman Filter (DK2F) algorithm in which Sleep and Active modes based on the nodes current status. Inter Cluster Routing is performed by maximum matching nodes which selects by Dual criteria and also data transmitted to AUV. Finally, void holes are detected and repair by Bi-Criteria Mayfly Optimization (BiCMO) algorithm. The BiCMO focuses on reducing the number of holes, data packet loss and maximizes Quality of Service (QoS) and energy efficiency of the networks. This protocol is timely deal with node failures in packet transmission via multi-hop routing. Simulation is implemented by NS3 (AquaSim module) simulator that evaluates the performance in network simulation for following metrics as average energy consumption, delay, packet delivery rate and throughput.

Background/methods: For mechanistic studies, in vitro human B cell differentiation and generation of plasma cells are invaluable techniques. However, the heterogeneity of both T cell-dependent (TD) and T cell-independent (TI) stimuli and the disparity of culture conditions used in existing protocols makes interpretation of results challenging. The aim of the present study was to achieve the most optimal B cell differentiation conditions using isolated CD19⁺ B cells and PBMC cultures. We addressed multiple seeding densities, different durations of culturing and various combinations of TD stimuli and TI stimuli including B cell receptor (BCR) triggering. B cell expansion, proliferation and differentiation was analyzed after 6 and 9 days by measuring B cell proliferation and expansion, plasmablast and plasma cell formation and immunoglobulin (Ig) secretion. In addition, these conditions were extrapolated using cryopreserved cells and differentiation potential was compared. Results: This study demonstrates improved differentiation efficiency after 9 days of culturing for both B cell and PBMC cultures using CD40L and IL-21 as TD stimuli and 6 days for CpG and IL-2 as TI stimuli. We arrived at optimized protocols requiring 2500 and 25.000 B cells per culture well for TD and TI assays, respectively. The results of the PBMC cultures were highly comparable to the B cell cultures, which allows dismissal of additional B cell isolation steps prior to culturing. In these optimized TD conditions, the addition of anti-BCR showed little effect on phenotypic B cell differentiation, however it interferes with Ig secretion measurements. Addition of IL-4 to the TD stimuli showed significantly lower Ig secretion. The addition of BAFF to optimized TI conditions showed enhanced B cell differentiation and Ig secretion in B cell but not in PBMC cultures. With this approach, efficient B cell differentiation and Ig secretion was accomplished when starting from fresh or cryopreserved samples. Conclusion: Our methodology demonstrates optimized TD and TI stimulation protocols for more indepth analysis of B cell differentiation in primary human B cell and PBMC cultures while requiring low amounts of B cells, making them ideally suited for future clinical and research studies on B cell differentiation of patient samples from different cohorts of B cell-mediated diseases.

Communication infrastructures may be partially or completely destroyed due to the natural disasters, especially the disruption of a few critical network devices, leading to the collapse of communication services.To address this issue, we constructed a layered, multi-domain data transmission architecture based on a UAV-assisted resilient network. Initially, the UAV controllers perceived the network status and learning the temporal- spatial characteristics of air-to-ground networks links. Subsequently, we developed a multi-domain routing algorithm based on federated reinforcement distillation, called FedRDR, enhancing the generalization capabilities of routing decision model through the augmentation of training data samples.We conducted simulation experiments, and the results indicate that the FedRDR algorithm has an average communication data volume of approximately 45.3KB between each domain controller and server. Compared to parameter transmission through the federated reinforcement learning algorithm, FedRDR can reduce the amount of transmitted parameters by approximately 29\%. Therefore, the FedRDR routing algorithm promotes knowledge transfer, accelerates the training process of intra-domain intelligent agents, and decreases the communication data volume between domain controllers and servers.

Although Cable driven rehabilitation devices (CDRD) have advantages over traditional link-driven devices, including lightweight, ease of reconfiguration, remote actuation, etc, the majority of existing lower-limb CDRD is limited to rehabilitation in the sagittal plane. In this work, we extend our previous sagittal plane model (2DOF) to accommodate hip motion in the frontal plane (abduction/adduction) toward studying the feasibility of tracking bi-planar motion (combined frontal and sagittal plane motion) via intra-planar cable routing. Two optimization problems have been formulated to estimate an optimal location of the hip cuffs, first to estimate the optimal cuff location at each time step to identify a single ‘averaged’ optimal cuff location and second to calculate a single optimal cuff location for the entire gait cycle. The optimization solutions identified for the 3DOF model revealed that optimization of the location of cuffs on the anterior and posterior side of the hip joint for 4 cable configuration is not sufficient to generate the desired bi-planar motion. For simultaneous tracking of the bi-planar motion, 2 additional cables have been added at hip joints and are routed in an intra-planar manner. The simulation result with the 3DOF model confirmed successful bi-planar trajectory tracking. The various number of cables and cable routings for tracking bi-planar motion will be studied in future work.

Mobility models are used to evaluated the network protocols of the ad hoc network using the simulation. The random waypoint model is a model for mobility which is usually used for performance evaluation of ad-hoc mobile network. Mobile nodes have the dynamic mobility in the ad hoc network so the mobility model plays an important role to evaluate the protocol performance.In this article, we developed modify random waypoint mobility (MRWM) model based on random waypoint for the mobile ad hoc network. In this article, the comparative analysis of modifying random waypoint mobility and random waypoint model on the ad hoc On-Demand Distance Vector (AODV) routing protocol has been done for large wireless ad hoc network (100 nodes) with the random mobile environment for the 1800s simulation time. To enhance the confidence on the protocol widespread simulations were accomplished under heavy traffic (i.e. 80 nodes) condition. The proposed model protocol has been investigated with the performance metrics: throughput; packet delivery ratio; packet dropping ratio; the end to end delay and normalized routing overhead. The obtained results revealed that proposed modify random waypoint mobility model reduces the mobility as compared to the random waypoint mobility model and it is trace is more realist.