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.

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

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.

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.

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.

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.

Opportunistic routing has emerged as one of the prominent solutions for efficient data delivery in ad hoc networks especially in highly dynamic scenarios. Opportunistic routing uses the broadcasting nature of the wireless medium to increase the number of potential forwarding nodes in the network, thereby improving the delivery rate. But most of the proposed opportunistic routing protocols suffer from increased duplicate data forwarding at the intermediate nodes in the network which leads to increase in traffic and reduced efficiency. We propose a novel method which uses acknowledgements for controlling the data forwarding by intermediate nodes and thereby eliminating most of the duplicate forwarding in the network. Simulation results show that our proposed method is much more efficient that all the major existing opportunistic protocols.

The exponential growth of user-contributed data provides a comprehensive basis for assessing collective perceptions of landscape change. A variety of possible public data sources exist, such as geospatial data from social media or Volunteered Geographic Information (VGI). Key challenges with such ‘opportunistic’ data sampling are variability in platform popularity and bias due to changing user groups and contribution rules. In this study, we use five case studies to demonstrate how intra- and inter-dataset comparisons can help to assess the temporality of landscape scenic resources, such as identifying seasonal characteristics for a given area, or testing hypotheses about shifting popularity trends observed in the field. By focusing on the consistency and reproducibility of temporal patterns for selected scenic resources and comparisons across different dimensions of data, we aim to contribute to the development of systematic methods for disentangling the perceived impact of events and trends from other technological and social phenomena included in the data. The proposed techniques may help to draw attention to overlooked or underestimated patterns of landscape change, fill in missing data between periodic surveys, or corroborate and support field observations. Despite limitations, the results already provide a comprehensive basis for developing indicators with a high degree of timeliness for monitoring perceived landscape change over time.

Understanding the interplay between infections and severe acute malnutrition is critical in attaining good clinical outcomes in managing malnourished children. However, review studies describing the profile of the associated pathogens in the malnourished African pediatric population are sparse in the literature. We aimed to identify the spectrum of pathogens from studies reporting infections in malnourished African children, as well as the antibiotic resistance pattern and clinical outcomes. A systematic literature of the PubMed database was conducted following PRISMA guidelines from January 2001 to June 2024. The search algorithm was ((marasmus) OR (kwashiorkor) OR (severe acute malnutrition) OR (protein energy malnutrition)) AND (Africa). For a more comprehensive retrieval, an additional search algorithm was deployed: (HIV OR tuberculosis) AND (severe acute malnutrition). We included 67 studies conducted between 2001 and 2024. Most of the studies were from East Africa (n=53, 79.1%) and Southern Africa (n=5, 7.4%). A total of 7,056 pathogens were identified comprising 3,030 Viruses, 2,381 bacteria, 1,452 parasites and 193 fungal pathogens. The predominant pathogens were HIV, Mycobacterium tuberculosis, and malaria parasites accounting for 42.5%, 25.2%, and 17.1% respectively. Antibiotic susceptibility testing was documented in only three studies. Fatality rates were reported in 49 studies and ranged from 2% to 56% regardless of the category of pathogen. This review affirms the deleterious effect of infections in malnourished patients and suggests a gross underdiagnosis as studies were found from only 17 (31.5%) African countries. Moreover, data on fungal infections in malnourished African children was nearly absent despite being at risk. There is also a need to prioritize research investigating African children with severe acute malnutrition for fungal infections besides other opportunistic pathogens and improve the availability of diagnostic tools and the optimized usage of antibiotics through the implementation of antimicrobial stewardship programmes.

The emerging working mode of coordinated trucks and drones has demonstrated significant practical potential in various fields, including logistics and delivery, intelligence surveillance reconnaissance, area monitoring, and patrol. The seamless collaboration between trucks and drones is garnering widespread attention in academia and has emerged as a key technology for achieving efficient and secure transportation. This paper provides a comprehensive and in-depth review of the research status on the routing problem for coordinated trucks and drones, covering aspects such as application background, cooperative modes, configurations, issues have been taken into consideration, and solution methodologies.

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.

Microorganisms belonging to the Lactobacillus genus are naturally associated or deliberately added to fermented food products and are widely used in probiotic food additives and supplements. Moreover these bacteria normally colonize mouth, gastrointestinal (GI) tract and female genitourinary tract of humans. They exert multiple beneficial effects and are regarded as safe microorganisms. However, infections caused by lactobacilli, mainly endocarditis, bacteremia and pleuropneumonia occasionally occur. The relevance of Lactobacillus spp. as opportunistic pathogens in humans and related risk factors and predisposing conditions are illustrated in this review article with more emphasis on the species L. rhamnosus, that has been more often involved in infection cases. The methods used to identify this species in clinical samples, to distinguish strains and to evaluate traits that can be associated to pathogenicity, as well as future perspectives for improving the identification of potentially pathogenic strains are outlined.

The development of multidrug resistance by pathogenic bacteria and yeast is a significant medical problem that needs to be addressed. One possible answer could be the combined use of antibiotics and silver nanoparticles, which have different mechanisms of antimicrobial action. Nanoparticles can be combined with antifungal agents in the same way. Biogenic silver nanoparticles synthesized using environmentally friendly technology using extracts of biologically active plants are an effective nanomaterial that needs to be comprehensively investigated for implementation into medical practice. In this study, the synergistic effects arising from their combined use with antibiotics and fungicides against various bacteria and yeasts, included in the ESKAPE list, were studied. Effective concentrations of substances were established, recommendations for the studied pathogenic species were presented and the effect of destruction of the bacterial membrane was illustrated. The most significant synergistic effect was manifested in pathogenic candida and brewer's yeast.

After 29 years of clinical practice treating odontogenic infections of the head, neck and oral cavity, my co-contributors and I sought to determine by a review of the literature and three clinical cases if Prevotella species were significant opportunistic pathogens in odontogenic infections of all kinds in the oral and maxillofacial region. We performed a PubMed review of 40 articles using terms associated with odontogenic infections, pericoronitis, Prevotella and antibiotics used to treat common oral and maxillofacial infections. Three cases were reported, and the treatment was discussed. An additional 26 articles were reviewed to describe the pathogenesis of Prevotella. Given the opportunity to become virulent—such as post-extraction wound healing of an extraction site adjacent to an intact dentition, excessive plaque and calculus, nearby gingivitis or periodontitis, or an immunocompromised host—we wondered if Prevotella could be targeted with antimicrobials mitigating, or even resolving, odontogenic infections in those cases refractory to conservative surgical therapy that includes source control. We found that Prevotella is a significant opportunistic pathogen in odontogenic infections. Prevotella is susceptible to Metronidazole (Flagyl), and it is effective in mitigating the disease process when basic principles of the treatment of odontogenic infections are employed. Infections not responsive to this empiric therapy should be cultured to determine the opportunistic organism’s sensitivity and susceptibility to specific antibiotic therapy.

