A Near Optimal Algorithm for Lifetime Optimization in Wireless Sensor Networks

Karine Deschinkel, Mourad Hakem

2013

Abstract

In this paper, we introduce an efficient energy-aware algorithm to enhance the lifetime of wireless sensor networks (WSN) by i) organizing/clustering the sensor nodes into disjoint cover sets where each cover set is capable of monitoring all the targets of the region of interest and ii) scheduling these cover sets successively/periodically. This study differs from previous works for the following reasons: i) it achieves near optimal solutions compared to the optimal ones obtained by the exact method and ii) unlike existing algorithms that construct gradually cover sets one after the other, our algorithm builds the different sets in parallel. Simulation results show the efficiency of our algorithm.

Paper Citation

in Harvard Style

Deschinkel K. and Hakem M. (2013). A Near Optimal Algorithm for Lifetime Optimization in Wireless Sensor Networks . In Proceedings of the 2nd International Conference on Sensor Networks - Volume 1: SENSORNETS, ISBN 978-989-8565-45-7, pages 197-202. DOI: 10.5220/0004272701970202

in Bibtex Style

@conference{sensornets13,
author={Karine Deschinkel and Mourad Hakem},
title={A Near Optimal Algorithm for Lifetime Optimization in Wireless Sensor Networks},
booktitle={Proceedings of the 2nd International Conference on Sensor Networks - Volume 1: SENSORNETS,},
year={2013},
pages={197-202},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004272701970202},
isbn={978-989-8565-45-7},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Sensor Networks - Volume 1: SENSORNETS,
TI - A Near Optimal Algorithm for Lifetime Optimization in Wireless Sensor Networks
SN - 978-989-8565-45-7
AU - Deschinkel K.
AU - Hakem M.
PY - 2013
SP - 197
EP - 202
DO - 10.5220/0004272701970202