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.

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.

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

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.

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.

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.

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.

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

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

Underwater wireless sensor networks (UWSNs) represent a specialized category of WSNs with versatile applications including acoustic monitoring, oil and gas exploration, and military surveillance. UWSNs face formidable challenges such as limited energy resources, extended propagation delays, and harsh conditions. Existing clustering and multi-hop routing protocols often unevenly distribute nodes geographically, causing network fragmentation and disproportionately draining the battery life of nodes near the sink due to higher data transmission demands. In this paper, we introduce an Energy-efficient Artificial Fish Swarm-based Clustering Protocol (EAFSCP), inspired by the collective behavior of fish swarms. EAFSCP is a decentralized clustering algorithm designed for acoustic monitoring in UWSNs. Its decentralized nature makes it particularly well-suited for large-scale UWSNs, where centralized algorithms may not be feasible. Through comprehensive comparisons with existing cluster-based routing protocols, our findings indicate that EAFSCP consistently outperforms them across multiple key performance metrics, including network lifetime, energy consumption, packet delivery ratio, packet loss rate, and throughput. According to the results, EAFSCP represents an effective clustering algorithm that enhances network performance, prolongs network lifespan by reducing energy consumption, promotes scalability, and provides valuable guidance for emergency response efforts.

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.

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.

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.

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.

Multi-level direct networks fueled by the evolving technology of active optical cables and increasing pin-bandwidth achieve reduced diameters and cost, with high-radix switches. These networks, like Dragonfly, are becoming the preferred aspirants for extreme high-performance parallel machines such as exa-scale computing. In this paper, we introduce a Hyper Z-Tree topology, which deploys the Z-Tree, a variant of fat-tree, as a computing node of a Generalized Hypercube (GHC) configuration. The resulting configuration provides higher bisection bandwidth, lower latency for some applications and higher throughput. Furthermore, the levels of the fat tree offer several path diversities across the GHC dimensions, hence conceding a more fault tolerant architecture. To profit from these path diversities, we propose two adaptive routing algorithms, which are extensions to the routing algorithm suggested in HyperX topology. These two algorithms exhibit better latencies and throughput than the HyperX.

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.

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.

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.

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.

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

The research develops the vehicular routing problem for the distribution of refrigerated products in a multinational company. The mathematical model corresponds to the vehicle routing problem with hard time windows and stochastic service (VRPTW-ST) time model applied in the city of Santiago de Chile. For optimization of the model, optimization methods tabu search, chaotic search and general algebraic modeling were used. The results allow to validate the meta-heuristic chaotic search to solve the VRPTW-ST; chaotic search method obtains superior performance than tabu search method for solving a real problem in a large city.

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.

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.

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.

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.

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.

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

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.

Large language models (LLMs) get quickly implemented into question answering and support systems to automate customer experience across all domains even including medical use cases. Models in such environments should solve multiple problems like general knowledge questions, queries to external sources, function calling and many others. Some cases might not even require a full-on text generation. They possibly need different prompts or even models. All of it can be managed by a routing step. This paper focuses on interpretable few-shot approaches for conversation routing like latent embeddings retrieval. The work here presents a benchmark, a sorrow analysis, and a set of visualizations of the way latent embeddings routing works for long-context conversations in a multilingual, domain-specific environment. The results presented here show that latent embeddings router is able to achieve performance on the same level as LLM-based routers with additional interpretability and higher level of control over model decision making.

The location routing problem of unmanned aerial vehicles (UAV) in border patrol for intelligence, surveillance and reconnaissance is investigated, where the location of UAV base stations and the UAV flying routes for visiting the targets in border area are jointly optimized. The capacity of the base station and the endurance of the UAV are considered. A binary integer programming model is developed to formulate the problem, and two heuristic algorithms combined with local search strategies are designed for solving the problem. The experiment design for simulating the distribution of stations and targets in border is proposed for generating random test instances. Also, an example based on the Sino-Vietnamese border is presented to illustrate the problem and the solution approach. The performance of the two algorithms are analyzed and compared through randomly generated instances.

The Onion Route Network (also called TOR) is by far the most efficient and widely used anonymity platform with millions of users daily and an expanding size and capacities. Since its public deployment in 2002, the Onion Routing network (also known as TOR) has maintained its leading position and dozens of propositions aiming to improve its performance and enhance the security (anonymity and privacy) have been made. Given the significance of this research area, this work seek to contribute into the improvement of TOR by investigating and testing revolutionary cryptographic and routing mechanism. This work is justified by the current TOR vulnerability and observed weaknesses, and set the challenging aim of covering these security flaws by proposing the relevant security and performances improvement such as the authenticated-encryption for onion construction, the lightened onion encapsulation approach and the secured circuit selection and cell routing mechanisms. The obtained results from implementing the proposed improvements and testing them into a TOR-like simulation platform permit to validate not only, the performances and security contributions brought by the improvement, but also the suitability of their potential implementation into the real TOR network.

