Efficient Path Selection Research Articles

Region Aware Proactive Routing Approaches Exploiting Energy Efficient Paths for Void Hole Avoidance in Underwater WSNs

Nowadays, constrained battery life expectancy is an important issue for reliable data delivery in an Underwater Wireless Sensor Network (UWSN). Conventional transmission methodologies increase the transmission overhead, i.e., the collision of packets, which influence the data transmission. Replacement of the sensors' battery in brutal underwater environment is a difficult task. Therefore, to maintain a strategic distance from the unexpected failure of the network and to increase the life expectancy of the network, energy efficient routing protocols are required. At this end, in this paper, a proactive routing protocol with three different network types is proposed to solve the aforementioned issues. The proposed protocol adaptively changes its communication strategy depending on the type of the network, i.e., dense network, partially dense network and sparse network. This adaptive strategy helps the routing protocols to continue their transmission by avoiding the void holes. In the proposed protocol named Proactive routing Approach with Energy efficient Path Selection (PA-EPS-Case I), vertical inter-transmission layering concept is introduced (using shortest and fastest path) in the dense and partially dense region. In addition, cluster formation concept is also appended to make transmission successful in the sparse regions. The Packet Delivery Ratio (PDR) is improved by the proposed protocol with minimum End to End (E2E) delay and packet drop ratio. Scalability of the proposed routing protocols is also analyzed by varying the number of nodes from 100-500. A comparative analysis is performed with two cutting edge routing protocols namely: Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) and Cluster-based WDFAD-DBR (C-DBR). Simulation results demonstrate that proposed protocol achieved 12.64% higher PDR with 20% decrease in E2E delay than C-DBR. Furthermore, the proposed routing protocol outperformed C-DBR in terms of packet drop ratio up to 14.29% with an increase of EC up to 30%.

A Clique Based Bandwidth Computation for Consistent Routing in Wireless Mesh Networks

A wireless mesh network has a more planned configuration, and may be deployed to provide dynamic and cost effective co n- nectivity over a certain geographic area. In this paper, we use the existing methods for calculating the bandwidth of a path for wireless networks and using it we provide an efficient path selection and packet forwarding mechanisms. The main objective of the paper is to provide a quality of service and at the same time utilise the bandwidth efficiently. The interference problem makes it difficult for computation of the available bandwidth for a particular route. In this paper the concept of composite available bandwidth is used along with clique based bandwidth computation. In this paper we will be using AODV routing protocol along with a distributed packet forwarding scheme and we will also find the no of hops to be stored in a packet for the distributed pack- et forwarding scheme based on expected transmission hops.

An Efficient power utilization approach with secure data transmission to maximize the life time of wireless sensor network with the help of duty cycle mechanism

Lifetime enhancement has always been a crucial issue as most of the wireless sensor networks (WSNs) operate in unattended environment where human access and monitoring are practically infeasible. Clustering is one of the most powerful techniques that can arrange the system operation in associated manner to attend the network scalability, minimize energy consumption and achieve prolonged network lifetime. An efficient path selection will reduce energy utilization on data transmission phase at this time data should be secure, by using RSA algorithm. In this paper, clustering mechanism and improvement in security is proposed. These two methods are used to decrease the energy consumption at data transmission phase and ensuring the security of the sensor data over wireless sensor .Key based security mechanism is used to secure the data. To ensure that any energy consumption associated with the role of the cluster head (CH) is shared between the nodes, the cluster head (CH) role is alternated between the nodes using duty cycle mechanism.

Dragon: Scalable, Flexible, and Efficient Traffic Engineering in Software Defined ISP Networks

