Quasi-optimal scheduling algorithm for area coverage in multi-functional sensor networks

Miklos Molnar, G. Simon, Laszlo Gonczy

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Wireless Sensor Networks (WSNs) are widely used to perform measurement and monitoring tasks in large sensing fields. Several applications require every point in the monitored area to be covered by at least k sensors (k-coverage problem) for measurement accuracy or robustness. In heterogeneous multi-functional sensor networks, p parallel observation tasks are performed with p types of sensors, each task having its own ki(i = 1; 2; : : : ; p) coverage requirement, assuming that multi-functional sensors are used which may have multiple measurement capabilities (multi-k-coverage problem). In order to prolong the lifetime of the network, active and sleeping states of sensors can be altered while maintaining the required coverage for all sensing tasks. In this paper an efficient distributed sensor state scheduling algorithm for multi-functional WSNs is proposed to solve the multi-k-coverage problem. The proposed multi-functional controlled greedy sleep algorithm is the generalisation of a recently proposed quasi-optimal scheduling algorithm. It is easy to implement and solves the common scheduling problem of heterogeneous multi-functional sensor networks. It has low local communication overhead and can adapt to dynamic changes in the network, while the required network-wide coverage for all sensing tasks is guaranteed as long as it is physically possible. The performance and the fault tolerance of the algorithm are illustrated by simulation examples.

Original languageEnglish
Pages (from-to)109-122
Number of pages14
JournalInternational Journal of Ad Hoc and Ubiquitous Computing
Volume14
Issue number2
DOIs
Publication statusPublished - 2013

Fingerprint

Scheduling algorithms
Sensor networks
Sensors
Wireless sensor networks
Active networks
Fault tolerance
Scheduling
Monitoring
Communication

Keywords

  • Distributed scheduling algorithm
  • Energy conservation
  • K-coverage problem
  • Multi-functional sensors
  • Wireless sensor networks
  • WSNs

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Quasi-optimal scheduling algorithm for area coverage in multi-functional sensor networks. / Molnar, Miklos; Simon, G.; Gonczy, Laszlo.

In: International Journal of Ad Hoc and Ubiquitous Computing, Vol. 14, No. 2, 2013, p. 109-122.

Research output: Contribution to journalArticle

@article{78d78981626348c9bc2d73e532bd3ac3,
title = "Quasi-optimal scheduling algorithm for area coverage in multi-functional sensor networks",
abstract = "Wireless Sensor Networks (WSNs) are widely used to perform measurement and monitoring tasks in large sensing fields. Several applications require every point in the monitored area to be covered by at least k sensors (k-coverage problem) for measurement accuracy or robustness. In heterogeneous multi-functional sensor networks, p parallel observation tasks are performed with p types of sensors, each task having its own ki(i = 1; 2; : : : ; p) coverage requirement, assuming that multi-functional sensors are used which may have multiple measurement capabilities (multi-k-coverage problem). In order to prolong the lifetime of the network, active and sleeping states of sensors can be altered while maintaining the required coverage for all sensing tasks. In this paper an efficient distributed sensor state scheduling algorithm for multi-functional WSNs is proposed to solve the multi-k-coverage problem. The proposed multi-functional controlled greedy sleep algorithm is the generalisation of a recently proposed quasi-optimal scheduling algorithm. It is easy to implement and solves the common scheduling problem of heterogeneous multi-functional sensor networks. It has low local communication overhead and can adapt to dynamic changes in the network, while the required network-wide coverage for all sensing tasks is guaranteed as long as it is physically possible. The performance and the fault tolerance of the algorithm are illustrated by simulation examples.",
keywords = "Distributed scheduling algorithm, Energy conservation, K-coverage problem, Multi-functional sensors, Wireless sensor networks, WSNs",
author = "Miklos Molnar and G. Simon and Laszlo Gonczy",
year = "2013",
doi = "10.1504/IJAHUC.2013.056418",
language = "English",
volume = "14",
pages = "109--122",
journal = "International Journal of Ad Hoc and Ubiquitous Computing",
issn = "1743-8225",
publisher = "Inderscience Enterprises Ltd",
number = "2",

}

TY - JOUR

T1 - Quasi-optimal scheduling algorithm for area coverage in multi-functional sensor networks

AU - Molnar, Miklos

AU - Simon, G.

AU - Gonczy, Laszlo

PY - 2013

Y1 - 2013

N2 - Wireless Sensor Networks (WSNs) are widely used to perform measurement and monitoring tasks in large sensing fields. Several applications require every point in the monitored area to be covered by at least k sensors (k-coverage problem) for measurement accuracy or robustness. In heterogeneous multi-functional sensor networks, p parallel observation tasks are performed with p types of sensors, each task having its own ki(i = 1; 2; : : : ; p) coverage requirement, assuming that multi-functional sensors are used which may have multiple measurement capabilities (multi-k-coverage problem). In order to prolong the lifetime of the network, active and sleeping states of sensors can be altered while maintaining the required coverage for all sensing tasks. In this paper an efficient distributed sensor state scheduling algorithm for multi-functional WSNs is proposed to solve the multi-k-coverage problem. The proposed multi-functional controlled greedy sleep algorithm is the generalisation of a recently proposed quasi-optimal scheduling algorithm. It is easy to implement and solves the common scheduling problem of heterogeneous multi-functional sensor networks. It has low local communication overhead and can adapt to dynamic changes in the network, while the required network-wide coverage for all sensing tasks is guaranteed as long as it is physically possible. The performance and the fault tolerance of the algorithm are illustrated by simulation examples.

AB - Wireless Sensor Networks (WSNs) are widely used to perform measurement and monitoring tasks in large sensing fields. Several applications require every point in the monitored area to be covered by at least k sensors (k-coverage problem) for measurement accuracy or robustness. In heterogeneous multi-functional sensor networks, p parallel observation tasks are performed with p types of sensors, each task having its own ki(i = 1; 2; : : : ; p) coverage requirement, assuming that multi-functional sensors are used which may have multiple measurement capabilities (multi-k-coverage problem). In order to prolong the lifetime of the network, active and sleeping states of sensors can be altered while maintaining the required coverage for all sensing tasks. In this paper an efficient distributed sensor state scheduling algorithm for multi-functional WSNs is proposed to solve the multi-k-coverage problem. The proposed multi-functional controlled greedy sleep algorithm is the generalisation of a recently proposed quasi-optimal scheduling algorithm. It is easy to implement and solves the common scheduling problem of heterogeneous multi-functional sensor networks. It has low local communication overhead and can adapt to dynamic changes in the network, while the required network-wide coverage for all sensing tasks is guaranteed as long as it is physically possible. The performance and the fault tolerance of the algorithm are illustrated by simulation examples.

KW - Distributed scheduling algorithm

KW - Energy conservation

KW - K-coverage problem

KW - Multi-functional sensors

KW - Wireless sensor networks

KW - WSNs

UR - http://www.scopus.com/inward/record.url?scp=84884881284&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84884881284&partnerID=8YFLogxK

U2 - 10.1504/IJAHUC.2013.056418

DO - 10.1504/IJAHUC.2013.056418

M3 - Article

AN - SCOPUS:84884881284

VL - 14

SP - 109

EP - 122

JO - International Journal of Ad Hoc and Ubiquitous Computing

JF - International Journal of Ad Hoc and Ubiquitous Computing

SN - 1743-8225

IS - 2

ER -