A New Sufficient Condition for 1-Coverage to Imply Connectivity

TL;DR

This paper introduces a new sufficient condition linking sensing and communication ranges in wireless sensor networks, ensuring coverage implies connectivity under specific constraints, which enhances energy-efficient network design.

Contribution

It presents a novel lower bound for communication range relative to sensing range and a new node distribution method satisfying this constraint.

Findings

A new lower bound for communication range (s^2 + 3*R) ensuring coverage implies connectivity.

A distribution method that satisfies the new constraint.

Theoretical proof of the relationship between coverage and connectivity.

Abstract

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully the active nodes must maintain both sensing coverage and network connectivity, It proved before if the communication range of nodes is at least twice the sensing range, complete coverage of a convex area implies connectivity among the working set of nodes. In this paper we consider a rectangular region A = a *b, such that R a R b s s {\pounds}, {\pounds}, where s R is the sensing range of nodes. and put a constraint on minimum allowed distance between nodes(s). according to this constraint we present a new lower bound for communication range relative to sensing range of sensors(s 2 + 3 *R) that complete coverage of considered area implies connectivity among the working set of nodes; also we present a new distribution method, that satisfy our constraint.