Routing Protocol For Wireless Networks Research Articles

A Review of Hierarchical Routing Protocol for Wireless Sensor Network

Objectives: To minimize the energy utilized for transmitting and receiving the data in wireless sensor network. The goal is to find out the best routing protocol to increase the network lifespan. This paper dealt with the detailed review of hierarchical routing protocol of wireless sensor network and compared depends on few characteristics. Methods: Minimum spanning tree approach for finding the shortest path in the network to reach the sink. Energy Optimization is an important key used to increase the lifespan of the node. A different classification approach is introduced on routing the message based on the number of hops the packets takes to reach the destination. Findings: The transmission energy was a major factor in draining the sensor node. To minimize the transmission energy, we suggest a novel approach by varying the transmission power based on the distance from the node to the cluster head. Improvements: The survey will help to develop an adaptive routing protocol suitable for real-time application. Achieving the energy efficient routing protocol will have a downfall with the delayKeywords: Clustering based Routing, Data Aggregation, Energy Efficiency, Wireless Sensor Networks

Relay based thermal aware and mobility support routing protocol for wireless body sensor networks

The evolvement of wireless technologies has enabled revolutionizing the health-care industry by monitor patient health condition requiring early diagnosis and interfering when a chronic situation is taking place. In this regard, miniaturized biosensors have been manufactured to cover various medical applications forming therefore a Wireless Body Sensor Network (WBSN). A WBSN is comprised of several small and low power devices capable of sensing vital signs such as heart rate, blood glucose, body temperature etc.. Although WBSN main purpose is to provide the most convenient wireless setting for the networking of human body sensors, there are still a great number of technical challenges to resolve such as: power source miniaturization, low power transceivers, biocompatibility, secure data transfer, minimum transmission delay and high quality of service. These challenges have to be taken into consideration when creating a new routing protocol for WBSNs. This paper proposes a new Relay based Thermal aware and Mobile Routing Protocol (RTM-RP) for Wireless Body Sensor Networks tackling the problem of high energy consumption and high temperature increase where the mobility is a crucial constraint to handle.

Multipath QoS-driven routing protocol for industrial wireless networks

The Industry 4.0 concept targets the interconnection and computerization of traditional industries to improve their adaptability and utilize efficiently their resources. Industrial wireless networks will play a key role within the Industry 4.0 as they will facilitate the deployment of novel industrial applications thanks to the flexible and reconfigurable wireless connection of industrial devices. Significant advances are still necessary to enable the deployment of reliable industrial wireless networks capable to guarantee the strict QoS (Quality of Service) requirements of industrial applications in harsh propagation conditions. This paper contributes towards this objective with a novel multipath routing protocol that identifies and establishes the necessary redundant routes between any pair of nodes of a wireless network in order to satisfy the reliability and delay QoS levels demanded by industrial applications. The proposed protocol is here presented and analyzed under the framework of the WirelessHART standard given its important industrial adoption. However, it can also be adapted to other centralized TDMA-based multi-hop wireless networks.

A grid-based reliable routing protocol for wireless sensor networks with randomly distributed clusters

The need for implementing reliable data transfer in wireless sensor networks is still an open issue in the research community. Although cluster routing schemes are characterized by their low overhead and efficiency in reliable data transfer in traditional wireless sensor network, this potential is still yet to be utilized for viable routing options in the environment with obstacles and voids, via greedy and perimeter forwarding. In this paper, a novel Grid-Based Reliable Routing (GBRR) technique is presented. This is achieved by the creation of virtual clusters based on square grids from which the next hop choice is made based on intra-cluster and inter-cluster communication quality. The simulation result shows that the developed scheme can make more advancement to the BS as against the usual decisions of relevant clustering route select operations, while ensuring channel quality. Further simulation results have shown the enhanced reliability, lower latency and energy efficiency of the presented scheme with randomly nodes and obstacles distribution.

Improved algorithm of cluster-based routing protocols for agricultural wireless multimedia sensor networks

