Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks
type: Item
instance of: scholarly article
title: Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks
zbMATH Open document ID: 1461.68255
author: P. G. Spirakis
author: Sotiris E. Nikoletseas
published in: Algorithms
publication date: 2018-08-20T00:00:00Z
review text: Summary: In this work we focus on the energy efficiency challenge in wireless sensor networks, from both an on-line perspective (related to routing), as well as a network design perspective (related to tracking). We investigate a few representative, important aspects of energy efficiency: a) the robust and fast data propagation b) the problem of balancing the energy dissipation among all sensors in the network and c) the problem of efficiently tracking moving entities in sensor networks. Our work here is a methodological survey of selected results that have already appeared in the related literature. In particular, we investigate important issues of energy optimization, like minimizing the total energy dissipation, minimizing the number of transmissions as well as balancing the energy load to prolong the system's lifetime. We review characteristic protocols and techniques in the recent literature, including probabilistic forwarding and local optimization methods. We study the problem of localizing and tracking multiple moving targets from a network design perspective, i.e. towards estimating the least possible number of sensors, their positions and operation characteristics needed to efficiently perform the tracking task. To avoid an expensive massive deployment, we try to take advantage of possible coverage overlaps over space and time, by introducing a novel combinatorial model that captures such overlaps. Under this model, we abstract the tracking network design problem by a covering combinatorial problem and then design and analyze an efficient approximate method for sensor placement and operation.
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68M18
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6920441
zbMATH Keywords: sensor networks
zbMATH Keywords: energy efficiency
zbMATH Keywords: routing
zbMATH Keywords: tracking
zbMATH Keywords: distributed algorithms
zbMATH Keywords: probabilistic methods
describes a project that uses: LEDA
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3390/a2010121
OpenAlex ID: W2164535373
cites work: Algorithmic construction of sets for k -restrictions
cites work: Algorithmic Aspects of Wireless Sensor Networks
cites work: Grid coverage for surveillance and target location in distributed sensor networks
cites work: Q3395947
cites work: Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks
cites work: Q4526990
cites work: Energy-Balanced Data Propagation inWireless Sensor Networks
cites work: A threshold of ln n for approximating set cover
cites work: Q4886045
cites work: Approximating k-set cover and complementary graph coloring
cites work: Negotiation-based protocols for disseminating information in wireless sensor networks
cites work: Q4101255
cites work: Q4424116
cites work: On the hardness of approximating minimization problems
cites work: Q4702188
cites work: Efficient sensor network design for continuous monitoring of moving objects
cites work: Q4457211
cites work: Energy optimal data propagation in wireless sensor networks
DOI: 10.3390/A2010121
description: scientific article; zbMATH DE number 6920441