The Internet of Things (IoT) signifies a revolutionary technological advancement, enhancing various applications through device interconnectivity while introducing significant challenges due to these devices' limited hardware and communication capabilities. To navigate these complexities, the Internet Engineering Task Force (IETF) has tailored the Routing Protocol for Low-Power and Lossy Networks (RPL) to meet the unique demands of IoT environments. However, RPL struggles with traffic congestion and load distribution issues, negatively impacting network performance and reliability. This paper presents a novel enhancement to RPL by integrating learning automata designed to optimize network traffic distribution. This enhanced protocol, the Learning Automata-based Load-Aware RPL (LALARPL), dynamically adjusts routing decisions based on real-time network conditions, achieving more effective load balancing and significantly reducing network congestion. Extensive simulations reveal that this approach outperforms existing methodologies, leading to notable improvements in packet delivery rates, end-to-end delay, and energy efficiency. The findings highlight the potential of our approach to enhance IoT network operations and extend the lifespan of network components. The effectiveness of learning automata in refining routing processes within RPL offers valuable insights that may drive future advancements in IoT networking, aiming for more robust, efficient, and sustainable network architectures.

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.

The benefits of multi-robot systems are substantial, bringing gains in efficiency, quality, and cost, and are useful in a wide range of environments from warehouse automation, to agriculture, and even extend in part to entertainment. In multi-robot system research, the main focus is on ensuring efficient coordination in the operation of the robots, both in task allocation and navigation. However, much of this research seldom strays from theoretical bounds; there are many reasons for this, with the most prominent and impactful being resource limitations. This is especially true for research in areas such as multi-robot path planning (MRPP) and navigation coordination. This is a large issue in practice as many approaches are not designed with meaningful real-world implications in mind and are not scalable to large multi-robot systems. This survey aims to look into the coordination and path-planning issues and challenges faced when working with multi-robot systems, especially those using a prioritised planning approach and identify key areas which are not well-explored and the scope of applying existing MRPP approaches to real-world settings.

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

This paper introduces a novel 3D NoC router that combines buffered and bufferless routing with approximate priority comparison when deflecting flits. Our proposal is a modification of an asymmetrical router that is buffered in the z dimension ports and bufferless in the x and y dimension ports. Flits that request output ports in the x and y dimensions are granted or deflected based on approximate, instead of accurate, priority comparison. Experimental results show that the proposed router, besides effectively combining the advantages of both buffered and bufferless routers, it achieves additional performance and area gains due to the reduced logic required for approximate priority comparison in flit deflections. Experimental results using synthetic and realistic traffic show that the proposed router begins to saturate at a sifnificantly higher injection rate than a bufferless router, but at a slightly lower injection rate than when using accurate priority comparison. Furthermore, the proposed router achieves higher clock frequencies and reduced area compared to the simpler permutation network.

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.

Skin cancer is a prevalent type of malignancy on a global scale, and the early and accurate diag-nosis of this condition is of utmost importance for the survival of patients. The clinical assessment of cutaneous lesions is a crucial aspect of medical practice, although it encounters several obsta-cles, such as prolonged waiting time and misinterpretation. The intricate nature of skin lesions, coupled with variations in appearance and texture, presents substantial barriers to accurate clas-sification. As such, skilled clinicians often struggle to differentiate benign moles from early ma-lignant tumors in skin images. Although deep learning-based approaches such as convolution neural networks have made significant improvements, their stability and generalization continue to confront difficulties, and their performance in accurately delineating lesion borders, capturing refined spatial connections among features, and using contextual information for classification is suboptimal. To address these limitations, we propose a novel approach for skin lesion classification which combines snake models of Active Contour (AC) Segmentation, ResNet50 for feature ex-traction and a Capsule Network with a fusion of lightweight attention mechanisms, to attain the different feature channels and spatial regions within feature maps, enhance the feature discrimi-nation, and improve accuracy. We employed the Stochastic Gradient Descent (SGD) optimization algorithm to optimize the model's parameters. The proposed model is implemented on publicly available datasets, namely HAM10000 and ISIC 2020. The experimental results showed that the proposed model achieved an accuracy of 98% and AUC-ROC of 97.3%, showcasing substantial potential in terms of effective model generalization compared to existing state-of-the-art (SOTA) approaches. These results highlight the potential for our approach to reshape automated derma-tological diagnosis and provide a helpful tool for medical practitioners.

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.

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.

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.

