Advancements in multi-objective eco-routing solutions using connectivity

Due to the significant adverse impact of transportation systems on the environment, topics related to alleviating greenhouse gas (GHG) emissions are gaining more attention. As potential solutions to mitigate GHG emissions, several approaches have been proposed to better control traffic and manage transportation systems. The employment of Intelligent Transportation System (ITS), which adopts the advancements in Information and Communication Technology (ICT), has been proposed as the most favourable approach to alleviate the undesirable impact of transportation systems on the environment. ITS can control several aspects of a network, such as speed, traffic signals, and route guidance. For the purpose of routing, this research aims to exploit the advancements in ICT by including connected and automated vehicles (CAVs) and sensing technology in an urban congested network.<div>Anticipatory multi-objective eco-routing in a distributed routing framework was proposed and compared to myopic routing with a large case study on a congested network. The End-to-End Connected Autonomous Vehicles (E2ECAV) dynamic distributed routing framework was examined, and encouraging results were found based on the traffic and environmental perspectives. The impact of different market penetration rates (MPRs) of CAVs was examined for various traffic conditions. E2ECAV was adopted for both the myopic and anticipatory routing strategies in this dissertation. The best GHG costing approach was defined and was among the elements tackled in this research. For a robust anticipatory routing application, predictive models were developed based on Long-Short Term Memory (LSTM), a deep learning approach, while considering a high level of spatial (link level) and temporal (one minute) resolution. With regards to the LSTM predictive models, the impact was illustrated of using a deeper LSTM network and systematically tuning its hyper-parameters. The anticipatory routing strategy significantly outperformed the myopic routing strategy based on the the traffic and environmental perspectives. This research shows that ITS can help significantly reduce GHG emissions produced by transportation systems. The developed predictive models can be used while real-time data are collected from sensors within an urban network. Furthermore, the proposed anticipatory routing framework can be applied in a real-time situation. </div>

Advancements in multi-objective eco-routing solutions using connectivity

Due to the significant adverse impact of transportation systems on the environment, topics related to alleviating greenhouse gas (GHG) emissions are gaining more attention. As potential solutions to mitigate GHG emissions, several approaches have been proposed to better control traffic and manage transportation systems. The employment of Intelligent Transportation System (ITS), which adopts the advancements in Information and Communication Technology (ICT), has been proposed as the most favourable approach to alleviate the undesirable impact of transportation systems on the environment. ITS can control several aspects of a network, such as speed, traffic signals, and route guidance. For the purpose of routing, this research aims to exploit the advancements in ICT by including connected and automated vehicles (CAVs) and sensing technology in an urban congested network.<div>Anticipatory multi-objective eco-routing in a distributed routing framework was proposed and compared to myopic routing with a large case study on a congested network. The End-to-End Connected Autonomous Vehicles (E2ECAV) dynamic distributed routing framework was examined, and encouraging results were found based on the traffic and environmental perspectives. The impact of different market penetration rates (MPRs) of CAVs was examined for various traffic conditions. E2ECAV was adopted for both the myopic and anticipatory routing strategies in this dissertation. The best GHG costing approach was defined and was among the elements tackled in this research. For a robust anticipatory routing application, predictive models were developed based on Long-Short Term Memory (LSTM), a deep learning approach, while considering a high level of spatial (link level) and temporal (one minute) resolution. With regards to the LSTM predictive models, the impact was illustrated of using a deeper LSTM network and systematically tuning its hyper-parameters. The anticipatory routing strategy significantly outperformed the myopic routing strategy based on the the traffic and environmental perspectives. This research shows that ITS can help significantly reduce GHG emissions produced by transportation systems. The developed predictive models can be used while real-time data are collected from sensors within an urban network. Furthermore, the proposed anticipatory routing framework can be applied in a real-time situation. </div>

Performance Evaluation Indicators of Space Dynamic Networks under Broadcast Mechanism

