B.3. Communication/Networking and Information Technology
Ali Abdi Seyedkolaei
Abstract
Deploying multiple sinks instead of a single sink is one possible solution to improve the lifetime and durability of wireless sensor networks. Using multiple sinks leads to the definition of a problem known as the sink placement problem. In this context, the goal is to determine the optimal locations ...
Read More
Deploying multiple sinks instead of a single sink is one possible solution to improve the lifetime and durability of wireless sensor networks. Using multiple sinks leads to the definition of a problem known as the sink placement problem. In this context, the goal is to determine the optimal locations and number of sink nodes in the network to maximize the network's lifetime. In this paper, we propose a dynamic sensor assignment algorithm to address the sink placement problem and evaluate its performance against existing solution methods on a diverse set of instances. We conducted experiments in two stages. In the first stage, based on random instances and compared to the exact computational method using the CPLEX solver, and in the second stage, based on real-world instances compared to MC-JMSP (Model-Based Clustering- Joint Multiple Sink Placement) method. The results obtained in the first stage of the experiments indicate the superiority of the dynamic sensor assignment algorithm in runtime for all instances. Furthermore, the solution obtained by the dynamic sensor assignment algorithm is very close to the solution obtained by the CPLEX solver. In particular, the percentage error of the solution found by the proposed method compared to CPLEX in all experimented instances is less than 0.15%, indicating the effectiveness of the proposed method in finding the appropriate solution for assigning sensors to sinks. Also, the results of the second stage experiments show the superiority of the proposed method in both execution time and energy efficiency compared to the MC-JMSP method.