Unmanned aerial systems (UASs) create an extensive fighting capability of the developed military forces. Particularly, these systems carrying confidential data are exposed to security attacks. By the wireless’s nature within these networks, they become susceptible to different kinds of attacks, hence, it seems essential to design the appropriate safety mechanism in such networks. The sinkhole attack is one of the most dangerous and threatening attacks amongst types of attack in UAS. A malicious UAV exists in such a threat attacking as a black hole for absorbing all traffic in the network. Mainly, in a Flow-based protocol, the attacker considers the requests on the route, then, it replies to the target UAV such as high quality or the best route towards Gard station. The malicious UAV is able to only insert itself on one occasion between the nodes relating to each other (such as sink node and sensor node), and act for passing packets among them. In this study, the malicious attacks are detected and purged using two stages were. In the first stage, some principles and rules are used to detect black hole, gray hole, and sinkhole attacks. In the second stage, using a smart agent-based strategy negotiation procedure for three steps, a defense mechanism is designed to prevent these attacks. The smart agent is used by reliable neighbors via the negotiation procedure for three steps, hence, the traffic formed by the malicious UAV is not considered. The suggested protocol is called SAUAS. Here, the technique is assessed through extensive simulations performed in the NS-3 environment. Based on the simulation outcomes, it is indicated that the UAS network performance metrics are enhanced based on the packet delivery rate, detection rate, false-negative rate and false-positive rate.

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 EigenAnt algorithm has been proposed to find the shortest path between two nodes with a proof of convergence. Two novel features are noticeable in EigenAnt compared to the conventional ant colony optimization algorithms. Pheromone evaporation in the EigenAnt algorithm is done locally for the selected path and it does not use heuristic information in its selection phase. On the other hand, a simple version of ant colony optimization that also does not use heuristic information has been used for analyzing convergence, considering parameter impact analysis, in the problem of finding the shortest path for 1-node binary chain problems. In this paper, we propose to improve the EigenAnt algorithm by adding additional parameters in such a way as to be able to take advantage of the analysis developed for the simple ant colony optimization algorithm. We demonstrate through our analysis that since the Improved EigenAnt algorithm has one parameter more than ant colony optimization algorithms, tuning of convergence speed is decoupled from tuning of convergence features in the algorithm. Thus, IEigenAnt, which can be interpreted as having two uncorrelated intensification and diversification components, makes it possible to achieve a balance between intensification and diversification. In order to illustrate the advantages of this decoupling, we present experimental results for the routing network problem.

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

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.

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

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

Home care centers face both an increase in demand and many variations during the execution of routes, compromising the routes initially planned: robust solutions are not effective enough, it is necessary to move on to resilient approaches. We create a close to reality use case supported by interviews of staff at home health care centers, where caregivers are faced with unexpected events that compromise their initial route. We model, analyze and compare three resilient approaches to deal with these disruptions: a baseline approach without any collaboration, a distributed collaborative approach, and a centralized collaborative approach, where we propose a centralization and sharing of information to improve local decision-making. The latter reduces the number of late arrivals by 11% and the total time of late arrival by 21%, and also halves the number of routes exceeding the end of work time (contrary to the distributed collaborative approach, due to the time wasted reaching colleagues). The use of a device, such as a smartphone application, to centralize and share information thus allows better mutual assistance between caregivers. Moreover, we highlight several possible openings like the coupling of simulation and optimization to propose a more resilient approach.

Wireless Sensor Networks (WSN) is the network of the resource-constrained network which forms the foundation of the Internet of Things (IoT). The Routing Protocol for Low-power and Lossy Networks (RPL) is responsible for generating and managing data routing paths. Nodes implementing RPL uses the mechanics of Objective Function (OF) to select the preferred next-hop node – parent node, and optimal routing path to the destination node. If routing decisions are not efficiently made, this results in increased collision domain, leading to packet losses and packet retransmission which impairs the network operational lifetime. In this study, we present the Contiki Operating System (OS), a state-of-the-art OS for IoTs, ContikiRPL; Contiki variant of RPL. We investigated the performance of RPL with respect to its two OFs; Objective Function Zero (OF0) and the Minimum Rank with Hysteresis Objective Function (MRHOF). The performance of these OFs was evaluated on the following metrics; Packet Delivery Ratio (PDR), Power consumption, and network latency. The result shows that MRHOF outperformed OF0 on all metrics with an overall average PDR of 91.5%, a latency of 44ms, and power consumption of 1.72mW across all nodes. This results in optimal network performance with improved network operational lifetime.