Large-scale heterogeneous constellations will be the major forms of future space-based systems, and the implementation of numerous derived applications depends mainly on intersatellite communication. The nodes representing heterogeneous satellites will form the networks with rapidly changing topology. However, few researches have been carried out for such networks. This paper studies the broadcast mechanism for space dynamic networks and establishes centralized and distributed routing framework. And then, performance evaluation indicators are proposed to evaluate both the connectivity of dynamic networks and the effectiveness of routing algorithms. Finally, we examine the performance of multigroup networks and verify the rationality of corresponding indicators. We also explore the impact of information survival time which directly affects the delivery ratio and, if unfortunately, may waste the communication resources. Empirical conclusion about the survival time is given in the final part. We believe the performance indicators and the routing algorithms proposed in this paper are great help to future space-based system and both the broadcast mechanism designing.

Research on energy-efficient routing algorithm based on SWIPT in multi-hop clustered WSN for 5G system

As one of the basic supporting technologies of 5G system, wireless sensor networks technology is facing a new challenge to improve its transmission energy efficiency. This paper considers combining simultaneous wireless information and power transfer (SWIPT) technique and routing technique, and applying them to multi-hop clustered wireless sensor networks (MCWSN), where each node can decode information and harvest energy from a received radio-frequency signal. And the relay nodes in MCWSN can utilize the harvest energy to forward data to their next hop nodes according to the routing scheme. First, we formulate an energy-efficient routing problem of MCWSN with SWIPT. Then, a heuristic energy efficient cooperative SWIPT routing algorithm (EECSR) is presented to find a transmission path with the maximum energy efficiency. Specifically, in EECSR, the resource allocation problem in each hop of the path is transformed to some equivalent convex optimization problems, which are resolved via dual decomposition. Moreover, a distributed routing protocol based on EECSR is proposed. As far as we know, this is the first solution that considers energy efficiency optimization based on routing and SWIPT in MCWSN. Simulation results show that our EECSR algorithm has high energy efficiency and good robustness. And our distributed routing protocol has better real-time performance than traditional protocols.

Solving Routing Problem Using Improved Camel Herds Algorithm

This paper introduces a new adaptive, distributed routing algorithm based on the Improved Camel Herds Algorithm (CHA). It is an intelligent, multi-agent optimization algorithm that is inspired by the behavior of camels and how they search for food in their desert environment. We examine its ability to solve the routing problem in switched networks: finding the shortest path in the process of transferring data packets between networks. Many meta-heuristic algorithms have been previously proposed to address the routing problem, and this proposed approach is compared with three well-known algorithms (ACO, GA, PSO) on ten graphs (weighted, integer, and not negative) and datasets with various size of nodes (from 10 nodes to 297 nodes). Three performance criteria were used to evaluate the performance of the algorithms (mean relative error, standard deviation, and number of function evaluations). The results proved that the performance of the proposed algorithm is both promising and competitive with other algorithms.

Energy Efficient Routing for Multi-hop Clustered Wireless Sensor Network with SWIPT

This paper considers combining simultaneous wireless information and power transfer (SWIPT) technique and routing technique, and applying them to multi-hop clustered wireless sensor networks (MCWSN), where each node can decode information and harvest energy from a received radio frequency signal. And the relay nodes in MCWSN can utilize the harvest energy to forward data to their next hop nodes according to the routing scheme. First, we formulate an energy-efficient routing problem of MCWSN with SWIPT. Then, a heuristic energy efficient cooperative SWIPT routing algorithm (EECSR) is presented to find a transmission path with the maximum energy efficiency. Specifically, In EECSR, the resource allocation problem in each hop of the path is transformed to some equivalent convex optimization problems, which are resolved via dual decomposition. Moreover, a distributed routing protocol based on EECSR is proposed.As far as we know, this is the first solution that considers energy efficiency optimization based on routing and SWIPT in MCWSN. Simulation results show that our EECSR algorithm has high energy efficiency and good robustness. And our distributed routing protocol has better real-time performance than traditional protocols.