Urinary tract infections (UTIs) remain one of the most important problems of modern urology and medicine. Infections bring great discomfort and significantly reduce the quality of life. UTIs rank second after respiratory tract infections in outpatients. The most common pathogen of UTI are E.coli. The study of the etiology of UTI has great clinical and epidemiological importance in routine practice. Objective: To assess the etiological significance of pathogens in the occurrence of urinary tract infections in the Karaganda region of Kazakhstan. Methods: A total of 2378 patients presenting UTIs were enrolled and each provided a urine sample. The study was carried out in the Clinical Microbiology Laboratory MediTEC-NS between 2 January and 29 December 2018. Identification of isolated microorganisms was carried out on a WalkAway 96 Plus microbiological analyzer, Microscan model manufactured by Beckman Coulter (USA). Statistical Analysis was performed using the STATISTICA-6 package. Results: Out of 2378 patients a total of 1177 (49,5%) urine samples tested positive by culture test. From these samples, 1356 strains of microorganisms were isolated, of which 84.79% were monoculture and 21% were of a mixed culture. Gram-positive bacteria 690 (50, 88%), Gram-negative bacteria 630 (46, 46%), and Candida 36 (2.65%) were identified. Gram-negative rods were represented by Enterobacterales 557 (88.41%) and non-fermenting bacteria 73 (11.59%). In the Enterobacterales group included Escherichia coli 371 (66.61%) of which 108 (29,1%) ESBL strains. The next etiologically significant uropathogens were Klebsiella- 99 (17, 77%), Enterobacter-36 (6,46%) and Proteus-32 (8,09). K.pneumoniae prevailed in comparison with other Klebsiella spp. ESBL producing was 34 (57, 6%) out of 59 K.pneumoniae isolates. Gram-negative non-fermenting rod were represented by Acinetobacter spp-34 (46.57%) and Pseudomonas spp 31 (42.47%). Of 34 Acinetobacter spp. isolates 22 (64.7%) were identified as Acinetobacter lwoffii. Among the gram-positive pathogens of UTI, Staphylococcus spp prevailed - 411 (59.57%), followed by Enterococcus spp 197 (28.55%) and Streptococcus spp 81 (11.73%). Coagulase-negative staphylococci 381 (92,7%) isolates out of total 411 staphylococcal isolates. Staphylococcus epidermidis 245 (59,61%) and Staphylococcus haemolyticus 81 (21,17%) were the most frequent isolated coagulase-negative staphylococci. Of 411 staphylococcal isolates, 182 (44.28%) were MRS Conclusion: We found that UTIs among our study population were predominantly caused by ten opportunistic pathogens. The most common uropathogens with a frequency of 66.9% were E. coli- 30.53%, S. epidermidis -20.16%, and Enterococcus spp. -16.21%. Frequently isolated pathogens included Klebsiella, S. haemolyticus spp., and Streptococcus spp. which amounted to 21.98%. The distribution within the patient group was equable and ranged from 6,67% to 8,15%. Etiologically significant pathogens included Enterobacter spp., Proteus spp., Acinetobacter spp., Pseudomonas spp. These bacteria accounted for 11.11%. The distribution within the group was again equable and ranged within 2,55% to 2,96%.

Introduction: Urinary tract infections (UTIs) remain one of the most important problems of modern urology and medicine. Infections bring great discomfort and significantly reduce the quality of life. UTIs rank second after respiratory tract infections in outpatients. The most common pathogen of UTI are E.coli. The study of the etiology of UTI has great clinical and epidemiological importance in routine practice.Objective: To assess the etiological significance of pathogens in the occurrence of urinary tract infections in the Karaganda region of Kazakhstan.Methods: A total of 2378 patients presenting UTIs were enrolled and each provided a urine sample. The study was carried out in the Clinical Microbiology Laboratory MediTEC-NS between 2 January and 29 December 2018. Identification of isolated microorganisms was carried out on a WalkAway 96 Plus microbiological analyzer, Microscan model manufactured by Beckman Coulter (USA). Statistical Analysis was performed using the STATISTICA-6 package.Results: Out of 2378 patients a total of 1177 (49,5%) urine samples tested positive by culture test. From these samples, 1356 strains of microorganisms were isolated, of which 84.79% were monoculture and 21% were of a mixed culture. Gram-positive bacteria 690 (50, 88%), Gram-negative bacteria 630 (46, 46%), and Candida 36 (2.65%) were identified. Gram-negative rods were represented by Enterobacterales 557 (88.41%) and non-fermenting bacteria 73 (11.59%). In the Enterobacterales group included Escherichia coli 371 (66.61%) of which 108 (29,1%) ESBL strains. The next etiologically significant uropathogens were Klebsiella- 99 (17, 77%), Enterobacter-36 (6,46%) and Proteus-32 (8,09). K.pneumoniae prevailed in comparison with other Klebsiella spp. ESBL producing was 34 (57, 6%) out of 59 K.pneumoniae isolates. Gram-negative non-fermenting rod were represented by Acinetobacter spp-34 (46.57%) and Pseudomonas spp 31 (42.47%). Of 34 Acinetobacter spp. isolates 22 (64.7%) were identified as Acinetobacter lwoffii. Among the gram-positive pathogens of UTI, Staphylococcus spp prevailed - 411 (59.57%), followed by Enterococcus spp 197 (28.55%) and Streptococcus spp 81 (11.73%). Coagulase-negative staphylococci 381 (92,7%) isolates out of total 411 staphylococcal isolates. Staphylococcus epidermidis 245 (59,61%) and Staphylococcus haemolyticus 81 (21,17%) were the most frequent isolated coagulase-negative staphylococci. Of 411 staphylococcal isolates, 182 (44.28%) were MRSConclusion: We found that UTIs among our study population were predominantly caused by ten opportunistic pathogens. The most common uropathogens with a frequency of 66.9% were E. coli- 30.53%, S. epidermidis -20.16%, and Enterococcus spp. -16.21%. Frequently isolated pathogens included Klebsiella, S. haemolyticus spp., and Streptococcus spp. which amounted to 21.98%. The distribution within the patient group was equable and ranged from 6,67% to 8,15%. Etiologically significant pathogens included Enterobacter spp., Proteus spp., Acinetobacter spp., Pseudomonas spp. These bacteria accounted for 11.11%. The distribution within the group was again equable and ranged within 2,55% to 2,96%.