As a novel concept in technology and communication world, “Internet of Things (IoT)” has been emerged. In such modern technology, the capability to transmit data through data communication networks (such as Internet or Intranet) is provided for each organism (e.g. human being, animals, things, and so forth). Due to the limited hardware and communication operational capability as well as small dimensions, IoT undergoes quite a few challenges. Such inherent challenges not only cause fundamental restrictions in the efficiency of aggregation, transmission, and communication between nodes; but they also degrade routing performance. To cope with the reduced availability time and unstable communications among nodes, data aggregation and transmission approaches in such networks are designed more intelligently. In this paper, a distributed method is proposed to set child balance among nodes. In this method, the height of the network graph is increased through restricting the degree; and network congestion is reduced as a result. Besides, a dynamic data aggregation approach -named as LA-RPL- is proposed for RPL networks. More specifically, each node is equipped with learning automata in order to perform data aggregation and transmissions. Simulation results demonstrate that the proposed approach outperforms previously suggested based approaches in terms of energy consumption, network control overhead, and packet loss rate.

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.

With the widespread use of the Internet of Things, underwater control and monitoring systems for purposes such as ocean data sampling, natural disaster prevention, underwater surveillance, submarine exploration, and the like have become a popular and challenging topic in computers. So far, various topology control and routing solutions have been proposed for these networks. However, as technology expands and applications grow, so does the need for a stable underwater communication platform. On the other hand, underwater communication is associated with challenges such as node mobility, long propagation delays, low bandwidth, limited resources, and high error rates. In this research, for the first time, a topology control platform based on the RPL tree is modelled by applying its structural changes underwater. The proposed RPLUW methods in the case of RPLUWM fixed nodes are introduced to support the mobility of nodes underwater. Flexible objective functions, utilisation of decision-making systems, and application of control schedules in these methods have increased network life, reduced overhead, and increased node efficiency. The simulation results of the proposed method, in comparison with recent methods in this field, show an increase in network efficiency.

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

Optimization using Genetic Algorithms (GA) is a well-known strategy in several scientific disciplines. The crossover is an essential operator of the Genetic Algorithm. It has been an active area of research to develop sustainable forms for this operand. In this work, a new crossover operand is proposed. This operand depends on giving an elicited description for the chromosome with a new structure for alleles of the parents. It is suggested that each allele has two attitudes, one attitude differs contrastingly with the other, and both of them complement the allele. Thus, in case of one attitude is good, the other should be bad. This is suitable for many systems which contain admired parameters and unadmired parameters. The proposed crossover would improve the desired attitudes and damp the undesired attitudes. The proposed crossover can be achieved in two stages: the first stage is a mating method for both attitudes in one parent to improving one attitude at the expense of the other. The second stage comes after the first improvement stage for mating between different parents. Hence, two concurrent steps for improvement would be applied. Simulation experiments for the system shows improvement in the fitness function. The proposed crossover could be helpful in different fields, especially to optimize routing algorithms and network protocols, an application that has been tested as a case study in this work.

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

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

Internet of things (IoT) is a network of smart things. This indicates the ability of these physical things to transfer information with other physical things. IoT has introduced various services and daily human life depends on its reliable and accessible operation. The characteristics of these networks, such as topology dynamicity and energy constraint, challenges the routing problem in these networks. Previous routing methods could not achieve the required performance in this type of network. Therefore, developers of this network designed and developed specific methods in order to satisfy the requirements of these networks. One of the routing methods is utilization of multi-path protocols which send data to its destination using routs with separate links. One of such protocols is AOMDV routing protocol. AOMDV protocol is a multi-path protocol which uses multiple different paths for sending information in order to maintain the network traffic balance, manage and control node energy, decrease latency, etc. In this paper, this method is improved using gray system theory which chooses the best paths used for separate routes to send packets. To do this, AOMDV packet format is altered and some fields are added to it so that energy criteria, link expiration time, and signal to noise ratio can also be considered while selecting the best route. The proposed method named GSTMPR-IoT is introduced which chooses the routs with highest rank for concurrent transmission of data, using a specific routine based on the gray system theory. In order to evaluate and report the results, the proposed GSTMPR-IoT method is compared to the EECRP and AOMDV approaches with regard to throughput, packet delivery rate, end to end delay, average residual energy, and network lifetime. The results demonstrate the superior performance of the proposed GSTMPR-IoT compared to the EECRP and AOMDV approaches.

