Design Of Routing Protocols Research Articles

Performance Evaluation of Distribution Node in Case of LEACH Implementation on Wireless Sensor Network

Wireless sensor networks consisting of sensor nodes can be used as an effective tool for collecting data in various situations. Nodes are usually placed randomly in an area to perform sensing and monitor various parameters related to environmental conditions in various locations. One of the major problems in wireless sensor networks is developing energy-efficient routing protocols that have a significant impact on the overall life of sensor networks so it is important to make energy savings in these limited energy sources to extend network life. This paper proposes a hardware design and Low-Energy Adaptive Clustering Hierarchy (LEACH) routing protocol configuration for power saving by utilizing cluster head selection mechanism. The cluster head selection process is performed periodically based on LEACH algorithm enables the node to have the best lifetime responsible for communication between the nodes and the server as well as the effort to save energy consumption of limited energy sources to extend network life. So that makes the process of sending information more effective and optimal. The system has been able to display data information along with the position of nodes in the web server with an average of 42 seconds of computing time in a rotation of the system so that it can be done 85 times in 1 hour. The system is able to provide real-time information with a throughput of more than 1.052 Kbps and packet loss of no more than 6.7%. In addition, energy savings can up to 6.5% of the existing energy in a lithium battery.

RMEER: Reliable Multi-path Energy Efficient Routing Protocol for Underwater Wireless Sensor Network

Underwater Wireless Sensor Networks (UWSNs) is interesting area for researchers.To extract the information from seabed to water surface the the majority numbers of routing protocols has been introduced. The design of routing protocols faces many challenges like deployment of sensor nodes, controlling of node mobility, development of efficient route for data forwarding, prolong the battery power of the sensor nodes, and removal of void nodes from active data forwarding paths. This research article focuses the design of the Reliable Multipath Energy Efficient Routing (RMEER) which develops the efficient route between sensor nodes, and prolongs the battery life of the nodes. RMEER is a scalable and robust protocol which utilizes the powerful fixed courier nodes in order to enhance the network throughput, data delivery ratio, network lifetime and reduces the end-to-end delay. RMEER is also an energy efficient routing protocol for saving the energy level of the nodes. We have used the NS2.30 simulator with AquaSim package for performance analysis of RMEER.We observed that the simulation performance of RMEER is better than D-DBR protocol.

A multi-hop graph-based approach for an energy-efficient routing protocol in wireless sensor networks

Emerging technological advances in wireless communication and networking have led to the design of large scale networks and small sensor units with minimal power requirements and multifunctional processing. Though energy harvesting technologies are improving, the energy of sensors remains a scarce resource when designing routing protocols between sensor nodes and base station. This paper proposes a multi-hop graph-based approach for an energy-efficient routing (MH-GEER) protocol in wireless sensor networks which aims to distribute energy consumption between clusters at a balanced rate and thus extend networks’ lifespans. MH-GEER deals with node clustering and inter-cluster multi-hop routing selection. The clustering phase is built upon the centralized formation of clusters and the distributed selection of cluster heads similar to that of low-energy adaptive clustering hierarchy (LEACH). The routing phase builds a dynamic multi-hop path between cluster heads and the base station. Our strategy is about exploring the energy levels in the entire network and using these to select the next hop in a probabilistic, intelligent way. Performance evaluation shows that MH-GEER minimizes energy depletion in distant clusters and ensures load balancing in a network, thus improving the network’s lifetime and stability compared with single-hop conventional LEACH protocol.

Implementing beneficial prioritization of traffic flow in complex networks

Despite the reality of traffic prioritization in real networks as the internet, this has almost been ignored in designed routing protocols. In this work, we propose a priority policy where packets are prioritized according to their destination. This procedure is applied to a fraction f of nodes; packets are classified as High Priority if their destinations are among the fraction f, otherwise the packets are treated as Low Priority. Using numerical simulation we found that the prioritization of nodes with high degree (hubs) is always more efficient than the prioritization of nodes with small degree or the random prioritization of nodes. Moreover, we observed three regimes based on the prioritized fraction f in the network: the first one is characterized by an improvement of the High Priority Traffic (HPT) flow without any degradation of the flow of the Low Priority Traffic (LPT). In the second regime, the HPT gains some performance at the expense of a loss of the performance in the LPT flow. While in the last regime the LPT experiences a low performance without any noticeable improvement in HPT compared to the normal flow.

