Routing Protocol For Wireless Networks Research Articles

A Review: Mobile AdQ Hoc Routing Protocols

Mobile adhoc network is defined as multi-hop radio relaying and are capable of operating without the support of any fixed infrastructure. The absence of any central coordinator makes the routing complex as compared to cellular networks. Ad hoc wireless network consist of multi-hop wireless link with distributing routing. Selforganizing and maintenance are built properties for ad hoc wireless network. The main aim of routing in ad hoc network is to find path with minimum overheads and amendment of broken paths. Time synchronization is difficult in ad hoc wireless networks. Section 1 and section 2 alleged the brief introduction of adhoc wireless network and different routing protocols used for routing in MANET's. Section 3 depicted the characteristics of an ideal routing protocol. Section 4 portrayed some of the previous work done in MANET and last is conclusion given in section 5.

Selection of preferred routing protocols of wireless sensor and actuator network nodes

The problems of routing to search for energy efficiency-optimal routes are important in wireless sensor and actuator networks. This determines the relevance of selecting a preferred option among many different routing protocols for a specific implementation. The paper considers the practical features of applying the analytic hierarchy process to select the preferred routing protocol for wireless sensor and actuator networks. A comparative analysis of the characteristics of existing routing protocols in sensor networks is performed. Experts provided paired comparisons of characteristics of 11 routing protocols. The paired comparison matrices, which allowed computing the eigenvector and priority vector components are formed. According to the maximum values of the priority vector components, the preferred routing protocol - GEAR (Geographical and Energy-Aware Routing) is selected for use in field sensor and actuator networks with localization of elements. The results confirm the applicability of the analytic hierarchy process to select the preferred routing protocol in the design of sensor and actuator networks taking into account the specified implementation requirements.

QMRPRNS: Design of QoS multicast routing protocol using reliable node selection scheme for MANETs

A mobile Ad-Hoc networks (MANETs) is a continuously self-configuring, infrastructure-less network of wireless mobile devices. In which multicast is one of the efficient way of communication. Currently, several research have been conducted to design multicast routing protocols for wireless mobile ad-hoc networks (MANETs). Multicasting is a technique that allow to send the same message to a group of destinations simultaneously. However, it faces several challenges against its implementation in ad-hoc network due to its dynamic nature, lack of bandwidth, short battery lifetime of the mobile devices. The multicast routing protocol MAODV have several constraints as mentioned above. Hence to address these constraints a reliable neighbour nodes selection scheme has been integrated over MAODV. This paper attempt a Quality of Service (QoS) based multicast routing protocol using reliable neighbour nodes selection scheme (QMRPRNS) for same. The simulation has been conducted to compare the performance of the proposed scheme against some existing multicast routing protocols which shows significant improvement over EMAODV and MAODV.

FAMACROW: Fuzzy and ant colony optimization based combined mac, routing, and unequal clustering cross-layer protocol for wireless sensor networks

This paper presents Fuzzy and Ant Colony Optimization Based Combined MAC, Routing, and Unequal Clustering Cross-Layer Protocol for Wireless Sensor Networks (FAMACROW) consisting of several nodes that send sensed data to a Master Station. FAMACROW incorporates cluster head selection, clustering, and inter-cluster routing protocols. FAMACROW uses fuzzy logic with residual energy, number of neighboring nodes, and quality of communication link as input variables for cluster head selection. To avoid hot spots problem, FAMACROW uses an unequal clustering mechanism with clusters closer to MS having smaller sizes than those far from it. FAMACROW uses Ant Colony Optimization based technique for reliable and energy-efficient inter-cluster multi-hop routing from cluster heads to MS. The inter-cluster routing protocol decides relay node considering its: (i) distance from current cluster head and that from MS (for energy-efficient inter-cluster communication), (ii) residual energy (for energy distribution across the network), (iii) queue length (for congestion control), (iv) delivery likelihood (for reliable communication). A comparative analysis of FAMACROW with Unequal Cluster Based Routing [33], Unequal Layered Clustering Approach [43], Energy Aware Unequal Clustering using Fuzzy logic [37] and Improved Fuzzy Unequal Clustering [35] shows that FAMACROW is 41% more energy-efficient, has 75–88% more network lifetime and sends 82% more packets compared to Improved Fuzzy Unequal Clustering protocol.

