Hierarchical Routing Approach Research Articles

Implementation of Blockchain-Assisted Source Routing for Traffic Management in Software-Defined Networks

The control and infrastructure layers are split into Software-Defined Networks (SDNs). With the control and infrastructure planes split, new network applications may be developed with more simplicity and greater independence. On the other hand, the disadvantages of SDN create a slew of questions. In large-scale networks, such as Wide Area Networks (WANs) covering huge areas, more propagation delays substantially contribute to network convergence time. In addition, traditional SDN restricts network design flexibility due to the influence of controller location on network performance in large-scale networks. SDN-based source routing (SR) has emerged as a viable solution to the issues above, where the packet header field is used to specify a packet's route. This study presents an SR-based End-to-End (E2E) traffic management framework called SoRBlock. In SoRBlock, inter-domain routing uses blockchain technology, while intra-domain routing relies on the SR technique in SDNs. The simulation results show that the proposed SR-based SoRBlock framework outperforms the traditional hierarchical routing approach, HRA, in SDN networks by lowering path setup time (PST) and the number of controller messages. While the same (i.e., identical origin and target) service requests were used for all runs in the simulations, the proposed SoRBlock architecture presents almost three times less total PST between 45ms and 65ms than the HRA method between 130ms and 200ms due to the HRA approach's increased node-controller and controller-controller latencies. On the other hand, SoRBlock shows two times less PST ([75ms – 90ms]) than HRA ([150ms – 175ms]) when different service requests (i.e., different origin and target) were used. Concerning Controller Messages Processed (CMP), the HRA deals nearly 50% more controller messages between 7 and 15 than the SoRBlock between 3 and 10 when the number of domains varies, while the CMP in the SoRBlock scheme ([10 - 17]) approaches that in the HRA framework ([15 - 20]) regarding the ratio while the count of nodes rises in domains.

Performance evaluation of hierarchical clustering protocols with fuzzy C-means

The longevity of the network and the lack of resources are the main problems within the WSN. Minimizing energy dissipation and optimizing the lifespan of the WSN network are real challenges in the design of WSN routing protocols. Load balanced clustering increases the reliability of the system and enhances coordination between different nodes within the network. WSN is one of the main technologies dedicated to the detection, sensing, and monitoring of physical phenomena of the environment. For illustration, detection, and measurement of vibration, pressure, temperature, and sound. The WSN can be integrated into many domains, like street parking systems, smart roads, and industrial. This paper examines the efficiency of our two proposed clustering algorithms: Fuzzy C-means based hierarchical routing approach for homogeneous WSN (F-LEACH) and fuzzy distributed energy efficient clustering algorithm (F-DEEC) through a detailed comparison of WSN performance parameters such as the instability and stability duration, lifetime of the network, number of cluster heads per round and the number of alive nodes. The fuzzy C-means based on hierarchical routing approach is based on fuzzy C-means and low-energy adaptive clustering hierarchy (LEACH) protocol. The fuzzy distributed energy efficient clustering algorithm is based on fuzzy C-means and design of a distributed energy efficient clustering (DEEC) protocol. The technical capability of each protocol is measured according to the studied parameters.

An Efficient Routing Approach to Maximize the Lifetime of IoT-Based Wireless Sensor Networks in 5G and Beyond

The Internet of Things grew rapidly, and many services, applications, sensor-embedded electronic devices, and related protocols were created and are still being developed. The Internet of Things (IoT) allows physically existing things to see, hear, think, and perform a significant task by allowing them to interact with one another and exchange valuable knowledge when making decisions and caring out their vital tasks. The fifth-generation (5G) communications require that the Internet of Things (IoT) is aided greatly by wireless sensor networks, which serve as a permanent layer for it. A wireless sensor network comprises a collection of sensor nodes to monitor and transmit data to the destination known as the sink. The sink (or base station) is the endpoint of data transmission in every round. The major concerns of IoT-based WSNs are improving the network lifetime and energy efficiency. In the proposed system, Optimal Cluster-Based Routing (Optimal-CBR), the energy efficiency, and network lifetime are improved using a hierarchical routing approach for applications on the IoT in the 5G environment and beyond. The Optimal-CBR protocol uses the k-means algorithm for clustering the nodes and the multihop approach for chain routing. The clustering phase is invoked until two-thirds of the nodes are dead and then the chaining phase is invoked for the rest of the data transmission. The nodes are clustered using the basic k-means algorithm during the cluster phase and the highest energy of the node nearest to the centroid is selected as the cluster head (CH). The CH collects the packets from its members and forwards them to the base station (BS). During the chaining phase, since two-thirds of the nodes are dead and the residual energy is insufficient for clustering, the remaining nodes perform multihop routing to create chaining until the data are transmitted to the BS. This enriches the energy efficiency and the network lifespan, as found in both the theoretical and simulation analyses.

