Sustainable Maintenance of Connected Dominating Set by Solar Energy Harvesting for IoT Networks

被引:10
作者
Chowdhury, Chandrani Ray [1 ]
Mandal, Chittaranjan [1 ]
Misra, Sudip [1 ]
机构
[1] Indian Inst Technol Kharagpur, Dept Comp Sci & Engn, Kharagpur 721302, India
来源
IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING | 2022年 / 6卷 / 04期
关键词
Maintenance engineering; Green products; Approximation algorithms; Solar panels; Solar energy; Hysteresis; Energy harvesting; Connected dominating set; node disjoint maximum weighted independent set; maximum connected Steiner tree; approximation algorithm; solar energy harvesting; sustainable; WIRELESS SENSOR NETWORKS; ALGORITHM; CONSTRUCTION; APPROXIMATION;
D O I
10.1109/TGCN.2022.3175035
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
A new scheme, Sustainability in Dominating Set (SID), to construct and maintain a sustainable and adaptive node disjoint weighted connected dominating set (CDS) is presented for solar energy harvesting-enabled Internet of Things (IoT) networks. The primary contribution of this work is the design of an approximation algorithm for CDS construction and maintenance in energy harvesting-enabled IoT networks, which is triggered when energy of any CDS node falls below a threshold. This is a new CDS construction approach of approximation ratio $\frac {\delta w(G) + 1}{2} + (1 + \ln 5) |O_{p}|$ , where $\delta w(G)$ and $|O_{p}|$ are weighted average degree of the network and optimal number of Steiner nodes, respectively. The extensive simulation results show that per-slot-rotation-based SID (SIDS) improves residual energy (saves by 14.3%, 25.6%, 8.25% and 8%), message complexity (reduces by 88.5%, 34% and 72.75% and 83.25%), and average CDS size (reduces by 9.01%, 9.09%, 41.75%, and 54.5%) for two scenarios and cloud cover 0.25, 0.5 and 0.8, compared to LMW, Improved LMW (ILMW), DataCDS and UCDS, respectively. Merely based on threshold switching, SID enhances residual energy, message complexity, and CDS size by 3.08%, 51.88%, and 4% for all scenarios and cloud covers compared to SIDS, respectively.
引用
收藏
页码:2115 / 2127
页数:13
相关论文
共 27 条
  • [1] An algorithm based on ant colony optimization for the minimum connected dominating set problem
    Bouamama, Salim
    Blum, Christian
    Fages, Jean-Guillaume
    [J]. APPLIED SOFT COMPUTING, 2019, 80 : 672 - 686
  • [2] UNIT DISK GRAPHS
    CLARK, BN
    COLBOURN, CJ
    JOHNSON, DS
    [J]. DISCRETE MATHEMATICS, 1990, 86 (1-3) : 165 - 177
  • [3] Improved approximations for weighted and unweighted graph problems
    Demange, M
    Paschos, V
    [J]. THEORY OF COMPUTING SYSTEMS, 2005, 38 (06) : 763 - 787
  • [4] An Improved Energy Efficient Duty Cycling Algorithm for IoT based Precision Agriculture
    Dhall, Ruchi
    Agrawal, Himanshu
    [J]. 9TH INTERNATIONAL CONFERENCE ON EMERGING UBIQUITOUS SYSTEMS AND PERVASIVE NETWORKS (EUSPN-2018) / 8TH INTERNATIONAL CONFERENCE ON CURRENT AND FUTURE TRENDS OF INFORMATION AND COMMUNICATION TECHNOLOGIES IN HEALTHCARE (ICTH-2018), 2018, 141 : 135 - 142
  • [5] Energy-Aware Constrained Relay Node Deployment for Sustainable Wireless Sensor Networks
    Djenouri, Djamel
    Bagaa, Miloud
    [J]. IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING, 2017, 2 (01): : 30 - 42
  • [6] Optimal Bidding Strategy for Microgrids Considering Renewable Energy and Building Thermal Dynamics
    Duong Tung Nguyen
    Le, Long Bao
    [J]. IEEE TRANSACTIONS ON SMART GRID, 2014, 5 (04) : 1608 - 1620
  • [7] DACYCLEM: A decentralized algorithm for maximizing coverage and lifetime in a mobile wireless sensor network
    Etancelin, Jean-Matthieu
    Fabbri, Andre
    Guinand, Frederic
    Rosalie, Martin
    [J]. AD HOC NETWORKS, 2019, 87 : 174 - 187
  • [8] Connected Dominating Set Enabled On-Demand Routing (CDS-OR) for Wireless Mesh Networks
    Farooq, Muhammad Umar
    Zeeshan, Muhammad
    [J]. IEEE WIRELESS COMMUNICATIONS LETTERS, 2021, 10 (11) : 2393 - 2397
  • [9] Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs
    Fukunaga, Takuro
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2020, 28 (01) : 387 - 398
  • [10] Gonzalez T.F., 2007, Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall/Crc Computer & Information Science Series