Through the Internet of Things (IoT) the internet scope is established by the aid of physical objects integration to classify themselves to mutual things. A physical object can be created by this inventive perception to signify itself in the digital world. Regarding the physical objects that are related to the internet, it is worth to mention that considering numerous theories and upcoming predictions, they mostly require protected structures, moreover, they are at risk of several attacks. IoTs are endangered by particular routing disobedience called physical layer attack owing to their distributed features. The physical layer attack as a security warning makes possible for the invader to abuse the resources and bandwidth of the network through overloading the network via unimportant packets. This protocol is called LSFA-IoT consisting of two key sections of the physical layer detection system and misbehavior detection system. The first section is utilized in stabilizing the status of the network. The second section is in charge of discovering the misbehavior sources within the IoT network through , the Average Packet Transmission RREQ. By detecting a malicious node, the status of the node is checked by LSFA-IoT prior to sending a data packet and in case detecting the node as malicious, no packet is sent to that node and that node is added to the detention list. Here, the technique is assessed through wide simulations performed within the NS-3 environment. Based on the results of the simulation, it is indicated that the IoT network behaviour metrics are enhanced based on the detection rate, false-negative rate, false-positive rate, and packet delivery rate.

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

There is an increasing trend that Unmanned Combat Air Vehicles (UCAVs) are employed to complete different combat missions in modern wars. This paper investigates a UCAV routing problem, which simultaneously considers the decisions for the configuration of weapons carried by the UCAV subject to its capacity and the allocation of weapons to the targets subject to their destroying requirements. An integer linear programming model is developed to formulate the problem. An adaptive large neighborhood search (ALNS) heuristic is proposed to solve the problem, in which seven neighborhood structures are designed and employed. Randomly generated instances covering the small, medium and large sizes are used to test the proposed ALNS algorithm. CPLEX is also utilized to solve the small-size instances, whose results are compared with that obtained by the ALNS algorithm. And the extensive experimental results confirm the effectiveness and superiority of the proposed ALNS algorithm.

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.

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.

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.

Efficiently solving the problem of computing, in a distributed fashion, the shortest paths of a graph whose topology dynamically changes over time is a core functionality of many today’s digital infrastructures, probably the most prominent example being communication networks. Many solutions have been proposed over the years for this problem that can be broadly classified into two categories, namely Distance-Vector and Link-State algorithms. Distance-Vector algorithms are widely adopted solutions when scalability and reliability are key issues or when nodes have either limited hardware resources, as they result in being very competitive approaches in terms of both the memory and the computational point of view. In this paper, we first survey some of the most established solutions of the Distance-Vector category. Then, we discuss some recent algorithmic developments in this area. Finally, we propose a new experimental study, conducted on a prominent category of network instances, namely generalized linear preference (GLP) power-law networks, to rank the performance of such solutions.

As an important part of urban terminal delivery, automated guided vehicle (AGV) has been widely used in the field of takeout delivery. Due to the real-time generation of takeout orders, the delivery system is required to be extremely dynamic, so the AGV needs to be dynamically scheduled. At the same time, the uncertainty in the delivery process (such as the meal preparation time) further increases the complexity and difficulty of AGV scheduling. Considering the influence of these two factors, the method of embedding stochastic programming model into rolling mechanism is adopted to optimize the AGV delivery routing. Specifically, To handle real-time orders under dynamic demand, an optimization mechanism based on rolling scheduling framework is proposed, which allows the AGV route to be continuously updated. Different from most VRP models, open chain structure is used to describe the dynamic delivery path of AGV. In order to deal with the impact of uncertain meal preparation time on route planning, a stochastic programming model is formulated with the purpose of minimizing the expectation of order timeout rate and the total customer waiting time. In addition, an effective path merging strategy and after-effects strategy are also considered in the model. In order to solve the proposed mathematical programming model, a multi-objective optimization algorithm based on NSGA-III framework is developed. Finally, a series of experimental results demonstrate the effectiveness and superiority of the proposed model and algorithm.

