scholarly journals REVIEW ON HIERARCHICAL ROUTING IN WIRELESS SENSOR NETWORKS

Author(s):  
ER NEETIKA ◽  
SIMARPREET KAUR

The Wireless Sensor Network(WSN) has become an interesting field of research of the 21st century. It is a type of the wireless ad-hoc network. This has brought about developing low cost, low-power and multi-function sensor nodes. The network life for wireless sensor network plays an important role in survivability. Energy efficiency is one of the critical concerns for wireless sensor networks. Sensor nodes are strictly constrained in terms of storage, board energy and processing capacity. For these reasons, many new protocols have been proposed for the purpose of data routing in sensor networks. These protocols can be classified into three main categories: data-centric, location-based and hierarchical. This paper mainly deals with some of the major Energy-efficient hierarchical routing protocols for wireless sensor networks. First we will discuss the energy-efficient Hierarchical routing protocols in brief along with their important features, objectives, drawbacks and area of application. Finally, we provide a comparison of these various protocols.

Wireless sensor network consists of various sensor nodes connected through wireless media. Sensor nodes are tiny devices having lesser energy capabilities. Sensor nodes are either ad-hoc or mobile in their environment. Wireless sensor network route of transmission media is discovered by routing protocols and responsible for secure communication between sensor nodes. Energy is a precious resource of sensor nodes, and the entire lifetime of WSNs is depending on the energy capability of the sensor nodes. The fundamental problem is how to organize topology of WSN for deployed sensor nodes with lesser power consumption as possible. Major problems in wireless sensor networks which consume extra energy are interference, control message overhead, packet delay, unnecessary transmission, and bandwidth utilization. Therefore, energy efficient techniques are needed to overcome these problems. Hierarchical routing is the best routing method for finding optimal path between sensor nodes which enhance the lifetime of the network. This paper focuses towards various hierarchical energy efficient routing in wireless sensor networks and analyzes various features of WSN that should consider during designing of routing protocols.


2019 ◽  
Vol 29 (09) ◽  
pp. 2050141 ◽  
Author(s):  
Muhammed Enes Bayrakdar

In this paper, a monitoring technique based on the wireless sensor network is investigated. The sensor nodes used for monitoring are developed in a simulation environment. Accordingly, the structure and workflow of wireless sensor network nodes are designed. Time-division multiple access (TDMA) protocol has been chosen as the medium access technique to ensure that the designed technique operates in an energy-efficient manner and packet collisions are not experienced. Fading channels, i.e., no interference, Ricean and Rayleigh, are taken into consideration. Energy consumption is decreased with the help of ad-hoc communication of sensor nodes. Throughput performance for different wireless fading channels and energy consumption are evaluated. The simulation results show that the sensor network can quickly collect medium information and transmit data to the processing center in real time. Besides, the proposed technique suggests the usefulness of wireless sensor networks in the terrestrial areas.


Author(s):  
Maha Salih Abdulridha ◽  
Ghaihab Hassan Adday ◽  
Imad S. Alshawi

The wide deployment of wireless sensor networks is the primary reason behind the advancement of numerous routing protocols. In this context, sensors need to be remotely conveyed in unattended situations. Further, propels in wireless sensor network innovation have ensured accessibility and minimal effort in terms of sensor hubs with a capacity to sense various physical and natural environment conditions, in addition to wireless communication and data processing. Moreover, wireless sensor networks are rather different from regular and cellular networks, which comprise nodes with restricted bandwidth and energy. However, the most important limitation of wireless sensor networks is their characteristic limited energy resources. Furthermore, there is an imbalance of power consumption in their sensor nodes. Therefore, it is preferable to distribute the amount of energy throughout a wireless sensor network to minimize the maintenance and maximize the overall system performance. To this end, this paper suggests a new strategy in wireless sensor network dissemination and routing protocols referred to as the Fast Simple Flooding Strategy, which focuses on energy efficiency as a crucial design objective for routing protocols used in wireless sensor networks, without the overhead of other design factors, and reduces end-to-end latency. Additionally, this new strategy can be listed under flat approaches; it is simple and very fast in delivering the packet to the sink and does not require additional equipment or complex mathematical operations. It also resolves the major drawbacks of classic flooding and gossiping.


The technological advances in wireless communication systems and digital data processing techniques has given rise to many innovative intelligent networks. One such network is wireless sensor network (WSN). In recent past, huge growth has been perceived in the applications of WSN. In wireless sensor network, the battery powered sensor nodes are scattered in a monitoring area and it is impossible to replace the batteries of sensor nodes after deployment. Therefore, energy efficiency remains a prime concern in design of WSNs. The routing protocols help to find energy efficient routes and increases the lifetime of WSNs. The cluster-based routing techniques play an important role in design of energy efficient WSNs. However, authors analyzed two types of sensor networks in the literature such as homogeneous and heterogeneous networks. In homogeneous clustering, all sensor nodes possess same level of initial energy and cluster head (CH) formation probability of each node in such networks remains equal. In heterogeneous clustering, the nodes are bifurcated into three energy levels such as normal node, advanced node and super node. Therefore, the CH formation probability of a node in such network depends on the type of node. This paper presented a survey on recent energy efficient routing protocols in homogeneous as well as heterogeneous wireless sensor networks. The energy efficient routing protocols are classified based on some quality of service (QoS) metrics such as energy efficiency, network lifetime, network stability, cluster head selection threshold and heterogeneity levels.