RETRACTED ARTCILE: Advertisement valid time triggered firefly and fruit-fly inspired approach for efficient cluster formation and standby CH selection in hierarchical wireless sensor network

A major concern in wireless sensor network (WSN) is energy efficiency as they utilize small sized batteries, which can neither be replaced nor be recharged. Hence, there are many research efforts in designing energy efficient hierarchical clustering model. Most of the hierarchical models have created improper clusters which induces increased communication overhead and quick depletion of energy in the network. In this paper, advertisement valid time triggered firefly and fruit-fly based bio-inspired algorithm is adapted in WSN for the efficient cluster formation and electing stand by CH to avoid unnecessary reelection process, respectively. These bio-inspired computational approaches ensure the formation of energy efficient hierarchical networking model. The firefly and fruit-fly based energy efficient routing protocol are implemented using the J-Sim tool and the effectiveness of algorithms are analyzed using the result parameters Viz. reelection, data delivery ratio, network lifetime and delay. Further, the results are compared with other variant Hierarchical routing approaches such as LEACH-FA, GA-ABC, and GWO. Our results demonstrate clear superiority of FA and FFA based clustering against other variant approaches.

A Hierarchical Heuristic Approach for Solving Air Traffic Scheduling and Routing Problem With a Novel Air Traffic Model

Efficient flight routing and scheduling play an important role in air traffic flow management, which aims to maximize the utilization of airport and enroute capacities to ensure safety and efficiency of air transportation. In this paper, we first propose a novel discrete-time flow dynamic model for an air traffic network, consisting of airports, waypoints, and air links, upon which we formulate an air flow routing and scheduling problem as an integer linear programming problem. Considering the NP-hard nature of the problem, we present a novel hierarchical flow routing and scheduling approach, where the hierarchical architecture is derived naturally from the network containment relationship, and computation is carried out in a bottom-up manner, which relies on an incremental strategy. On the resulting flow routes and schedules, a heuristic algorithm is carried out to determine flight plans for individual aircrafts. The effectiveness of the proposed hierarchical approach is illustrated by air traffic data in four flight information regions in the association of Southeast Asian nations.

Proactive data routing using controlled mobility of a mobile sink in Wireless Sensor Networks

Stationary sink based Wireless Sensor Networks (WSN) have issues like sink neighborhood problem, end-to-end delay, data delivery ratio, network lifetime, etc. Although several routing approaches with mobile sink have been introduced to mitigate those issues across the network, very few, have considered delay requirements of applications. In this paper, we propose an efficient virtual grid based hierarchical routing approach suitable for delay bound applications, which judiciously selects a mobile sink’s path by considering both hop counts and data generation rates of the sensor nodes, which reduces the overall energy consumption for multi-hop data communication. Data aggregation at each level of the hierarchy aims to reduce data traffic and increase throughput. The performance of the proposed protocol has been evaluated using simulation based on different metrics and compared with an existing routing protocol. Results have demonstrated that it performs better than the existing one while it still meets delay constraints of applications.

Inventory slack routing application in emergency logistics and relief distributions.

Various natural and manmade disasters during last decades have highlighted the need of further improving on governmental preparedness to emergency events, and a relief supplies distribution problem named Inventory Slack Routing Problem (ISRP) has received increasing attentions. In an ISRP, inventory slack is defined as the duration between reliefs arriving time and estimated inventory stock-out time. Hence, a larger inventory slack could grant more responsive time in facing of various factors (e.g., traffic congestion) that may lead to delivery lateness. In this study, the relief distribution problem is formulated as an optimization model that maximize the minimum slack among all dispensing sites. To efficiently solve this problem, we propose a two-stage approach to tackle the vehicle routing and relief allocation sub-problems. By analyzing the inter-relations between these two sub-problems, a new objective function considering both delivery durations and dispensing rates of demand sites is applied in the first stage to design the vehicle routes. A hierarchical routing approach and a sweep approach are also proposed in this stage. Given the vehicle routing plan, the relief allocation could be easily solved in the second stage. Numerical experiment with a comparison of multi-vehicle Traveling Salesman Problem (TSP) has demonstrated the need of ISRP and the capability of the proposed solution approaches.

