scholarly journals A Comprehensive Survey on Hierarchical-Based Routing Protocols for Mobile Wireless Sensor Networks: Review, Taxonomy, and Future Directions

2017 ◽  
Vol 2017 ◽  
pp. 1-23 ◽  
Author(s):  
Nabil Sabor ◽  
Shigenobu Sasaki ◽  
Mohammed Abo-Zahhad ◽  
Sabah M. Ahmed

Introducing mobility to Wireless Sensor Networks (WSNs) puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs). Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.

2021 ◽  
Vol 9 (17) ◽  
pp. 56-65
Author(s):  
Carlos Egas Acosta ◽  
Felipe Gil-Castiñeira ◽  
Enrique Costa-Montenegro

A particular case of wireless sensor networks are those that have a linear topology. These networks are used in monitoring large-scale linear infrastructures that are characterized by having thousands of sensor nodes, hundreds of hops and great lengths. The requirements for routing in linear topologies are minimal relative to the requirements of other topologies. There are currently several network architectures and routing protocols for wireless sensor networks, which have been created based on the application that will run on the nodes. Routing protocols designed for mesh, tree, and star topologies are very complex when applied to linear multi-hop topologies, resulting in large processing delays. This article defines the relevance of the existence of the network level in the network architecture with linear topology, for which the functions of the network protocols that are applicable to linear topologies are analyzed. Finally, it is justified that the network level is not necessary in wireless sensor networks with linear topology, and as a consequence, the network levels that the new network architecture should have are proposed.


Author(s):  
A. Radhika ◽  
D. Haritha

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.


2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Asmaa Ez-Zaidi ◽  
Said Rakrak

Wireless sensor networks have been the subject of intense research in recent years. Sensor nodes are used in wide range of applications such as security, military, and environmental monitoring. One of the most interesting applications in wireless sensor networks is target tracking, which mainly consists in detecting and monitoring the motion of mobile targets. In this paper, we present a comprehensive survey of target tracking approaches. We then analyze them according to several metrics. We also discuss some of the challenges that influence the performance of tracking schemes. In the end, we conduct detailed analysis and comparison between these algorithms and we conclude with some future directions.


Author(s):  
Naveen Chilamkurti ◽  
Sohail Jabbar ◽  
Abid Ali Minhas

Network layer functionalists are of core importance in the communication process and so the routing with energy aware trait is indispensable for improved network performance and increased network lifetime. Designing of protocol at this under discussion layer must consider the aforementioned factors especially for energy aware routing process. In wireless sensor networks there may be hundreds or thousands of sensor nodes communicating with each other and with the base station, which consumes more energy in exchanging data and information with the additive issues of unbalanced load and intolerable faults. Two main types of network architectures for sensed data dissemination from source to destination exist in the literature; Flat network architecture, clustered network architecture. In flat architecture based networks, uniformity can be seen since all the network nodes work in a same mode and generally do not have any distinguished role.


2020 ◽  
pp. 372-399
Author(s):  
Naveen Chilamkurti ◽  
Sohail Jabbar ◽  
Abid Ali Minhas

Network layer functionalists are of core importance in the communication process and so the routing with energy aware trait is indispensable for improved network performance and increased network lifetime. Designing of protocol at this under discussion layer must consider the aforementioned factors especially for energy aware routing process. In wireless sensor networks there may be hundreds or thousands of sensor nodes communicating with each other and with the base station, which consumes more energy in exchanging data and information with the additive issues of unbalanced load and intolerable faults. Two main types of network architectures for sensed data dissemination from source to destination exist in the literature; Flat network architecture, clustered network architecture. In flat architecture based networks, uniformity can be seen since all the network nodes work in a same mode and generally do not have any distinguished role.


2020 ◽  
pp. 147-168
Author(s):  
Anju Sangwan ◽  
Rishipal Singh

In the hostile areas, deployment of the sensor nodes in wireless sensor networks is one of the basic issue to be addressed. The node deployment method has great impact on the performance metrics like connectivity, security and resilience. In this paper, a technique based on strong keying mechanism is proposed which will enhance the security of a non-homogeneous network using the random deployment of the nodes. For this, the q-composite key pre-distribution technique is presented with new flavor that will enhance the network size as well as the security level in comparison to the existing techniques. The technique ensures the k-connectivity among the nodes with a redundant method to provide backup for failed nodes. In the simulation section, the performance of the proposed scheme is evaluated using NS-2 based upon the real model MICAz. A discussion based on various obtained results is also given in the paper.


2018 ◽  
Vol 7 (4.12) ◽  
pp. 20
Author(s):  
Navneet Kaur ◽  
Dr. Sahil Verma ◽  
Dr. Kavita

Wireless Sensor Networks(WSNs) comprise sensor nodes which find applications in a wide variety of fields such as medical, wildlife, security, environment, industry. A network communication is initialized and accomplished with the aid of routing protocols. A routing protocol is a set of rules which govern the routing phenomenon. WSNs protocols for the purpose of routing have been the ubiquitous option of the researchers in the recent years due to their exorbitant scope of improvement. The objective of a routing protocol is to inquest for a relevant route amidst sender and receiver to accomplish successful transmission at the destination .Dissipation of energy and lengthening the duration of the network have always been one of the major points of research gaps. As the nodes in WSNs in are battery operated, so they can only use restricted energy to proceed with the communication and transmission operation. To cope up with this, a number of researchers have come up with developments in the field of energy efficacy and optimizations in WSNs routing protocols. A reify summarization of some protocols for routing purposes has been manifested in this paper.


2010 ◽  
Vol 34-35 ◽  
pp. 1019-1023
Author(s):  
Zhao Feng Yang ◽  
Ai Wan Fan

Wireless sensor networks consist of hundreds or thousands of sensor nodes that involve numerous restrictions including computation capability and battery capacity. In this paper we propose an optimal algorithm with genetic algorithm taken into consideration, and compare it with three well known and widely used approaches, i.e., LEACH and LEACH-C, in performance evaluation. Experimental results show that the proposed approach increases the overall network lifetime, and data delivery at the base station than the other routing protocols. Key words: Wireless sensor networks, base station, heuristic optimized genetic algorithm, low energy adaptive clustering hierarchy


Sensors ◽  
2018 ◽  
Vol 18 (5) ◽  
pp. 1619 ◽  
Author(s):  
Anwar Khan ◽  
Ihsan Ali ◽  
Abdullah Ghani ◽  
Nawsher Khan ◽  
Mohammed Alsaqer ◽  
...  

2018 ◽  
Vol 14 (2) ◽  
pp. 131-137
Author(s):  
Lanny Sitanayah

Wireless Sensor Networks (WSNs) are subject to failures. Even though reliable routing protocols for WSNs exist and are well-understood, the physical network topology must ensure that alternate routes with an acceptable length to the sinksare in fact available when failures occur. This requires a sensor network deployment to be planned with an objective of ensuring some measure of robustness in the topology, so that when failures do occur the protocols can continue to offer reliable delivery. To ensure that sensor nodes have sufficient paths, it may be necessary to add a number of additional relay nodes, which do not sense, but only forward data from other nodes. In this paper, we review a range of existing algorithms to deploy relay nodes for fault tolerance. We classify the state-of-the-art relay placement algorithms based on routing structures, connectivity requirements, deployment locations, and fault-tolerant requirements.


Sign in / Sign up

Export Citation Format

Share Document