By Topic

Ant-Colony-Based Scheduling Algorithm for Energy-Efficient Coverage of WSN

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lee, J.-W. ; Department of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea ; Ju-Jang Lee

Sensors in most wireless sensor networks (WSNs) work with batteries as their energy source, it is usually infeasible to recharge or replace batteries when they discharge. Thus, solving the efficient-energy coverage (EEC) problem is an important issue for a WSN. Therefore, it is necessary to schedule the activities of the devices in a WSN to save the network's limited energy and prolong its lifetime. In this paper, we propose an ant-colony-based acheduling algorithm (ACB-SA) to solve the EEC problem. Our algorithm is a simplified version of the conventional ant colony optimization algorithm, optimized for solving the EEC problem. We also use the probability sensor detection model and apply our proposed algorithm to a heterogeneous sensor set, which represents a more realistic approach to solving the EEC problem. Simulation results are performed to verify the effectiveness of the ACB-SA for solving the EEC problem in comparison with other algorithms.

Published in:

Sensors Journal, IEEE  (Volume:12 ,  Issue: 10 )