Performance Evaluation of Ad-Hoc On-Demand Distance Vector and Optimized Link State Routing Protocols in Mobile Ad-Hoc Networks

Mobile Ad-hoc Networks (MANETs) are self-sufficient networks that can work without the need for centralized controls, pre-configuration to the routes or advance infrastructures. The nodes of a MANET are autonomously controlled, which allow them to act freely in a random manner within the MANET. The nodes can leave their MANET and join other MANETs at any time. These characteristics, however, might negatively affect the performance of the routing protocols and the overall topology of the networks. Subsequently, MANETs comprise specially designed routing protocols that reactively and/or proactively perform the routing. This paper evaluates and compares the performance of two routing protocols which are Ad-Hoc On-Demand Distance Vector (AODV) and Optimized Link State Routing (OLSR) in MANET environment. The study includes implementing a simulation to examine the performance of the routing protocols based on the variables of the nodes’ number and network size. The evaluation results show that the AODV outperforms the OLSR in most of the simulated cases. The results further show that the number of nodes and network size have a great impact on the Throughput (TH), Packet Delivery Ratio (PDR), and End-to-End delay (E2E) of the network.

Analysis of Data Dissemination and Control in Social Internet of Vehicles

To achieve end-to-end delivery in intermittently connected mobile Internet of Vehicles (IoV) networks, epidemic routing is proposed for data dissemination at the price of excessive buffer occupancy due to its store-and-forward nature. Typically, epidemic routing should be controlled to reduce system resource usage (e.g., buffer occupancy) while simultaneously providing data delivery with differentiated level of statistical guarantee. With the aid of social connectivity among vehicles, the control of data dissemination could be benefited from the property of instant end-to-end communication in Social IoV (SIoV). In particular, social links are leveraged to deliver control message for balancing the tradeoffs between buffer occupancy and data delivery reliability for supporting data dissemination in SIoV. In this paper, we proposed two representative schemes: the global timeout scheme and the antipacket dissemination scheme, respectively, for lossy and lossless data delivery, where control messages are delivered in social-based end-to-end and local-based ad-hoc fashions. For lossy data delivery, our investigation shows that with the suggested global timeout value, the per-node buffer occupancy only depends on the maximum tolerable packet loss rate and pairwise meeting rate, providing principles toward mission-critical protocols. For lossless data delivery, our analytical results show that the buffer occupancy can be significantly reduced via fully antipacket dissemination, providing efficient end-to-end communication. The developed tools therefore offer new insights for epidemic routing protocol designs and performance evaluations for SIoV.

Dynamic Cluster Based Routing Protocol with Sink Mobility Support for Underwater Wireless Sensor Networks

Underwater wireless sensor networks are energy resource constrained due to the scarce battery capacity. Energy efficient routing protocol is highly demanded to be developed for such networks. It is indeed a challenging task to design routing protocol that can achieve energy efficiency due to the dynamic and harsh underwater environment. A dynamic cluster based routing protocol coupled with sink mobility support (DCMMS) is proposed. Two schemes are combined together in the protocol. One is the formation of clusters and two is the mobile sink management. The cluster formation includes cluster head election process and member association process. Each cluster member sends the sensed data to the cluster head. Multiple mobile sinks are deployed to gather data directly from cluster heads. Finally, mobile sinks send the collected data after proper aggregation to the static sinks located at the surface. Thus, sink mobility and the dynamic clustering technique together help to balance the load among the nodes thereby minimizing energy consumption to a significant extent and extending the network life span. Analytical simulations are extensively carried out to attest how the proposed protocol (DCMMS) achieves better performance with minimum energy consumption, less end to end delay and higher packet delivery ratio than its counterpart existing protocol (AA-RP).

A greedy traffic light and queue aware routing protocol for urban VANETs