Author(s):  
Vasaki Ponnusamy ◽  
Azween Abdullah ◽  
Alan G. Downe

This research presents a survey of energy efficient routing protocols in sensor network by categorizing into a main classification as architecture based routing. Architecture based routing is further classified into two main areas: flat or location based routing protocol, and hierarchical based routing protocols. Flat based routing is more suitable when a huge number of sensor nodes are deployed, and location based routing is employed when nodes are aware of their location. Hierarchical routing look into alternative approach by placing intermediate nodes in terms of cluster heads, gateway nodes, or mobile entities for efficient handling of energy. The survey is presented in order to highlight the advantage of hierarchical based routing, mainly the deployment of mobility routing. As not many surveys have been conducted in mobility based routing, this chapter can be helpful for looking into a new perspective and paradigm of energy efficient routing protocols.


2015 ◽  
Vol 4 (1) ◽  
Author(s):  
Syopiansyah Jaya Putra, Siti Ummi Masruroh

The main goal of this research is concerning clustering protocols to minimize the energy consumption of each node, and reduce number of transmission in wireless sensor network. However, most existing clustering protocols consume large amounts of energy, incurred by cluster formation overhead and fixed-level clustering, particularly when sensor nodes are densely deployed in wireless sensor networks. In this paper, we propose TPR (Teen-Pegasis Routing)  protocol, which is a  low energy adaptive clustering hierarchy and  threshold sensitive  energy  efficient sensor  network protocol.  This proposed algorithm combine both proactive and reactive routing protocol. Keywords: Wireless sensor networks (WSN), LEACH, PEGASIS, TEEN


Author(s):  
Ms Mamta

Wireless Sensor Network (WSN) has delivered the accessibility of small, tiny and low cost sensor nodes which are capable to sense various kinds of physical and environmental conditions, data processing, wireless communication and data gathering. In wireless sensor network routing protocols can be divided into two categories first is flat routing protocol and another is hierarchical routing protocol. In this paper flat and hierarchical routing protocols are evaluated and compared based on various performance parameters. In the last decade we have seen expanded enthusiasm for the potential utilization of remote wireless sensor systems (WSNs) in an extensive change of uses and it has turned into a unique research zone. So finally, in this research paper we are focusing on two different classes of routing protocols in WSN: flat routing and hierarchical or clustering routing.


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.


2020 ◽  
Author(s):  
Ademola Abidoye ◽  
Boniface Kabaso

Abstract Wireless sensor networks (WSNs) have been recognized as one of the most essential technologies of the 21st century. The applications of WSNs are rapidly increasing in almost every sector because they can be deployed in areas where cable and power supply are difficult to use. In the literature, different methods have been proposed to minimize energy consumption of sensor nodes so as to prolong WSNs utilization. In this article, we propose an efficient routing protocol for data transmission in WSNs; it is called Energy-Efficient Hierarchical routing protocol for wireless sensor networks based on Fog Computing (EEHFC). Fog computing is integrated into the proposed scheme due to its capability to optimize the limited power source of WSNs and its ability to scale up to the requirements of the Internet of Things applications. In addition, we propose an improved ant colony optimization (ACO) algorithm that can be used to construct optimal path for efficient data transmission for sensor nodes. The performance of the proposed scheme is evaluated in comparison with P-SEP, EDCF, and RABACO schemes. The results of the simulations show that the proposed approach can minimize sensor nodes’ energy consumption, data packet losses and extends the network lifetime


The emergence of sensor networks as one of the dominant technology trends in the coming decades has posed numerous unique challenges on their security to researchers. These networks are likely to be composed of thousands of tiny sensor nodes, which are low-cost devices equipped with limited memory, processing, radio, and in many cases, without access to renewable energy resources. While the set of challenges in sensor networks are diverse, we focus on security of Wireless Sensor Network in this paper. First, we propose some of the security goal for Wireless Sensor Network. To perform any task in WSN, the goal is to ensure the best possible utilization of sensor resources so that the network could be kept functional as long as possible. In contrast to this crucial objective of sensor network management, a Denial of Service (DoS) attack targets to degrade the efficient use of network resources and disrupts the essential services in the network. DoS attack could be considered as one of th


Sign in / Sign up

Export Citation Format

Share Document