A Level-Wise Periodic Tree Construction Mechanism for Sleep Scheduling in WSN

Abstract

<jats:p>The wireless sensor network (WSN) has been extensively used to monitor and control the natural ecosystem on a large scale like air quality, natural life, etc. Low battery power,low storage, and limited processing ability are the most critical areas of concern in WSN. To reduce energy utilization, the sensor nodes in WSN work in a cyclic process between active and sleep mode. A certain number of nodes are chosen active and they are responsible for sensing as well as data transmission and rest of the nodes are gone to sleep. In order to lengthen the lifetime of network, in this paper we proposed a level wise periodic tree construction algorithm that uses a specific set of nodes to participate in tree construction, instead of all the nodes, to minimize the energy consumption. In this proposed approach, the main idea is to put the nodes, which are currently active and have already spent a significant amount of energy, to sleep mode, while giving chances to the leaf nodes, which has comparatively spent less energy, to become an active node and maintain connectivity. The performance of the proposed protocol is evaluated using the Castalia simulator. The simulation results show that the proposed level-wise periodic tree construction approach increases the durability of the network in conjunction with the non-level approach.</jats:p>

Improved Localized Sleep Scheduling Techniques to Prolong WSN Lifetime

“…To fulfill the primary objective of WSN, i.e., sense the whole deployed area along with maintaining network lifetime, the proposed level-wise tree construction approach includes the area coverage into consideration to fulfill the above two requirements. To validate the efficiency of the proposed algorithm with respect to network lifetime, in figure 4.1, we compare the number of nodes alive after each tree reconstruction round in the proposed approach compared to the normal level-wise approach given [27]. From this figure, it is observed that after 46 th round, the nodes start dying out in both the earlier approach and the proposed approach.…”

“…In order to evaluate the longevity of the proposed protocol, we simulated both the earlier approach [27] as well as the proposed approach to identify the number of sleep nodes present in different rounds of the tree reconstruction as shown in figure 4.6. This figure ensures that the network lifetime achieved through the proposed approach is far better than the earlier level-wise tree construction approach.…”

“…Number of nodes alive after each tree reconstruction round in the normal level-wise tree construction approach[27] vs the proposed level-wise tree construction along with coverage. Number of dead nodes, sleep nodes and coverage node after each each tree reconstruction rounds.…”