Vehicular Ad-hoc Networks (VANETs) require reliable data dissemination for time-sensitive public safety applications. An efficient routing protocol plays a vital role to achieve satisfactory network performance. It is well known that routing is a challenging problem in VANETs due to the fast-changing network typology caused by high mobility at both ends of transmission. Moreover, under urban environment, there are two non-negligible factors in routing protocol design, the non-uniform vehicle distribution caused by traffic lights, and the network congestion due to high traffic demand in rush hours. In this paper, we propose a greedy traffic light and queue aware routing protocol (GTLQR) which jointly considers the street connectivity, channel quality, relative distance, and queuing delay to alleviate the packet loss caused by vehicle clustering at the intersection and balance the traffic load among vehicles. Through performance evaluation, we show that our proposed protocol outperforms both TLRC and GLSR-L in terms of packet delivery ratio and end-to-end delay.

COMPARATIVE ANALYSIS ON REDUCING ROUTE DISCOVERY LATENCY IN MANET USING DIFFERENT TECHNIQUES

MANET is a self-configuring network, in which topology is dynamic. These nodes are struggling to cope with the normal effect of radio communication channels, multi-user interference, multi-path fading etc. The design of an optimum routing protocol for MANET is highly difficult. To determine the connectivity of network organizations, there is a need for an efficient algorithm link scheduling, and routing in such dynamic scenarios, becomes very important. The efficiency of a routing algorithm depends on the proficient and winning route computation. Usually, the shortest path algorithm is a successful method to calculate the optimal way in static networks. But this idea is not possible in MANET platform. There are many factors which can be considered for routing. Multihop paths are used in MANET for interconnecting the nodes. All the nodes are present in the network which are used for path construction for delivering a packet from source to destination node.

Design and analysis of VBF and EEVBF routing protocols for energy efficient underwater communication

Major constrain in Acoustic communication network is the consumption of energy by senor nodes. The need to regulate the energy con-sumption of senor nodes relay mainly on underwater applications like disaster prevention, tsunami warning and other environmental moni-toring, where the sensor need to transmit the sensed data constantly to the control station for critical analysis. This paper mainly focuses in designing a routing protocol that can challenge a better life expectancy of underwater sensor nodes. From the broader area of research in UWSN, VBF routing protocol gives a promising performance in term of increase in data throughput, PDR and energy consumption. Hence an energy efficient vector based forwarding protocol (EEVBF) is designed which can efficiently regulates the energy consumption when compared to VBF. Based on simulation results, the performance analysis of data throughput, packet delivery ratio, and energy consumed using aquasim network simulators.

Totally opportunistic routing algorithm (TORA) for underwater wireless sensor network.

Underwater Wireless Sensor Network (UWSN) has emerged as promising networking techniques to monitor and explore oceans. Research on acoustic communication has been conducted for decades, but had focused mostly on issues related to physical layer such as high latency, low bandwidth, and high bit error. However, data gathering process is still severely limited in UWSN due to channel impairment. One way to improve data collection in UWSN is the design of routing protocol. Opportunistic Routing (OR) is an emerging technique that has the ability to improve the performance of wireless network, notably acoustic network. In this paper, we propose an anycast, geographical and totally opportunistic routing algorithm for UWSN, called TORA. Our proposed scheme is designed to avoid horizontal transmission, reduce end to end delay, overcome the problem of void nodes and maximize throughput and energy efficiency. We use TOA (Time of Arrival) and range based equation to localize nodes recursively within a network. Once nodes are localized, their location coordinates and residual energy are used as a matrix to select the best available forwarder. All data packets may or may not be acknowledged based on the status of sender and receiver. Thus, the number of acknowledgments for a particular data packet may vary from zero to 2-hop. Extensive simulations were performed to evaluate the performance of the proposed scheme for high network traffic load under very sparse and very dense network scenarios. Simulation results show that TORA significantly improves the network performance when compared to some relevant existing routing protocols, such as VBF, HHVBF, VAPR, and H2DAB, for energy consumption, packet delivery ratio, average end-to-end delay, average hop-count and propagation deviation factor. TORA reduces energy consumption by an average of 35% of VBF, 40% of HH-VBF, 15% of VAPR, and 29% of H2DAB, whereas the packet delivery ratio has been improved by an average of 43% of VBF, 26% of HH-VBF, 15% of VAPR, and 25% of H2DAB. Moreover, the average end-to-end delay has been reduced by 70% of VBF, 69% of HH-VBF, 46% of VAPR, and 73% of H2DAB. Furthermore, average hope-count has been improved by 57%, 53%, 16% and 31% as compared to VBF, HHVBF, VAPR, and H2DAB, respectively. Also, propagation delay has been reduced by 34%, 30%, 15% and 23% as compared to VBF, HHVBF, VAPR, and H2DAB, respectively.

