Improved Localized Sleep Scheduling Techniques to Prolong Wsn Lifetime

被引:0
|
作者
Tarasia N. [1 ]
Swain A.R. [1 ]
Roy S. [1 ]
Kar U.N. [1 ]
机构
[1] KIIT Deemed to be University, Bhubaneswar
来源
Scalable Computing | 2021年 / 22卷 / 01期
关键词
Coverage; Energy Efficient; Sleep Scheduling; Wireless Sensor Network;
D O I
10.12694:/scpe.v22i1.1847
中图分类号
学科分类号
摘要
A standard Wireless Sensor Networks(WSNs) comprises of low-cost sensor nodes embedded with small batteries. To enhance the network lifetime of WSN, the number of active nodes among the deployed nodes should be minimum. Along with this, it must be ensured that coverage of the targeted area would not get affected by the currently active nodes. Considering different applications of WSN, there is still a demand for full coverage or partial coverage of the deployed area. Irrespective of the circumstances, a proper sleep scheduling algorithm needs to be followed. Else, the active nodes will be tuckered out of the battery. Random distribution of the sensor nodes in a common area may have multiple active nodes. It is essential to identify the redundant number of active nodes and put them into sleep to conserve energy. This paper has proposed a methodology where the active sensor nodes form a hierarchical structure that heals itself by following a level wise approach. In the meantime, it also detects the total number of redundant nodes in the coverage area. The performance of the proposed protocol is evaluated using the Castalia simulator. The simulation results show that the proposed level wise periodic tree construction approach increases the network’s durability in conjunction with the level wise approach. © 2021 SCPE.
引用
收藏
页码:81 / 92
页数:11
相关论文
共 50 条
  • [1] IMPROVED LOCALIZED SLEEP SCHEDULING TECHNIQUES TO PROLONG WSN LIFETIME
    Tarasia, Nachiketa
    Swain, Amulya Ratna
    Roy, Soham
    Kar, Udit Narayana
    SCALABLE COMPUTING-PRACTICE AND EXPERIENCE, 2021, 22 (01): : 81 - 92
  • [2] Topology Driven Cooperative Self Scheduling for Improved Lifetime Maximization in WSN
    Brindha G.
    Ezhilarasi P.
    Computer Systems Science and Engineering, 2023, 45 (01): : 445 - 458
  • [3] An Improved Energy-Efficient Clustering Protocol to Prolong the Lifetime of the WSN-Based IoT
    Hassan, Ali Abdul-Hussian
    Shah, Wahidah Md
    Habeb, Abdul-Hussien Hassan
    Othman, Mohd Fairuz Iskandar
    Al-Mhiqani, Mohammed Nasser
    IEEE ACCESS, 2020, 8 : 200500 - 200517
  • [4] Unequal Clustering Algorithm for WSN to Prolong the Network Lifetime (UCAPN)
    Selvi, Ganesan Vennira
    Manoharan, Rajendran
    FOURTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS, MODELLING AND SIMULATION (ISMS 2013), 2013, : 456 - 461
  • [5] Traffic scheduling to prolong the lifetime of sensor networks
    Pan, Yantao
    2006 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY, WORKSHOPS PROCEEDINGS, 2006, : 231 - 234
  • [6] Balanced Energy Using Uneven Transmission Schemes to Prolong the Lifetime of WSN
    Guo, Jing
    Zhang, Caixia
    Chen, Yong
    Wang, Fei
    PROCEEDINGS OF THE 28TH CHINESE CONTROL AND DECISION CONFERENCE (2016 CCDC), 2016, : 2410 - 2414
  • [7] An Adjustable Sleep Scheduling Framework for WSN
    Liul, Yanheng
    Zhangi, Lei
    Wangi, Aimin
    Sun, Dayang
    INTERNATIONAL JOURNAL OF FUTURE GENERATION COMMUNICATION AND NETWORKING, 2014, 7 (03): : 213 - 228
  • [8] EASM: Energy-Aware Sink Mobility Algorithm to Prolong Network Lifetime in WSN
    Kumar, Hemanth
    Nagarjun, E.
    Kumar, Dilip S. M.
    2019 IEEE 16TH INDIA COUNCIL INTERNATIONAL CONFERENCE (IEEE INDICON 2019), 2019,
  • [9] Cluster Based Routing Protocol to Prolong Network Lifetime through Mobile Sink in WSN
    Kushal, B. Y.
    Chitra, M.
    2016 IEEE INTERNATIONAL CONFERENCE ON RECENT TRENDS IN ELECTRONICS, INFORMATION & COMMUNICATION TECHNOLOGY (RTEICT), 2016, : 1287 - 1291
  • [10] Tree reconstruction using energy aware sink mobility to prolong network lifetime in WSN
    Kumar, Hemanth
    Nagarjun, E.
    Kumar, S. M. Dilip
    INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2021, 37 (01) : 50 - 60