Wireless Sensor Networks (WSNs) play a critical role in many domains through the use of sensors for sensing and tracking environmental changes. This paper focus on the deployment of directional sensors in WSNs, where orientation and location of sensors are key issues to ensure maximum coverage with minimum use of sensors. Directional sensors are unlike omnidirectional sensors in that they sense signals from a particular angle, introducing exclusive challenges in best placement and coverage. A novel Clique Detection-based Sensor Deployment (CD-SD) algorithm is designed to solve such difficulties. Proposed algorithm detects cliques in target network to get an optimal count and locations of direction sensors. Identifying 3-cliques, 2-cliques, and 1-cliques within target graph makes algorithm reduce the sensor deployment redundancy such that target can be effectively covered using lesser sensors. The given algorithm is also compared against prevailing algorithms like Firefly Algorithm (FA) and Cat Swarm Optimization (CSO). Experimental results illustrate that the designed algorithm attains 100% target coverage while using fewer sensors than the Cat Swarm Optimization and Firefly algorithms.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Clique Detection-Based Sensor Deployment for Efficient Target Coverage in Directional Sensor Network

  • P. Surya Bharathi,
  • R. Pavithra,
  • Raghav Kadambi,
  • S. Balaji

摘要

Wireless Sensor Networks (WSNs) play a critical role in many domains through the use of sensors for sensing and tracking environmental changes. This paper focus on the deployment of directional sensors in WSNs, where orientation and location of sensors are key issues to ensure maximum coverage with minimum use of sensors. Directional sensors are unlike omnidirectional sensors in that they sense signals from a particular angle, introducing exclusive challenges in best placement and coverage. A novel Clique Detection-based Sensor Deployment (CD-SD) algorithm is designed to solve such difficulties. Proposed algorithm detects cliques in target network to get an optimal count and locations of direction sensors. Identifying 3-cliques, 2-cliques, and 1-cliques within target graph makes algorithm reduce the sensor deployment redundancy such that target can be effectively covered using lesser sensors. The given algorithm is also compared against prevailing algorithms like Firefly Algorithm (FA) and Cat Swarm Optimization (CSO). Experimental results illustrate that the designed algorithm attains 100% target coverage while using fewer sensors than the Cat Swarm Optimization and Firefly algorithms.