Abstract Introduction: Urinary tract infections (UTIs) remain one of the most important problems of modern urology and medicine. Infections bring great discomfort and significantly reduce the quality of life. UTIs rank second after respiratory tract infections in outpatients. The most common pathogen of UTI are E.coli. The study of the etiology of UTI has great clinical and epidemiological importance in routine practice. Objective: To assess the etiological significance of pathogens in the occurrence of urinary tract infections in the Karaganda region of Kazakhstan. Methods: A total of 2378 patients presenting UTIs were enrolled and each provided a urine sample. The study was carried out in the Clinical Microbiology Laboratory MediTEC-NS between 2 January and 29 December 2018. Identification of isolated microorganisms was carried out on a WalkAway 96 Plus microbiological analyzer, Microscan model manufactured by Beckman Coulter (USA). Statistical Analysis was performed using the STATISTICA-6 package. Results: Out of 2378 patients a total of 1177 (49,5%) urine samples tested positive by culture test. From these samples, 1356 strains of microorganisms were isolated, of which 84.79% were monoculture and 21% were of a mixed culture. Gram-positive bacteria 690 (50, 88%), Gram-negative bacteria 630 (46, 46%), and Candida 36 (2.65%) were identified. Gram-negative rods were represented by Enterobacterales 557 (88.41%) and non-fermenting bacteria 73 (11.59%). In the Enterobacterales group included Escherichia coli 371 (66.61%) of which 108 (29,1%) ESBL strains. The next etiologically significant uropathogens were Klebsiella- 99 (17, 77%), Enterobacter-36 (6,46%) and Proteus-32 (8,09). K.pneumoniae prevailed in comparison with other Klebsiella spp. ESBL producing was 34 (57, 6%) out of 59 K.pneumoniae isolates. Gram-negative non-fermenting rod were represented by Acinetobacter spp-34 (46.57%) and Pseudomonas spp 31 (42.47%). Of 34 Acinetobacter spp. isolates 22 (64.7%) were identified as Acinetobacter lwoffii. Among the gram-positive pathogens of UTI, Staphylococcus spp prevailed - 411 (59.57%), followed by Enterococcus spp 197 (28.55%) and Streptococcus spp 81 (11.73%). Coagulase-negative staphylococci 381 (92,7%) isolates out of total 411 staphylococcal isolates. Staphylococcus epidermidis 245 (59,61%) and Staphylococcus haemolyticus 81 (21,17%) were the most frequent isolated coagulase-negative staphylococci. Of 411 staphylococcal isolates, 182 (44.28%) were MRS Conclusion: We found that UTIs among our study population were predominantly caused by ten opportunistic pathogens. The most common uropathogens with a frequency of 66.9% were E. coli- 30.53%, S. epidermidis -20.16%, and Enterococcus spp. -16.21%. Frequently isolated pathogens included Klebsiella, S. haemolyticus spp., and Streptococcus spp. which amounted to 21.98%. The distribution within the patient group was equable and ranged from 6,67% to 8,15%. Etiologically significant pathogens included Enterobacter spp., Proteus spp., Acinetobacter spp., Pseudomonas spp. These bacteria accounted for 11.11%. The distribution within the group was again equable and ranged within 2,55% to 2,96%.

Colpodella species are free-living opportunistic pathogens that cause human and animal infections and use ticks and flies as vectors. Trophozoite and cyst stages of Colpodella species can be distinguished from stages of the prey Parabodo caudatus using Sam-Yellowe’s trichrome staining. Colpodella species obtain nutrients by attaching to their prey, aspirating the prey’s cytoplasmic contents into a posterior food vacuole and encysting. It is unclear whether both trophozoite and cyst stages are present during infection. Molecular techniques identified Colpodella species in all reported infections. However, no morphological information was reported to aid life cycle stage identification in hosts. This review discusses the increased incidence of Colpodella infection in animals and in vectors and the need to identify stages used for transmission and pathogenesis. The potential for zoonotic infections through tick and fly bites is a public health concern. We previously used Sam-Yellowe’s trichrome staining to identify life cycle stages of Colpodella sp. In order to gain a better understanding of transmission and pathogenesis, identifying Colpodella life cycle stages in infected tissue and in vectors will provide important insights regarding nutrient uptake in hosts by determining whether attachment of trophozoites to host cells occurs, and identifying trophozoites and cysts in infected hosts.