Routing Protocols for Underwater Wireless Sensor Networks: Taxonomy, Research Challenges, Routing Strategies and Future Directions.

Recent research in underwater wireless sensor networks (UWSNs) has gained the attention of researchers in academia and industry for a number of applications. They include disaster and earthquake prediction, water quality and environment monitoring, leakage and mine detection, military surveillance and underwater navigation. However, the aquatic medium is associated with a number of limitations and challenges: long multipath delay, high interference and noise, harsh environment, low bandwidth and limited battery life of the sensor nodes. These challenges demand research techniques and strategies to be overcome in an efficient and effective fashion. The design of routing protocols for UWSNs is one of the promising solutions to cope with these challenges. This paper presents a survey of the routing protocols for UWSNs. For the ease of description, the addressed routing protocols are classified into two groups: localization-based and localization-free protocols. These groups are further subdivided according to the problems they address or the major parameters they consider during routing. Unlike the existing surveys, this survey considers only the latest and state-of-the-art routing protocols. In addition, every protocol is described in terms of its routing strategy and the problem it addresses and solves. The merit(s) of each protocol is (are) highlighted along with the cost. A description of the protocols in this fashion has a number of advantages for researchers, as compared to the existing surveys. Firstly, the description of the routing strategy of each protocol makes its routing operation easily understandable. Secondly, the demerit(s) of a protocol provides (provide) insight into overcoming its flaw(s) in future investigation. This, in turn, leads to the foundation of new protocols that are more intelligent, robust and efficient with respect to the desired parameters. Thirdly, a protocol can be selected for the appropriate application based on its described merit(s). Finally, open challenges and research directions are presented for future investigation.

An Energy Balanced and Lifetime Extended Routing Protocol for Underwater Sensor Networks.

Energy limitation is an adverse problem in designing routing protocols for underwater sensor networks (UWSNs). To prolong the network lifetime with limited battery power, an energy balanced and efficient routing protocol, called energy balanced and lifetime extended routing protocol (EBLE), is proposed in this paper. The proposed EBLE not only balances traffic loads according to the residual energy, but also optimizes data transmissions by selecting low-cost paths. Two phases are operated in the EBLE data transmission process: (1) candidate forwarding set selection phase and (2) data transmission phase. In candidate forwarding set selection phase, nodes update candidate forwarding nodes by broadcasting the position and residual energy level information. The cost value of available nodes is calculated and stored in each sensor node. Then in data transmission phase, high residual energy and relatively low-cost paths are selected based on the cost function and residual energy level information. We also introduce detailed analysis of optimal energy consumption in UWSNs. Numerical simulation results on a variety of node distributions and data load distributions prove that EBLE outperforms other routing protocols (BTM, BEAR and direct transmission) in terms of network lifetime and energy efficiency.

Bio-inspired Optimization Routing Technique Using DNA Sequencing Algorithm for Wireless Sensor Networks

Routing optimization is a promising platform in wireless sensor network (WSN) for many researchers to work on various problems related to the balancing of performance parameters required by an application. In a sensor network, multipath routing protocol design is influenced by many factors, which includes hardware constraints, scalability, operating environment, reliability, topology, fault tolerance, transmission media, and power consumption which are addressed by many researchers. Balancing of these factors plays vital role in designing a routing protocol because they are application specific and vary from one application to another. All these performance metrics which are considered as application requirement must be measurable, independent and comparable. This paper focuses on designing a framework that balances the various performance metrics to get near optimal solution for multipath routing in WSNs. This framework is a hybrid approach that combines the dynamic programming model of DNA sequence algorithm with the existing Multipath routing algorithms to get the optimized routing sequence to balance the real time traffic and non-real time traffic on the multiple paths with improved energy and throughput parameters. Simulation results confirms the significant improvement in throughput performance and packet delivery ratio, substantial reduction in energy consumption against standard Multipath routing protocols.

OceanRoute: Vessel Mobility Data Processing and Analyzing Model Based on MapReduce

