Title of article :
Gravitational Search Algorithm to Solve the K-of-N Lifetime Problem in Two-Tiered WSNs
Author/Authors :
Kuchaki Rafsanjani، Marjan نويسنده , , Dowlatshahi، Mohammad Bagher نويسنده Department of Computer Science, Shahid Bahonar University of Kerman, Kerman, Iran. , , Nezamabadi-Pour، Hossein نويسنده Department of Electrical Engineering, Shahid Bahonar University of Kerman, Kerman, Iran. ,
Issue Information :
فصلنامه با شماره پیاپی سال 2015
Abstract :
Wireless Sensor Networks (WSNs) are networks of autonomous
nodes used for monitoring an environment. In designing WSNs, one of
the main issues is limited energy source for each sensor node. Hence,
offering ways to optimize energy consumption in WSNs which eventually increases the network lifetime is strongly felt. Gravitational Search
Algorithm (GSA) is a novel stochastic population-based meta-heuristic
that has been successfully designed for solving continuous optimization
problems. GSA has a flexible and well-balanced mechanism to enhance
intensification (intensively explore areas of the search space with high
quality solutions) and diversification (move to unexplored areas of the
search space when necessary) abilities. In this paper, we will propose
a GSA-based method for near-optimal positioning of Base Station (BS)
in heterogeneous two-tiered WSNs, where Application Nodes (ANs) may
own different data transmission rates, initial energies and parameter values. Here, we treat with the problem of positioning of BS in heterogeneous
two-tiered WSNs as a continuous optimization problem and show that proposed GSA can locates the BS node in an appropriate near-optimal
position of heterogeneous WSNs. From the experimental results, it can
be easily concluded that the proposed approach finds the better location
when compared to the PSO algorithm and the exhaustive search.
Journal title :
Iranian Journal of Mathematical Sciences and Informatics (IJMSI)
Journal title :
Iranian Journal of Mathematical Sciences and Informatics (IJMSI)