Award Date

8-2011

Degree Type

Thesis

Degree Name

Master of Science in Computer Science

Department

Computer Science

First Committee Member

Laxmi P. Gewali, Chair

Second Committee Member

Ajo K. Datta

Third Committee Member

John T. Minor

Graduate Faculty Representative

Rama Venkat

Number of Pages

41

Abstract

Delaunay graphs have been used in CAD/CAM, sensor network and geographic information systems. We investigate the reliability properties of nodes in Delaunay graphs. For measuring the reliability we formulate the concept of roaming-region for nodes. A node v with large roaming-region r(v) such that v is positioned near the center of r(v) is identified as a reliable node. We develop algorithms for constructing roaming-regions and present an implementation of the proposed algorithm in the Java programming language.

Keywords

Geographic information systems; Roaming (Telecommunication); Sensor networks; Triangulation

Disciplines

Computer Sciences | Programming Languages and Compilers | Theory and Algorithms

Language

English


Share

COinS