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.

We study a two-echelon supply chain made up of a supplier and a manufacturer, both of which can reduce their component/product carbon emissions. With the vertical technology spillovers, we explore the optimal decisions of centralized and decentralized supply chains with price dependent demand and propose coordination strategy for the decentralized supply chain. Considering the cost contraction effectiveness of the technology spillovers, the centralized and decentralized game theoretic models of a two-echelon supply chain are developed to investigate optimal decisions of pricing and carbon emissions reduction. Through a systematic comparison and numerical analysis, we show that the profits of both players and the entire supply chain improve with the effect of technology spillovers increasing. Carbon emissions reduction will be taken by various protective measures so that the supplier and the manufacturer who do not innovate can hardly share the results of innovating via the “free-riding” methods when the technology spillover is relatively small. We also propose a revenue-cost sharing contract through bargaining to enhance the performance of the decentralized supply chain.

The combination of e-commerce and the green economy allows enterprises to distribute their green products directly to consumers through Internet channels. This paper investigates the impact of service spillovers on emission reduction and channel decisions in a two-echelon supply chain,in which the supplier is a Stackelberg leader and the retailer is a follower.By comparing the equilibrium outcomes of the single-channel and dual-channel supply chain in a setting with and without retail services, we observe that the supplier prefers to encroach on the market when services that retail locations provide largely spillover to and benefit the direct sales channel. Contrary to popular belief, a higher degree of service spillovers is beneficial for the retailer to get more returns under the dual-channel structure, whereas supplier encroachment will lead to a decline in the service level if the spillover degree is relatively low. In addition, the emission reduction level of products under supplier encroachment is always higher than that employed in the single-channel structure if consumers have both low-carbon preference and high degree of service sensitivity. Furthermore, we extend the equilibrium decisions under a carbon cap-and-trade (CCT) mechanism; the results fully verify the above conclusions. Interestingly, the implementation of a carbon price not only motivates carbon emission abatement and supplier encroachment, but also helps achieve a win-win outcome for supply chain members when service spillovers happen.

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.

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.

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.

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.

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.

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.

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.

This paper concentrates on the general birth-death processes with two different types of catastrophes. The Laplace transform of transition probability function for birth-death processes with two-type catastrophes are is successfully expressed with the Laplace transform of transition probability function of the birth-death processes without catastrophe. The first effective catastrophe occurrence time is considered. The Laplace transform of its probability density function, expectation and variance are obtained.

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.

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.

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 fast decoding of low-density parity-check (LDPC) is crucial for its future applications. In this paper, we propose to use Early Termination (ET) and Force Convergence (FC) techniques to accelerate the decoding of two new local/global two-phases decoding algorithms to reduce the Globally Coupled (GC) LDPC codes. Specifically, ET is applied in the local decoding phase of two- phases decoding of GC-LDPC codes to skip the local decoding which is highly likely to fail and avoid the unnecessary iterations. FC is applied in global decoding phase where converged variable nodes are identified and removed from Tanner graph and the decoding can be speed up shrinking parity check matrices. Two variants are proposed for the ET operation in local decoding phase. ET-1 merely stops iteration if it meets the stopping criterion while in ET-1, the iteration number saved in local decoding is added up in global decoding to improve the decoding performance. The simulation results show that the ET-1-FC scheme can save up to 42% decoding time complexity in the low SNR region while keeping the error rate performance nearly unchanged, the ET-2-FC can improve the error rate performance by 0.18dB at bit error rate 0.001 or 0.23dB at frame error rate 0.1. In the waterfalling region of BER/FER curves, both schemes can save about 25% decoding time complexity.

A PLS-based quality prediction method is proposed for batch processes using two-dimensional extended windows. To realize the adoption of information in the direction of sampling time and batch, a new definition region of support (ROS), k-i-back-extended region of support (KIBROS), is proposed to establish the extended window, which including the data of the previous sampling times in the same batch, the data of the same sampling time in the historical batches, the data of the previous sampling times in the historical batches and the data of the later sampling times in the historical batches. According to these regions of support, extended windows are established, and different models are proposed based on the extended windows for batch processes quality prediction. Further, using a typical batch process as an example, the injection molding process, the proposed quality prediction method is experimentally verified, proving that the proposed methods have higher prediction accuracy than the traditional method and the prediction stability is also improved.

Mushroom cultivation vastly improves the yield of mushrooms under optimized, controlled conditions, but may be susceptible to opportunistic colonization by pest species that can establish themselves, as well as the pathogens and pests they may transmit. Here we describe our investigation into the bacterial communities of adult Lycoriella ingenua (Diptera: Sciaridae) and Megaselia halterata (Diptera: Phoridae) collected from button mushroom (Agaricus bisporus) production houses in Pennsylvania. We collected adult flies and sequenced the hypervariable v4 region of the bacterial 16S rRNA using the Illumina MiSeq. The most abundant bacterial genus detected in both species was Wolbachia, but phylogenetic analysis revealed that the infections are from different clades. Future studies include the characterization of Wolbachia infections on fly behavior and biology, comparison of microbial diversity of fly species colonizing wild mushrooms, and other microbiota that may contribute to the success of certain pest fly species.