Low Energy Adaptive Clustering Hierarchy (LEACH) is a routing algorithm in agricultural wireless multimedia sensor networks (WMSNs) that includes two kinds of improved protocol, LEACH_D and LEACH_E. In this study, obstacles were overcome in widely used protocols. An improved algorithm was proposed to solve existing problems, such as energy source restriction, communication distance, and energy of the nodes. The optimal number of clusters was calculated by the first-order radio model of the improved algorithm to determine the percentage of the cluster heads in the network. High energy and the near sink nodes were chosen as cluster heads based on the residual energy of the nodes and the distance between the nodes to the sink node. At the same time, the K-means clustering analysis method was used for equally assigning the nodes to several clusters in the network. Both simulation and the verification results showed that the survival number of the proposed algorithm LEACH-ED increased by 66%. Moreover, the network load was high and network lifetime was longer. The mathematical model between the average voltage of nodes (y) and the running time (x) was concluded in the equation y=−0.0643x+4.3694, and the correlation coefficient was R2=0.9977. The research results can provide a foundation and method for the design and simulation of the routing algorithm in agricultural WMSNs. Keywords: wireless sensor networks, routing protocol, LEACH algorithm, improved algorithm, cluster head, K-means clustering DOI: 10.3965/j.ijabe.20160904.2261 Citation: Zhang F, Liu H M, Wang J, Qiu Z M, Mao P J, Zhang Y K. Improved algorithm of cluster-based routing protocols for agricultural wireless multimedia sensor networks. Int J Agric & Biol Eng, 2016; 9(4): 132－140.

A comprehensive survey of energy-aware routing protocols in wireless body area sensor networks.

Wireless body area sensor network is a special purpose wireless sensor network that, employing wireless sensor nodes in, on, or around the human body, makes it possible to measure biological parameters of a person for specific applications. One of the most fundamental concerns in wireless body sensor networks is accurate routing in order to send data promptly and properly, and therefore overcome some of the challenges. Routing protocols for such networks are affected by a large number of factors including energy, topology, temperature, posture, the radio range of sensors, and appropriate quality of service in sensor nodes. Since energy is highly important in wireless body area sensor networks, and increasing the network lifetime results in benefiting greatly from sensor capabilities, improving routing performance with reduced energy consumption presents a major challenge. This paper aims to study wireless body area sensor networks and the related routing methods. It also presents a thorough, comprehensive review of routing methods in wireless body area sensor networks from the perspective of energy. Furthermore, different routing methods affecting the parameter of energy will be classified and compared according to their advantages and disadvantages. In this paper, fundamental concepts of wireless body area sensor networks are provided, and then the advantages and disadvantages of these networks are investigated. Since one of the most fundamental issues in wireless body sensor networks is to perform routing so as to transmit data precisely and promptly, we discuss the same issue. As a result, we propose a classification of the available relevant literature with respect to the key challenge of energy in the routing process. With this end in view, all important papers published between 2000 and 2015 are classified under eight categories including 'Mobility-Aware', 'Thermal-Aware', 'Restriction of Location and Number of Relays', 'Link-aware', 'Cluster- and Tree-Based', 'Cross-Layer', 'Opportunistic', and 'Medium Access Control'. We, then, provide a full description of the statistical analysis of each category in relation to all papers, current hybrid protocols, and the type of simulators used in each paper. Next, we analyze the distribution of papers in each category during various years. Moreover, for each category, the advantages and disadvantages as well as the number of issued papers in different years are given. We also analyze the type of layer and deployment of mathematical models or algorithmic techniques in each category. Finally, after introducing certain important protocols for each category, the goals, advantages, and disadvantages of the protocols are discussed and compared with each other.

A two-hop based adaptive routing protocol for real-time wireless sensor networks.

One of the most important and challenging issues in wireless sensor networks (WSNs) is to optimally manage the limited energy of nodes without degrading the routing efficiency. In this paper, we propose an energy-efficient adaptive routing mechanism for WSNs, which saves energy of nodes by removing the much delayed packets without degrading the real-time performance of the used routing protocol. It uses the adaptive transmission power algorithm which is based on the attenuation of the wireless link to improve the energy efficiency. The proposed routing mechanism can be associated with any geographic routing protocol and its performance is evaluated by integrating with the well known two-hop based real-time routing protocol, PATH and the resulting protocol is energy-efficient adaptive routing protocol (EE-ARP). The EE-ARP performs well in terms of energy consumption, deadline miss ratio, packet drop and end-to-end delay.

