Free Routing Research Articles

DetSpace: Distributed congestion free routing for global deterministic network in mega-constellations

DetSpace: Distributed congestion free routing for global deterministic network in mega-constellations

Free Routing in High-Complexity Airspace: Impact Assessment for Environment and Aviation Stakeholders

Free Route Airspace (FRA) is a concept introduced as a part of the Single European Sky Research program, enabling users to arrange routes between defined entry and exit fixes with the goal of addressing some of aviation’s concerns, such as efficiency, capacity, and the environment. This study aims to analyze the mitigation potential of the FRA with different implementation strategies from the perspectives of several stakeholders, particularly in high-complexity airspace. The impact this operational improvement would have on different stakeholders of aviation (such as air traffic controllers, airlines, passengers, and the climate) is studied with the developed models. Simulations are performed in high-complexity airspace with the presence of wind, and the concept is assessed using different planning strategies to analyze the mitigation potentials in different cases and potential impacts on aviation stakeholders and environment. The results show that the operational improvement implemented in the high-complexity airspace in the ECAC (European Civil Aviation Conference) area has a reduction potential of around 7–9% in fuel consumption and carbon dioxide, 26–31% in nitrogen oxide, and 19–27% in the average temperature response over 20 years (ATR20); with respect to the baseline scenario in 2018. And, the impacts obtained by different planning strategies on the operational-, economic-, safety-, and air-traffic-control-related key performance indicators are analyzed in detail throughout the study.

A novel conflict free routing with multi pickup delivery tasks for autonomous vehicles

PurposeThis study aims to propose a novel method for the conflict detection and eradication of autonomous vehicles which has predetermined routes to establish multi pickup and delivery tasks according to task priorities and vehicle capacity status on each pickup and delivery nodes in assembly cells in the automotive production.Design/methodology/approachIn the designed system, the routing of autonomous vehicles (AVs) and scheduling of pickup and delivery tasks are established in production logistics. Gantt chart is created according to vehicle routes, and conflicts are detected using the proposed conflict-sweep algorithm. The proposed conflict-solving algorithm eliminates conflicts on intersections and roads by considering vehicle routes and task priorities.FindingsIn many production systems, there is a need to obtain flexible routes in each pickup delivery task group that changes during day, week, etc. Proposed system provides remarkable advantages in obtaining conflict-free routes for pre-scheduled multi transport tasks of vehicles by considering efficiency in production systems.Originality/valueA novel method is proposed for the conflict detection and eradication of AVs. Proposed system eliminates conflicts on intersections and roads by considering pre-planned vehicle routes for a fleet of heterogeneous AVs. Unlike most of the other conflict-free algorithms, in which conflicts are solved between two points, proposed system also considers multi pickup and delivery points for AVs. This is pioneering paper that addresses conflict-free route planning with backhauls and scheduling of multi pickup and delivery tasks for AVs.

Cross Layer based Congestion Free Route Selection in Vehicular Ad Hoc Networks

For creating a mobile network, the moving cars consider as nodes in the Vehicular Ad-Hoc Networks (VANETs). Each participating car is turned into a wireless router in the VANETs that allows the connecting and creating a network. To improve the comfort and safety of driving of automotive users, the vehicular environment system develops in the vehicular environment systems using the wireless access. The channel congestion causes the degradation of quality of service in such cases with higher vehicle density. The real-time and reliable communication is required for various safety applications of VANETs. The dense traffic network has included one of the major challenges as avoiding the communication channels’ degradation. To provide the network with efficient operation, most of the studies are recommended to use the appropriate congestion control methods. It’s important to note that many congestion control mechanisms are not implemented for event-driven real-time safety messages. Based on the congestion probability approach estimation, CFRS-CP-Congestion free route selection is introduced for minimizing the total number of data flow packets that passing through the congested nodes. At each node, the congestion probability is estimated using the proposed technique of CFRS-CP based on link quality, MAC overhead, neighbour density & vehicle velocity. Then, the estimated congestion probability is used for route assessment. The estimated probability value is appended to the control packets for comparison. All the available routes are assessed based on the estimated congestion probability which results in congestion free routing path for every round of data communication. The simulation results prove that the proposed method decreases end to end delay by 32% and improves PDR up to 30% and throughput up to 45% compared to the existing protocols.