We propose and experimentally realize a scheme of the optical nonreciprocity (ONR) using degenerate two-level atoms embedded in an optical ring cavity. For the degenerate transition Fg=4→Fe=3, we first study the cavity-transmission property in different coupling field, and verify that within the strong-coupling regime, the single-dark-state peak formed by electromagnetically induced transparency (EIT) shows ONR. Qualitative theoretical analysis shows that the stable ground-state Zeeman coherence is necessary for intracavity EIT. However, due to the frequency degeneracy, the large Rabi frequency of counter-propagating coupling field can reduce the number of effective atoms and weaken the strong-coupling of the atom-cavity, which determines that ONR based on intracavity EIT occurs only at weaker probe intensity. Furthermore, the ONR transmission with high contrast, linewidth-narrowed and broadband is experimentally demonstrated.

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

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

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

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

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

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

In wheeled vehicles, there exists a challenge concerning the alignment of the front wheels during turns. When both wheels are turned to the same extent, the inner wheel experiences lateral slippage on the road surface, resulting in reduced steering efficiency. Such problems can be solved by using the Ackermann principle. There are two approaches: through the steering mechanism or by employing autonomous wheel control. From a technical standpoint, it is achievable to synthesize a steering mechanism that fulfills the Ackermann condition, ensuring as accurately as possible for any given turning radius. This research paper focuses on synthesizing a steering mechanism, specifically a two-circuit linkage that links the left and right wheels. The structure and kinematics of this mechanism are being investigated. Following the principles of Ackermann, an objective function for the kinematic synthesis of the mechanism has been formulated. The synthesis process of the mechanism is conducted using the analytical method of interpolation in four parameters. A dedicated method has been developed, and kinematic analysis of the mechanism using the synthesized parameters has been performed. The simulation results have demonstrated high accuracy in achieving the desired implementation of the Ackermann condition.

Bacteriophages (phages) are potential alternatives to chemical antimicrobials against pathogens of public health significance. Understanding the diversity and host specificity of phages is important for developing effective phage biocontrol approaches. Here, we assessed the host range, morphology, and genetic diversity of eight Salmonella enterica phages isolated from a wastewater treatment plant. The host range analysis revealed that six out of eight phages lysed more than 81% of the 43 Salmonella enterica isolates tested. The genomic sequences of all phages were determined. Whole genome sequencing data (WGS) data revealed that phage genome sizes ranged from 41 to 114 kb with GC contents be-tween 39.9 and 50.0 %. Two of the phages SB13 and SB28 represent new species Epsep-timavirus SB13 and genera Macdonaldcampvirus, respectively as designated by the In-ternational Committee for the Taxonomy of Viruses (ICTV) as per genome based taxonomic classification. One phage (SB18) belonged to the Myoviridae morphotype while the re-maining phages belonged to the Siphoviridae morphotype. The gene content analyses showed that none of the phages possessed virulence, toxin, antibiotic resistance, type I-VI toxin-antitoxin modules or lysogeny genes. Three (SB3, SB15 and SB18) out of the eight phages possessed tailspike proteins. Whole genome-based phylogeny of the eight phages with their 113 homologs revealed three clusters A, B, C and seven subclusters (A1, A2, A3, B1, B2, C1 and C2). While cluster C1 phages were predominantly isolated from animal sources, cluster B contained phages from both wastewater and animal sources. The broad host range of these phages highlights their potential use to control the presence of S. enterica in foods.

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

This article provides a literature review on tubal carcinoma to offer an updated insight into its preventative strategies, diagnosis, treatment, and oncological surveillance. In addition to the search string utilized, the authors' focus extended to key scientific studies, consensus statements, guidelines, and relevant case reports essential for the proper clinical management of the disease, providing a methodologically well-structured literature review combined with the practical expertise in the oncological field. The article also includes two emblematic clinical cases that emphasize the importance of understanding the physiopathology and the current state of the art in the anatomopathological advancements of tubal/ovarian/peritoneal carcinoma, often assimilated into a single clinical entity.

Spray penetration into citrus canopies is critical for adequate coverage and deposition to ensure effective pest control. However, mismatch of air assistance to target canopy characteristics can lead to unintended spray loss through over penetration. To evaluate the effect of air assistance on on-target deposition, two sprayers (surrogates for airflow rates) were used to apply a fluorescent tracer dye solution @ target concentration of 300 ppm to 16 medium foliage density tree blocks in a commercial mandarin orchard. The complete factorial experiment in three replications comprised two ground speeds (1.6 and 4.8 km/h), two disc-core nozzles (TeeJet® D3-25 and D6-45), and either one or two nozzle rows to obtain a wide range of application rates (496 to 9,719 L/ha). Dye deposition significantly decreased with canopy depth (p=<0.001) by nearly 7 times across the 3.4-m-wide canopies but was not significant over 1.2 to 2.2 m sampling height (p=0.867). Deposition obtained with the low airflow rate sprayer was significantly greater (p=<0.001) than that obtained with the high airflow rate sprayer over the dose range likely due to too much air pushing out spray droplets. This study underscores the importance of matching the air assistance of orchard sprayers to the target canopy.

The production of recombinant proteins in Escherichia coli is often challenged by cytoplasmic expression due to proteolytic degradation and inclusion body formation. Extracellular expression can overcome these problems by simplifying downstream processing and improving protein yields. This study aims to compare the efficiency of two Bacillus subtilis chitosanase signal peptides in mediating extracellular secretion in E. coli. We identified a naturally occurring mutant signal peptide (mCsn2-SP) from B. subtilis CH2 chitosanase (CH2CSN), which is characterized by a deletion of six amino acids in the N-region relative to the signal peptide (Csn1-SP) from B. subtilis CH1 chitosanase (CH1CSN). The CH1CSN and CH2CSN genes were cloned into the pET-11a vector and protein secretion was evaluated in E. coli BL21(DE3) host cells. Expression was induced with 0.1 mM and 1 mM IPTG at 30°C for one and three days. CH2CSN showed higher secretion levels compared to CH1CSN under all experimental conditions, especially with 0.1 mM IPTG induction for 3 days, which resulted in a 2.37-fold increase in secretion. These results suggest that signal peptide deletion variants may have an effect on protein secretion efficiency and help to further understand the function of signal peptides.

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.