Modeling and performance evaluation of security attacks on opportunistic routing protocols for multihop wireless networks

In wireless networks, opportunistic routing (OR) protocols are designed to route data packets towards their destination with greater reliability than traditional routing schemes. In addition to reliability, nodes’ trustworthiness and willingness to cooperate can also play a significant role in the delivery of packets to their final destinations. More specifically, nodes in the network may be compromised, experience software or hardware failures, or behave maliciously for various reasons. Therefore, it would be beneficial to model the behavior of malicious or uncooperative nodes and study their effects in a wireless network that employs OR for communications. In this paper, the behavior of malicious nodes in a wireless mesh network that utilizes unicast opportunistic routing protocols is modeled using Discrete Time Markov Chain (DTMC). Afterwards, using the proposed model, we introduce a novel approach for the calculation of packet drop ratio, through which the negative effects of uncooperative nodes can be calculated. Furthermore, a customized version of a black-hole attack is introduced as an example of malicious behavior in OR protocols; we apply this routing attack to several well-known OR protocols, with the additional use of network simulation as well as through the proposed analytical technique. Finally, a comprehensive set of performance evaluation scenarios is designed and applied, with the purpose of investigating the effects of different parameters on a wireless mesh network that uses OR as a routing approach in the presence of malicious nodes. Evaluation results indicate that the proposed black-hole attack can significantly downgrade communication performance, and the proposed model can properly model the effects of malicious nodes on OR protocols.

Rendezvous based routing protocol for wireless sensor networks with mobile sink

In wireless sensor networks, the sensor nodes find the route towards the sink to transmit data. Data transmission happens either directly to the sink node or through the intermediate nodes. As the ...

A Multipath Prefix Routing for Wireless Sensor Networks

When a spanning tree is built on top of a wireless network and an appropriate labelling scheme is applied, the complexity of the routing mechanism in terms of memory usage and control messages can be drastically reduced using compact routing. In this paper, we propose multipath prefix routing (MPR), a multipath routing protocol for wireless sensor networks. MPR is a hybrid (both reactive and proactive) protocol that operates on an already built spanning tree rooted at the sink (the collect station). Besides the tree path, additional paths are built based on an appropriate labelling scheme and neighbourhood relationships. For practical implementation, we propose and evaluate two different labelling schemes. We mainly show that in a perfect W-ary tree, the additional number of bits required to encode labels is at most $$(H-1)$$(H-1) where H is the height of the tree. Finally, we apply MPR to the ZigBee standard and evaluate its performance using simulations. MPR has a small state routing while control messages overhead is maintained low compared to traditional multipath routing protocols.

Designing of Low Energy Sensor Networks by using Energy Aware Routing Protocol

As per the system optimization in terms of speed, area and power effectively taken all the things into consideration created Low Energy Sensor Networks using Ad-hoc On Demand Distance Vector Routing Protocol(AODV).A routing protocol specifies how routers communicate with each other, disseminating information that enables them to select routes between any two nodes on a computer network. Routing algorithms determine the specific choice of route. Each router has a priori knowledge only of networks attached to it directly. WSNs have great potential for many applications in scenarios such as military target tracking and surveillance, natural disaster relief, biomedical health monitoring and hazardous environment exploration and seismic sensing. In this synopsis, we propose an energy efficient data forwarding protocol called Ad-hoc On Demand Distance Vector Routing Protocol (AODV/AOMDV) for wireless sensor networks to extend the life time of the network. Ad hoc On-Demand Distance Vector (AODV) Routing is a routing protocol for mobile ad hoc networks (MANETs) and other wireless ad hoc networks . The AODV (Ad-Hoc On-Demand Distance Vector) routing protocol is a reactive routing protocol that uses some characteristics of proactive routing protocols. Routes are established on-demand, as they are needed. However, once established a route is maintained as long as it is needed. Reactive (or on-demand) routing protocols find a path between the source and the destination only when the path is needed (i.e., if there are data to be exchanged between the source and the destination). In AODV, both position information and energy are available at nodes used to route packets from sources to destination. The routing design of AODV is based on two parameters: location and energy levels of nodes. Each node knows the location and energy level of its neighbors. The performance measures have been analyzed with variable number of nodes. The simulations were carried out for different number of nodes.

