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

摘要: Abstract We solve a movement problem in which there are n sensors path network plane, where any sensor communicates only with its two immediate neighbors and at given maximum communication distance λ . Initially, some of the inter-sensor distances may be more than need to move so that each is range neighbors, keeping topology intact. The minimize sensor. present an O ( 3 ) -time algorithm compute new positions establish transmission connectivity, called -connectivity paper, convex path-network minimizes among sensors. also generalize our for ring, non-convex path, tethered heterogeneous networks.