Reliable Routing Technique Research Articles

An Energy-Efficient and Reliable Opportunistic Routing for Wireless Sensor Networks

Introduction: Routing protocols in Wireless Sensor Networks (WSN) are of major concern because of the important factors like energy efficiency and reliability. Opportunistic Routing (OR) is the simplest and reliable routing technique for ad-hoc networks and WSN. The OR protocol guarantees data delivery in the network. As WSN need energy-efficient routing, therefore, energy- efficient OR protocols gained popularity in the last three years. Objectives: Opportunistic routing improves the performance of the network by utilizing the broadcasting abilities of wireless channels. In this paper, a new energy-efficient and reliable routing protocol has been proposed that is based on the opportunistic routing technique. Methods: The proposed protocol is based on the energy-efficient routing metric. The proposed OR protocol prioritizes among the candidate forwarders on the basis of energy-efficient routing metric and this will lead to the achievement of improved network lifetime. Results: The end-to-end delay is reduced because of the selection of candidate forwarders from the neighbor list of each node. The proposed protocol uses selective acknowledgment mechanisms. The simulation results of the proposed protocol depict the improved performance as compared to other recent OR protocols. Conclusion: The proposed protocol can directly be used with existing WSN applications. Further improvements can be made by utilizing more parameters like distance and the quality of transmission.

Parameter Based Efficient & Reliable Routing Technique to Enhance Network Lifetime for Vehicular Ad Hoc Networks

Some Inherent Vehicular Ad Hoc Networks (VANETs) characteristics such as intermittent connectivity, highly dynamic topology, and hard delay constraints, make data communication a challenging task in these networks. Due to such peculiarities, in this paper we study the impact of using vehicles predicted locations as a metric for data communication in VANETs. This paper deals with PBERR (Parameter Based Efficient Reliable Routing) for VANETs, which is a multilevel routing algorithm. The focus of this algorithm is 100% data transmission from end to end with no loss or drop of data packets by selecting the reliable path. The proposed algorithm will use the data of the digital maps to limit the scope of message exchanges in the shortest path for vehicles between source and destination. Our results clearly demonstrate the efficiency of the proposed solution in different scenarios, especially in terms of Network throughput, Energy consumption and Average delay.

Ensuring Reliable Communication in Disaster Recovery Operations with Reliable Routing Technique

The purpose of this research paper is to ensure reliable and continuous communication between the rescue officers and other people during disaster recovery and reconstruction operations. Most of the communication infrastructure gets damaged during the disaster and proper communication cannot be established in the area which leads to longer delays in emergency operations and increased damage to life and property. Various methods proposed to enable communication between the people using wireless ad hoc networks do not guarantee reliable delivery of data with fast moving devices. This paper presents a Reliable Routing Technique (RRT) that ensures reliable data delivery at the destination device even when the people with the mobile devices are moving in the network. We make use of the broadcasting property of the wireless network and create a priority list of probable forwarding candidates at each device. With this technique, RRT ensures that if a forwarder device is unable to forward the data packet due to movement of mobile devices, the next priority candidate forwards the data packet to the destination device, thus ensuring reliability of data delivery in the network. Simulation results show that RRT achieves significant performance improvement with better data delivery in ad hoc networks.

A Reliable Routing Technique for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are composed of tiny and miniaturized electronic devices which are known as sensors. Sensors can sense, compute, store, transmit and receive data of interests from the environment in which they are deployed. Due to small size of sensors, a big size battery source cannot be embedded into them therefore sensors need efficient mechanism for energy utilization. Many of the existing hierarchical routing protocols do not guarantee the optimum choice of cluster heads because of the lack of comprehensive consideration of the remaining energy of the nodes, the distribution within a cluster and the distribution among the clusters in the process of choosing the cluster heads. In addition, the single-hop communication among clusters head to a serious imbalance in the energy of the cluster heads. This paper combines the improved particle swarm clustering algorithm and the interclustering algorithm to form an Adaptive Energy Efficient Clustering routing Protocol (AECRP).Simulations results show that this protocol not only balances the energy consumption of the overall network, delays death time of the nodes, but also provides more reliable data delivery.

A fast and reliable routing technique for wireless mesh networks

AbstractIn wireless mesh networks (WMNs), real time communications (e.g., Voice over IP (VoIP) and interactive video communications) may often be interrupted as packets are frequently lost or delayed excessively. This usually happens due to the unreliability of wireless links or buffer overflows along the routing paths. The mesh connectivity within the WMN enables the capability to enhance reliability and reduce delay for such applications by using multiple paths for routing their packets. The vital components in multi‐path routing for achieving this are the pre‐determined formation of paths and the technique that the paths are deployed for packet traversal. Therefore, we propose a novel multi‐path routing protocol by introducing a new multi‐path organization and a traffic assignment technique. The designed technique dubbed as FLASH (Fast and reLiAble meSH routing protocol) discovers one primary path between a pair of source and destination based on a new proposed metric, and thereafter selects mini‐paths, which connect pairs of intermediate nodes along the primary path. The primary path and mini‐paths are concurrently deployed, as multiple copies of packets are routed through. This technique compensates for possible outage at intermediate wireless nodes or their corresponding wireless links along the primary path. Routing along mini‐paths is performed in such a way that redundant copies do not cause an excessive congestion on the network. The effectiveness of the proposed scheme is evaluated analytically and through extensive simulations under various load conditions. The results demonstrate the superiority of the proposed multi‐path organization in terms of reliability and satisfactory achievements of the protocol in enhancing delay and throughput compared to the existing routing protocols, especially for long distances and in congested conditions. Copyright © 2010 John Wiley & Sons, Ltd.