Energy Optimization of Routing Protocols in Wireless Sensor Networks

The hierarchical routing of data in WSNs is a specific class of routing protocols it encompasses solutions that take a restructuring of the physical network in a logical hierarchy system for the optimization of the consum-ption of energy. Several hierarchical routing solutions proposed, namely: the protocol LEACH (Low Energy Adaptive Clustering Hierarchy) consist of dividing the network in distributed clusters at one pop in order of faster data delivery and PEGASIS protocol (Power-Efficient Gathering in Sensor Information Systems) which uses the principle of constructing a chain’s sensor node. Our contribution consists of a hierarchical routing protocol, which is the minimization of the energy consumption by reducing the transmission distance of data and reducing the data delivery time. Our solution combines the two hierarchical routing approaches: chain based approach and the cluster based approach. Our approach allows for multi-hop communications, intra- and intercluster, and a collaborative aggregation of data in each Cluster, and a collaborative aggregation of data at each sensor node<strong>.</strong>

Hierarchical routing algorithm for ad hoc networks using mobile VMN

One of the most significant challenges introduced by routing protocol in mobile networks is coping with the unpredictable motion and the unreliable behaviour of mobile nodes. In this paper, we present a hierarchical routing algorithm based on virtual mobile node VMN. A routing path can be found rapidly by exchanging path information between VMNs without accurate topology information. We discuss the routing process and the implementing details of the proposed routing algorithm. Finally, we evaluate the performance of our hierarchical routing algorithm through simulations, and the results show that the number of mobile WAVE generated by routing algorithm is well satisfied with the quality of service QoS requirements of all source and destination nodes. Furthermore, we compare the performance on VMN failure and message delivery ratio using hierarchical and non-hierarchical routing approaches, the results show that we can obtain magnitude better performance by HRA-VMN than hierarchical state routing HSR and non-hierarchical routing approach.

Sefp: A New Routing Approach Using Fuzzy Logic For Clustered Heterogeneous Wireless Sensor Networks

Abstract Wireless sensor networks (WSNs) are composed of set sensor nodes communicating through wireless channels with limited resources. Therefore, several routing protocols and approaches about energy efficient operation of WSNs have been proposed. Clustering algorithm based routing protocols are well used for efficient management of sensing sensor node energy resources. However, many researches were focused on optimization of well-known hierarchical routing approaches of WSNs using fuzzy logic system or heuristic methods. Most of these routing approaches haven’t considered the impact of heterogeneity of sensor nodes, in terms of their energy which is equipped with additional energy resources. In this paper, we propose stable election using three fuzzy parameters approach (SEFP) using fuzzy logic system for heterogeneous WSNs. The main purpose of this routing approach is to improve the network lifetime and particularly the stability period of the network. In the SEFP approach, the sensor node with the maximum chance value becomes a cluster head (CH) based in three fuzzy parameters such as residual energy of each sensor node, closeness to base station (BS), and sum of distances between particular sensor node and other sensor nodes (area distance). The Simulation results of heterogeneous WSNs shows that our approach using fuzzy logic system always preserves more energy as compared to well-known protocols such as LEACH and SEP. additionally, we found that our approach SEFP outperforms LEACH and SEP protocols in prolonging the lifetime and the stability period for heterogeneous WSNs

CHRA: a coloring based hierarchical routing algorithm

Graph coloring was exploited in wireless sensor networks to solve many optimization problems, mainly related to channel assignment. In this paper, we propose to use coloring to jointly manage channel access and routing to the sink. We introduce CHRA, a coloring based hierarchical routing approach. Coloring is exploited to avoid interferences and also to schedule nodes transmissions to the sink. We provide an analytical study assessing the performance of CHRA and present an investigation of various coloring heuristics to study their impact on CHRA performances on maintaining the network connectivity and coverage, while reducing the energy consumption.

Coloring based Hierarchical Routing Approach