Distributed Greedy Coding-aware Deterministic Routing for multi-flow in wireless networks

As one of the compelling performance improvement techniques, network coding is widely used for designing routing protocols in wireless networks. Specifically, in deterministic routing, coding benefit is viewed as an important factor for distributed route selection. However, most of the existing deterministic routing protocols only detect two-flow coding opportunities in the route discovering phase, but the multi-flow scenario is not researched sufficiently. It is obvious that multi-flow coding can improve the coding benefit in complex network environments. In this paper, we analyze the challenges of the multi-flow coding, and propose a Distributed Greedy Coding-aware Deterministic Routing (DGCDR) for multi-flow in wireless networks. To increase the potential coding opportunities, a decoding policy and a coding condition are defined in the multi-flow environment, which exploit the coding benefit of multiple intersecting flows in a greedy way. Meanwhile, considering the interference introduced by multi-flow coding, we design an extra confirmation process in our protocol. Furthermore, to enhance the flexibility of packet delivery and coding, we propose a greedy aggregation mechanism and a greedy coding algorithm. From the simulation results, we can find that DGCDR can induce a competitive performance in terms of increased coding benefit, decreased delay, larger throughput, and smaller queue size.

HEER – A delay-aware and energy-efficient routing protocol for wireless sensor networks

Minimizing energy consumption to maximize network lifetime is one of the crucial concerns in designing wireless sensor network routing protocols. Cluster-based protocols have shown promising energy-efficiency performance, where sensor nodes take turns to act as cluster heads (CHs), which carry out higher-level data routing and relaying. In such case the energy consumption is more evenly distributed for all the nodes. However, most cluster-based protocols improve energy-efficiency at the cost of transmission delay. In this paper, we propose an improved delay-aware and energy-efficient clustered protocol called Hamilton Energy-Efficient Routing Protocol (HEER). HEER forms clusters in the network initialization phase and links members in each cluster on a Hamilton Path, constructed using a greedy algorithm, for data transmission purpose. No cluster reformation is required and the members on the path will take turns to become cluster head. The design allows HEER to save on network administration energy and also balance the load comparing to traditional cluster-based protocols. The algorithms designed in HEER also means that it does not suffer long delay and does not require each node to have global location information comparing with classic chain-based protocols such as PEGASIS and its variations. We implemented the HEER protocol in MATLAB simulation and compared it with several cluster-based and chain-based protocols. We found that HEER is able to achieve an improved network lifetime over the current protocols while maintaining the average data transmission delay. In the simulation, HEER achieved 66.5% and 40.6% more rounds than LEACH and LEACH-EE, which are cluster-based protocols. When compared with chain-based protocols (PEGASIS and Intra-grid-PEGSIS), HEER managed 21.2 times and 16.7 times more rounds than PEGASIS and Intra-grid-PEGASIS respectively. In addition, HEER can eliminated 90% of transmission delay comparing to LEACH and LEACH-EE and 99% comparing with PEGASIS and Intra-grid-PEGASIS.

Entropy-based Correlation Clustering for Wireless Sensor Networks in Multi-Correlated Regional Environments

The existence of correlation characteristics brings significant potential advantages to the development of efficient routing protocols in wireless sensor networks. This research proposes a new simple method of clustering sensor nodes into correlation groups in multiple-correlation areas. At first, the evaluation of joint entropy for multiple-sensed data is considered. Based on the evaluation, the definition of correlation region, based on entropy theory, is proposed. Following that, a correlation clustering scheme with less computation is developed. The results are validated with a real data set.

A survey on LEACH and other’s routing protocols in wireless sensor network

An extensive range of applications of Wireless Sensor Networks such as military, environment, surveillance, home, vehicle tracking/detection, traffic flow and medical make it hot-spot in the epoch of wireless networks. A WSN consisting of numerous sensor-nodes is equipped with inadequate energy, memory, and computation capability issues. Further, such networks are limited to reinstate the dead nodes caused by energy’s depletion and to maximize the life-span of the system. To achieve this aim, several routing algorithms are proposed and investigated. In this work, an attempt is carried out to assess the diverse hierarchical routing protocols, developed from LEACH and is extended to other presented routing protocols like TEEN, APTEEN, and PEGASIS. Depending upon the observations and scrupulous consideration, a relative conclusion is drawn in the last.

