Abstract
Sink mobility is one of the most effective solutions for improving lifetime and has been widely investigated for the last decade. Algorithms for single-sink mobility are not directly applied to the multiple-sink case due to the latter’s specific challenges. Most of the approaches proposed in the literature use mathematical programming techniques to solve the multiple-sink mobility problem. However, doing so leads to higher complexities when traffic flow information for any possible sink-site combinations is included in the model. In this paper, we propose two algorithms that do not consider all possible sink-site combinations to determine migration points. We first present a centralized movement algorithm that uses an energy-cost matrix for a user-defined threshold number of combinations to coordinate multiple-sink movement. We also give a distributed algorithm that does not use any prior network information and has a low message exchange overhead. Our simulations show that the centralized algorithm gives better network lifetime performance compared to previously proposed MinDiff-RE, random movement, and static-sink algorithms. Our distributed algorithm has a lower network lifetime than centralized algorithms; sinks travel significantly less than in all the other schemes.
Highlights
Moving sink nodes is among the most effective solutions to improve network lifetime in wireless sensor networks (WSNs) where sinks can move [1]
We present two low-complexity algorithms for multiple-sink mobility problem, multiple-sink movement algorithm (MSMA) and prevent and move away (PMA) algorithm
Algorithms proposed to solve the multiple-sink mobility problem usually consider the amount of traffic between nodes when sinks are placed at certain locations/sites [26, 27]
Summary
Moving sink nodes (base stations or mobile agents) is among the most effective solutions to improve network lifetime in wireless sensor networks (WSNs) where sinks can move [1]. Experiments show that MinDiff-RE gives better network lifetime compared to other approaches These heuristics are presented as energy-efficient and low-complexity algorithms, Max-Min-RE and MinDiffRE need to process all combinations before selecting the migration points. These methods can be practical for small values of number of sinks and sites. The simulation results show that the proposed schemes improve lifetime significantly compared to the cases of a static-sink case and random mobility Authors both give an efficient method for solving LP and a centralized heuristic for solving the multiple-sink problem. Algorithms proposed to solve the multiple-sink mobility problem usually consider the amount of traffic (directly or indirectly) between nodes when sinks are placed at certain locations/sites [26, 27]. The other option is to visit those location combinations and form topology trees for each combination to determine the child-parent relationship and energy expenditure values to construct matrices in a training phase, as in [27], before x 104 4.5
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
