Solving target coverage problem using cover sets in wireless sensor networks based on learning automata
Recent years have witnessed a significant increase in employing wireless sensor networks (WSNs) for a variety of applications. Monitoring a set of discrete targets and, at the same time, extending the network lifetime is a critical issue in WSNs. One method to solve this problem is designing an effi...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
Springer
2014
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/62623/ http://dx.doi.org/10.1007/s11277-013-1371-x |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Recent years have witnessed a significant increase in employing wireless sensor networks (WSNs) for a variety of applications. Monitoring a set of discrete targets and, at the same time, extending the network lifetime is a critical issue in WSNs. One method to solve this problem is designing an efficient scheduling algorithm that is able to organize sensor nodes into several cover sets in such a way that each cover set could monitor all the targets. This study presents three learning automata-based scheduling algorithms to solve the problem. Moreover, several pruning rules are devised to avoid the selection of redundant sensors and manage critical sensors for extending the network lifetime. To evaluate the performance of proposed algorithms, we conducted several experiments, and the obtained results indicated that Algorithm 3 was more successful in terms of extending the network lifetime. |
|---|