Prime turn model and first last turn model: An adaptive deadlock free routing for network-on-chips

Purpose: Network-on-Chips (NoCs) have emerged as a valuable solution for the never-ending communication needs of large System-on-Chips (SoCs). It opened the doors for scalability, resource management, bandwidth, and power management for communication technologies. The performance and efficiency of NoCs is largely determined by the routing mechanism it uses to transfer the data. There occur many challenges while designing a routing algorithm, deadlock being one among them. Deadlock is one of the most frequently occurring and difficult to handle problem in NoCs. Hence the deployment of deadlock-free algorithms is necessary for the fruitful functioning of NoCs. In this paper, we are discussing multiple deadlock handling techniques, with a focus on deadlock prevention. Further, we have developed two models namely Prime Turn Model and First Last Turn Model for 2D meshes. Both these turn models are adaptive and deadlock-free. No virtual channels are used for deadlock prevention. The behavior and working of turn models along with pseudocode and simulations are all provided. They are compared with different already existing turn models for different traffic patterns. Simulation results show that our routing algorithms obtain good improvement in terms of latency and throughput and hence enhance performance.

A Collision Free Network with Minimal Routing Path for 2<sup>n</sup> Nodes

In the present work, a simple but complex network which has collision free communications is created. With the help of the binary n-cube the network is formed. This n-cube network connection is formed by connecting distinct N number of nodes which are expressed as a power of 2. If each node has an address of m bits then there are N=2^m number of nodes in the n-cube network. To find out the predefined routing path for the case of this n-cube network, we can apply deterministic algorithm providing us a collision /deadlock free concept. In calculating the predefined routing path(s), node addresses involved in the path are calculated by using the exclusive OR operation, firstly, upon the two node addresses of source and destination, and then, on the derived node-addresses according to the algorithm stated in section 2. Here, the Exclusive-OR operation is performed simply by using 2-input XOR gate which may be made up of either (i) classical CMOS based material, or (ii) Multiple input threshold logic gate , or (iii) Single electron tunneling Transistor (SET). We are concentrated in the case of CMOS based XOR circuit. In this work, an E-cube Routing on a 6-dimensional hypercube has been designed and constructed. We have tried to find out the node addresses for predefining the deadlock free routing path for any set of “source and destination”. To develop a “Collision free network with minimal Routing”, a number of Exclusive-OR gates are arranged in a pattern discussed in section 3 and the desired circuit is implemented. The implemented circuit can supply the predefined path nodes through which the signal/packets/data can pass. Regarding the experimental input –output values, some truth tables are depicted in substantial places. At the time of applying the algorithm, we have investigated that for 6-dimentional hypercube, the maximum path length are confined to 6, i.e. whenever the source and destination points are provided, then 6-node points are produced. Among these 6-pionts some of them may have identical values. As a result path length should be less than 6. For the network, the time required to travel a path is measured and shown. The net designed and implemented must a be a collision free one, since when a truth table is written, there would not be any pair of nodes identical in a column.

Threshold Logic Technology based E-cube Routing on a 4-dimensional hypercube

