%0 Journal Article
%A Kuchaki Rafsanjani, M.
%A Dowlatshahi, M. B.
%A Nezamabadi-Pour, H.
%T Gravitational Search Algorithm to Solve the K-of-N Lifetime Problem in Two-Tiered WSNs
%J Iranian Journal of Mathematical Sciences and Informatics
%V 10
%N 1
%U http://ijmsi.ir/article-1-333-en.html
%R 10.7508/ijmsi.2015.01.006
%D 2015
%K Wireless sensor network (WSN), Two-tiered WSNs, Base station location, Energy consumption, Network lifetime, Gravitational search algorithm (GSA).,
%X 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.
%> http://ijmsi.ir/article-1-333-en.pdf
%P 81-93
%& 81
%!
%9 Research paper
%L A-10-349-1
%+ Shahid Bahonar University of Kerman
%G eng
%@ 1735-4463
%[ 2015