Free Routing Research Articles

Energy Analysis on Localization Free Routing Protocols in UWSNs

The challenges faced in underwater communication systems are limited bandwidth, Energy consumption rate, larger propagation delay time, End-End Delay (E-ED), 3D topology, media access control, routing, resource utilization and power constraints. These issues and challenges are solved by means of deploying the energy efficient protocol. The protocol can either be localization-based protocol or localization free protocol. In this paper, review of localization free protocols were discussed and reviewed with reference to environmental factors, data transmission rate, transmission efficiency, energy consumption rate, E-ED and propagation delay. The review analysis gives the pros and cons to give rise to the new directions of research for future improvements in Underwater Wireless Sensor Networks (UWSNs). This manuscript propose a survey on localization free protocol according to the problem addressed or the major parameter considered during routing in UWSNs. Unlike the existing survey, the present survey focuses on present state and art of routing protocols, in terms of routing strategy issues addressed. The solutions of energy efficient protocol is arrived by highlighting the pros of each protocols. The description of routing strategy for each protocol is presented to understand its operation in an understandable form. The cons of each protocol is taken into consideration for further investigation and to arrive the best protocol. The presented routing strategy, pros and cons provide open challenges and research directions for future investigation.

Multicriteria-Optimized Trajectories Impacting Today’s Air Traffic Density, Efficiency, and Environmental Compatibility

Today’s air traffic system is faced with airspace capacity constraints that can cause inefficiencies in flight and in airport ground handling. Free routing performance-based navigation and harmonized airspace structures are seen as efficient mitigation measures to save distance and fuel, as far as free routes are implemented as optimized and predictable trajectories. In this case, a monitoring of the air traffic system is expected due to an improved predictability of those trajectories. In this paper, a trajectory optimization model for three-dimensional free routes considering multiple targets is presented, including operational costs, time costs, environmental costs, and expected external costs of condensation trails. The model is applied for a case study that looks at optimization of trajectories for an entire day based on the departure airport, arrival airport, and departure time in July of 2016. The resulting trajectories are evaluated against the number of conflicts. The case study shows that today’s air traffic demand already stresses the free route capacity when considering efficiency, ecological compatibility, and safety standards.

Intelligent Beaconing Principle based Congestion Free Routing in Vanet

Intelligent Beaconing Principle based Congestion Free Routing in Vanet

Performance analysis of EEDR routing protocol for WSNs

Wireless Sensor Networks (WSNs) possess formidable design challenges in Energy constrained operation, Communication range, Memory and processing power constraints, Bandwidth constrained links, Dynamic network topologies and Network traffic patterns. These new-found types of networks are largely dictated by application requirements and characterized by severe resource constraints in terms of available energy, computational and communication capabilities. Routing is one of the significant design considerations in WSNs, more especially under severe energy constraints. In this paper the Energy Efficient Distributed Receiver (EEDR) based routing protocol for WSNs is proposed. The proposed work employs the concept of initiating the route from the receiver side instead of sender side. The procedure aims to opt the best route from the multiple routes based on the quality of the multiple channels. The main outcomes of EEDR protocol are (1) Finding a stable route between the source and the destination, (2) adaptation to dynamic conditions of the links with very small delay, (3) Reducing the power consumption of node, (4) Improving the lifetime of the node. The simulation results shows that, for EEDR protocol, the node energy consumption is very less, reduced end-to-end delay and increased throughput. EEDR also ensures loop free routing with reduced hop count.

Comparison of Localization Free Routing Protocols in Underwater Wireless Sensor Networks

Underwater Wireless Sensor Network (UWSN) is newly developed branch of Wireless Sensor network (WSN). UWSN is used for exploration of underwater resources, oceanographic data collection, flood or disaster prevention, tactical surveillance system and unmanned underwater vehicles. UWSN uses sensors of small size with a limited energy, memory and allows limited range for communication. Due to multiple differences from terrestrial sensor network, radio waves cannot be used over here. Acoustic channel are used for communication in deep water, which has many limitations like low bandwidth, high end to end delay and path loss. With the above limitations while using acoustic waves, it is very important to develop energy efficient and reliable protocols. Energy efficient communication in underwater networks has become uttermost need of UWSN technology. The main aim nowadays is to operate sensor with smaller battery for a longer time. This paper will analyse various routing protocols in the area of UWSN through simulation. This paper will analyse Depth Based Routing (DBR), Energy Efficient Depth Based Routing (EEDBR) and Hop by Hop Dynamic Addressing Based (H2-DAB) protocol through simulation. This comparison is carried out on the basis of total consumed energy, end to end delay, path loss and data delivery ratio.

Deadlock Free Load Balanced Adaptive Routing for Network on Chip (NoC) Systems