To optimize network cost, performance, and reliability, SDN advocates for centralized traffic engineering (TE) that enables more efficient path and egress point selection as well as bandwidth allocation. In this paper, we argue SDN-based TE for ISP networks can be very challenging. First, ISP networks often are very large in size, imposing significant scalability challenges to the centralized TE. Second, ISP networks usually have diverse types of links, switches, and cost models, leading to a complex combination of optimizations. Third, ISP networks not only have many choices of internal paths but also include rich selections of egress points and interdomain routes, unlike cloud/enterprise networks. To overcome these challenges, we present a novel TE application framework, called Dragon, for existing SDN control planes. To address the scalability challenge, Dragon consists of hierarchical and recursive TE algorithms and mechanisms that divide flow optimization problems into subtasks and execute them in parallel. Further, Dragon allows ISPs to express diverse objectives for different parts of their network. Finally, we extend Dragon to jointly optimize the selection of intradomain and interdomain paths. Using extensive evaluation on real topologies and prototyping with SDN controller and switches, we demonstrate that Dragon outperforms existing TE methods both in speed and optimality.

Improving performance in mobile ad hoc networks by reliable path selection routing using RPS‐LEACH

SummaryVitality reliant and mobility are the two factors that deplete some measure of energy during the radio communication often occur in Mobile Ad hoc Network (MANET) among and between the nodes. Since MANET is a decentralized system, it poses to the exploitation of energy during the reliable path selection during routing. Hence, selection of protocol plays a major aspect in MANET for combatting against the energy depletion of nodes, Instable link, mobility character, and load balancing. The RPS‐LEACH protocol is proposed in this paper for the efficient path selection by organizing the nodes into clusters. For each cluster, Cluster Head (CH) is elected based on its strong transmission power and battery life. The Cluster Members (CM) is organized, respectively, based on its ability to respond to its cluster head REQs. Mainly, RPS values are calculated by the two parameters such as (i) successful interactions and (ii) unsuccessful interactions. In the proposed system, RPS (Reliable Path Selection) values are exchanged among the nodes for the reliable path selection by choosing the highest RPS value node for its communication. Hence, by adopting the RPS scheme, the nodes are able to choose the most reliable path for the efficient data transfer by exchanging the RPS values by ignoring the paths that consuming long time to transfer the data. In this procedure, correspondence convention, which comprises imperative impact of vitality liberality of such networks, is addressed. In cases of applications with no predefined or intended infrastructure, this scheme paves way for the versatile hubs to perform as the energy efficient routing nodes. Simulation carried out in NS2 and results shown improved performance when compared with LDTS and RPS‐LEACH.

Topology adaption for the quantum Internet

In the quantum repeater networks of the quantum Internet, the varying stability of entangled quantum links makes dynamic topology adaption an emerging issue. Here we define an efficient topology adaption method for quantum repeater networks. The model assumes the random failures of entangled links and several parallel demands from legal users. The shortest path defines a set of entangled links for which the probability of stability is above a critical threshold. The scheme is utilized in a base-graph of the overlay quantum network to provide an efficient shortest path selection for the demands of all users of the network. We study the problem of entanglement assignment in a quantum repeater network, prove its computational complexity, and show an optimization procedure. The results are particularly convenient for future quantum networking, quantum-Internet, and experimental long-distance quantum communications.

Sharing sequential values in a network

Consider a sequential process where agents have individual values at every possible step. A planner is in charge of selecting steps and distributing the accumulated aggregate values among a number of agents. We model this process by a directed network, whereby each edge is associated with a vector of individual values. This model applies to several new and existing problems, e.g. developing a connected public facility and distributing total values received by surrounding districts, selecting a long-term production project and sharing final profits among partners of a firm, or choosing a machine schedule to serve different tasks and distributing total benefits among task owners.Herein, we provide the first axiomatic study on path selection and value-sharing in networks. We consider four sets of axioms from different perspectives, including those related to (1) the sequential consistency of value-sharing; (2) the monotonicity of value-sharing with respect to technology improvements; (3) the independence of value-sharing with respect to certain network transformations; and (4) the robust implementation of the efficient path selection when the planner has no information about network configuration. Surprisingly, these four disparate sets of axioms characterize similar classes of solutions, namely selecting an efficient path(s) and assigning to each agent a share of total values that is independent of individual values. Furthermore, we characterize more general solutions that depend on individual values.

ENERGY EFFICIENT PATH SELECTION (EEPS) OF MOBISINK FOR EFFICIENT DATA COLLECTION IN WSN