Scalable approach in Greedy Perimeter Stateless Routing

Greedy perimeter stateless routing (GPSR), a scalable routing protocol for wireless sensor networks (WSNs) that use the randomized positioning of routers in different configurations and algorithms are used to make packet delivery decisions through nodes. As the number of destinations increases this protocol scales better in per-router state than shortest-path and ad-hoc routing protocols. Because of scalable topology property in GPSR, it uses local topology (e.g. star, ring) to find out new and correct routes quickly as per demand. In this paper, we describe the GPSR protocol and optimization of mobile wireless networks to compare its performance based on changes in topology. Our simulation elaborates GPSR‟s scalability on densely deployed wireless networks based on route adaptability.

Backpressure-based routing and scheduling protocols for wireless multihop networks: A survey

Backpressure-based routing and scheduling has been considered as a promising strategy for efficient resource allocation in wireless multihop networks. It has many attractive features such as throughput optimality, achievable adaptive resource allocation, support for agile load-aware routing, and simplicity. In this article, we first categorize existing backpressure-based protocols based on different design criteria and then summarize several key issues faced in the design of efficient backpressure-based protocols. We present a comprehensive survey of state-of-theart backpressure-based protocols for wireless multihop networks. We illustrate how each of the protocols works, and discuss their merits and deficiencies. Finally, we point out some future directions for supporting efficient backpressure- based routing and scheduling.

Location-aided and secure routing protocol for heterogeneous multi-hop wireless networks

Most of the existing routing protocols for heterogeneous multi-hop wireless networks (HWMNs) use on-demand routing protocols owing to their suitability for dynamic topology environments, but it causes wastes of network resources with large number of data packets being broadcast. Furthermore, some nodes in heterogeneous wireless multi-hop networksmay be malicious or selfish nodes which can easily lead to link attacks. A novel routing protocol called trust-based secure routing protocol with auxiliary of nodes' location information (TSRAL) is proposed for the establishment of a secure routing protocol with a lower overhead for HWMNs which combines the location information and trust value of nodes to select the next forwarding nodes. The destination node selects an optimal path from multiple paths according to the total trust value and the hop number of routes. Simulation results demonstrate that TSRAL can not only reduce the number of hops and data packets being broadcast in the process of routing but also ensure the safety of the route.

3D Real-Time Routing Protocol With Tunable Parameters for Wireless Sensor Networks

A novel 3D real-time geographical routing protocol (3DRTGP) for wireless sensor networks is presented in this paper. 3DRTGP controls the number of forwarding nodes in the network by limiting forwarding to a unique packet forwarding region (PFR). PFR selection is based on the network density around each of the forwarding nodes, which reduces the number of redundant packet transmissions, collisions, and congestion. This enables 3DRTGP to meet the real-time requirements of a time sensitive application. In order to meet the packet delivery delay deadline, a forwarding node uses its own delay parameters, such as queuing and processing delays, and the expected number of hops to the destination to make a forwarding decision. 3DRTGP does not require an explicit exchange of neighboring information, such as location information. 3DRTGP is evaluated through extensive simulations under various network densities and traffic load conditions, which provides network tuning parameters to meet the real-time requirements of applications. 3DRTGP heuristically solves the void node problem (VNP) in 3-D deployments. It is demonstrated that 3DRTGP resolves VNP given that there is no network partitioning. 3DRTGP significantly outperforms similar 3-D geographical routing protocols in terms of end-to-end delay and miss ratio.

Supervisory routing control for dynamic load balancing in low data rate wireless sensor networks