Survivability is a critical concern in WSNs, heavily influenced by energy efficiency. Addressing severe energy constraints in WSNs requires solutions that meet application goals while prolonging network life. This paper presents an energy optimization approach (EOAMRCL) for WSNs, integrating the Grey Wolf Optimization (GWO) for enhanced performance. EOAMRCL aims to enhance energy efficiency by selecting the optimal duty-cycle schedule, transmission power, and routing paths. The proposed approach employs a centralized strategy using a hierarchical network architecture. During the cluster formation phase, an objective function, augmented with GWO, determines the ideal cluster heads (CHs). The routing protocol then selects routes with minimal energy consumption for data transmission to CHs, using transmission power as a metric. In the transmission phase, the MAC layer forms a duty-cycle schedule based on cross-layer routing information, enabling nodes to switch between active and sleep modes according to their network allocation vectors (NAV). This process is further optimized by an enhanced CSMA/CA mechanism, which incorporates sleep/activate modes and pairing nodes to alternate between active and sleep states. This integration reduces collisions, improves channel assessment accuracy, and lowers energy consumption, thereby enhancing overall network performance. EOAMRCL was evaluated in a MATLAB environment, demonstrating superior performance compared to EEUC, DWEHC, and CGA-GWO protocols, particularly in terms of network lifetime and energy consumption. This highlights the effectiveness of integrating GWO and the updated CSMA/CA mechanism in achieving optimal energy efficiency and network performance.

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.

The vehicular ad hoc network (VANET) when augmented with internet is called internet of vehicles (IoV). In the IoV, vehicles have on board units (OBUs), use communication technologies and customized software to communicate with infrastructure around them. The vehicles can have permanent connectivity and global network awareness based on cloud computing. IoV technologies are still being assessed to ensure that the network is protected from attacks, supports a dynamic vehicular mobility scenarios and meets the low latency communication requirements between the vehicles and the surrounding infrastructure. To meet these strict Quality of Service (QoS) demands, Unmanned Aerial Vehicles (UAVs) play a vital role in IoV ecosystems. An UAV can serve as a mobile roadside unit (mRSU) to transmit data between vehicles, stationery RSUs and other UAVs. The UAVs have better line of sight (LOS) connections which result in better channel states and lower path loss than fixed RSUs. Although the inclusion of UAVs in vehicular networks has improved the system performance by providing better resource management and routing solutions, the traditional optimization techniques with their limitations are often not applicable. Therefore, in recent years, research community is integrating Artificial Intelligence (AI) and Machine Learning (ML) into UAV based IoV ecosystem to better manage resource allocation, routing and mobility management issues to optimize the overall network performance. In this survey paper we review the existing research done in AI/ML based UAV-IoV networks and communications with focus on resource management and routing from year 2019 to 2023. We have studied different AI techniques, their training attributes and architectures in various research works. The limitations of AI-based approaches in terms of required computational resources, availability of real world data and AI models’ complexity for the UAV-IoV environment are also discussed. Finally, the future directions for UAV-IoV research opportunities that can leverage the full potential of AI are presented.

City zones have become increasingly overcrowded as a result of the extensive population widening ratio and the swift relocation of people from villages. The traffic monitoring process is a major issue in these areas due to the massive traffic flow on the roads. This research proposed a cluster-based improved authentication and communication scheme for an Intelligent Transportation System in Vehicular AdHoc Networks (VANETs). Our primary objective is to optimize resource sharing in vehicular communication. We enhanced the reliability, scalability, and stability of fast-moving VANETs by introducing cluster-based routing schemes for Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communications. We used a third-party certification authority for vehicle authentication to address security and privacy concerns. Our proposed schemes support minimizing the end-to-end (E2E) delay and route request, in addition to reducing link failure. Our schemes’ leading yield includes throughput enhancement, TCP Socket Initialization time minimization, TCP handshake response speedup, and DNS lookup improvement. The schemes are centred on short-range peer-to-peer (P2P) wireless communication in a 400-meter radius cluster. This includes innovative P2P wireless communications on VANET using minimized resources. The proposed schemes deliver a secure authentication mechanism with a securely generated vehicle authentication key provided by a certification authority. Furthermore, we have developed RESTful APIs in vehicular communication for implementation purposes, and also offered and implemented algorithms for resource sharing regarding V2V and V2I communication. Ultimately, we evaluated the performance of our experiments.

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

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.

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.

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

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.

General Variable Neighborhood Search (GVNS) is a well known and widely used metaheuristic for efficiently solving many NP-hard combinatorial optimization problems. Quantum General Variable Neighborhood Search (qGVNS) is a novel, quantum inspired extension of the conventional GVNS. Its quantum nature derives from the fact that it takes advantage and incorporates tools and techniques from the field of quantum computation. Travelling Salesman Problem (TSP) is a well known NP-Hard problem which has broadly been used for modelling many real life routing cases. As a consequence, TSP can be used as a basis for modelling and finding routes for Geographical Systems (GPS). In this paper, we examine the potential use of this method for the GPS system of garbage trucks. Specifically, we provide a thorough presentation of our method accompanied with extensive computational results. The experimental data accumulated on a plethora of symmetric TSP instances (symmetric in order to faithfully simulate GPS problems), which are shown in a series of figures and tables, allow us to conclude that the novel qGVNS algorithm can provide an efficient solution for this type of geographical problems.