WSNs are considered as the most promising technologies of this decade. The major objective of sensor nodes is to gather information from distinct places where other mechanism cannot be applied. However, the huge challenge is in collecting of data which is scattered across the network. Energy also plays a significant role in deciding an optimized route to collect this data spread across the network. This problem is analyzed and provided an efficient solution in the proposed algorithm. Energy Efficient Path Selection (EEPS) is introduced that will help in forming a efficient path selection for MobiSink to traverse through the network. An intelligent layer is defined which will find data collection points (DCP) in advance in the network. Current research works focus on how to reduce the energy of sensor nodes to increase the lifetime of the network. But, advance identification mobile sink's moving trajectory not only optimizes the energy consumption, but also reduces the latency. The proposed algorithms and protocols are validated through simulation experiments using Network Simulator (NS2).

A QOS AWARE MULTICAST ROUTING PROTOCOL FOR CONSTRUCTING AN OPTIMAL PATH FOR MULTIMEDIA TRAFFIC IN WIRELESS SENSOR NETWORKS

Wireless Sensor Networks (WSNs) are communication networks having tiny sensors with sensing and transmitting capabilities . These systems adopting traditional routing protocols to organize communication, have design issues, and quality of service is still a challenging research factor. The key idea of this research is to discover the most efficient routing protocols based on the design of a reliable and efficient routing protocol to determine quality of services in a WSN. In this paper we propose a reliable and efficient path selection strategy by designing a Quality of Service Aware multicast routing protocol. This protocol discusses the multicast routing problem of WSN with multiple QoS constraints, by discovering a minimum resource consumption path while satisfying multiple constraints optimization conditions. Simulation results show that the fair link selection strategy can yield to a good solution for this traditionally NP complex problem, as compared to the best multicast algorithms known.

ESPS: Efficient Stable Path Selection Approach for Improved Network Performance

ESPS: Efficient Stable Path Selection Approach for Improved Network Performance

An Efficient False Path-Aware Heuristic Critical Path Selection Method with High Coverage of the Process Variation Space

In this article, we present a critical path selection method that efficiently finds true (sensitizable) critical paths of a circuit in the presence of process variations. The method, which is based on the viability analysis, tries to select the least number of true critical paths that cover all of circuit critical gates. Critical gates are those that make a path critical with a probability higher than a predefined threshold value. Selecting fewer critical paths leads to less computation time for the algorithm and shorter test time of fabricated chips. For this purpose, an efficient Statistical Static Timing Analysis– (SSTA) based technique is suggested. This technique tries to find circuit-critical gates whose process parameter variations cover a major part of the process space. Improving the process space coverage using fewer paths is achieved by considering both spatial (proximity of gates) and structural (having common gates) correlations in the analysis of choosing the critical paths. In the selection process, paths with low similarities in their characteristics are preferred. In addition, only true paths whose delays affect the maximum delay of the circuit are included. The selected paths can be used in the test process of the fabricated chips to determine if the chip meets its timing requirements. Also, a modified viability analysis that incorporates statistical computations is used in the SSTA. The efficacy of the proposed method is evaluated by comparing its results for combinational and sequential ISCAS benchmarks with those obtained by exhaustive search. Results indicate although, on average, only 4.38% of all the critical paths found by the exhaustive search are selected by the proposed method, the maximum probability of criticality for the paths that are not considered in our method is, on average, less than 4%.

An Improved Energy Efficient Duty Cycling Algorithm for IoT based Precision Agriculture

There is an increasing focus on IoT based precision agriculture to increase the productivity and yield in the farm fields through real-time monitoring of agriculture field parameters. The data in the farm field is collected using sensors such soil sensor, temperature and humidity sensor, air quality sensor, and video camera mounted on drones. The data from each sensor is then aggregated at the base station and forwarded to a gateway. Recent research work conducted by Microsoft on IoT based precision agriculture has reported that designing the energy efficient data aggregation method for such IoT based networks is one of the classical research challenges. In this paper, we proposed a duty cycling data aggregation algorithm to improve energy efficiency performance of the base station. The proposed improved duty cycling algorithm reduces the energy consumption in special events such as cloudy weather. To further optimize the reliability and network lifetime, we proposed the efficient path selection approach based on the residual energy parameters. To evaluate the performance merit, we conducted simulations in Network Simulator (ns2). Network Simulator is an event driven tool which is widely used for research studies. The performance of various algorithms is compared using No Duty Cycling (NDC), Duty Cycling (DC) and the proposed Improved Duty Cycling algorithms (IDC). The results show that the proposed IDC outperforms the other two algorithms.

