Standard

Optimal Distributed Blanket Coverage Self-Deployment of Mobile Wireless Sensor Networks. / Savkin, A.V.; Javed, F.; Matveev, A.S.

в: IEEE Communications Letters, Том 16, № 6, 2012, стр. 949-951.

Результаты исследований: Научные публикации в периодических изданияхстатья

Harvard

APA

Vancouver

Author

Savkin, A.V. ; Javed, F. ; Matveev, A.S. / Optimal Distributed Blanket Coverage Self-Deployment of Mobile Wireless Sensor Networks. в: IEEE Communications Letters. 2012 ; Том 16, № 6. стр. 949-951.

BibTeX

@article{07a6699a97e740cd92f8ec15155bd8e7,
title = "Optimal Distributed Blanket Coverage Self-Deployment of Mobile Wireless Sensor Networks",
abstract = "We propose a novel distributed random algorithm for self-deployment of a network of mobile wireless sensors in the problem of blanket coverage. The aim is to deploy sensors in a bounded region so that any point of the region is sensed by at least one sensor. The algorithm is based only on information about the closest neighbours of each sensor. The monitoring region is of an arbitrary shape and not known to the sensors a priori. We give mathematically rigorous proofs of asymptotic optimality and convergence with probability 1 of the proposed algorithm.",
keywords = "Wireless sensor networks, mobile sensor networks, sensor deployment, distributed algorithms, blanket coverage, randomized algorithms",
author = "A.V. Savkin and F. Javed and A.S. Matveev",
year = "2012",
doi = "10.1109/LCOMM.2012.040912.110932",
language = "English",
volume = "16",
pages = "949--951",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

RIS

TY - JOUR

T1 - Optimal Distributed Blanket Coverage Self-Deployment of Mobile Wireless Sensor Networks

AU - Savkin, A.V.

AU - Javed, F.

AU - Matveev, A.S.

PY - 2012

Y1 - 2012

N2 - We propose a novel distributed random algorithm for self-deployment of a network of mobile wireless sensors in the problem of blanket coverage. The aim is to deploy sensors in a bounded region so that any point of the region is sensed by at least one sensor. The algorithm is based only on information about the closest neighbours of each sensor. The monitoring region is of an arbitrary shape and not known to the sensors a priori. We give mathematically rigorous proofs of asymptotic optimality and convergence with probability 1 of the proposed algorithm.

AB - We propose a novel distributed random algorithm for self-deployment of a network of mobile wireless sensors in the problem of blanket coverage. The aim is to deploy sensors in a bounded region so that any point of the region is sensed by at least one sensor. The algorithm is based only on information about the closest neighbours of each sensor. The monitoring region is of an arbitrary shape and not known to the sensors a priori. We give mathematically rigorous proofs of asymptotic optimality and convergence with probability 1 of the proposed algorithm.

KW - Wireless sensor networks

KW - mobile sensor networks

KW - sensor deployment

KW - distributed algorithms

KW - blanket coverage

KW - randomized algorithms

U2 - 10.1109/LCOMM.2012.040912.110932

DO - 10.1109/LCOMM.2012.040912.110932

M3 - Article

VL - 16

SP - 949

EP - 951

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 6

ER -

ID: 5361942