Wireless Sensor Networks are critical for modern applications ranging from environmental monitoring to smart city infrastructures. This research proposes a novel optimization learning and deployment strategy for Wireless Sensor Networks (WSNs) by 3D WUSN model is uniformly distributed M sensor nodes across diverse terrains, with clusters representing 20% of sensors, showcasing its ability to balance power consumption and extend network longevity, grounded in fuzzy clustering based protocol using the Fuzzy C-Means (FCM) method, called FCM-3DWUSN. Comparative analysis against established models including LEACH-C, K-Means and LEACH emphasized FCM-3DWUSN's outperformed performance, with average power consumption such as 134.990, 341.790, 143.895, and 192.984; respectively. The experimental result shows that FCM protocol in the 3D WUSN model can reduce energy consumption and improve the network lifetime to gather data and send the information.

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.

Optical networks are prone to power jamming attacks intending service disruption. This paper presents a Machine Learning (ML) framework for detection and prevention of jamming attacks in optical networks. We evaluate various ML classifiers for detecting out-of-band jamming attacks with varying intensities. Numerical results show that artificial neural network is the fastest ($10^6$ detection per second) for inference and most accurate ($\approx 100 \%$) in detecting power jamming attacks as well as identifying the optical channels attacked. We also discuss and study a novel prevention mechanism when the system is under active jamming attacks. For this scenario, we propose a novel resource reallocation scheme that utilizes the statistical information of attack detection accuracy to lower the probability of successful jamming of lightpaths while minimizing lightpaths' reallocations. Simulation results show that the likelihood of jamming a lightpath reduces with increasing detection accuracy, and localization reduces the number of reallocations required.

Wireless Sensor Networks are at the center of scientific interest thanks to the ever growing range of their applications. The main weakness of Wireless Sensor Networks is the restricted lifetime of their sensor nodes due to limited energy capacity. The extension of the lifespan of sensor nodes is pursued in various ways. One of them, is the usage of protocols that achieve energy efficient routing. LEACH is one of the pioneering protocols of this type and has numerous descendants. This research article focuses on energy efficient routing protocols that are based on LEACH. Specifically, a study of LEACH along with many of its successors is provided. In addition, a novel protocol of this kind, named T-LEACHSAS is proposed. This protocol is actually an extension of T-LEACH, which is one of the most well-known descending protocols of LEACH. The performance of T-LEACHSAS is compared against that of T-LEACH via simulation tests that validate the protocols' strengths and weaknesses in various scenarios. Finally, concluding remarks are indicated.

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

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

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

The shallow water equations are widely applied for the simulation of flow routing in rivers and floodplains, as well as for flood inundation mapping. From a mathematical point of view, they are a hyperbolic system of nonlinear partial differential equations, whose numerical integration is sometimes computationally burdensome. For this reason, the interest of many researchers has been focused on the study of simplified forms of the original set of equations, which requires less computational effort. One of the most commonly applied simplifications consists in neglecting the inertial terms, which changes the hyperbolic model to a parabolic one. The effects of such a choice on the outputs of the simulations of flooding events are controversial and an important topic of debate. In the present paper, two numerical models, recently proposed for the solution of the complete and zero-inertia forms of the shallow waters equations, are applied to several unsteady flow routing scenarios. We simulate synthetic and laboratory studies, starting from very simple geometries and moving towards complex topographies. Analyzing the role of the terms in the momentum equations, we try to understand the effect, on the computed results, of neglecting the inertial terms in the zero-inertia formulation. We analyze the computational costs.

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.

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

Single-sided deafness (SSD) refers to a condition where there is severe to profound Sensorineural hearing loss in one ear, while the other ear has normal or near-normal hearing. SSD can significantly impact an individual's ability to localize sounds, understand speech in noisy environments, and maintain spatial awareness, often resulting in a reduced quality of life and increased social isolation. In children with unilateral deafness, it can impede spoken language development and potentially impact cognitive abilities. Historically, there was a misconception that the unaffected ear could adequately support speech development in early cases and provide acceptable hearing function in adults. Consequently, SSD was frequently undertreated. However, advances in technology and a deeper understanding of the psychological and developmental impact of SSD have led to a shift in management strategies. Various treatment options are available for addressing SSD, but ongoing debate surrounds the most effective approach. These options include cochlear implants (CI), contra-lateral-routing-of-signal (CROS) devices, and bone conduction devices (BCDs). The aim of this study is to review the scientific evidence on different treatment options for SSD and compare their impact on the quality of life of individuals with this condition.

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

