DBSR: Dynamic base station Repositioning using Genetic algorithm in wireless sensor network
Amir Mollanejad, Leili Mohammad Khanli, Mohammad Zeynali

TL;DR
This paper introduces DBSR, a genetic algorithm-based method for dynamically repositioning the base station in wireless sensor networks to optimize energy use and extend network lifetime.
Contribution
It presents a novel genetic algorithm approach for dynamic base station repositioning considering energy and distance, improving network longevity.
Findings
Enhanced network lifetime with dynamic repositioning
Effective energy savings through optimized base station placement
Validated on LEACH and HEED protocols
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEnergy Efficient Wireless Sensor Networks · Indoor and Outdoor Localization Technologies · IoT-based Smart Home Systems
