Linear Complexity for k-Coverage Sensor Redundancy Determination in IoT
Chenait, Manel; Benzaïd, Chafika; Zebbane, Bahia (2023-11-27)
IEEE
27.11.2023
M. Chenait, C. Benzaïd and B. Zebbane, "Linear Complexity for k-Coverage Sensor Redundancy Determination in IoT," 2023 International Symposium on Networks, Computers and Communications (ISNCC), Doha, Qatar, 2023, pp. 1-6, doi: 10.1109/ISNCC58260.2023.10324000
https://rightsstatements.org/vocab/InC/1.0/
© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:oulu-202401181314
https://urn.fi/URN:NBN:fi:oulu-202401181314
Tiivistelmä
Abstract
Sensors play a crucial role in the IoT frameworks by enabling devices to collect and transmit data in k-coverage situations. However, maintaining k-coverage in a region of Interest (RoI) requires the concurrent activation of many sensors where at least k nodes (k > 1), should cover each location in the sensing region. Due to overlaps in their sensing disks, sensors may be redundant and consume energy unnecessarily, in most k-coverage scenarios. In this paper, we propose SRA-Rot-k lmax ; a new redundancy algorithm that can affordably determine redundant sensors with a linear running time complexity even in k-coverage situations. A sensor is redundant in SRA- Rot-k lmax , if its neighbors belong to particular sub-regions within its sensing disk denoted Flower areas (FA). A logical rotation with a certain angle value a is preformed to determine all possible Flower areas of a sensing disk and their local coverage degree k lmax . Finally, according to klmax of each sensor, the coverage degree of the entire RoI is obtained. Simulations show that the proposed algorithm outperforms well-known k-coverage protocols in terms of energy conservation, network lifetime, and coverage performance.
Sensors play a crucial role in the IoT frameworks by enabling devices to collect and transmit data in k-coverage situations. However, maintaining k-coverage in a region of Interest (RoI) requires the concurrent activation of many sensors where at least k nodes (k > 1), should cover each location in the sensing region. Due to overlaps in their sensing disks, sensors may be redundant and consume energy unnecessarily, in most k-coverage scenarios. In this paper, we propose SRA-Rot-k lmax ; a new redundancy algorithm that can affordably determine redundant sensors with a linear running time complexity even in k-coverage situations. A sensor is redundant in SRA- Rot-k lmax , if its neighbors belong to particular sub-regions within its sensing disk denoted Flower areas (FA). A logical rotation with a certain angle value a is preformed to determine all possible Flower areas of a sensing disk and their local coverage degree k lmax . Finally, according to klmax of each sensor, the coverage degree of the entire RoI is obtained. Simulations show that the proposed algorithm outperforms well-known k-coverage protocols in terms of energy conservation, network lifetime, and coverage performance.
Kokoelmat
- Avoin saatavuus [38841]