Award Date

1-1-2007

Degree Type

Thesis

Degree Name

Master of Science (MS)

Department

Computer Science

First Committee Member

Laxmi P. Gewali

Number of Pages

48

Abstract

We consider the problem of estimating free-regions of nodes in a sensor network deployed in two dimensions. The free-region of a node is the connected set of points in its neighborhood that preserves the existing network topology. We present an efficient exact algorithm for computing free-region of a given node x that runs in O( k2) time, where k is the number of in-bound and out-bound nodes of x. We also discuss approaches for developing localized approximation algorithms for estimating free-regions. We also present an experimental implementation of the proposed exact algorithm.

Keywords

Deployment; Nodes; Relocation; Sensors

Controlled Subject

Computer science

File Format

pdf

File Size

1259.52 KB

Degree Grantor

University of Nevada, Las Vegas

Language

English

Permissions

If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to digitalscholarship@unlv.edu and include clear identification of the work, preferably with URL.

Rights

IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/

Download


COinS