Computer Science – Networking and Internet Architecture
Scientific paper
2010-04-19
IJCSI, Volume 7, Issue 2, March 2010
Computer Science
Networking and Internet Architecture
International Journal of Computer Science Issues online at http://ijcsi.org/articles/DBSR-Dynamic-base-station-Repositioning-u
Scientific paper
Wireless sensor networks (WSNs) are commonly used in various ubiquitous and pervasive applications. Due to limited power resources, the optimal dynamic base station (BS) replacement could be Prolong the sensor network lifetime. In this paper we'll present a dynamic optimum method for base station replacement so that can save energy in sensors and increases network lifetime. Because positioning problem is a NPhard problem [1], therefore we'll use genetic algorithm to solve positioning problem. We've considered energy and distance parameters for finding BS optimized position. In our represented algorithm base station position is fixed just during each round and its positioning is done at the start of next round then it'll be placed in optimized position. Evaluating our proposed algorithm, we'll execute DBSR algorithm on LEACH & HEED Protocols.
Khanli Leili Mohammad
Mollanejad Amir
Zeynali Mohammad
No associations
LandOfFree
DBSR: Dynamic base station Repositioning using Genetic algorithm in wireless sensor network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with DBSR: Dynamic base station Repositioning using Genetic algorithm in wireless sensor network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and DBSR: Dynamic base station Repositioning using Genetic algorithm in wireless sensor network will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-60333