Title
Activities scheduling algorithms based on probabilistic coverage models for wireless sensor networks.
Abstract
Area monitoring using Internet and barrier coverage is a typical application of wireless sensor networks. The main concerns in this type of applications are coverage efficiency and sensor energy conservation. For that, many activities scheduling algorithms are proposed in the literature. Unlike prior efforts based on an unrealistic binary sensor coverage model, this paper proposes three efficient activities scheduling algorithms based on realistic sensor coverage models. The first algorithm (C1L-PBC) is centralized and it is based on a coverage graph. The second algorithm (D1L-PBC) is distributed and it ensures 1-barrier coverage; whereas, the third one (D2L-PBC) is also distributed and it guarantees 2-barrier coverage. The obtained experimental results show that the proposed algorithms can effectively guarantee the barrier coverage and prolong the sensor network lifetime.
Year
DOI
Venue
2017
10.1007/s12243-017-0564-9
Annales des Télécommunications
Keywords
Field
DocType
Wireless sensor networks, Barrier coverage, Intrusion detection, Activities scheduling algorithms, Network lifetime
Key distribution in wireless sensor networks,Energy conservation,Scheduling (computing),Computer network,Probabilistic logic,Intrusion detection system,Wireless sensor network,Mathematics,Binary number,The Internet
Journal
Volume
Issue
ISSN
72
3-4
1958-9395
Citations 
PageRank 
References 
0
0.34
14
Authors
4
Name
Order
Citations
PageRank
Mohammed Boudali100.34
Mustapha Reda Senouci211414.41
Mohamed Aissani3476.91
Walid-Khaled Hidouci4144.64