Orphan Node Connected Management in Multi-Hop Clustering-Based Routing Protocols for Wireless Sensor Networks

Orphan Node Connected Management in Multi-Hop Clustering-Based Routing Protocols for Wireless Sensor Networks

Wassim Jerbi (Higher Institute of Technological Studies, Tunisia), Abderrahmen Guermazi (CES Lab, Higher Institute of Technological Studies, Tunisia) and Hafedh Trabelsi (CES Lab, National School of Engineering of Sfax, University of Sfax, Tunisia)
DOI: 10.4018/IJITN.2019100101
OnDemand PDF Download:
No Current Special Offers


In distributed clustering protocols, the selection of a cluster head CH presents a major constraint to the proper functioning of the network. Generally, the process begins with a random choice of CHs at the time of cluster formation. A selective process is then used based on a probabilistic or iterative calculation in order to choose the different CHs. This approach leads to a non-uniform distribution of the different CHs. Indeed, in some cycles, the CHs may be concentrated in a part of the monitored area, some CH nodes fail to reach its neighbor CH. They are considered as isolated nodes in the network. The major contribution of this article is to propose a solution to maximize the number of nodes connected to the networks, in order to have an improved connectivity. However, the coverage of the entire monitored area can provide persistent information to WSN applications. The work in this paper resulted in the design and development of a new distributed clustering protocol called Orphan_Nodes_Connected (ONC) protocol that significantly improves the connectivity of the monitored area.
Article Preview

1. Introduction

The advancement of wireless sensor technology has improved communication and monitoring the environment surrounding us. Several research studies have been carried out on the WSNs. Not all sensor nodes are able to reach the base station in a single message because the monitored area can be so wide and the range of the signal is limited. The cluster head nodes send their data over multi-hop paths to the base station. Routing paths should be created to route data to the sink. The range of the signal is proportional to the remaining energy of the node. The sensor nodes are equipped with a microcontroller, a memory and a radio module with low power consumption. At T rounds, the energy of the node will be dissipated so the signal weakens. New perspectives have emerged in various fields such as agriculture, civil protection and environmental control the focus of this study is forest fires. However, these sensor nodes have limitations in terms of memory size, processing power, communication range and power supply. There are several families of routing protocols defined for WSN, for instance, flat routing, hierarchical routing, data centric routing, location-based routing protocols ... The routing protocols belonging to these families take account of the specificities of the sensor nodes described and above all they ensure energy saving. Hierarchical protocols based on clustering are designed to save more energy. These protocols assign different roles to the sensor nodes, such as the role of an ordinary node, the role of cluster head and the role of a Gateway node. The cluster head collects data from member nodes. Then, it performs data aggregation treatments before sending the aggregated data to the base station. From one cycle to another, a sensor node can change its role. This organizational dynamic makes it possible to standardize the energy consumption. The processes carried out by the clustering theory, such as merging, aggregating, data compression, eliminating redundant data and reducing the number of messages circulating in the network, have resulted in better consumption of data energy for WSN.

The clustering technique makes it possible to partition the network into a subset of clusters. The latter are more homogeneous according to a specific metric. Each cluster consists of a particular sensor node called the cluster head (CH). The role of CH consists in coordinating among the members of its cluster, thus collecting the data and aggregating them and then transmitting them to the base station. The CH is selected to facilitate this role according to very specific metrics. the most answered protocols run as follows:

  • Each sensor node should know its neighbors;

  • Each node takes the decision (autonomous) according to its local knowledge of the topology to be chief cluster or not according to metrics used for each type of protocol;

  • Sensor node elected as the cluster head broadcasts its status to all neighboring nodes that are within its reach, and invites its neighbors that are not yet connected to other clusters to join it.

Among the best-known protocols, we can single out LEACH (Heinzelman, Chandrakasan & Balakrishnan, 2000), HEED (Younis & Fahmy, 2004), PEGASIS (Lindsey, Raghavendra & Sivalingam, 2002), TEEN (Manjeshwar & Agrawal, 2001), APTEEN (Manjeshwar & Agrawal, 2002) and CPCP (Soro & Heinzelman, 2009).

The LEACH protocol (Low-Energy Adaptive Clustering Hierarchy) is known as a pioneering protocol of distributed clustreing. It is based on a probabilistic calculation to select the cluster head. Successive LEACH protocols have involved other parameters for the selection of cluster head, such as residual energy (Perillo & Heinzelman, 2004; Singh, Kumar, and Singh, 2017), location, signal strength, etc. However, most of these protocols do not guarantee full coverage of the network for all cycles. Indeed, in some cycles, cluster head may be concentrated in a part of the monitored area, some ordinary nodes fail to reach a cluster head. They are considered orphaned nodes in the network.

Complete Article List

Search this Journal:
Open Access Articles
Volume 14: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 13: 4 Issues (2021)
Volume 12: 4 Issues (2020)
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing