Free Regions of Sensor Nodes

We introduce the notion of free region of a node in a sensor network. Intuitively, a free region of a node is the connected set of points R in its neighborhood such that the connectivity of the network remains the same when the node is moved to any point in R. We characterize several properties of free regions and develop an efficient algorithm for computing them. We capture free region in terms of related notions called in-free region and out-free region. We present an O(n2) algorithm for constructing the free region of a node, where n is the number of nodes in the network

Characterizing Free-regions of Sensor nodes

This paper considers the problem of relocating a sensor node for increasing the quality of coverage. We present the notion of free-region of nodes in a sensor network. We investigate properties of free-regions and their characterizations in term of in-free region and out-free region. A centralized algorithm for constructing the free region of sensor node in presented. The algorithm runs in O(n^2) time, where n is the number of sensor nodes in the network

FREE REGIONS OF SENSOR NODES

ABSTRACT We introduce the notion of free region of a node in a sensor network. Intuitively, a free region of a node is the connected set of points R in its neighborhood such that the connectivity of the network remains the same when the node is moved to any point in R. We characterize several properties of free regions and develop an efficient algorithm for computing them. We capture free region in terms of related notions called in-free region and out-free region. We present an O(n 2 ) algorithm for constructing the free region of a node, where n is the number of nodes in the network