Universiti Teknologi Malaysia Institutional Repository

Solving target coverage problem using cover sets in wireless sensor networks based on learning automata

Ismail, Abdul Samad and Salleh, Shaharuddin and Mohamadi, Hosein (2014) Solving target coverage problem using cover sets in wireless sensor networks based on learning automata. Wireless Personal Communications, 75 (1). pp. 447-463. ISSN 0929-6212

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1007/s11277-013-1371-x

Abstract

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.

Item Type:Article
Uncontrolled Keywords:cover set formation, learning automata
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computing
ID Code:62623
Deposited By: Widya Wahid
Deposited On:19 Jun 2017 03:04
Last Modified:19 Jun 2017 03:04

Repository Staff Only: item control page