In contrast to “frank” pathogens, like Salmonella entrocolitica, Shigella dysenteriae, and Vibrio cholerae, that always have a probability of disease, “opportunistic” pathogens are organisms that cause an infectious disease in a host with a weakened immune system and rarely in a healthy host. Historically, drinking water treatment has focused on control of frank pathogens, particularly those from human or animal sources (like Giardia lamblia, Cryptosporidium parvum, or Hepatitis A virus), but in recent years outbreaks from drinking water have increasingly been due to opportunistic pathogens. Characteristics of opportunistic pathogens that make them problematic for water treatment include: 1) they are normally present in aquatic environments, 2) they grow in biofilms that protect the bacteria from disinfectants, and 3) under appropriate conditions in drinking water systems (e.g., warm water, stagnation, low disinfectant levels, etc.) these bacteria can amplify to levels that can pose a public health risk. The three most common opportunistic pathogens in drinking water systems include Legionella pneumophila, Mycobacterium avium, and Pseudomonas aeruginosa. This report focuses on these organisms to provide information on their public health risk, occurrence in drinking water systems, susceptibility to various disinfectants and other operational practices (like flushing and cleaning of pipes and storage tanks). In addition, information is provided on a group of nine other opportunistic pathogens that are less commonly found in drinking water systems, including Aeromonas hydrophila, Klebsiella pneumoniae, Serratia marcescens, Burkholderia pseudomallei, Acinetobacter baumannii, Stenotrophomonas maltophilia, Arcobacter butzleri, and several free-living amoebae including Naegleria fowleri and species of Acanthamoeba. The public health risk for these microbes in drinking water is still unclear, but in most cases, efforts to manage Legionella, mycobacteria, and Pseudomonas risks will also be effective for these other opportunistic pathogens. The approach to managing opportunistic pathogens in drinking water supplies focuses on controlling the growth of these organisms. Many of these microbes are normal inhabitants in biofilms in water, so the attention is less on eliminating these organisms from entering the system and more on managing their occurrence and concentrations in the pipe network. With anticipated warming trends associated with climate change, the factors that drive the growth of opportunistic pathogens in drinking water systems will likely increase. It is important, therefore, to evaluate treatment barriers and management activities for control of opportunistic pathogen risks. Controls for primary treatment, particularly for turbidity management and disinfection, should be reviewed to ensure adequacy for opportunistic pathogen control. However, the major focus for the utility’s opportunistic pathogen risk reduction plan is the management of biological activity and biofilms in the distribution system. Factors that influence the growth of microbes (primarily in biofilms) in the distribution system include, temperature, disinfectant type and concentration, nutrient levels (measured as AOC or BDOC), stagnation, flushing of pipes and cleaning of storage tank sediments, and corrosion control. Pressure management and distribution system integrity are also important to the microbial quality of water but are related more to the intrusion of contaminants into the distribution system – rather than directly related to microbial growth. Summarizing the identified risk from drinking water, the availability and quality of disinfection data for treatment, and guidelines or standards for control showed that adequate information is best available for management of L. pneumophila. For L. pneumophila the risk for this organism has been clearly established from drinking water, cases have increased worldwide, and it is one of the most identified causes of drinking water outbreaks. Water management best practices (e.g., maintenance of a disinfectant residual throughout the distribution system, flushing and cleaning of sediments in pipelines and storage tanks, among others) that have been shown to be effective for control of L. pneumophila in water supplies. In addition, there are well documented management guidelines available for the control of the organism in drinking water distribution systems. By comparison, management of risks for Mycobacteria from water are less clear than for L. pneumophila. Treatment of M. avium is difficult due to its resistance to disinfection, the tendency to form clumps and attachment to surfaces in biofilms. Additionally, there are no guidelines for management of M. avium in drinking water and one risk assessment study suggested a low risk of infection. The role of tap water in the transmission of the other opportunistic pathogens is less clear and in many cases actions to manage L. pneumophila (e.g., maintenance of a disinfectant residual, flushing, cleaning of storage tanks, etc.) will also be beneficial in helping to manage these organisms as well.

In recent years, the delivery of medical supplies has faced significant challenges due to natural disasters and recurrent public health emergencies. Addressing the need for improved logistics operations during such crises, this article presents an innovative approach integrating vehicle and Unmanned Aerial Vehicle (UAV) logistics to enhance the efficiency and resilience of medical supply chains. Our study introduces a dual-mode distribution framework that employs the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm for efficiently clustering demand zones unreachable by conventional vehicles, thereby identifying areas requiring UAV delivery. Furthermore, we categorize the demand for medical supplies into two distinct sets based on vehicle accessibility, optimizing distribution routes via both UAVs and vehicles. Through comparative analysis, our findings reveal that the artificial bee colony (ABC) algorithm significantly outperforms the genetic algorithm in terms of solving efficiency, iteration counts, and delivery speed. However, the ABC algorithm's tendency towards early local optimization and rapid convergence leads to potential stagnation in local optima. To mitigate this issue, we incorporate a simulated annealing technique into the ABC framework, culminating in a refined optimization approach that successfully overcomes the limitations of premature local optima convergence. The experimental results validate the efficacy of our enhanced algorithm, demonstrating reduced iteration counts, shorter computation times, and substantially improved solution quality over traditional logistic models. The proposed method holds promise for significantly improving the operational efficiency and service quality of the healthcare system's logistics during critical situations.

This literature review was aimed to identifying the opportunistic bacterial pathogens that can be transmitted by contaminated food and represent a current threat for patients particularly suscep-tible to infections because of underlying conditions or predisposing factors. The analysis was focused on recent case or outbreak reports, and systematic reviews published in years 2019 - 2023 and resulted in sorting 24 bacterial groups comprising genera or species able to cause a variety of systemic or invasive infections if ingested with food or drinking water. These included both bacteria known to cause mild infections in immunocompetent persons and bacteria considered innocuous that are used in food fermentation or as probiotics. No recent cases from dietary routes were reported for bacteria of critical importance as nosocomial pathogens and widely occurring in food products, primarily, Acinetobacter baumanii and Klebsiella pneumoniae. However, the very first sources of their introduction in the clinical environment still need to be estab-lished. In many instances, risky dietary habits such as eating raw fish, seafood, raw meat, unpasteurized milk and derived products or the lack of control on fermentation processes led to the reported illnesses, pointing out to the necessity to improve the hygiene of production and consumer’s awareness of risks.

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.

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.

The human coronaviruses (CoV) include HCoV-229E, HCoV-OC43, HCoV-NL63 and HCoV-HKU1, some known for decades. The severe acute respiratory syndrome (SARS) CoV briefly emerged into the human population but was controlled. In 2012 another novel severely human pathogenic CoV – Middle Eastern Respiratory Syndrome (MERS)-CoV was identified in the Kingdom of Saudi Arabia, where 80% of over 2,000 human cases have been recorded across five years. Targeted research remains key to developing control strategies for MERS-CoV, a cause of mild illness in its camel reservoir. A new therapeutic toolbox being developed in response to MERS is also teaching us more about how CoVs cause disease. Travel-related cases continue to challenge the world’s surveillance and response capabilities and more data are needed to understand unexplained primary transmission. Signs of genetic change have been recorded but it remains unclear whether any impact on clinical disease. How camels came to carry the virus remains academic to the control of MERS. To date, human-to-human transmission has been inefficient, but virus surveillance, characterisation and reporting are key to responding to any future change. MERS-CoV is not currently a pandemic threat; it is spread mainly with the aid of human habit and error.

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.

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.

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.

