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

Cited 32 time in webofscience Cited 0 time in scopus
  • Hit : 426
  • Download : 0
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 antcolony-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.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2012-10
Language
English
Article Type
Article
Keywords

WIRELESS SENSOR NETWORKS; REAL-TIME; LOCALIZATION; SYSTEM

Citation

IEEE SENSORS JOURNAL, v.12, no.10, pp.3036 - 3046

ISSN
1530-437X
DOI
10.1109/JSEN.2012.2208742
URI
http://hdl.handle.net/10203/102679
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 32 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0