Hypercube network connection is formed by connecting different N number of nodes that are expressed as a power of 2. If each node has an address of m bits then the total number of nodes in the Hypercube network is N=2^m. In calculating the predefined routing path for the case of this E-cube network, we apply deterministic algorithm which gives a deadlock free concept. For determining predefined routing path, node addresses involved in the path are calculated by using the exclusive operation, firstly, on the node addresses of source and destination, next, on the derived nodes according to the algorithm. In the present work, the Exclusive-OR operation is performed with the help of electron-tunneling based XOR gate which is made up of Multiple input threshold logic gate. This multiple input threshold logic gate technology is really different from the existing one. By using an emerging technology we are capable of making an electronic circuit with high speed, low cost, high concentration density, light in weight, reduced gate numbers and low power consumption. This technology is relies on the condition of linear threshold logic and electron-tunneling event. When we are interested in implementing a circuit, a multi-inputs but one-output based logic-gate will be taken account of consideration. In this work, we have designed an E-cube Routing on a 4-dimensional hypercube to find out the node addresses for predefining the deadlock free routing path from source to destination. To develop this “E-cube Routing on a 4-dimensional hypercube”, we must require a specific logic called Exclusive-OR gate and for this, some small components like 2-input OR gate, 2-input AND gates of different input conditions are essential. After arranging this XOR gate in a pattern discussed in section 2, a desired circuit is implemented. All the circuit we are intended to construct are given in due places with their threshold logic and simulation set, the simulation results are provided as well. Different truth tables, derivation of threshold logic expressions are given for clear understanding. We have taken our consideration of whether the present work circuits are faster or slower than the circuits of CMOS based- and Single electron transistor (SET) based-circuits. The power consumed at the time of tunneling event for a circuit is measured and sensed that it exists in the range between 10meV to 250meV which is very small amount. All the combinational circuits we have presented in this work are of ‘generic multiple input threshold logic gate’-based.

Energy Efficient Proactive Routing Scheme for Enabling Reliable Communication in Underwater Internet of Things

The Underwater Internet of Things (UIoT) is a network of smart interconnected devices operating under various aqueous environments. In UIoT, due to aqueous feature of signal absorption, data signals are transmitted at low frequency. Similarly, significant interference and collisions degrade transmission quality, resulting in a low Packet Delivery Ratio (PDR) and a long End-to-End (E2E) delay. Moreover, a significant amount of energy is being wasted due to the void hole problem, which arises when the source node does not identify an instant forwarder node. Thus, a reliable communication with enhanced network lifetime is highly desired in UIoT. Therefore, this work proposes a proactive energy Efficient Layer-by-Layer Watchman-based Collision Free Routing (ELW-CFR) scheme to address the above mentioned issues. The proposed scheme provides the low E2E delay and high PDR while avoiding the void hole problem. Extensive simulations have been performed to show the performance superiority of the proposed scheme against the state-of-the-art schemes.

Multipath Reliable Routing Using Cluster Based Communication

In this research we proposed the protection in ANT Optimized primarily based multipath congestion routing performance. Here the situation of DDoS is simulated and examines their impact in dynamic network. The multipath protocol like AOMDV is balance the all load by way of offering alternative path however not knowledgeable at each and every condition. The DDoS attacker is blocking off the whole viable direction in community by way of flooding large quantity of redundant packets in dynamic network. The attacker is that the intermediate node and this attacker contamination is continuously dispersing infection and the entire network overall performance is dumped. The proposed security scheme is identified attacker and their loss effect. Attacker is utterly disabled by way of proposed protection mechanism and their loss is also evaluated. The proposed approach is now not only detecting but also stop community from DDoS attack. The overall performance of protection scheme and assault is measured in three distinctive scenarios of a range of node densities. The proposed scheme is offers attacker free routing and get better network performance after making use of it. The performance of ANT OPTIMIZED is almost equal. The packets receiving, throughput, and PDR are bettering but the loss of packets and unnecessary flooding is decreased in dynamic network.

Support to Design for Air Traffic Management: An Approach with Agent-Based Modelling and Evolutionary Search

