Optimizing movement in convex and non-convex path-networks to establish connectivity

Document Type

Conference Article

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract

We solve a min-max movement problem in which there are n sensors in path network in plane, where any sensor communicates only with its two immediate neighbors and only at a given maximum communication distance λ. We need to move sensors so that each sensor is in the communication range of its two neighbors, keeping the path topology intact. We present an O(n3) algorithm for min-max movement problem in a convex path-network which minimizes the maximum movement among the sensors. We also generalize our algorithm for ring, non-convex path, tethered and heterogeneous networks.

First Page

141

Last Page

155

DOI

10.1007/978-3-319-53007-9_13

Publication Date

1-1-2017

This document is currently not available here.

Share

COinS