Target coverage heuristic based on learning automata in wireless sensor networks

Target coverage heuristic based on learning automata in wireless sensor networks

For access to this article, please select a purchase option:

Buy eFirst article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
— Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In wireless sensors networks, the sensor nodes are densely deployed. Owing to this excessive deployment of sensor nodes, each target is covered by multiple sensors at a time. To prolong the network lifetime, the authors can schedule the sensor activity in such a way that only a subset of sensor nodes, called cover set, is sufficient enough to cover all the targets. In this study, they propose an energy-efficient scheduling algorithm based on learning automata for target coverage problem. The learning automata-based technique helps a sensor node to select its appropriate state (either active or sleep). To prove the effectiveness of their proposed scheduling method, they conduct a detailed set of simulations and compare the performance of their algorithm with the existing algorithms.

Related content

This is a required field
Please enter a valid email address