Document Type
Article
Publication Date
2009
Publication Title
Systems Science
Volume
35
Issue
2
First page number:
67
Last page number:
72
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(n2) algorithm for constructing the free region of a node, where n is the number of nodes in the network.
Keywords
Algorithms--Data processing; Computer architecture; Sensor networks; Wireless sensor networks; Wireless sensor nodes
Disciplines
Computer Engineering | Controls and Control Theory | Electrical and Computer Engineering | Signal Processing | Systems and Communications
Language
English
Permissions
Posted with permission from the Wrocław University of Technology, all rights reserved. You may download, display, print and reproduce this material in unaltered form (attaching a copy of this notice) for your personal, non-commercial use. The Wrocław University of Technology reserves the right to revoke such permission at any time.
Repository Citation
Gewali, L. P.,
Rongatana, N.,
Selvaraj, H.,
Pedersen, J. B.
(2009).
Free Regions of Sensor Nodes.
Systems Science, 35(2),
67-72.
https://digitalscholarship.unlv.edu/ece_fac_articles/280
Included in
Computer Engineering Commons, Controls and Control Theory Commons, Signal Processing Commons, Systems and Communications Commons
Comments
Best copy available