By Topic

An efficient heuristic for placement, scheduling and routing in wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Turkogullari, Y.B. ; Ind. Eng. Dept., Bogazici Univ., Istanbul ; Aras, N. ; Altinel, I.K. ; Ersoy, C.

In this paper we consider the differentiated coverage problem for heterogeneous sensor networks over a finite planning horizon consisting of discrete time intervals. The goal is to determine optimal locations of sensors and sinks, activity schedules of the deployed sensors, and sensor-to-sink data routes subject to coverage, flow conservation, energy consumption and budget constraints with the objective of maximizing the network lifetime. We first give a mixed-integer linear programming formulation. Since this formulation is difficult to be solved exactly even for small instances, we propose a heuristic that first finds connected sensor sets with minimum cost satisfying the coverage constraint, and then determines optimal sensor-to-sink data routes with optimal flow quantities maximizing the lifetime of the sensor sets. Computational experiments performed on various test instances indicate that the heuristic is very efficient and quite accurate.

Published in:

Computer and Information Sciences, 2008. ISCIS '08. 23rd International Symposium on

Date of Conference:

27-29 Oct. 2008