Energy efficient path selection for mobile sink and data gathering in wireless sensor networks

Mobile sink (MS) has drawn significant attention for solving hot spot problem (also known as energy hole problem) that results from multihop data collection using static sink in wireless sensor networks (WSNs). MS is regarded as a potential solution towards this problem as it significantly reduces energy consumption of the sensor nodes and thus enhances network lifetime. In this paper, we first propose an algorithm for designing efficient trajectory for MS, based on rendezvous points (RPs). We next propose another algorithm for the same problem which considers delay bound path formation of the MS. Both the algorithms use k-means clustering and a weight function by considering several network parameters for efficient selection of the RPs by ensuring the coverage of the entire network. We also propose an MS scheduling technique for effective data gathering. The effectiveness of the proposed algorithms is demonstrated through rigorous simulations and comparisons with some of the existing algorithms over several performance metrics.

Efficient Load Sharing using Multipath Channel Awareness Routing in Mobile Ad hoc Networks

Objectives: To develop a new multipath load sharing algorithm using channels sensing, node energy level analysis and malicious node detection. It aims at finding an efficient load sharing technique that gives better throughput delivery, less delay and security for data transformation. Methods/Analysis: A channel sensing between the nodes is performed to measure the signal to noise ratio and reject the path if the noise strength is greater than the signal strength. Prior energy level analysis is done for consistent data transmission over a period of time without any interrupt. A watchdog timer method is adopted for malicious node identification and removal. Findings: The quality of service in MANETs has been improved such as throughput has been increased 15% and packet delivery ratio has been increased 20% and the overall delay has been minimized 27%. Conclusion/Application: We proposed an efficient best path selection load sharing algorithm, which involves channel sensing, node energy level analysis and malicious node removal for security concern.

Low cost fault-tolerant routing algorithm for Networks-on-Chip

A novel adaptive routing algorithm – Efficient Dynamic Adaptive Routing (EDAR) is proposed to provide a fault-tolerant capability for Networks-on-Chip (NoC) via an efficient routing path selection mechanism. It is based on a weighted path selection strategy, which exploits the status of real-time NoC traffic made available via monitor modules. The key performance goal is to maintain throughput under congested and faulty conditions via effective routing path decisions. In the proposed EDAR, port weights are calculated in real-time according to the channel status – Idle/Busy/Congested/Faulty, and the port with the lowest weighting is ranked as the near-optimal route to forward packets. This mechanism enables the router to bypass congested ports and tolerate faulty ports. To assess the latency and throughput of the proposed routing algorithm, several traffic patterns for both fault-free and faulty NoCs were evaluated. Results show that EDAR can achieve higher throughput compared to other state of the art routing algorithms under various traffic patterns and levels of injected faults. In addition, the hardware area overhead for EDAR is demonstrated to have a reasonably low cost which maintains scalability for large NoC implementations.

Efficient Path Selection Routing based on Traffic-Size for Mobile Ad Hoc Networks

Routing in Mobile Ad hoc Networks (MANETs) is a complex one due to the absence of any central coordinator and infrastructure. Congestion is one of the prominent reasons for link-failure in network due to the heavy traffic which leads to failure of nodes, network partition and topology change. Due to power drainage among nodes, network topology changes and the nodes should be well adaptive to respond quickly to the changes. Various existing routing protocols forward the data packets towards the destination through the path having less number of hop counts. However, these protocols do not minimize the traffic load in the network and thus causes congestion which reduces the network operation. A routing protocol called Efficient Path Selection (EPS) is proposed which enhances the quality of services' issues such as Packet Delivery Ratio, End to End delay, Energy Consumption and also provide secure transmission of data packets. This paper provides secure and efficient path routing. The simulation signifies that proposed protocol provides reliable secure transmission than the existing Implicit Source Routing (ISR) protocol.