The colpodellids consist of free-living predatory protists phylogenetically related to pathogenic Apicomplexan parasites such as Plasmodium species, Cryptosporidium sp. and Toxoplasma gondii. Among the colpodellids, Colpodella species prey on bodonids, algae, and ciliates. Voromonas pontica preys on Percolomonas species. In the past decade, Colpodella species have been reported to cause opportunistic infections in humans and animals, and having the potential for zoonotic infections in humans due to the presence of Colpodella species in ticks. In the reported cases, transmission and pathogenic stages of Col-podella were not identified by light microscopy. In the colpodellid V. pontica, cyst stages of both the pred-ator and its prey Percolomonas cosmopolitus have not been identified by light microscopy. In this study we evaluated the dye components used for Sam-Yellowe’s trichrome staining, from different major vendors to determine the consistency and reproducibility of the staining protocol to aid the use of the staining proto-col for diagnosis. We show that although slight variations in the color of the stained cells are obtained, life cycle stages of Colpodella ATCC 50594 could be clearly identified, regardless of the vendor used. For the first time, Sam-Yellowe’s trichrome staining series, could identify cysts of V. pontica and its prey, demonstrating that the staining protocol can identify life cycle stages of other colpodellids. Sam-Yellowe's trichrome staining will aid molecular diagnosis of infections caused by colpodellids in human and ani-mals, identify colpodellids in ticks and flies and from environmental samples, when used for staining.

In recent years, humanity has faced a growing challenge posed by the rise of antibiotic-resistant bacteria, resulting in an alarming surge in fatalities and the emergence of increasingly hard-to-manage diseases. Among these resilient pathogens is Acinetobacter baumannii, due to its escalating prevalence in hospitals, elevated mortality rates, and resistance to treatment. Despite its clinical significance, our understanding of this pathogen in non-hospital settings and its virulence factors remains limited. Therefore, this review aims to shed light on the latest research regarding its ecological niche, microbiological traits, and antibiotic resistance profiles. Recent investigations have expanded its detection to various environmental niches, including rivers, treatment plants, and soils. Moreover, this bacterium has been discovered in diverse food sources such as meat and vegetables, as well as in farm animals and household pets like dogs and cats. This broader presence of Acinetobacter baumannii outside of hospital environments underscores a significant risk of environmental contamination, necessitating heightened awareness and preventive measures to address potential public health implications.

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.

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.

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 %.

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).

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.

Energy-efficient microprocessors are essential for a wide range of applications. While near-threshold computing is a promising technique to improve energy efficiency, optimal supply demands from logic core and on-chip memory are conflicting. In this paper, we perform static reliability analysis of 6T SRAM and discover the variance among different sizing configuration and asymmetric minimum voltage requirements between read and write operations. We leverage this asymmetric property in near-threshold processors equipped with voltage boosting capability by proposing an opportunistic dual-supply switching scheme with a write aggregation buffer. Our results show that proposed technique improves energy efficiency by more than 21.45% with approximate 10.19% performance speed-up.

It was recently studied how to achieve the optimal degrees of freedom (DoF) in a multi-antenna full-duplex system with partial channel state information (CSI). In this paper, we revisit the DoF of a multiple-antenna full-duplex system using opportunistic transmission under the partial CSI, in which a full-duplex base station having M transmit antennas and M receive antennas supports a set of half-duplex mobile stations (MSs) having a single antenna each. Assuming no self-interference, we present a new hybrid opportunistic scheduling method that achieves the optimal sum DoF under an improved user scaling law. It is shown that the optimal sum DoF of 2M is asymptotically achievable provided that the number of MSs scales faster than SNR^M, where SNR denotes the signal-to-noise ratio. This result reveals that in our full-duplex system, better performance on the user scaling law can be obtained without extra CSI, compared to the prior work that showed the required user scaling condition (i.e., the minimum number of MSs for guaranteeing the optimal DoF) of SNR^2M−1.

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.

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.

Background: Deficiency of alpha-1 antitrypsin (AAT1) is a rare disorder that represents a significant health threat and early diagnostic a priority issue. We investigate the usefulness of the serum protein electrophoresis (SPE) as an opportunistic screening tool for AAT1 deficiency. Methods: For 6 months, all SPE carried out for any reasons were evaluated in our center. In those with less than 3% of Alpha-1 globulins, AAT1 concentrations were studied. The SERPINA1 gene was subsequently sequenced in those subjects displaying concentrations below 100 mg/dL. Results: Out of the total, 14 patients (0.3%) were identified with low AAT1 concentrations, 11 of them agreeing to enter the study. Of those, mutations in the SERPINA1 gene were discovered in 10 subjects (91%). Heterozygous mutations were detected in 7 patients; 3 had the c.1096G>A mutation (p.Glu366Lys; Pi*Z), 2 the c.863A>T mutation (p.Glu288Val; Pi*S), one the c.221_223delTCT mutation (p.Phe76del; Pi*Malton) having the last one the c.1066G>A (p.Ala356Thr) mutation not previously described. Finally one patient had the c.863A>T mutation in homozygosis whereas two double heterozygous patients c.863A> T/ c.1096G>A were detected. Conclusions: an altered result in the concentration of AAT1 anticipates a mutation in the SERPINA1 gene in a manner close to 91%. The relationship between a decrease in the Alpha-1 globulin band of the SPE and an alteration in the AAT1 concentration is direct in basal states of health. The SPE is presented as a highly sensitive test for opportunistic screening of AAT1 deficiency.

Water mist systems (WMS) are used for evaporative cooling in public areas. The health risks associated with their colonization by opportunistic premise plumbing pathogens (OPPPs) is not well understood. To advance the understanding of the potential health risk of OPPPs in WMS, biofilm, water and bioaerosol samples (n = 90) from ten (10) WMS in Australia were collected and analyzed by culture and polymerase chain reaction (PCR) methods to detect the occurrence of 5 representative OPPPs: Legionella pneumophila, Pseudomonas aeruginosa, Mycobacterium avium, Naegleria fowleri and Acanthamoeba. P. aeruginosa (44%, n = 90) occurred more frequently in samples, followed by L. pneumophila serogroup (Sg) 2 - 14 (18%, n = 90) and L. pneumophila Sg 1 (6%, n = 90). A negative correlation between OPPP occurrence and residual free chlorine was observed except with Acanthamoeba ,rs (30) = 0.067, p > 0.05. . All detected OPPPs were positively correlated with water temperature. Biofilms contained higher concentrations of L. pneumophila Sg 2 - 14 (1000 – 3000 CFU/ml) in comparison to water samples (0-100CFU/ml). This study suggests that WMS can be colonized by OPPPs and are a potential health risk if OPPP contaminated aerosols get released into ambient atmospheres.

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.

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.

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.