The network coverage is a big problem in ocean communication, and there is no low-cost solution in the short term. Based on the knowledge of Mobile Delay Tolerant Network (MDTN), the mobility of vessels can create the chances of end-to-end communication. The mobility pattern of vessel is one of the key metrics on ocean MDTN network. Because of the high cost, few experiments have focused on research of vessel mobility pattern for the moment. In this paper, we study the traces of more than 4000 fishing and freight vessels. Firstly, to solve the data noise and sparsity problem, we design two algorithms to filter the noise and complement the missing data based on the vessel’s turning feature. Secondly, after studying the traces of vessels, we observe that the vessel’s traces are confined by invisible boundary. Thirdly, through defining the distance between traces, we design MR-Similarity algorithm to find the mobility pattern of vessels. Finally, we realize our algorithm on cluster and evaluate the performance and accuracy. Our results can provide the guidelines on design of data routing protocols on ocean MDTN.

A Design and Implementation of Routing Protocols for Low Power Lossy Networks

A Design and Implementation of Routing Protocols for Low Power Lossy Networks

A selective multipath routing protocol for ubiquitous networks

During the past years, ubiquitous networks have become an interesting topic for research due to their flexible and independent nature in terms of network infrastructure. A lot of effort has been made around the design of efficient routing protocols, mainly because of their unique characteristics, such as, dynamic topology, high mobility and limited bandwidth. In this paper, we propose a new routing protocol which is based on our Multipath-ChaMeLeon (M-CML) routing protocol. We perform a network optimization analysis of M-CML under a series of simulations taking into account three Quality of Service (QoS) metrics and we provide the results with statistical confidence interval by applying the Wilcoxon signed-rank test model. On top of the outcome of the analysis, we also apply an intelligent algorithm to enhance our protocol’s effectiveness by reducing the improvident emission of data packets. The new protocol, named M-CMLv2, is compared to OLSR, AOMDV and M-CML using the NS-3 simulator. The acquired results indicate that M-CMLv2 reduces the redundant information, maintains good performance at successfully delivering packets with acceptable end-to-end delay, while at the same time, it reduces the network’s routing load and the energy consumption of the nodes.

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS) and position random candidates selection (PRCS). PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

Multipoint Relay Selection based on Stability of Spatial Relation in Mobile Ad hoc Networks

Increasing stability is one of the main objectives in designing routing protocols for Mobile Ad-Hoc Network (MANETS). Various research schemes have been addressed to this challenge and to support it. In fact, some papers have considered modifications to MPRs selection mechanism in OLSR. In this paper, the author proposes a new mechanism to elect stable and sustainable nodes relay between all nodes in MANETs. In this mechanism, a mobility function is used as the main selection criterion based on the calculation of the spatial relation of a node relative to its neighbor. This mechanism is applied in OLSR protocol to choose stable and supportable MPRs nodes. This mechanism significantly finds more stable MPRs and it promises QoS metrics such as lost packets and delay. Simulation results reveals a significant performance gains and it motivates further examinations to develop the mechanism in order to improve the routing protocol requirements. Performances are evaluated based on Random Waypoint model and network simulator ns3.

A Stable and Energy-Efficient Routing Algorithm Based on Learning Automata Theory for MANET

The mobile Ad Hoc network (MANET) is a self-organizing and self-configuring wireless network, consisting of a set of mobile nodes. The design of efficient routing protocols for MANET has always been an active area of research. In existing routing algorithms, however, the current work does not scale well enough to ensure route stability when the mobility and distribution of nodes vary with time. In addition, each node in MANET has only limited initial energy, so energy conservation and balance must be taken into account. An efficient routing algorithm should not only be stable but also energy saving and balanced, within the dynamic network environment. To address the above problems, we propose a stable and energy-efficient routing algorithm, based on learning automata (LA) theory for MANET. First, we construct a new node stability measurement model and define an effective energy ratio function. On that basis, we give the node a weighted value, which is used as the iteration parameter for LA. Next, we construct an LA theory-based feedback mechanism for the MANET environment to optimize the selection of available routes and to prove the convergence of our algorithm. The experiments show that our proposed LA-based routing algorithm for MANET achieved the best performance in route survival time, energy consumption, energy balance, and acceptable performance in end-to-end delay and packet delivery ratio.