The Network-on-Chip (NoC) systems have emerged in on-chip communication architecture in various fields. To achieve excellent results in Network on Chip (NoC) systems application, the routing must eliminate the deadlock issues from the network. To overcome this issue in the network, in this paper, we propose Deadlock Free Load Balanced Adaptive Routing. In this approach, Oblivious Routing (OR) algorithm is implemented on the channel by using the probability function. The network considers the capacity of the node and tries to maximize the throughput based on the connectivity between the data packets flow and minimize the channel load. A Reconfiguration Protocol is used for the data packets to choose other channel in the network if the deadlock occurs. Simulation results show that this approach reduces the delay and packet loss in the network.

An Optimum Value of Dynamic Communication Performance for Midimew Connected Mesh Network

A Midimew connected Mesh Network (MMN) is a proposed hierarchical interconnection network in which numerous basic modules are interconnected in a hierarchical fashion to construct a massively parallel computer. Here, the basic module is the first level of the network which is connected by mesh network while higher level network is connected by a midimew network. In this study, we have evaluated a dynamic communication performance of a variety of MMN using the TOPAZ simulator using a deadlock free routing algorithm with uniform traffic patterns, whereby the dimension order routing and virtual cut-through flow control are used. It is found that the saturation throughput of the Virtual MMN (VMMN) is higher than that of Horizontal MMN (HMMN), Symmetric MMN (SMMN), and Tori connected mESH network (TESH).

An Iterative Approach for Collision Free Routing and Scheduling in Multirobot Stations

This work is inspired by the problem of planning sequences of operations, as welding, in car manufacturing stations where multiple industrial robots cooperate. The goal is to minimize the station cycle time, i.e., the time it takes for the last robot to finish its cycle. This is done by dispatching the tasks among the robots, and by routing and scheduling the robots in a collision-free way, such that they perform all predefined tasks. We propose an iterative and decoupled approach in order to cope with the high complexity of the problem. First, collisions among robots are neglected, leading to a min–max Multiple Generalized Traveling Salesman Problem (MGTSP). Then, when the sets of robot loads have been obtained and fixed, we sequence and schedule their tasks, with the aim to avoid conflicts. The first problem (min–max MGTSP) is solved by an exact branch and bound (B&B) method, where different lower bounds are presented by combining the solutions of a min–max set partitioning problem and of a Generalized Traveling Salesman Problem (GTSP). The second problem is approached by assuming that robots move synchronously: a novel transformation of this synchronous problem into a GTSP is presented. Eventually, in order to provide complete robot solutions, we include path planning functionalities, allowing the robots to avoid collisions with the static environment and among themselves. These steps are iterated until a satisfying solution is obtained. Experimental results are shown for both problems and for their combination. We even show the results of the iterative method, applied to an industrial test case adapted from a stud welding station in a car manufacturing line.

Towards cost-effective and low latency data center network architecture

This paper presents the design, analysis, and implementation of a novel data center network architecture, named NovaCube. Based on regular Torus topology, NovaCube is constructed by adding a number of most beneficial jump-over links, which offers many distinct advantages and practical benefits. Moreover, in order to enable NovaCube to achieve its maximum theoretical performance, a probabilistic oblivious routing algorithm PORA is carefully designed. PORA is a both deadlock and livelock free routing algorithm, which achieves near-optimal performance in terms of average routing path length with better load balancing thus leading to higher throughput. Theoretical derivation and mathematical analysis together with extensive simulations further prove the good performance of NovaCube and PORA.

Advanced noise abatement departure procedures: custom-optimised departure profiles

AbstractThis paper presents the concept of custom-optimised departure profiles, as an advanced form of noise abatement departure procedures. This concept relies on fixed routes in combination with individually optimised vertical departure profiles. Although the use of fixed ground tracks results in some loss in environmental performance, the high degree of complexity associated with free routing is eliminated as well, leading to a concept that does not appear to be incompatible with today’s Air Traffic Control (ATC) principles. By using a primitive form of trajectory negotiation between airline and ATC, selected flights can be allowed to perform an optimised departure without interfering with non-participating traffic. Apart from the concept itself, this paper also describes the departure profile optimisation tool, which is based on a previously developed trajectory optimisation framework called NOISHHH. Finally, in a numerical example, a current standard ICAO-A procedure is compared with two optimised profiles for a Boeing 737 departure from Amsterdam Airport. Fuel burn, noise impact and the required flight time to a specified point are compared for the three departure profiles. It is shown that the custom-optimised departure profiles have the potential to both reduce fuel burn as well as noise exposure, relative to the ICAO-A procedure.

Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios

The problem of finding and keeping updated shortest paths in distributed networks is considered crucial in today's practical applications. In the recent past, there has been a renewed interest in devising new efficient distance-vector algorithms as an attractive alternative to link-state solutions for large-scale Ethernet networks, in which scalability and reliability are key issues or the nodes can have limited storage capabilities. In this paper, we present Distributed Computation Pruning (DCP), a new technique, which can be combined with every distance-vector routing algorithm based on shortest paths, allowing to reduce the total number of messages sent by that algorithm and its space occupancy per node. To check its effectiveness, we combined the new technique with DUAL (Diffuse Update ALgorithm), one of the most popular distance-vector algorithm in the literature, which is part of CISCO's widely used EIGRP protocol, and with the recently introduced LFR (Loop Free Routing) which has been shown to have good performances on real networks. We give experimental evidence that these combinations lead to a significant gain both in terms of number of messages sent and of memory requirements per node.

Communication Void Free Routing Protocol in Wireless Sensor Network

Communication voids have negative effect on real time routing protocols. Hence it needs to design an energy efficient communication void free routing protocol for wireless sensor network. A clustering and routing protocol is proposed in the present work. The proposed clustering algorithm is the combination of cluster head selection algorithm and cluster member selection algorithm. The proposed routing algorithm establishes an energy efficient communication void free route for delivering the sensed data to the base station. Both clustering and routing algorithm outperform the existing algorithms in terms of energy consumption and execution time of clustering algorithm, energy consumption, energy dissipation and transmission delay of routing algorithm.

2D Hexagonal Mesh Vs 3D Mesh Network on Chip: A Performance Evaluation

D Network on Chip (NoC) has emerged as a new platform to meet the performance requirements and scaling challenges of System on Chip. More investigations require addressing challenges in multiport topologies, minimizing foot printing of nodes and interconnections of wires. This paper discusses multi-port NoC topologies and routing in 2D hexagonal and 3D mesh NoC. Deadlock free routing for 2D hexagonal mesh topology is compared to ZXY routing in 3D mesh with similar number of nodes. Routing algorithms shows promising results, thus making the architecture and algorithm more suitable for the future NoC design.

Improved Novel Routing Algorithm for Congestion Control in Wireless Sensor Network

This paper is based upon the concept of improving the novel congestion control scheme in Wireless Sensor Network. In WSN Congestion is an important issue. Congestion occurs at the transport layer of the OSI model. The Novel Congestion Control Scheme proposed a rate-based Fairness-Aware Congestion Control Protocol (FACC), which controls congestion and achieves approximately fair bandwidth allocation for different flows. Congestion occurs at the intermediate nodes in WSN. This means the time during when intermediate nodes send Flow Control Acknowledgement to Source Node to describe the congestion status so as to control its flow rate will result in large amount of packet loss. This motivates the need of new technique to control the packet dropping at the intermediate nodes. So to avoid the packet dropping the proposed work introduced the Improved Novel Routing Algorithm (INOVEL) for Congestion Control in Wireless Sensor Network which works in three phases. These three phases plays an important role in utilizing the available free spaces of the neighbored nodes and free routing paths to accommodate the load of Congestion Affected Node’s. This Routing Algorithm is implemented in NS-2 where the results show that such an algorithm improves the performance, efficiency of the network by decreasing end to end delay and increasing both the throughput and packet delivery fraction among the nodes.

Formula omitted] routing algorithm for [formula omitted]-stage switching networks and beyond

This paper addresses routing algorithm for a classic network called rearrangeable network with a complexity which is minimum than any other reported algorithms in this class. A new routing algorithm is presented for symmetric rearrangeable networks built with 2×2 switching elements. This new algorithm is capable of connection setup for partial permutation, m¯=ρN, where N is the total input numbers and m¯ is the number of active inputs. Overall the serial time complexity of this method is O(NlogN)11All log in this paper are base-2. and O(m¯.logN) where all N inputs are active and with m¯<N active inputs respectively. The time complexity of this algorithm in a parallel machine with N completely connected processors is O(log2N). With m¯ active requests the time complexity goes down to O(logm¯.logN), which is better than the O(log2m¯+logN), reported in the literature for 212[(log2N−4logN)12−logN]≤ρ≤1. In later half of this paper, modified rearrangeable networks have been demonstrated built with bigger switching elements (>2×2) with shorter network depth. Routing algorithm for these new networks have been proposed by modifying the proposed algorithm for smaller switching elements networks. Also we shall look into the application of these networks in optical domain for crosstalk free routing.

Deadlock free routing algorithm for minimizing congestion in a Hamiltonian connected recursive 3D-NoCs