Measuring the non-pathogenic Torque Teno Virus (TTV) load allows assessing the net immunosuppressive state after kidney transplantation (KTx). Currently, it is not known how exposure to maintenance immunosuppression affects TTV load. We hypothesized that TTV load is associated with the exposure to mycophenolic acid (MPA) and tacrolimus. We performed a prospective study including 54 consecutive KTx. Blood TTV load was measured by an in-house PCR at months 1 and 3. Together with doses and trough blood levels of tacrolimus and MPA, we calculate the coefficient of variability (CV), time in therapeutic range (TTR) and concentration/dose ratio (C/D) of tacrolimus, and the MPA-area under the curve (AUC-MPA) at the third month. TTV load at the first and third month discriminated those patients at risk of developing opportunistic infections between months 1 and 3 (AUC-ROC 0.723, 95%CI 0.559-0.905, p = 0.023) and between months 3 to 6 (AUC-ROC 0.778, 95%CI 0.599-0.957, p = 0.028), respectively, but not those at risk of acute rejection. TTV load did not relate to mean tacrolimus blood level, CV, TTR, C/D and AUC-MPA. To conclude, although TTV is a useful marker of net immunosuppressive status after KTx, it is not related to exposure to maintenance immunosuppression.

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 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.

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

This article introduces a novel three-phase angular perturbation technique for solving the School Bus Problem (SBP), an NP-hard combinatorial optimization challenge. The three phases—initial solution, global and local search, and solution exploration—focus on optimizing school bus routes by minimizing sharp turns and reducing travel distances. The performance of three metaheuristic algorithms (GAACOSA-AP, BFSPSO-AP, RL-AP) is evaluated, and significant improvements in routing efficiency are observed. we evaluated the performance of our hybrid algorithm against the industry-leading optimization software, CPLEX, and other optimization techniques across multiple school scenarios. The results show that the GAACOSA-AP algorithm consistently outperforms its counterparts, achieving substantial reductions in travel distances, particularly for complex routes with numerous stops. The integration of Angular Perturbation was key to improving route geometry by, reducing sharp turns, and enhancing overall path optimization by an average reduction of 27.12% compared to 22.37% without Angular Perturbation.

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.

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.

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.

This work presents a multi-start algorithm for solving the capacitated vehicle routing problem with two-dimensional loading constraints (2L-CVRP) allowing for the rotation of goods. Researches dedicated to graph theory and symmetry considered the vehicle routing problem as a classical application. This problem has complex aspects that stimulate the use of advanced algorithms and symmetry in graphs. The use of graph modeling of the 2L-CVRP problem by undirected graph allowed the high performance of the algorithm. The developed algorithm is based on metaheuristics such as the Constructive Genetic Algorithm (CGA), to construct promising initial solutions; a Tabu Search (TS), to improve the initial solutions on the routing problem; and a Large Neighborhood Search (LNS), for the loading subproblem. Although each one of these algorithms allowed to solve parts of the 2L-CVRP, the combination of these three algorithms to solve this problem was unprecedented in the scientific literature. In our approach, a parallel mechanism for checking the loading feasibility of routes was implemented using multi-threading programming to improve the performance. Additionally, memory structures, like hash-tables, were implemented to save time by storing and querying previously evaluated results for the loading feasibility of routes. For benchmarks, tests were done on well-known instances available in the literature. The results proved that the framework matched or outperformed most of the previous approaches. As the main contribution, this work brings higher quality solutions for large-size instances of the pure CVRP. This paper involves themes related to the symmetry journal, mainly complex algorithms, graphs, search strategies, complexity, graph modeling, and genetic algorithms. In addition, the paper especially focuses on topic-related aspects of special interest of the community involved in symmetry studies, such as, graph algorithms and graph theory.

Legacy IPv4 networks are strenuous to manage and operate. Network operators are in need to minimize the capital and operational expenditure of running network infrastructure. The implementation of Software-defined networking (SDN) addresses those issues by minimizing the expenditures in the long run. Legacy networks need to integrate with the SDN networks for the smooth migration towards the fully functional SDN environment. In this paper, we compare the network performance of the legacy network with the SDN network for IP routing in order to determine the feasibility of the SDN deployment in the Internet Service provider (ISP) network. The simulation of the network is performed in the Mininet test-bed and the network traffic is generated using distributed Internet traffic generator. Open network operating system is used as a controller for the SDN network in which SDN-IP application is used for IP routing. Round trip time, bandwidth, and packet transmission rate from both SDN and legacy networks are first collected and then the comparison is done. We found that SDN-IP performs better in terms of bandwidth and latency as compared to legacy routing. The experimental analysis of interoperability between SDN and legacy networks shows that SDN implementation in production level carrier-grade ISP network is viable and progressive.

Considering the great growth of IoT networks and the need for highly reliable networks and also considering the manufacturing divides of IoT equipment which are highly limited by their memory, processing power and battery; we need a highly efficient routing for guaranteeing our network's high life span. So, this paper has suggested an efficient energy routing method based on the overlapping clustering method which is inspired from the Grey theory. The Overlap clustering method means that some Things collect data that must be sent to two or more Fog nodes for processing. In the suggested method the best node is selected as the cluster head based on factors such as remaining energy, distance, link expiration time, signal power for receiving data from things by the Fog nodes. In the next step the Fog node's data are sent in a hierarchical method using a symmetrical tree of processed data to the server. Thus, the main issue here is making using a proper routing method for data sending to the Cloud that doesn't just focus on energy, but also considers other factors such as delay and network life span. The simulation results show that the HR-IoT reduces the average end to end delay more than 17.2% and 23.1%, decreases the response time more than 20.1% and 25.78% and increase packet delivery rate more than 23.1% and 28.78% and lifetime more than 25.1% and 28.78% compared to EECRP and ERGID approaches.