The African continent has the highest prevalence of hypertension globally, with South Africa reporting the highest prevalence in Southern Africa. While the influence of genetic variability in the pathogenesis of hypertension is well described internationally, limited reports are available for African populations. This study aimed to assess the association of genetic variants and essential hypertension in a cohort of two ethnic South African population groups. Two hundred and seventy-seven hypertensive and one hundred and seventy-six normotensive individuals were genotyped for 79 variants. Genotyping was performed using the Illumina GoldenGate Assay and allele-specific polymerase chain reaction. The association of variants was assessed using the Fisher Exact test under the additive and allelic genetic models, while multivariate logistic regression was used to predict the development of hypertension. Five variants (CYP11B2 rs179998, AGT rs5051 and rs699, AGTR1 rs5186 and ACE rs4646994) were significantly associated with essential hypertension in the cohort under study. Furthermore, AGTR1 rs5186 and AGT rs699 were identified as risk factors for the development of hypertension in both ethnic groups. In two ethnic South African populations an association was observed between Renin-Angiotensin-Aldosterone System (RAAS) related genes and the development of hypertension.

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.

Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assisted. It is especially relevant for sensor nodes location in UWSNs. Global Positioning System (GPS) is not suitable for using in UWSNs because of the underwater propagation problems. Hence some localization algorithms based on the precise time synchronization between sensor nodes have been proposed which are not feasible for UWSNs. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme base on the Particle Swarm Optimization (PSO) algorithm to decrease the localization error. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence in this algorithm, we use a small number of mobile beacons to help achieve location without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization.

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.

Polycyclic polyprenylated acylphloroglucinols (PPAPs) comprise a large group of compounds of mostly plant origin. The best-known compound is hyperforin from St. John's wort with its antidepressant, antitumor and antimicrobial properties. Chemical synthesis of PPAP variants allows the generation of compounds with improved activity and compatibility. Here we studied two synthetic PPAP-derivatives, PPAP 23 and PPAP 53, as to their antimicrobial activity. While PPAP 23 is insoluble in water, PPAP 53, the sodium salt, is water-soluble. In vitro, both compounds exhibited good and comparable activity against methicillin-resistant Staphylococcus aureus (MRSA) and vancomycin-resistant Enterococcus faecium. Both compounds had no adverse effects on Galleria mellonella wax moth larvae, even at high concentrations. However, they were unable to protect the larvae from infection with S. aureus because components of the larval coelom neutralized the antimicrobial activity; a similar neutralizing effect was also seen with serum albumin. In a septic arthritis model triggered by S. aureus PPAP23 decreased the formation of abscesses and bacterial load in kidneys, and in a mouse skin abscess model topical treatment with PPAP 53 resulted in an approximately two-fold reduction in S. aureus counts. PPAP 23 and PPAP 53 also showed high growth inhibiting activity against anaerobic Gram-positive pathogenic gut bacteria such as Clostridium perfringens and Clostridium difficile. Based on these results, we envision potential application of PPAP 23 and PPAP 53 in the topical treatment of wound infections with Gram+ pathogens, and their oral use in intestinal infections with C. difficile.

The advancement in science and technology has led to luffa sponge (LS) being widely used as a natural material in industrial application as its polyporous structure and light texture. In order to enhance the utility of LS fibers as the reinforcement of lightweight composite materials, this study investigate its water absorption, mechanical properties, anatomical characteristic and thermal performance. Hence, moisture regain, tensile properties of LS fiber bundles were measured in accordance with standards and the structural characteristics were investigated via microscopic observation. Scanning electron microscopy (SEM) was used to observe the surface morphology and fracture surface of fiber bundles. Test results shows that the special structure where the phloem tissues degenerate to cavities had a significant influence on the mechanical properties of LS fiber bundles. Additionally, the transverse sectional area occupied by fibers in a fiber bundle (SF), wall thickness and ratio of wall to lumen of fiber cell, and crystallinity of cellulose had an impact on the mechanical properties of LS fiber bundles. Furthermore, the fiber bundles density of LS varies range of 385.46-468.70 kg/m³, much less than that of jute (1360.40 kg/m³) and Arenga engleri (950.20 kg/m³) while LS fiber bundles has superior specific modulus.

Unmanned aerial vehicles (UAVs) have increasingly become integral to multi-access edge computing (MEC) due to their flexibility and cost-effectiveness, especially in the B5G and 6G eras. This paper aims to enhance the Quality of Experience (QoE) in large-scale UAV-MEC networks by minimizing the shrinkage ratio through optimal decision-making in computation mode selection for each user device (UD), UAV flight trajectory, bandwidth allocation, and computing resource allocation at edge servers. However, the interdependencies among UAV trajectory, binary task offloading mode, and computing/network resource allocation across numerous IoT nodes pose significant challenges. To address these challenges, we formulate the shrinkage ratio minimization problem as a mixed-integer nonlinear programming (MINLP) problem and propose a two-tier optimization strategy. To reduce the scale of the optimization problem, we first design a low-complexity UAV partition coverage algorithm based on the Welzl method and determine the UAV flight trajectory by solving a Traveling Salesman Problem (TSP). Subsequently, we develop a coordinate descent (CD) based method and an alternating direction method of multipliers (ADMM) based method for network bandwidth and computing resource allocation in the MEC system. The CD-based method is simple to implement and has a low computational complexity, while the ADMM-based method can further enhance the optimization result through joint optimization. Extensive simulations demonstrate that our proposed algorithms perform well in large-scale edge networks and outperform other representative benchmark methods.