This paper presents a methodology to manage the support to design in ATM operations. We propose a workflow for the design of ATM solutions in a performance-based setting. The methodology includes the evaluation of the impact on human behaviour and exploits a combination of different paradigms, such as Agent-Based Modelling and Simulation, and Agent-Based Evolutionary Search. We prove the soundness of the methodology by carrying out a real case study, which is the transition from Direct Routing to Free Routing in the Italian airspace. The validation results exhibit limited errors for the assessment of the performance metrics under evaluation. Furthermore, the optimization of sector collapsing/decollapsing configuration is discussed to demonstrate the effectiveness of the implemented engines.

Congestion aware Adaptive Reverse Routing Strategy for Improving QoS in WSN

General purpose routing techniques for a WSN cannot be capable to give adequate functioning for various communication. This creates low adaptively provided with a general purpose routing technique ensuing in several connections reaching extremely congested. Ant Colony Optimization-Based Fault-Aware Routing (ACO-FAR) is used to balance the load in WSN. In this scheme, the node can calculate the present routes as well as deviation packets via a least congested path [17]. However, this scheme lacking the efficient awareness of bandwidth distribution, guaranteed quality of service in the WSN. To overcome these problems in this paper, Congestion aware Adaptive Reverse Routing strategy (CARS) for Improving Quality of Service (QoS) in WSN is proposed. It is a highly adaptive congestion free routing algorithms that also allocate traffic more equally and reduce network congestion. Reverse routing is used for diminishes the energy utilization and avoid the multiple retransmission in the network. Average delay as well as throughput is the two parameters that are utilized to calculate the performance of routing strategy. Simulation results demonstrate that throughput 36.76% enhanced dramatically whereas preserving 40.31%lesser latency performance.

Congestion Free Routing Mechanism for IoT-Enabled Wireless Sensor Networks for Smart Healthcare Applications

Recently, the Internet of Things (IoT) topology has used to collect physical, physiological, vital signs of patients in consumer-centric e-health or consumer' wellness care services. In such healthcare systems, varieties of medical sensors are attached to the patients to collect vital signs from those who are under observation. The data gathering process in IoT-enabled Wireless Sensor Network (WSN) suffers from the congestion problem. The effect of this translates on missing packets, a decrease of reliability and throughput degradation in IoT-enabled WSN. This article proposes a distributed congestion control algorithm for IoT-enabled WSNs to effectively resolve the congestion for healthcare applications. The proposed scheme alleviates congestion by a priority-based data routing strategy. Furthermore, this article presents a priority queue based scheduling scheme for better reliability. We analyze the properties of the proposed congestion control mechanism mathematically and validate its performance through extensive simulation and real-life experiments. The application of this work can be used to an early warning system in detecting abnormal heart rate, blood pressure, ECG, EMG in the hospital/home care environment to the state-of-art diagnosis.

From free-route air traffic to an adapted dynamic main-flow system

At present, en-route flight traffic is carried out on a system of predefined routes with a low number of intersections between aircraft trajectories. This enables the air traffic controllers to control and supervise the traffic, especially around these intersections. Consequently, the route system leads to a low ratio of used to unused airspace, where not necessarily the shortest route is used for each flight. To reduce trajectory length, the idea of free routing has been developed, whereby each aircraft uses the direct connection between origin and destination airport, generating a traffic distribution which uses nearly the entire available airspace. As a consequence, many intersections between flight trajectories occur, making it more difficult for controllers to handle. We use these intersections as the basis of a so-called main-flow system with trajectories consisting of intersection points instead of waypoints. The intersections of all trajectories of a traffic sample are clustered and the resulting cluster centres are used as nodes in a route system. Additional processing is applied to identify a system of main flows and reduce the number of intersections to an acceptable amount. Our approach is able to identify major traffic flows within unstructured great-circle traffic and to create a main-flow system which is a compromise between the flexibility of free routing and the easier surveillance by controllers in the case of a predefined route network. To prove the ability of the proposed method to identify main flows, it was applied to a scenario of planned flights following the standard route structure. Subsequent tests with two different free-routing scenarios led to new route systems where the median adapted trajectory length for flights of the traffic sample is merely 0.9% (respectively 4.1%) higher than the direct connections. Furthermore, structural complexity is lower for intersections (cluster centres) of the new main-flow system compared to those of direct or great-circle scenarios.