A single tree topology is a commonly employed topology for wireless sensor networks (WSN) to connect sensors to one or more remote gateways. However, its many-to-one traffic routing pattern imposes heavy burden on downstream nodes, as the same routes are repeatedly used for packet transfer, from one or more upstream branches. The challenge is how to choose the most optimal routing paths that minimizes energy consumption across the entire network. This paper proposes a proactive energy awareness-based many-to-one traffic routing scheme to alleviate the above said problem referred to as Energy Balance-Based Energy Hole Alleviation in tree topology (EBEHA-T). This protocol combines updated status of variations in energy consumption pattern around sink-hole zones and distribution of joint nodes among the trees. With this approach, EBEHA-T proactively prevents sink-hole formation instead of just a reactive response after they have occurred. Performance evaluation of EBEHA-T against benchmark method RaSMaLai shows increased energy saving across the entire network and a marked improvement in energy consumption balance in energy-hole zones. This precludes energy hole formation and the consequent network partitioning, leading to improved network lifetime beyond that of the RasMaLai. OMNET++ network simulation software has been used for the evaluation.

A Wireless Body Area Sensor Network (WBASN) is combination of numerous sense nodes, positioned onto/close or inside a person body. Wireless Body Area Sensor Networks (WBASN) is a developing automation trend that exploits wireless sensor nodes to put instantaneous wearable well-being of ill person to improve individual’s existence. The sensor nodes might be used outwardly to observe abundant health parameters (like heart activity, blood pressure and cholesterol) of an ill person at a vital site within hospital. Hence the goal of WBASN is much crucial, enhancing the lifetime of nodes is compulsory to sustain many issues such as utility and efficiency. It is essential to evaluate time that when the first node will die it we want to refresh or change the battery reason is that loss of crucial information is not tolerable. The lifetime is termed as the time interval when a first node dies out due to battery exhaustion. In our proposed protocol life time of a network is the main concern as well other protocol related issues such as throughput, path loss, and residual energy. Bio-sensors are used for deployment on human body. Poisson distribution and equilibrium model techniques have been used for attaining the required results. Multi-hop network topology and random network node deployment used to achieve minimum energy consumption and longer network lifetime.

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. IoT has introduced various services and daily human life depends on its reliable and accessible operation. 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 routs with separate links. One of such protocols is AOMDV routing protocol. AOMDV protocol is a multi-path protocol which uses multiple different paths for sending information in order to maintain the network traffic balance, manage and control node energy, decrease latency, etc. 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 GSTMPR-IoT is introduced which chooses the routs 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 GSTMPR-IoT method is compared to the EECRP and AOMDV approaches with regard to throughput, packet delivery rate, end to end delay, average residual energy, and network lifetime. The results demonstrate the superior performance of the proposed GSTMPR-IoT compared to the EECRP and AOMDV approaches.

Vehicle routing is a critical factor in municipal solid waste (MSW) collection planning and operations. Poor routing can introduce inefficiencies and cause targeted levels of services or performance to be missed irrespective of the level of resource application. Trial and error approaches have been proven to be not the best in the planning and prediction of expected performance. This study explores various Geographic Information System (GIS) tools and analysis techniques, and how they can be applied to optimizing vehicle routes in light of challenging site conditions. Using Adentan West residential area, suburb of Accra Ghana as a case study, current performance of the trial and error method was measured and a GIS computer model was used to evaluate various optimization scenarios to determine the level of savings that can be made. Field measurements were taking with Global Positioning System (GPS) devices for waste collection activities in areas with varying characteristics and conditions, and data analysed for one selected vehicle operating four days per week. It was found that, for a scenario where only the bin collection order was optimized while route selection was restricted by the ArcGIS Network Analyst, 2.6% of travel distance and 2.21% of travel time were saved. For the second scenario where only the route selection was optimized while order of bin collection was restricted, 4.1% and 1.5% of travel distance and time respectively were saved. For a third scenario where both the order of collection and route selection were together optimized, 10.9% and 3.7% of travel distance and time respectively were saved. Lastly, by regrouping all the bins for daily collection, 4.5% and 1.2% of travel distance and time respectively were saved. The results demonstrated that there is always room for optimization of solid waste collection routing irrespective of site constraints and other challenges that the nature of bin distribution pose to drivers. In developing countries like Ghana, where there is high demand for services in the face of limited road network access, application of GIS in optimization of routes will guide providers in planning and subsequently make more savings in fuel consumption, vehicle maintenance and cost of man-hours.

Background: Early diagnosis of postoperative complications is an urgent task, allowing timely prescribing of appropriate therapy and reducing the cost of patient treatment. Prognostic models based on various data could help in the early diagnosis of postoperative complications after cardiac surgery. Objectives: The purpose of the study was to determine whether an integrated approach based on clinical data along with metabolites and biomarkers had greater predictive value than the models built on less data. Methods: The study included patients (n=62) admitted for planned cardiac surgery (coronary artery bypass grafting with cardiopulmonary bypass), who were retrospectively divided into two groups depending on the presence (n=26) or absence (n=36) of postoperative complications of all types. Clinical and laboratory data on the first day after surgery were analyzed. Additionally, patients' blood samples were collected before and on the first day after surgery to determine biomarkers (interleukin-6, procalcitonin, NT-proBNP, high-sensitivity troponin T) and metabolites (8 aromatic and 2 dicarboxylic acids were detected using gas chromatography-mass spectrometry). Results: Patients before surgery, compared with healthy donors, differed in the concentration of metabolites (p < 0.05), and had concentrations of a number of biomarkers exceeding the corresponding reference values. Multivariate PLS-DA models, predicting the presence or absence of postoperative complications, were built using clinical data (ROC-AUC=0.71), concentrations of metabolites and biomarkers (ROC-AUC=0.60), and the entire data set (ROC-AUC=0.75). For comparison we built univariate models using the EuroScore2 (ROC-AUC=0.59) and SOFA (ROC-AUC=0.76) scales; concentrations of lactate (ROC-AUC=0.71), the dynamic changes of 4-hydroxyphenyllactic acid (ROC-AUC=0.69), and the sum of three sepsis-associated metabolites (ROC-AUC=0.70). The proposed complex model using entire data set was comparable to the SOFA scale, which confirms the expediency of searching for new predictive models based on a variety of factors.