Adaptive energy aware cluster-based routing protocol for wireless sensor networks

Wireless sensor networks (WSNs) have grown excessively due to their various applications and low installation cost. In WSN, the main concern is to reduce energy consumption among nodes while mainta...

FEQRP: a Fuzzy based Energy-efficient and QoS Routing Protocol over WSNs

In this paper, an energy efficient and QoS routing protocol; named Fuzzy based Energy-efficient and QoS Routing protocol (FEQRP) for wireless sensor networks; is proposed to extend the life time of the network. Most of the existing protocols don't take care about energy balancing. The energy manager protocols balance the energy consumption in the network to avoid network partitioning. The proposed protocol tries to find the best route with smallest distance between source and destination, reduce the energy consumption and balance it by fuzzy set approach. In FEQRP, both the node position and the energy level are used to route the packets from sources to destination. Each node knows the location and energy level of its neighbors.

Performance of Implementation IBR-DTN and Batman-Adv Routing Protocol in Wireless Mesh Networks

Wireless mesh networks is a network which has high mobility and flexibility network. In Wireless mesh networks nodes are free to move and able to automatically build a network connection with other nodes. High mobility, heterogeneous condition and intermittent network connectivity cause data packets drop during wireless communication and it becomes a problem in the wireless mesh networks. This condition can happen because wireless mesh networks use connectionless networking type such as IP protocol which it is not tolerant to delay. To solve this condition it is needed a technology to keep data packets when the network is disconnect. Delay tolerant technology is a technology that provides store and forward mechanism and it can prevent packet data dropping during communication. In our research, we proposed a test bed wireless mesh networks implementation by using proactive routing protocol and combining with delay tolerant technology. We used Batman-adv routing protocol and IBR-DTN on our research. We measured some particular performance aspect of networking such as packet loss, delay, and throughput of the network. We identified that delay tolerant could keep packet data from dropping better than current wireless mesh networks in the intermittent network condition. We also proved that IBR-DTN and Batman-adv could run together on the wireless mesh networks. In The experiment throughput test result of IBR-DTN was higher than Current TCP on the LoS (Line of Side) and on environment with obstacle.Keywords: Delay Tolerant, IBR-DTN, Wireless Mesh, Batman-adv, Performance

A survey and analysis of multipath routing protocols in wireless multimedia sensor networks

The main objective of this research is to conduct a performance analysis of various multipath routing protocols in wireless multimedia sensor networks for the efficient transmission of the image, audio and video data. To provide efficient routing for the large sized multimedia content, various multipath routing protocols such as energy-aware routing, QoS based routing and geographical routing methods are analyzed. In this analysis, the efficient routing techniques including geographical routing techniques such as GPSR, DGR, PW-DGR presented for wireless multimedia sensor networks are studied and the performance of each technique is evaluated to determine the efficient multipath routing technique. Comparisons are made for evaluated protocols and it is proved that the PW-DGR provides better routing performance for the multimedia data. The findings of the research also show that the PW-DGR method efficiently overcomes the routing problems such as energy bottleneck problem, energy-hole, reduced network lifetime and high delay in packet transmission.

A Stable Backbone-Based on Demand Multipath Routing Protocol for Wireless Mobile Ad Hoc Networks

In mobile ad hoc networks (MANETs), high node mobility leads to frequent link breaks and creates complexities in route discovery, this effect on the quality of service (QoS) and degrades the systems performance. So, providing a high quality communication using stable links among mobile nodes is a challenging issue in MANETs. Existing stability based routing algorithms initiate estimation of route stability metrics during the routing process, results in increased delay and overhead. In order to overcome these issues, in this paper, we construct a stable backbone-based multipath routing protocol (SBMRP). Initially, the nodes with high residual bandwidth, residual power, link quality and low mobility are designated as candidate nodes. Then multiple paths are established between source and destination through these candidate nodes, thus forming a routing backbone. If any candidate node in the path tend to fail due to lack of bandwidth, energy or link quality, alternate path through other candidate node is established before path breaks. Proposed routing scheme has been compared with other three existing protocols: AODV, AOMDV and RSQR. The protocol performance has been evaluated in terms of packet delivery ratio, normalized routing load, delay and packet drop ratio.