Routing protocols for Wireless Sensor Networks (WSN) are designed to select parent nodes so that data packets can reach their destination in a timely and efficient manner. Typically neighboring nodes with strongest connectivity are more selected as parents. This Greedy Routing approach can lead to unbalanced routing loads in the network. Consequently, the network experiences the early death of overloaded nodes causing permanent network partition. Herein, we propose a framework for load balancing of routing in WSN. In-network path tagging is used to monitor network traffic load of nodes. Based on this, nodes are identified as being relatively overloaded, balanced or underloaded. A mitigation algorithm finds suitable new parents for switching from overloaded nodes. The routing engine of the child of the overloaded node is then instructed to switch parent. A key future of the proposed framework is that it is primarily implemented at the Sink and so requires few changes to existing routing protocols. The framework was implemented in TinyOS on TelosB motes and its performance was assessed in a testbed network and in TOSSIM simulation. The algorithm increased the lifetime of the network by 41 % as recorded in the testbed experiment. The Packet Delivery Ratio was also improved from 85.97 to 99.47 %. Finally a comparative study was performed using the proposed framework with various existing routing protocols.

Routing Protocols for Wireless Sensor Networks

This paper makes a survey of the recent works on routing protocols for wireless sensor networks(WSN). First, this paper presents a unique set of challenges faced by the routing proto cols of wireless sensor networks. Then, it classifies, compares and analyzes the representative routing protocols. At the end of this paper, the principles for designing routing protocols are put forward and the open research issues are al so discussed.

EAMRP: energy aware multipath routing protocol for wireless sensor networks

Wireless sensor networks WSNs are made of the sensor nodes with restricted battery life and transmission capability. In this paper, we propose an energy aware multipath routing protocol for wireless sensor networks. This protocol is designed to improve the lifetime, latency and reliability through discovering multiple paths from the source node to the sink base station. It is the sink initiated route discovery process with the known location information of the source node. At the end of the route formation, one primary path and number of alternate paths are built. The proposed protocol is implemented and compared with the existing protocols and found that it outperformed the existing protocols in terms of energy consumption, throughput, latency and network lifetime.

A survey on routing protocols for wireless sensor networks using swarm intelligence

Efficient routing is an important issue for the design of wireless sensor network WSN protocols to meet the severe hardware and resource constraints. Swarm intelligence is a relatively novel field. It comes under intelligent routing protocols which contribute to the optimisation of wireless sensor networks. It addresses the study of the collective behaviours of systems made by many components that coordinate using decentralised controls and self-organisation. Many number of routing protocols for wireless sensor networks have been developed according to the principles of swarm intelligence. The routing protocols are categorised based on their computational complexity, network structure, energy efficiency, scalability, fault tolerance, path establishment, and many more. In this paper, we provide an extensive survey and study different swarm intelligence-based routing protocols for WSNs. We discuss the general principles of swarm intelligence and of its application to routing, design challenges for WSN routing protocols, routing factors, and taxonomy of routing protocols in WSNs.

A Reliable and Energy-efficient Opportunistic Routing Protocol for Dense Lossy Networks

Power conservation and reliable data delivery are two most critical issues in the design of routing protocols for wireless networks, especially for dense lossy networks. However, traditional routing protocols, which deliver packets along predetermined routing paths with unnecessarily high transmit power, cannot cope well with dynamic and lossy wireless mediums under excessive interference. In order to prolong the lifetime of networks and improve the reliability of networks, this letter proposes a reliable and energy-efficient opportunistic routing (REOR) protocol. REOR effectively utilizes path diversity by jointly selecting optimal transmit power and optimal forwarder set, which significantly postpones the death of nodes and ensures persistent network connectivity with dynamic workload sharing approach. Extensive simulation results demonstrate that REOR achieves up to 50% reliability improvement and 30% energy conservation compared to the benchmark, i.e., the IPv6 routing protocol for low-power and lossy networks.