Milk serves as a crucial source of natural bioactive compounds essential for human nutrition and health. The gastrointestinal digestion of milk proteins releases various biologically active peptides that positively impact human health and enhance physiological performance. With the growing production of cheese, Greek yogurt, and other dairy products, the volume of unutilized acid whey is significantly increasing. Acid whey, containing almost all whey proteins and approximately one-quarter of casein, presents a valuable raw material for generating peptides with potential health benefits. These peptides exhibit properties such as antioxidant, antimicrobial, anti-inflammatory, anticarcinogenic, antihypertensive, antithrombotic, opioid, mineral-binding, and growth-stimulating activities, contributing to improved human immunity and the treatment of chronic diseases. Enzymatic hydrolysis of milk proteins has been developed as a method to produce these peptides, facilitating their use in food fortification. To incorporate whey into functional beverages, it undergoes fermentation by lactic acid bacteria with proteolytic activity. To specifically enrich these beverages with peptides exhibiting targeted bioactivities, it is essential to select lactic acid bacteria strains possessing the requisite protease profiles. Additionally, the sensory properties of the final product can be enhanced using starter cultures with diverse metabolic capabilities, even in the absence of added flavoring agents. Given the imperative to develop waste-free technologies and enhance the profitability of the dairy industry, there is a growing need to efficiently utilize and transform acid whey into a broad spectrum of valuable products and food additives. This approach is justified not only by the nutritional benefits of the bioactive components in whey but also by the commercial potential of safe and health-enhancing products.

The paper focuses on the application of a multilevel, integrative and territorial approach to the protection of cultural heritage through planning instruments in Serbia. It points out the problems of the sectoral approach and discusses international recommendations that can be integrated into the planning methodology. The case study is the area of Djerdap National Park, which has an already established international and national importance. The research suggests that the cultural heritage in the area, with the exception of the Roman limes, is still recognized at the level of individual localities. The study emphasizes the importance of aligning all levels of governance to safeguard the whole spatial entity rather than focusing solely on its particular areas. The interna-tional and national importance of the planning area contributes to the strengthening of awareness of heritage and its institutional protection. However, the vitality of the area, which is key to its sustainable development, comes from the local level. Planning documents contribute to the inte-gration of local values and local communities into development programs and projects.

The impact of interaction SS with MJO on rainfall along Java Island to East Nusa Tenggara has been studied using daily rainfall observation data from 2140 weather observation stations, which are also equipped with GSMaP, OLR, and ERA5 data. There were 61 SS events found, 17 during active MJO and 44 in inactive MJO. Rainfall increases more in the western study area when the active MJO and more in the eastern study area when the inactive MJO is due to SS. SS reduces rainfall in the Jakarta region, regardless of the activity or inactivity of the MJO. SS causes extreme rainfall to only occur in a small part of certain areas, so it tends to significantly reduce the possibility of extreme rainfall. In the southern part of the IMC, SS predominates over MJO in supporting increased water vapor transport. Large-scale synoptic circulations like the monsoon, SS, and MJO can interact with local land-sea wind circulation to produce spatiotemporal variability in rainfall on Java Island. Rainfall mostly increases in the afternoon and decreases in the morning when SS occurs, whether there is MJO or not. Convective instability analysis indicates that SS increases precipitation, most likely by lowering CIN and raising VIMFC.

In order to shorten the detection time and improve the average precision on embedded devices, A lightweight and high accuracy model is proposed for passion fruit in complex environments (backlight, occlusion, overlap, sunny, cloudy, rainy). Firstly, replacing the backbone network of YOLOv5 with a lightweight GhostNet model reduces the number of parameters and computation while improving detection speed. Secondly, a new feature branch is added to the GhostNet network, and the feature fusion layer in the neck network is reconstructed to effectively combine the lower-level and higher-level features, which not only improves the accuracy of the model but also maintains its lightweight. Finally, the knowledge distillation methods are used to transfer the knowledge from the more capable teacher model to the less capable student model, which significantly improving the detection accuracy. The improved model is denoted as G-YOLO-NK. The average accuracy of the G-YOLO-NK network is 96.00%, which is 1.00% higher than the original YOLOv5s model. Furthermore, the improved model size is 7.14MB, reduced to half of the original model, and the real-time detection frame rate is 11.25 FPS on the Jetson Nano. Compared to the state-of-the-art model, the proposed model outperforms them in terms of average precision and detection performance. The present work provides an effective model for real-time detection of passion fruits in complex orchard scenes, which can provide valuable technical support for the development of orchard picking robots and greatly improve the intelligence level of orchards.

The Simultaneous Localization And Mapping (SLAM) scanner is an easy and portable Light Detection And Ranging (LiDAR) data acquisition device. Its main output is a 3D point cloud covering the scanned scene. Regarding the importance of accuracy in the survey domain, this paper aims to assess the accuracy of two SLAM scanners: the NavVis VLX and the BLK2GO Scanner. This assessment is conducted for both outdoor and indoor environments. In this context, two types of reference data are used: the Total Station (TS) and the static scanner Z+F Imager 5016. To carry out the assessment, four comparisons are tested: cloud to cloud, cloud to mesh, mesh to mesh, and edge detection board assessment. However, the results of the assessments confirm that the accuracy of indoor SLAM scanner measurements (5 mm) is greater than that of outdoor ones (between 10 mm and 60 mm). Moreover, the comparison of cloud to cloud provides the best accuracy regarding direct accuracy measurement without manipulations. Finally, based on the high accuracy, scanning speed, flexibility, and the accuracy differences between tested cases, it is confirmed that SLAM scanners are effective tools for data acquisition.

In recent years, electroencephalogram (EEG) emotion recognition has emerged as a research hotspot in the field of artificial intelligence (AI). Despite advancements in EEG-based emotion recognition, room for enhancing performance persists due to EEG signal redundancy and limitations in feature extraction, leading to inefficient models and emotional information loss. To fully utilize EEG's emotional information and improve recognition accuracy while reducing computational costs, this paper proposes a Convolutional-Recurrent Hybrid Network with a dual-stream adaptive approach and an attention mechanism (CSA-SA-CRTNN). Firstly, the model utilizes a CSAM module to assign corresponding weights to EEG channels. Then, an adaptive dual-stream convolutional-recurrent network (SA-CRNN and MHSA-CRNN) is applied to extract local spatial-temporal features. After that, the extracted local features are concatenated and fed into a temporal convolutional network with a multi-head self-attention mechanism (MHSA-TCN) to capture global information. Finally, the extracted EEG information is used for emotion classification. We conducted binary and ternary classification experiments on the DEAP dataset, achieving 99.26% and 99.15% accuracy for arousal and valence in binary classification, and 97.69% and 98.05% in ternary classification, surpassing relevant algorithms. Additionally, the model's efficiency is significantly higher than other models, achieving better accuracy with lower resource consumption.