Efficient Path Selection and Data Transmission Using Queue in Open Shortest Path First

In network, information apportioning occurs between one communication points to another using TCP protocol. The collected data are shared among many users via Single Router or Access Point (AP). During routing, traffic is occurred in the network and that is known as Random Early Detection (RED). In order to overcome this, an alternative path must be preferred by using Alternative Path Selection method which utilizes the Queue Process (FIFO). In case the queue is full, it chooses an alternative queue by using channel sensing mode of path selection. Here, we use OSPF (Open Shortest Path First) which selects the shortest path in short period of time and also it delivers the data to the particular destination. However, delay is reduced in OSPF. Hence, efficiency and overall network lifetime is increased. Finally, the network performance is evaluated.

SmartPATH: An Efficient Hybrid ACO-GA Algorithm for Solving the Global Path Planning Problem of Mobile Robots

Path planning is a fundamental optimization problem that is crucial for the navigation of a mobile robot. Among the vast array of optimization approaches, we focus in this paper on Ant Colony Optimization (ACO) and Genetic Algorithms (GA) for solving the global path planning problem in a static environment, considering their effectiveness in solving such a problem. Our objective is to design an efficient hybrid algorithm that takes profit of the advantages of both ACO and GA approaches for the sake of maximizing the chance to find the optimal path even under real-time constraints. In this paper, we present smartPATH, a new hybrid ACO-GA algorithm that relies on the combination of an improved ACO algorithm (IACO) for efficient and fast path selection, and a modified crossover operator to reduce the risk of falling into a local minimum. We demonstrate through extensive simulations that smartPATH outperforms classical ACO (CACO), GA algorithms. It also outperforms the Dijkstra exact method in solving the path planning problem for large graph environments. It improves the solution quality up to 57% in comparison with CACO and reduces the execution time up to 83% as compared to Dijkstra for large and dense graphs. In addition, the experimental results on a real robot shows that smartPATH finds the optimal path with a probability up to 80% with a small gap not exceeding 1m in 98%.

A study on efficient path selection algorithms for propagating data messages with a goal of optimising energy dissipation in WSN

Energy saving is one of the biggest challenges in wireless sensor networks (WSNs). The original Directed Diffusion algorithm chooses the best (shortest) path to transmit data from the source node to the destination (sink) node. In this algorithm, a particular set of nodes could be used more frequently, for message transmission. So, owing to high congestions, the energy of those nodes might get exhausted and an energy hole may be created. But if the message transmission load is distributed by considering both the parameters, namely the remaining energy and the remaining path length, then the problem could be solved. In this paper, we suggest a scheme for reducing energy dissipation in WSN. The scheme is an extension of the concept introduced in Hwang et al. (2006). We provide theoretical analysis to prove the efficiency of the proposed scheme. We also provide theoretical basis of choosing the values of certain parameters for optimising energy dissipation in the network.

An Energy Efficient Acknowledgement Based Ids For Manet

Mobile adhoc network is an infrastructureless network with a dynamic native where the nodes are free to move and hence it is susceptible to various attacks. Previous system is an acknowledgement based intrusion detection system where there is a high energy condumption due to the inefficient path selection where the selected nodes energy is drained before completing the communication and also due to the flooding of hello packets to unavailable nodes. The previous IDS also has the disadvantage of pre distribution of keys which can be easily accessed by the malicious attacker which can forge the acknowledgement packets which is confirming the packet delivery. The acknowledgement packet is when forged, the false information will be delivered to the source about the honest nodes which has already successfully forwarded the packet. This project deals with the problem of high energy consumption and also attack caused by pre distribution of the keys. The acknowledgement packets are digitally signed using a session key in order to avoid the forging of the acknowledgement packets. The energy consumption is reduced by using an energy efficient path selection method where efficient nodes are selected and also by suppressing the hello packets which is sent to the unavailable nodes. Simulation tool used in this project is ns2.35 .Simulation result shows that the proposed scheme provide a reasonably good level of security and reduced energy consumption than the existing system.This system is used in the military applications,banking etc.