Over the past few decades, aircraft Ground Handling Operations (GHO) have been investigated by numerous researchers. Some aspects of GHO have been more focused on than others due to their importance in the GH processes. For instance, GHO performance has been tackled from different perspectives while workers and vehicles allocation suffer from the lack of research in the area. This paper is a literary review of the research that has been conducted in different areas of GHO. It sheds light on GHO performance, resource allocation and scheduling, operations scheduling, vehicle routing, and workers and vehicles allocation.

The option of decarbonizing urban freight transport using Battery Electric Vehicle (BEV) seems promising.However, there is currently a strong debate whether Fuel Cell Electric Vehicle (FCEV) might be the bettersolution. The question arises as to how a fleet of FCEV influences the operating cost, the Greenhouse Gas(GHG) emissions and primary energy demand in comparison to BEVs and to Internal Combustion EngineVehicle (ICEV). To investigate this, we simulate the urban food retailing as a representative share of urbanfreight transport using a multi-agent transport simulation software. Synthetic routes as well as fleet size andcomposition are determined by solving a Vehicle Routing Problem (VRP). We compute the operating costsusing a total cost of ownership (Total Cost of Ownership (TCO)) analysis and the use phase emissions as wellas primary energy demand using the Well To Wheel (WTW) approach. While a change to BEV results in 17 -23% higher costs compared to ICEV, using FCEVs leads to 22 - 57% higher costs. Assuming today’s electricitymix, we show a GHG emission reduction of 25% compared to the ICEV base case when using BEV. Currenthydrogen production leads to a GHG reduction of 33% when using FCEV which however cannot be scaled tolarger fleets. Using current electricity in electrolysis will increase GHG emission by 60% compared to the basecase. Assuming 100% renewable electricity for charging and hydrogen production, the reduction from FCEVsrises to 73% and from BEV to 92%. The primary energy requirement for BEV is in all cases lower and forhigher compared to the base case. We conclude that while FCEV have a slightly higher GHG savings potentialwith current hydrogen, BEV are the favored technology for urban freight transport from an economic andecological point of view, considering the increasing shares of renewable energies in the grid mix.

This article presents a combined route and path planning strategy to guide Skid-Steer Mobile Robots (SSMRs) in scheduled harvest tasks within expansive crop rows with complex terrain conditions. The proposed strategy integrates: i) a global planning algorithm based on the Traveling Salesman Problem under the Capacitated Vehicle Routing approach and Optimization Routing (OR-tools from Google) to prioritize harvesting positions by minimum path length, unexplored harvest points, and vehicle payload capacity, and ii) a local planning strategy using Informed Rapidly-exploring Random Tree (IRRT*) to coordinate scheduled harvesting points while avoiding low-traction terrain obstacles. The global approach generates an ordered queue of harvesting locations, maximizing the crop yield in a workspace map. In the second stage, the IRRT* planner avoids potential obstacles, including farm layout and slippery terrain. The path planning scheme incorporates a traversability model and a motion model of SSMRs to meet kinematic constraints. Experimental results in a generic fruit orchard demonstrated the effectiveness of the proposed strategy. In particular, the IRRT* algorithm outperformed RRT and RRT* with 96.1% and 97.6% smoother paths, respectively. The IRRT* also showed improved navigation efficiency, avoiding obstacles and slippage zones, making it suitable for precision agriculture.

This paper presents a new methodology to derive and analyze strategies for a fully decarbonized urban transport system which combines conceptual vehicle design, a large-scale agent-based transport simulation, operational cost analysis, and life cycle assessment for a complete urban region. The holistic approach evaluates technical feasibility, system cost, energy demand, transportation time and sustainability-related impacts of various decarbonization strategies. In contrast to previous work, the consequences of a transformation to fully decarbonized transport system scenarios are quantified across all traffic segments, considering procurement, operation and disposal. The methodology can be applied to arbitrary regions and transport systems. Here, the metropolitan region of Berlin is chosen as a demonstration case. First results are shown for a complete conversion of all traffic segments from conventional propulsion technology to battery electric vehicles. The transition of private individual traffic is analyzed regarding technical feasibility, energy demand and environmental impact. Commercial goods, municipal traffic and public transport are analyzed with respect to system cost and environmental impacts. We can show a feasible transition path for all cases with substantially lower greenhouse gas emissions. Based on current technologies and today’s cost structures our simulation shows a moderate increase in total systems cost of 13-18%.