Earticle

초록

영어

One major problem in the area of wireless sensor networks is the coverage problem. The coverage problem deals with the ability of the network to cover a certain area or some certain events. In this paper, we focus on the area coverage problem. We use a cluster-based coverage control scheme and propose HSSAC protocol to maintain sensing coverage by keeping a small number of active sensor nodes and a small amount of energy consumption in a wireless sensor network. In this protocol, proper active sensor set can be determined using the harmony search algorithm. Due to the proposed protocol accuracy in selecting the active sensor set, it is able to provide the acceptable coverage rate in sparse deployment. As the result of increasing nodes density, the proposed protocol decreases the number of active nodes in the sensor networks. Thus, the proposed protocol decreases the energy consumption of the networks and prolongs the network lifetime. We have simulated our protocol and simulation results show high efficiency of the proposed protocol.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Harmony Search Algorithm
 4. The Network Model
  4.1. Coverage Problem Formulation
  4.2. The Cluster-based Architecture
  4.3. Energy Consumption Analysis
 5. Proposed Protocol
  5.1. Step1: Initialize the Problem and Algorithm Parameters
  5.2. Step2: Initialize the Harmony Memory
  5.3. Step3: Improvise the Active Sensors Set
  5.4. Sec Step4: Update Harmony Memory
  5.5. Check Stopping Criterion
 6. Simulation Result
 6. Conclusion
 References

키워드

저자

• Hagar Noori [ Department of computer engineering, science and research branch, Islamic Azad University, Arak-Iran ]
• Reza Rafeh [ Department of computer engineering, science and research branch, Islamic Azad University, Arak-Iran ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605