Determining Components of Medical Instructional Design based on Virtual Reality by Research Synthesis

Introduction: The purpose of the present study was to determine the components of medical education design based on virtual reality by research synthesis method. Methods: In the present study a synthesis method was used. In order to study the research background and to collect appropriate data among the databases of Science Direct, Springer, Scopus, ProQuest and Eric (ERIC) search. With the keywords of Educational Design, Virtual Reality, Medical Education, Augmented Reality, Research Synthesis identified from 150 external research cases (English language) between 2006 and 2019 and finally 20 of them with the most coordination and proportion were selected for evaluation. Result: By reviewing articles and themes analysis, medical education design has five main components that are as follows: 1- Analytical component including determining educational needs, defining learner characteristics, defining theoretical framework, defining characteristics of virtual reality technology, forming a corporate team. Designer, conduct feasibility study and determine the type of content suitable for presentation through virtual reality. Design component includes defining general goals, targeting goals that are achievable by virtual reality, defining features of a virtual reality-based learning environment (free routing, first-person, third-person vision), determining the type of interaction (visual, photo, touch). Virtual and immersion, defining educational strategies (small and large), determining the level of reality, determining the content and organizing it (navigation) 3. Component of production and production including: scenario design, user interface design, content design, design Avatar, Training Agent Design, Virtual Reality Modeling, Platform Development (Hardware and Software) 4. Support and Implementation including Training Implementation, System Integration Virtual education in curriculum, support (technical and educational) 5. Evaluation component including formative evaluation, aggregate evaluation, ease of use evaluation, small group evaluation, large group evaluation, virtual reality based learning environment and platform evaluation (software and hardware). Conclusion: With respect to that the components of medical education design based on virtual reality have been identified, it is recommended that the medical education process be organized according to the components of educational design and that educational principles and processes be designed according to the capacity of virtual reality technology.

Traffic Management of the Congested Urban-suburban Arterial Roads

Managing the congestion is an old and legitimate claim of the cities. However, in spite of the promising solutions, the use of passenger cars outside the city centers did not decrease. The still hot topic requires a real solution.The goal of the traffic planning and management was to serve the traffic demands but with the increase in traffic, infrastructure development could not keep up, so this goal - theoretically - is not valid anymore. We are in the midst of a paradigm shift: the old goals are obviously not working, but new goals and the tools needed to achieve them have not yet been developed.According to the presented research, the operation of urban-suburban rush hour congestion radically differs from the way we have assumed so far, so a new framework was developed that describes this traffic operation. This framework allows us to look for new and valid management solutions and set new strategic and operational goals. In this paper, it is proposed not to build infrastructure for traffic demands, but to adapt the traffic demands to the infrastructure, by creating the optimal saturated traffic flow. This will prevent negative traffic dynamics and impacts on the network and provide higher quality and a more reliable road network operation. The research results have led us to theoretical questions such as the right of the limitation of the free routing on the road network.

Comprehensive Learning on Characteristics, Applications, Issues and Limitations of Manets

This paper is aimed at giving an insight view over the research domains across various levels of Mobile Ad-hoc Networks. A mobile ad-hoc sensor network follows a broader sequence of operational scenarios, unlike typical sensor networks that communicate with the centralized controller. Hence they demand a less complicated setup favorably. Mobile ad-hoc sensors are otherwise known as hybrid ad-hoc networks that consist of some sensors spreads in a geographical area. All individual sensors are capable of mobile communication and have some level of intelligence to process signals and to transmit information. Mobile ad-hoc sensor networks are very constructive in different circumstances. These networks advance the operational efficiency of individual civilian applications. Mobile ad-hoc sensor network becomes highly adaptable so that it can be deployed in almost all environments .The evolution of research in MANET has been started from routing of packets, error free routing, reliable route to stable and secure path of communication in present days. Recent researchers may have much opening in the space of security over the data transmission in the MANET.

