Award Date

1-1-2005

Degree Type

Thesis

Degree Name

Master of Science (MS)

Department

Computer Science

First Committee Member

Ajoy K. Datta

Second Committee Member

Maria Gradinariu

Number of Pages

111

Abstract

Wireless ad-hoc sensor networks are composed of a large number of tiny sensors with embedded microprocessors, that have very limited resources and yet must coordinate amongst themselves to form a connected network. Every sensor has a certain sensing radius, Rs, within which it is capable of "covering" a particular region by detecting or gathering certain data. Every sensor also has a communication radius, R c, within which it is capable of sending or receiving data; Given a query over a sensor network, the minimum connected sensor cover problem is to select a minimum, or nearly minimum, set of sensors, called a minimum connected sensor cover, such that the selected sensors cover the query region, and form a connected network amongst themselves. In this thesis, we use present three fully distributed, strictly localized, scalable, self-* solutions to the minimum connected sensor cover problem.

Keywords

Algorithms; Connected; Cover; Distributed; Minimum; Self; Sensor; Star

Controlled Subject

Computer science

File Format

pdf

File Size

4136.96 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.

Identifier

https://doi.org/10.25669/uf9e-iscj


Share

COinS