In this paper, a semi-empirical model of air waves induced by falling rock is described. The model is composed of a uniform motion phase (velocity close to 0 m·s^-1) and an acceleration movement phase. The uniform motion phase was determined based on experimentally and the acceleration movement phase was derived by theoretical analysis. A series of experiments were performed to verify the semi-empirical model and elucidated the law of the uniform motion phase. The acceleration movement phase accounted for a larger portion with a greater height of the falling rock. Experimental results of different falling heights of the goaf showed close agreement with theoretical analysis values. The semi-empirical model could accurately and conveniently estimate the velocity of air wave induced by falling rock. Thus, the semi-empirical model can provide a reference and basis for estimating the speed of air waves and designing protective measures in mines.

Using the example of a generator model with dedicated inertia, a theoretical study of two coupled self-oscillators with capacitive coupling, their sequential single-frequency synchronization, chaos and two-frequency synchronization with an adiabatic change in the magnitude of the coupling between partial self-oscillators was carried out. The parameters of self-oscillators and the values of the coupling coefficient at which the specified operating modes of coupled self-oscillators exist are determined. The results of numerical studies, illustrating the conditions for excitation of single-frequency, chaotic and dual-frequency oscillations in a system of coupled self-oscillators are presented.

In this paper, we investigated the formation isolation regulation issue regarding multiple autonomous underwater vehicles (AUVs) characterized by a "leader-follower" framework. Considering the cooperative-competitive relationship among the follower AUVs and the impact of unknown external disturbances, an extended state observer was designed based on backstepping to mitigate these disturbances, and an event-triggered control scheme was designed to realize the two-part consensus control within the multi-AUV system. Through rigorous theoretical analysis, it is shown that the system achieves asymptotic steadiness and is free from zeno behavior under the proposed event-triggered control scheme. Finally, numerical simulations confirm the efficiency of the regulation strategy in achieving formation separation within the multi-AUV, where the trajectory tracking errors of individual AUVs gather in a compact vicinity close to the source and the structure converges was achieved, with the absence of zeno behavior also demonstrated.

Saikosaponin (SS) a is a compound with various pharmacological properties and easily degraded into SSb1 and SSg in acid condition. In present work another two new degradation products of SSa formed under acid hydrolytic condition were detected and isolated by analytical and semi-preparative liquid chromatography technology, furthermore their structures were characterized as hydroxyl-saikosaponin a and SSb2 by spectral analysis, which is not only essential in stability-indicating method development and validation but also could be used as a worst case to assess the analytical method performance of SSa. Moreover their structural transformation pathways were also proposed.

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

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

Aim: To evaluate the panmacular subthreshold micropulse laser treatment results among patients with central serous chorioretinopathy (CSC) and their correlation with functional and morphological parameters. Material and methods: The examined group included 10 non-treated and 41 treated patients with acute, recurrent, and chronic CSC (13 F, 38 M, mean age 44.11±6.5) and 14 healthy controls (6 F, 8 M, mean age 45±9.3). The BCVA examination, ophthalmoscopy, microp-erimetry, angio-OCT and OCT were performed. The medical history regarding chronic general disorders and known risk factors were recorded. Results: Complete resorption of SRF was obtained in 100% aCSC, 86.66% cCSC, and 63.63% r CSC. BCVA and RetSens significantly improved most of the patients treated in aCSC. The lowest BCVA and RetSens, but the largest pachyvessel and disease duration, were found in rCSC. A strong negative correlation between final BCVA and disease duration was found. No patient demonstrated laser lesions following treatment. Conclusions: The panmacular MPLT therapy leads to long-term enhancement of functional and morphological parameters in all CSC patients. The acute CSC patients showed the most significant improvement. The procedure is safe and could be considered a preferred treatment option for all active CSC cases. Timely treatment is crucial for beneficial outcomes.