Effective Routing Protocol And Analysing Various Attacks In The Manet Network

Mobile Ad-hoc Network is the self-configuring structure less network for transmitting the information from one node to another node because of the independent node direction. During the information transmission in the network one of the main challenges is to maintain the intermediate node information for making the effective transmission. In addition the intermediate person may be hacking the information by performing the Wormhole and Black hole attacks. So, in this paper proposes an effective Neighboring Relationship based Clustering protocol. The protocol analyzes the neighboring relationship between the transmitted node information protocols. Each similar node information is grouped into the cluster. At the time cluster head and neighboring node topology has been updated continuously for avoiding the middle man attacks like, wormhole and black hole. Further the energy consumption is managed by applying the Fireflies algorithm based Energy efficient routing protocol with efficient manner. Then the efficiency of the system is analyzed using the experimental results like, packet delivery ratio, energy utilization factor and percentage of attack free routing efficiency.

Congestion Free Routing in MANET based on Node Reliability Supported AODV

Congestion Free Routing in MANET based on Node Reliability Supported AODV

Impact of multi-criteria optimized trajectories on European airline efficiency, safety and airspace demand

Today the European airspace is facing multiple capacity constraints which are regulating demand during busy traffic periods of the day. These capacity limits cause inefficiencies in flight and airport ground handling. Current market forecasts predict an annual growth in passenger air traffic demand between 4.5 percent and 4.8 percent. This growth will be realized by an increasing number of aircraft movements reflected in an expected annual growth of jet airplanes by 3.3 percent with a negative impact on airspace capacity. To better manage the rare airspace capacity, the Single European Sky ATM Research (SESAR) and the Next Generation Air Transportation System (NextGen) program suggest free route airspaces, a Performance Based Navigation (PBN) and harmonized airspace structures as efficient concepts of improvement in air traffic efficiency. Beside today's minimum fuel and time objectives, a growing public awareness of the anthropogenic environmental impact necessitates further functions for flight planning and execution. Additionally, today's high safety standards must not be negatively influenced by the introduction of free route airspaces. In this paper, we present a trajectory calculation model capable of exploiting a 4D free route optimization potential while considering the divergent targets of safety, efficiency and environmental compatibility. In particular, the environmental effects of condensation trails depending on the time of the day are carefully considered. To further estimate the impact of free routes on airspace demand and on safety issues, the model is implemented in the simulation environment TOMATO, and the European flight intentions have been optimized for an entire day based on departure airports, arrival airports and original departure times July 2016. The resulting trajectories are evaluated against the number, location and duration of separation infringements. Despite constantly changing air speeds and cruising altitudes induced by the optimization target functions, the number and duration of separation infringements could be reduced by 30% due to optimized lateral and vertical trajectories. The results of this case study show a high potential for an increased airspace capacity under free routing conditions. Furthermore, fuel burn (20%) and airline direct operational costs (40%) could be significantly reduced.

Optimal civil aircraft missions exploiting free routing possibilities

A method is presented for optimizing burnt fuel and flight time of civil aircraft missions, under the scope of a full-scale free route airspace implementation as well as usage of actual environmental data, focusing on ambient temperature and pressure. A computational analysis model, using online available aircraft data is considered, for flight envelopes defined by the user, is used as the base tool. The model is validated over real flight data, before it is used as the main tool for optimization of flight missions. Flight paths are analyzed by considering both their vertical and horizontal aspect. Optimal paths are derived, for each chosen mission, through an optimization process that takes advantage of the flexibilities that become available by implementation of Free Route Airspace. Vertical flight path is shown to play very important role in achieving optimal flights, while horizontal paths also offer optimality possibilities, with a strong dependence on weather conditions.