Network on Chip (NoC) has been proposed as a solution for addressing the challenges in System on Chip (SoC) design. Designing a topology and its routing schemes are vital problems in a NoC. One of the major challenges that designers face today in 3D integration is how to route the data packets within a layer and across the layers in a scalable and efficient manner. In any 3D topology, minimizing the amount of data packet transmissions during the routing is still an open problem. Any efficient traditional routing schemes should avoid deadlocks and minimize network congestion from a source node to a destination node.In this paper, we propose a 3D recursive hyper graph Hamiltonian connected network and we propose a deadlock free routing algorithm to minimize congestion in the network. We show that the proposed topology outperforms the topology presented by Dubois et al. (Elevator-First: a Dealock-free distributed routing algorithm for vertically partially connected 3d-Nocs, IEEE Trans. Comput. 62(3) (2013) 609–615) [1] with respect to average network latency. Also, we analysis the delay bound of the switches for the proposed topology and 3D Partially connected Mesh Topology (PMT) and conclude that our topology performs better than 3D PMT.

Collaborator Homed Routing: a Mechanism for Fault Free Routing on Wireless Sensor Network

A Wireless Sensor Network (WSN) normally consists of an exceptionally large number of inexpensive, disposable, robust, small, and low power sensor nodes operational considerately. A Distributed and Scalable Scheduling Access (DSSA) scheme that mitigates in wireless sensor networks handles some mobility with high data loss due to the faults. A virtual grid network in distributed and scalable scheduling access scheme is an effortless method to cluster local sensors but fails in network scalability improvement. Existing, Information Controlled Transmission Power (ICTP) alteration method uses higher transmission powers with additional information than individuals that are less instructive to distribute their object state information with the neighboring nodes. ICTP does not detect faults and outlier sensor nodes in the network and probable safety measures have to be taken against them. To overcome these faulty and energy saving issues, Collaborator Homed Routing (CHR) mechanism is developed in WSN. In CHR, cluster heads aggregate information and relay information to the base station independently for improving system’s transmission power with half amount of energy consuming. Non Cluster Head (NCH) nodes choose a restricted number of objects in the information transmission. Based on the CHR principles, designed and implemented a novel mechanism to handle faulty situations. Using CHR in WSN, cluster head faults are installed to observe the scalability of these mechanisms. Therefore CHR consumes less energy with minimal faults. Experimental results show that proposed routing considerably reduces energy consumption, fault free routing, and reduces the possibility of communication disturbance, network scalability, throughout and link failure ratio is compared to existing method

Prevention slot flow‐control mechanism for low latency torus network‐on‐chip

The challenge for on-chip networks is to provide low latency communication in a very low power budget. To reduce the latency and maintain the simplicity of a mesh topology, torus topology is proposed. As torus topology has an inherent circular dependency, additional effort is needed to prevent deadlock, even if deadlock free routing algorithms are used. The authors propose a novel flow-control mechanism to address cost/performance constraints in torus networks and ensure deadlock freedom. They achieve flow-control by using a prevention mechanism and ensure deadlock freedom while requiring only a single packet buffer per input port. They simplify the router design by having a simple switch allocator that prioritises in-flight packets, and a single packet buffer per input port that eliminates the need for virtual channels. They also propose a mechanism to avoid starvation that can arise because of the prioritised arbitration. Experimental validation reveals that the authors design achieves significant improvement in throughput, as compared with the traditional design, while using significantly fewer buffers.

Congestion-aware ant colony based routing algorithms for efficient application execution on Network-on-Chip platform

Networks-on-Chip (NoC) is an interesting option in design of communication infrastructures for embedded systems. It provides a scalable structure and balanced communication between the cores. Parallel applications that take advantage of the NoC architectures, are usually are communication-intensive. Thus, a big deal of data packets is transmitted simultaneously through the network. In order to avoid congestion delays that deteriorate the execution time of the implemented applications, an efficient routing strategy must be thought of carefully. In this paper, the ant colony optimization paradigm is explored to find and optimize routes in a mesh-based NoC. The proposed routing algorithms are simple yet efficient. The routing optimization is driven by the minimization of total latency during packets transmission between the tasks that compose the application. The presented performance evaluation is threefold: first, the impact of well-known synthetic traffic patterns is assessed; second, randomly generated applications are mapped into the NoC infrastructure and some synthetic communication traffics, that follow known patterns, are used to simulate real situations; third, sixteen real-world applications of the E3S and one specific application for digital image processing are mapped and their execution time evaluated. In both cases, the obtained results are compared to those obtained with known general purpose algorithms for deadlock free routing. The comparison avers the effectiveness and superiority of the ant colony inspired routing.

Routing for applications in NoC using ACO-based algorithms

Networks-on-Chips (NoCs) have been used as an interesting option in design of communication infrastructures for embedded systems, providing a scalable structure and balancing the communication between cores. Because several data packets can be transmitted simultaneously through the network, an efficient routing strategy must be used in order to avoid congestion delays. In this paper, ant colony algorithms were used to find and optimize routes in a mesh-based NoC, where several randomly generated applications have been mapped. The routing optimization is driven by the minimization of total latency in packets transmission between tasks. The simulation results show the effectiveness of the ant colony inspired routing by comparing it with general purpose algorithms for deadlock free routing.