In this paper, the synthesis of two novel luminescent Eu3+ ion complexes [Eu(TFT)3(phen) (1) and Eu(TFT)3(bpy)•Hex (2)] based on the combination of 2-(2,2,2-trifluoroethyl)-1-tetralone (TFT), containing n-donor ligands (1,10-phenanthroline or 2,2'-Bipyridine) and Eu3+ ion is reported herein, and their structural features are discussed on the basis of X-ray crystallographic and thermal analyses. We observed that the ligands transfer energy effectively to the metal center by fluorescence, IR and UV spectrograms studies. The structures and properties of complexes 1-2 were optimized by the DFT theoretical calculation, and the calculation results were consistent with the experimental X-ray structure data and spectral analysis.

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.

Background and Objectives Neurofibromatosis 1 (NF1 MIM # 162200), also known as von Recklinghausen disease, is among the most common autosomal dominantly transmitted disorders characterized mainly by neurocutaneous manifestations such as café au lait spots, intertriginous freckling, various types of neurofibromas (cutaneous neurofibromas or plexiform tumors), neurological manifestations, and bone abnormalities. It occurs with an incidence of 1:3000–1:4000 cases. Cone-rod dystrophies belong to the large group of retinal dystrophies, a highly heterogeneous group of disorders clinically manifested mainly by damage to cone and rod cells and have a broad spectrum of clinical manifestations. Many genes are involved in their etiology, with more than 100 currently identified, including the CRX gene responsible for the autosomal dominant form of cone-rod dystrophy (ad CORD). Materials and Methods: The authors present an intriguing case of a patient diagnosed with Neurofibromatosis type 1 (NF1) as an infant and ocular involvement (myopia and astigmatism onset at age 15), which yielded a surprising molecular testing result. Results: Molecular DNA analysis identified a rare occurrence of two mutational variants, including a pathogenic variant in the NF1 gene, c.3871-2A, and a likely pathogenic variant in the CRX gene c.119G>A. Conclusions: The authors present this case to highlight the surprises offered by molecular testing in a condition where the diagnosis is usually based on clinical criteria, thus providing patients with competent genetic advice.

Utilizing groundwater offers a promising solution to alleviate water stress in Ethiopia, providing a dependable and sustainable water source, particularly in regions with limited or unreliable surface water availability. However, effective decision-making regarding well drilling and placement is essential to maximize groundwater resource potential, enhancing agricultural productivity, reducing hunger, and bolstering food security in Ethiopia. This study concentrates on the development of two-stage stochastic mixed integer programming (SMIP) models to optimize well placement for sustainable agricultural irrigation, considering uncertain demand scenarios. Additionally, a deterministic mixed integer programming model is formulated for comparison with the two-stage SMIP. Experiments are conducted to explore various demand scenario distributions, revealing that the optimized total cost for the two-stage SMIP generally exceeds that of a deterministic setting, aligning with the two-stage SMIP's focus on long-term benefits. Moreover, slight differences are observed in well layouts under different assumption scenarios. The study also examines the impact of selected parameters, such as fixed construction costs, per-meter drilling costs, and demand scenarios. The out-of-sample performance shows that the stochastic model is more flexible and resilient, with 11% and 4% lower costs than deterministic cases 1 and 3, respectively. This flexibility provides a more robust long-term strategy for well placement and resource allocation in groundwater management.

During choriogenesis in insects, chorion (eggshell) is formed by surrounding follicular epithelial cells in ovarioles. However, the regulatory endocrine factor(s) activating choriogenesis and the chemical components on eggshell deserve further exploration. In two representative Coleopterans, a Coccinellid Henosepilachna vigintioctopunctata and a Chrysomelid Leptinotarsa decemlineata, genes encoding the 20-hydroxyecdysone (20E) receptor heterodimer, ecdysone receptor (EcR) and ultraspiracle (USP), and two chitin biosynthesis enzymes UDP-N-acetylglucosamine pyrophosphorylase (UAP) and chitin synthase (ChS1), were highly expressed in ovaries of the young females. RNA interference (RNAi)-aided knockdown of either HvEcR or Hvusp in H. vigintioctopunctata inhibited oviposition, suppressed the expression of HvChS1, and lessened the positive signal of Calcofluor staining on the chorions, which suggests the reduction of a chitin-like substance (CLS) deposited on eggshells. Similarly, RNAi of LdEcR or Ldusp in L. decemlineata constrained oviposition, decreased the expression of LdUAP1 and LdChS1, and declined CLS contents in the resultant ovaries. Knockdown of LdUAP1 or LdChS1 caused similar defective phenotypes, i.e., reduced oviposition and CLS contents in the L. decemlineata ovaries. These results, for the first time, indicate that 20E signaling activates choriogenesis in two Coleopteran species. Moreover, our findings propose the deposition of a CLS on the chorions.

Semi-continuous data are very common in the social science and economics. In this paper, a Bayesian variable selection procedure is developed to assess the influence of exogenous factors including observed and unobserved on the semi-continuous data. Our formulation is based on the two-part latent variable model with polytomous response. We consider two schemes for the penalties of regression coefficients and factor loadings: the Bayesian spike and slab bimodal prior and the Bayesian lasso prior. Within the Bayesian framework, we implement Markov Chains Monte Carlo sampling method to conduct posterior inference. To facilitate posterior sampling, we recast the logistic model in part one as the norm-like mixture model. Gibbs sampler is designed to draw observations from the posterior. Our empirical results show that with suitable hyper-parameters, the spike and slab bimodal method slightly outperforms the Bayesian lasso in the current analysis. Finally, a real example related to the China household finance survey is analyzed to illustrate the application of the methodology.. .

Fluorescence microscopic images of cells contain a large number of morphological features that are used as an unbiased source of quantitative information about cell status, through which researchers can extract quantitative information about cells and study the biological phenomena of cells through statistical and analytical analysis. As an important research object of phenotypic analysis, images have a great influence on the research results. Saturation artifacts present in the image result in a loss of grayscale information that does not reveal the true value of fluorescence intensity. From the perspective of data post-processing, we propose a two-stage cell image recovery model based on generative adversarial network to solve the problem of phenotypic feature loss caused by saturation artifacts. The model is capable of restoring large areas of missing phenotypic features. In the experiment, we adopt the strategy of progressive restore to improve the robustness of the training effect, and add the contextual attention structure to enhance the stability of the restore effect. We hope to use deep learning methods to mitigate the effects of saturation artifacts to reveal how chemical, genetic, and environmental factors affect cell state, providing an effective tool for studying the field of biological variability and improving image quality in analysis.

In Mexico viticulture represents the second source of employment in the agricultural area after the fruit and vegetable sector. In developed countries, remote sensing is widely used for vineyard monitoring, however, this tool is barely used in developing countries of Iberoamerica. In this re-search, our overall objective is to characterize two vineyards in the state of Queretaro (Mexico) using Sentinel-2 and meteorological data, specifically spectral and thermal indices. Results showed that spectral indices obtained from Sentinel-2 bands have characterized adequately the phenolog-ical evolution of the different varieties of the vineyards. The Modified Soil-Adjusted Vegetation Index (MSAVI) was adequately used to discriminate the first stages of vineyards, while the Nor-malized Difference Vegetation Index (NDVI) was useful to monitor vineyards during the rest stages of vineyards. Thermal indices have shown that the best grape varieties were those that can adapt to both cooler and warmer temperatures, have a reasonable ripening period, and can produce wines with balanced acidity and flavors. In conclusion, the combination of meteorological (including thermal indices) and remote sensing data (NDVI and MSAVI) provide information for choosing the suitable grape variety for this region.

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.

ABSTRACT Background: To date, the COVID-19 pandemic has been the foremost health concern for humankind in the new millennia. This paper aims to describe the related hospitalizations in Italy during the first two years of the health emergency. Design and methods: This is a retrospective, population-based study of Italian hospitalizations for patients diagnosed with COVID-19 during the 2020-2021 period, extracted from the National Hospital Discharge Registry. The outcome variables considered include hospital admissions, costs, and length of stay, among other hospitalization-level variables. Costs were estimated through the charges associated with the Diagnosis-Related Group and Major Diagnostic Categories coding system, plus an additional cost attributed to COVID-19 admissions. To these charges was added an extra cost defined by the ministry of health. Results: In Italy, there were 357,354 hospitalizations for COVID-19 attributed to 298,856 patients in 2020 and 399,043 hospitalizations for COVID-19 attributed to 333,447 patients in 2021. COVID-19 patients faced a transfer rate thrice that of other patients. Hospitalizations were concentrated predominantly in the northern regions, particularly in the first year. Hospitalization rates varied by age in a sine wave pattern, peaking in the youngest and oldest age groups, with mortality rates escalating with age— tending to remain below 3% for those under 44 but surging to 40% in individuals over 75. The financial impact of COVID-19 hospitalizations was substantial, with total costs reaching €3.97 billion in 2020 and €4.99 billion in 2021. Costs per admission and per day also rose, from €11,112 and €807 in 2020 to €12,503 and €844 in 2021, respectively. Excluding the added financial burden of COVID-19, costs would have been notably lower. Hospitalizations involving continuous invasive mechanical ventilation were particularly costly (about 24.000 euros x admission), reflecting the significant resources required for these treatments. Conclusion: Implementing a protective pad around the entire health system that leverages networks of family doctors and nurses, connected in real time to the entire health system, can be crucial. Such a network, tasked with monitoring the local epidemiological situation, protecting vulnerable individuals also through telehealth visits, and establishing a triage system for infections in the initial phase, may effectively help in managing virus spread and protecting hospitals from unpredictable waves of admission demand. Strengthening primary health care could be a decisive factor for the future and enhance the system's resilience in facing new challenges.

This paper proposes two max-pooling engines, named the RTB-MAXP engine and the CMB-MAXP engine, with a scalable window size parameter for FPGA-based convolutional neural network (CNN) implementation. The max-pooling operation for the CNN can be decomposed into two stages, i.e., a horizontal axis max-pooling operation and a vertical axis max-pooling operation. These two one-dimensional max-pooling operations are performed by tracking the rank of the values within the window in the RTB-MAXP engine and cascading the maximum operations of the values in CMB-MAXP engine. Both the RBM-MAXP engine and the CMB-MAXP engine were implemented using VHSIC Hardware Description Language (VHDL) and verified by simulations. They have been employed for and tested in our CNN accelerator targeting at the CNN model YOLOv4-CSP-S-Leaky for object detection.

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.

PET imaging of bacterial infection could potentially provide added benefit for patient care by non-invasive means. [68Ga]Ga-desferrioxamine B – a radiolabelled siderophore – shows specific uptake by human-pathogenic bacteria like Staphylococcus aureus or Pseudomonas aeruginosa as well as sufficient serum stability for clinical application. Here, we provide data for automated production of [68Ga]Ga-desferrioxamine B on two different cassette based synthesis modules (Modular-Lab PharmTracer and GRP 3V) using commercially available cassettes together with an approved 68Ge/68Ga radionuclide generator. Quality control including determination of radiochemical purity as well as a system suitability test was set up via RP-HPLC on a C18 column. The two described production processes, using an acetic acid/acetate buffer system with ascorbic acid as a radiation scavenger for radiolabelling, yield ready-to-use formulations with sufficient activity yield. Batch data showed radiochemical purity of >95 % as determined by RP-HPLC and ITLC as well as excellent stability over 2 hours post production. Specifications for routine production were set up and validated with four master batches for each synthesis module. Based on this study, an academic clinical trial for imaging of bacterial infection was initiated. Both described synthesis methods enable reproducible, automated in-house production of [68Ga]Ga-desferrioxamine B for clinical application.

This paper proposed three-dimensional numerical simulation method by coupling of electrostatic and fluid fields to evaluating the performance of electrical sensor in the concentration measurement of gas/solid two-phase flow. Compared with the static numerical simulation, this real-time dynamic 3-D simulation method can research on a designed capacitance sensor combining the dynamic characteristics of the two-phase flows for concentration measurement. Several fluid-electrostatic models of transmission pipes with different sensor structures are built. Under different test positions and different particle concentrations, the flow characteristics and the corresponding electric signals can be obtained, and the correlation coefficient between the concentration values and the capacitance values are used for performance evaluation of the sensors. The effects of flow regimes on concentration measurement are also been investigated in this paper. To validate the results of simulation, an experimental platform with horizontal straight pipe for phase volume concentration measurement of solid/air two-phase flow is built, and the experimental results agree well with simulation conclusions. The simulation and test results show that the coupling models can give constructive reference opinions for the sensor design and collection of installation position in different transmission pipelines, which are very important for the practical process of pneumatic conveying system.

In this study, we seek to analyze and numerically evaluate a plasmonic sensor. To form the sensor structure, we use several amplifiers, such as two rings attached to each other and a cavity, as well as two metal insulating metal waveguides (MIM). At the beginning of this simulation, we must examine the resonant wavelengths and the refractive index of the resonators using the finite difference time domain method. By changing the refractive index and changing the dimensions of the cavity and the rims, we seek to investigate the sensor performance and the conduction characteristics of the plasmonics and to obtain the effect of these parameters. To evaluate the sensor performance, we calculate the three factors of sensitivity coefficient S, quality factor Q and figure of merit (FOM), here we reach the sensitivity of 987.6 nm / RIU. Such a plasmonic sensor with a simple framework and high optical resolution can be very useful for sensor systems on optical circuits.

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.

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.

Lung neuroendocrine tumors (LNETs) and gastroenteropancreatic neuroendocrine tumors (GEPNETs) are two distinct types of neuroendocrine tumors (NETs) that have traditionally been treated as a single entity despite originating from different sources. Although they share certain phenotypic characteristics and the expression of neuroendocrine markers, they exhibit differences in their microenvironment, molecular mutations, and responses to various therapeutic regimens. Recent research has explored the genetic alterations in these tumors, revealing dissimilarities in the frequently mutated genes, role of EGFR in carcinogenesis, presence of transcription factors, and immunogenicity of the tumor and its microenvironment. Spread Through Air Spaces (STAS), a phenomenon unique to lung carcinomas, appears to play a crucial role in LNET prognosis. These distinctions are also evident in the cascade response of lung and GI tract neuroendocrine tumors to somatostatin analogs, Peptide Receptor Radionuclide Therapy (PRRT), chemotherapy, and immunotherapy. Identifying similarities and differences between the two groups may im-prove our understanding of the underlying mechanisms and facilitate the development of more effective treatment strategies.

We study the electron tunneling (ET) and local Andreev reflection (AR) processes in a quantum dot (QD) coupled to the left and right ferromagnetic leads with noncollinear ferromagnetisms. In particular, we consider that the QD is also side-coupled to a nanowire hosting Majorana bound states (MBSs) at its ends. Our results show that when one mode of the MBSs is coupled simultaneously to both spin-up and spin-down electrons on the QD, the height of the central peak is quite different from that if the MBS is coupled to only one spin component electrons. The ET and AR conductances which are mediated by the dot-MBS hybridization strongly depend on the angle between the left and right magnetic moments in the leads, which result in sign change of the angle-dependent tunnel magnetic resistance. This result is very different from case when the QD is coupled to regular fermonic mode, and can be used for detecting the existence of MBSs, a current challenge in condensed matter physics under extensive investigations.

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.

Coastal environments are complex systems that are influenced by a combination of natural processes and human activities. Scientific interest in the effects of coastal erosion/accretion and climatic change-related processes greatly increased in recent decades due to the growing human development along coastal areas. This paper investigates the state and evolution of beach-dune systems for the 1977-2001 and 2001-2019 periods of the Mediterranean coast of Andalusia (Spain) using two different proxies: the dune toe line, which was used to track foredunes evolution, and the high-water line, which was used to assess shoreline evolution. Results showed a general erosional behavior of the studied beach-dune systems and identified cases where the main trend was altered through human interventions. In the 1977-2001 period, 54% of foredunes showed erosion, 24% accretion and 22% stability while and 34% of shorelines showed erosion, 40% accretion and 34% stability. In the 2001-2019 period, 42% of foredunes showed erosion, 28% accretion and 30% stability, and 40% of shorelines showed erosion, 34% accretion and 26% stability. Combining the evolution classes of each proxy (dune toe/shoreline) allows the behavior of both shoreline proxies to be assed together and provides insights additional to those derive from the use of a single proxy. In this regard, Erosion/Erosion (EE) was the most frequent behavior, with 25% and 27% in the first and second periods respectively, and Accretion/Accretion (AA), with 17% in both periods. Erosion of foredunes combined with stability or accretion of the shoreline (ES and EA) were the most common pairings in the first period, while stability of dunes combined with accretion of the shoreline (SA) and Stability/Stability (SS) dominated in the second period. The results obtained provide additional insights on the nature and drivers of coastal change that aid local coastal managers and administrations in understanding erosion processes. The method can be applied at other areas around the world where a similar data base is available.

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

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

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

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

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

Purpose: Investigation for the co-occurrence of two unrelated genetic disorders of muscular dystrophy and Prader-Willi syndrome (PWS) (OMIM # 176270) using joint whole genome sequencing (WGS). Methods: Trio WGS joint analysis was performed to investigate the genetic etiology in a proband with PWS, prolonged muscular hypotonia associated hyperCKemia, and early-onset obesity. The parents were unaffected. Results: Results showed maternal isodisomy uniparental disomy (UPD) in chromosome 15 expanding from 15q11.2 to 15q22.2, including PWS regions at 15q11.2-15q13. Maternal heterodisomy was detected from 15q22.2 to 15q26.3. A pathogenic variant, NM_000070.3(CAPN3):c.550del (p.Thr184fs), was identified at 15q15.1 in a heterozygous state in the mother that was homozygous in the proband due to maternal isodisomy. Conclusion: This is the first study of the concurrent molecular etiology of PWS and calpainopathy (OMIM # 253600) in the same patient. This report highlights the utility of joint analysis and need for the assessment of autosomal recessive disease in regions of isodisomy in patients with complex and unexplained phenotype.

The inhibition of kynurenine aminotransferase II (KATII) is a target for treating several diseases with an excess of kynurenic acid (KYNA). KATII inhibitors exist, but they have adverse side effects, given their irreversible inhibition mechanism. This study aimed to discover potent and safe inhibitors of KATII by using computational and in vitro methods. We identified herbacetin and (-)-Epicatechin as reversible KATII inhibitors from a small library of natural compounds, whose Glide docking scores (-8.66 kcal mol-1 and-8.16 kcal mol-1, respectively) and MM/GBSA binding energies (-50.30 kcal mol-1 and -51.35 kcal mol-1, respectively), which are higher scores than the standard inhibitor, PF-04859989 (-7.12 kcal mol-1 and -38.41 kcal mol-1, respectively). The ADMET analysis showed that herbacetin and (-)-Epicatechin have suitable pharmacokinetic parameters, are moderately bioavailable, and have a safe toxicity profile. Their KATII inhibitory activity is in the range of IC50 values of 5.98± 0.18 µM and 8.76 ± 0.76 µM, respectively. Furthermore, the MTT assay for cell toxicity showed that the two compounds do not alter HepG2 cell viability at their required concentration for KATII inhibition. These results show that herbacetin and(-)-Epicatechin are suitable for KATII inhibition and appropriate candidates for further development of KATII inhibitors.

Background/Objectives: The global burden of colorectal cancer (CRC) is projected to increase by 2040, highlighting the need for prevention strategies, early detection and adequate follow. The aim of this study was to provide an overview of the progress in personalized medicine of CRC in Serbia, with results and insights from the Institute for Oncology and Radiology of Serbia (IORS), and to propose guidance for tackling observed challenges in the future. Methods: Epidemiological data was derived from official global and national cancer registries and IORS electronic medical records. Germline genetic testing for Lynch syndrome was performed by Next Generation Sequencing. RAS and BRAF mutation analyses were performed using qPCR diagnostic kits. Results: Epidemiology and risk factors, prevention and early detection programs, as well as treatment options and scientific advances have been described in detail. Out of 103 patients who underwent germline testing for Lynch syndrome, 19 (18.4%) had a pathogenic or likely pathogenic mutation in one of the MMR genes, and 8 (7.8%) in other CRC-associated genes (APC, CHEK2, MUTYH). Of 6369 tested patients, 50.43% had a mutation in KRAS or NRAS genes, while 9.54% had the V600 mutation in the BRAF gene. Conclusions: Although significant improvements in CRC management have occurred globally in recent years, the high incidence of young-onset CRC and the growing elderly population due to a rise in life expectancy require a strategic approach leading to population-based systemic solutions, especially important for countries with limited health care resources as Serbia.

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

Input reconstruction problem is usually encountered in the areas such as virtual sensing, image restoration, sensor linearization, and communications. The input reconstruction problem can be seen as an inverse problem. Given a nominal system, two types of approaches are commonly used for solving the inverse problem. The first one is to directly invert the nominal system, and the second one is to derive an inversion of the nominal system in an indirect way. However, for the first type of approaches, system inversion cannot be directly conducted under some conditions such as there exist nonminimum-phase zeros in the nominal system, while for the second type of approaches, simultaneously guaranteeing stability and causality of the obtained inversion is still not solved well. In order to avoid the drawbacks existing in the two types of approaches, an alternative approach is proposed for input reconstruction. In this approach, the input signal is first modeled as the output of a state-space model, afterwards two Kalman filters for the model resulted by combining the input signal model and the nominal system model are implemented alternatively such that the input signal can be sequentially reconstructed in an infinite horizon. The proposed input reconstruction approach is applied in two examples, and simulation results can illustrate the effectiveness of the proposed approach.

The purpose of this finite element analysis (FEA) was to evaluate the stress experienced by both the prosthetic components and the bone in relation to varying cement thicknesses ranging from 20 to 60 μm, utilized in the attachment of a zirconia crown on a conometric cap. The study focused on two distinct types of implants (Cyroth and TAC, AoN Implants, Grisignano di Zocco, Italy) featuring a Morse cone connection. Detailed three-dimensional (3D) models were created to repre-sent the bone structure (cortical and trabecular) and the prosthetic components, encompassing the crown, cement, cap, abutment, and the implant. The two implants were placed in a 1.5 mm sub-crestal position and subjected to an inclined load of 200 N at 45° on the crown. The results re-vealed that an increase in cement thickness resulted in a reduction of von Mises stress on the cor-tical bone for both Cyroth and TAC implants, while the decrease in stress on the trabecular bone was relatively less pronounced. However, the TAC implant exhibited a higher stress field and de-formation in the apical area compared to the Cyroth implant. In summary, this study investigated the impact of cement thickness on stress transmission across prosthetic components and peri-implant tissues by means of FEA analysis, indicating that the 60 μm cement layer manifested higher stress values nearing the material strength limit.

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.

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

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

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