Graph coloring was exploited in wireless sensor networks to solve many optimization problems. These problems are related in general to channel assignment. In this paper, we propose to jointly use coloring for routing purposes. We introduce CHRA a coloring based hierarchical routing approach. Coloring is exploited to avoid interferences and also to schedule nodes transmissions to sink. We provide an analytical and experimental study assessing the performance of CHRA in terms of end-to-end delay and energy consumption. In particular, we find that CHRA performs better than LEACH, a well established hierarchical routing protocol.

Energy-efficient and reliable data delivery in wireless sensor networks

Clustering has been used as one of energy-efficient mechanisms for data routing in wireless sensor networks. In hierarchical routing approaches, cluster heads are responsible for management (e.g. data aggregation, queries dispatch) and transmission of the collected data in the region controlled by them. For efficient data delivery, several researches have proposed various mechanisms for cluster organization and cluster head selection. However, less focus is given in the area of data transmission associated with Base Station (BS). In such a situation, any failure or packet loss may lead to considerable packet loss. For solving this problem, we propose an efficient data routing scheme for controlling data delivery from nodes to BS. In our proposed approach every node is aware about the link quality of all nodes and is able to deliver data to the BS through the most reliable and energy-efficient route.

An addressing independent networking structure favorable for all-optical packet switching

All-optical packet switching (AOPS) technology is essential to fully utilize the tremendous bandwidth provided by advanced optical communication techniques through forwarding packets in optical domain for the next generation network. However, long packet headers and other complex operations such as table lookup and packet header re-writing still have to be processed electronically for lack of cost-effective optical processing techniques. This not only increases system complexity but also limits packet forwarding speed due to optical-electronic-optical conversion. Lots of work of improving optical processing techniques to realize AOPS is reported in the literature. Differently, this paper proposes a new networking structure to facilitate AOPS realization and support various existing networks through simplifying networking operations. This structure only requires an AOPS node to process a short packet header to forward packets across it with neither table lookup nor header re-writing. Furthermore, it moves high layer addressing issues from packet forwarding mechanisms of routers. Consequently, any changes in addressing schemes such as address space extension do not require changes in the AOPS nodes. It can also support both connection-oriented and connectionless services to carry various types of traffic such as ATM and IP traffic. This structure is mainly based on the hierarchical source routing approach. The analytical results show that average packet header sizes are still acceptable even for long paths consisting of many nodes each of which has a large number of output ports.

An ILP based hierarchical global routing approach for VLSI ASIC design

The use of integrated circuits in high-performance computing, telecommunications, and consumer electronics has been growing at a very fast pace. The level of integration as measured by the number of logic gates in a chip has been steadily rising due to the rapid progress in processing and interconnect technology. The interconnect delay in VLSI circuits has become a critical determiner of circuit performance. As a result, circuit layout is starting to play a more important role in today’s chip designs. Global routing is one of the key sub-problems of circuit layout which involves finding an approximate path for the wires connecting the elements of the circuit without violating resource constraints. In this paper, several integer programming (ILP) based global routing models are fully investigated and explored. The resulting ILP problem is relaxed and solved as a linear programming (LP) problem followed by a rounding heuristic to obtain an integer solution. Experimental results obtained show that the proposed combined WVEM (wirelength, via, edge capacity) model can optimize several global routing objectives simultaneously and effectively. In addition, several hierarchical methods are combined with the proposed flat ILP based global router to reduce the CPU time by about 66% on average for edge capacity model (ECM).

A hierarchical routing approach for optical transport networks

Although the automatically switched optical networks (ASON) specifications strongly recommend a hierarchical network architecture for these networks, this is still an open issue. The hierarchical network concept involves several mechanisms mainly related with signaling and routing, such as the aggregation scheme, the dissemination process, the updating policy and the routing algorithms. The existing mechanisms for flat networks must be substantially modified to be applied to a hierarchical network architecture. In this paper, authors propose a complete hierarchical routing approach mainly focusing on routing concerns, aiming to optimize the global network performance while guaranteeing scalability.

Scalable routing protocols for mobile ad hoc networks

The growing interest in mobile ad hoc network techniques has resulted in many routing protocol proposals. Scalability issues in ad hoc networks are attracting increasing attention these days. We survey the routing protocols that address scalability. The routing protocols included in the survey fall into three categories: flat routing protocols; hierarchical routing approaches; GPS augmented geographical routing schemes. The article compares the scalability properties and operational features of the protocols and discusses challenges in future routing protocol designs.