Energy Resource Optimization for Home Area Sensor Networks Using Discrete Venus Flytrap Algorithm

Energy Resource Optimization for Home Area Sensor Networks Using Discrete Venus Flytrap Algorithm

Rathipriya Ramalingam, Sivabalan Settu
Copyright: © 2021 |Pages: 15
DOI: 10.4018/IJAMC.2021100103
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The energy resource selection (ERS) problem for home area sensor network is defined as the selection of the optimal external energy resource from the energy source station for the sensor nodes to avoid uninterrupted service and extends the network lifespan. In this paper, the discrete Venus fly-trap search algorithm (DVFS) is proposed to select the optimal energy source for sensor nodes in the HASN. Discrete Venus fly-trap search algorithm is a population-based, non-swarm intelligence search algorithm that copycats the foraging behaviors of Venus fly-trap plant.
Article Preview
Top

1. Introduction

For the past two decades, many meta-heuristic optimization algorithms are proposed to solve problems in different fields. Nowadays, these algorithms are quite popular methods because of their excellent computation power and easy conversion to the real problem. Meta-heuristic methods are very general, which can be adapted easily to any type of problem with a single objective or multi-objective (Kalita, K., Dey, P., Haldar, S., & Gao, X. Z., 2019).

A recent study indicates that plants also exhibit intelligent behaviors, which can be modeled mathematically for the system model and objective function. For example, foraging behavior of Venus flytrap, a carnivorous plant can be modeled as an optimal search algorithm for identifying the optimal solution under specified constraints.

Swarm Intelligence based Search algorithms inspired by social insects, fish, bird flocking, honey bees, etc., mimic direct or indirect communication among individuals, especially information regarding promising search space for their foraging. But, many species search for food independently and autonomously rather than cooperatively. Such species also have food search stratagems to maintain the species, which is known as Non-Swarm Intelligence.

The Discrete Venus Fly-Trap Search Algorithm (DVFS) is modeled based on the foraging behavior of Venus Fly-Trap plant. The botanical name of Venus flytrap is Dionaea Muscipula is shown in the following figure 1. The great scientist Darwin quoted this plant as “one of the most wonderful in the world.” This algorithm devised on the rapid closure action of its traps (also called as leaves). This trap closure is due to the stimulation of the trigger hairs that present in the two lobes of the leaf by the movements of prey (small insects, small animals, raindrop, fast blowing wind, etc.). The traps in this plant search for their food independently and autonomously without any information exchange among them (Sivabalan S, Gowri R, Rathipriya R, 2015).

Energy Resource Optimization (ERO) is a technique that can find an optimal energy resource selection for a home appliance through wireless power transfer to calculate the overall network energy consumption. In this paper, the Discrete Venus Fly-Trap Search Algorithm (DVFS) is the new optimal search algorithm devised the first time for selecting energy sources (Gowri R, Sivabalan S, Rathipriya R, 2015). The remaining part of the paper organized as follows. Section 2 presents the state-of-the-art of energy-efficient sensor network models using optimization algorithms. Section 3 describes the methods and materials needed for the proposed work. The detail description of the proposed work is in section 4. The summary and possible future enhancement are in Section 5.

Figure 1.

Different Stages of Venus Fly-Trap

IJAMC.2021100103.f01
Top

2. Review Of Literature

Table 1 describes the detailed assessment of the state-of-the-art in energy-efficient model techniques for sensor network and the issues in the present research work related to node energy saving.

Complete Article List

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