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 propose SRAHS, a sensing radius adjusting protocol, to deal with the problem of area coverage. In this protocol, proper sensing radius can be determined using the harmony search algorithm. Due to the proposed protocol accuracy in adjusting the nodes sensing radius, it is able to provide the full coverage in less densities. Moreover, as the result of increasing nodes density, the proposed protocol decreases both the nodes sensing radius and the energy consumption. 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 and the Assumpti
  4.1. Adjustable Sensing Radius
  4.2. Coverage Problem Formulation
  4.3. Cellular Method
  4.4. The Cluster-based Architecture
  4.5. 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 a Sensing Radius Set
  5.4. Step4. Update Harmony Memory
  5.5. Step5. Check Stopping Criterion
 6. Simulation Results
 7. Conclusion
 References

키워드

저자

• Arash Nikdel [ Department of Computer Engineering, Islamic Azad University, Ramhormoz Branch, Ramhormoz, Iran ]
• Meysam Shavali Kohshoori [ Department of Computer Engineering, Islamic Azad University, Izeh Branch, Izeh, Iran ]
• Seyed Mahdi Jamei [ Department of Computer Engineering, Islamic Azad University, Shahr-e-Qods Branch, Tehran, Iran ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605