A statistical distributed multipath routing protocol in wireless sensor networks

Wireless sensor networks WSNs usually consist of many tiny sensor nodes and a sink. Problems and characteristics like resources' severe constraints, low reliability and fault tolerance, low throughput, and insecure operational environments, significantly degrade their overall performance. One significant solution against these problems is multipath routing. However, the existing multipath routing protocols have weaknesses like high overhead and algorithmic-computational complexity, security vulnerabilities, low scalability, and permanent usage of optimal paths and resources' severe exhaustion. As a result, this paper proposes a statistical distributed multipath routing protocol for homogeneous WSNs, called SDMR. It is different from other existing multipath routing protocols in terms of statistical-mathematical nature, criteria and procedure of routing score calculation, routes' selection process and traffic load distribution technique. The performance of SDMR is compared with the performance of secure and energy-efficient multipath routing protocol called SEEM; results of algorithmic-complexity and statistical-simulation analyses show that the SDMR is improved in terms of energy consumption, throughput, accuracy, average rate of packet loss, scalability and fault tolerance, average delay and routing overhead in the route discovery process.

A routing protocol for wireless sensor networks using K-means and Dijkstra algorithm

For random clustering and one hop communication in LEACH, if there are too many nodes in a cluster, the cluster head will consume more energy and the network lifetime will be shortened. To balance energy consume and avoid long distance communication, a uniform clustering routing algorithm based on K-means and Dijkstra algorithm KDUCR is proposed in this paper. In the KDUCR algorithm, the sink node uses K-means clustering algorithm to divide sensor nodes into k uniform clusters and assigns the head of each cluster in the first round. Then the sink node uses Dijkstra algorithm with heads' position to calculate the shortest paths from every head to the sink node. In the resident round of network operation, reclustering will not run, only cluster heads updating and routing updating run. The simulation shows that the KDUCR algorithm could better balance the energy consumption of nodes and prolong lifetime of a wireless sensor network WSN.

Enhanced Chain-Cluster Based Mixed Routing Algorithm for Wireless Sensor Networks

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorithm that combines the full advantages of both cluster and chain techniques such as CCM (Chain-Cluster based Mixed routing). In this paper, introduce a routing algorithm relying on CCM algorithm called (Enhanced Chain-Cluster based Mixed routing) algorithm E-CCM. Simulation results show that E-CCM algorithm improves the performance of CCM algorithm in terms of three performance metrics which are: energy consumption, network lifetime, and (FND and LND). MATLAB program is used to develop and test the simulation process in a computer with the following specifications: windows 7 (32-operating system), core i5, RAM 4 GB, hard 512 GB.
 

Fault tolerant routing protocols in wireless sensor networks: a decision support tool

Wireless Sensor Networks WSNs can be prone to many shortcomings owing to the energy limitation as well as the hostile environments where they could be deployed. Thus, it becomes of paramount importance to consider an adequate Fault Tolerant Routing Protocol FTRP. Nevertheless, the multiplicity of the existing FTRPs makes the choice of a specific protocol, to tackle target application constraints, very expensive in terms of simulations conduction. In this paper, we propose a Decision Support Tool for WSN applications developers to enable them to make the choice of a protocols, before performing simulations, which satisfies the predefined conditions in terms of time and energy costs of fault tolerance as well as its efficiency of the application to be deployed. The studied protocols are also classified according to the target applications types. An example of this tool usage is provided in a case study of forest fire detection.

Energy efficient routing protocols for wireless sensor networks- a review

energy efficient routing protocols for wireless sensor networks- a review

Expected Path Bandwidth-Based Metric Routing Protocol in Wireless Mesh Networks

Expected Path Bandwidth-Based Metric Routing Protocol in Wireless Mesh Networks

Intelligent MAC and Routing Protocols for Wireless Sensor Networks

Intelligent MAC and Routing Protocols for Wireless Sensor Networks