Solving Target Coverage Problem in Wireless Sensor Networks using Greedy Approach

Network life time is one of the important aspects of Wireless Sensor Networks. For monitoring the environment, a large number of sensor nodes are deployed in Wireless Sensor Networks for collecting information from surrounding. Then the collected information was moved to the base station. The process of information gathering, forwarding consume more energy, more efficient scheduling algorithm can be followed to enhance the lifetime of the network. Deterministic placement of sensors is not suitable for monitoring different targets. In such cases random deployment can be used. Information about position of sensor in region may be lost in randomized deployment. In randomized deployment, deployment density of sensors can be enhanced. In this paper we discuss about an algorithm to increase the network lifetime of WSNs. This can be achieved by putting the sensors in multiple different set covers. At a particular instant, sensors were in active or sleep state. Only in active mode, sensors can monitor the targets. These types of problems are called Maximum Set Covers Problem which is a optimization problem. In order to obtain a suboptimal solution, in this paper a greedy based heuristic is proposed for deploying and scheduling the sensors in order to increase or enhance the network lifetime of WSN.

• Publication year

  2020

• Venue

  2020 International Conference on Computer Science, Engineering and Applications (ICCSEA)

• Publication date

  2020-03-01

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/ICCSEA49143.2020.9132907
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Coverage protocols for wireless sensor networks: Review and future directions

  2019cited by this paper
• Wireless sensor node deployment strategy for hilly terrains - a surface approximation based approach

  2019cited by this paper
• Energy-Efficient Scheduling for Multiple-Target Coverage in Wireless Sensor Networks

  2010cited by this paper
• Power-saving scheduling for multiple-target coverage in wireless sensor networks

  2009influential reference
• Lifetime Maximization for Connected Target Coverage in Wireless Sensor Networks

  2008cited by this paper
• Energy-efficient connected-coverage in wireless sensor networks

  2008cited by this paper
• Maximum network lifetime in wireless sensor networks with adjustable sensing ranges

  2005cited by this paper
• Energy-efficient target coverage in wireless sensor networks

  2005cited by this paper
• Improving Wireless Sensor Network Lifetime through Power Aware Organization

  2005cited by this paper
• Power efficient organization of wireless sensor networks

  2001cited by this paper

• Performance analysis of PSO for solving coverage problem in WSN

  2023cites this paper
• A Jaccard Factor-Based Heuristic for the Set k-Cover Problem in Wireless Sensor Networks

  2023cites this paper
• QoS-Aware Energy Management and Node Scheduling Schemes for Sensor Network-Based Surveillance Applications

  2021cites this paper
• A Binary Adaptive Clone Shuffled Frog Leaping Algorithm for Three-Dimensional Low-Energy Target Coverage Optimization in Environmental Monitoring Wireless Sensor Networks

  2021cites this paper
• WSN Coverage Optimization Based on Two-Stage PSO

  2020cites this paper