Award Date

8-1-2012

Degree Type

Thesis

Degree Name

Master of Science in Computer Science

Department

Computer Science

First Committee Member

Laxmi P. Gewali

Second Committee Member

John T. Minor

Third Committee Member

Juyeon Jo

Fourth Committee Member

Rama Venkat

Number of Pages

58

Abstract

Greedy forward routing and face routing algorithms have been extensively used for sending messages in sensor networks. In this thesis, we consider the problem of filtering redundant nodes in a sensor network as a pre-processing step for face routing. We propose two algorithms for identifying redundant nodes. We test the performance of proposed filtering algorithms on generated networks. The prototype algorithm for testing the proposed algorithms has been implemented in the Java programming language. Experimental investigation shows that the proposed filtering algorithms are effective in removing redundant nodes without compromising the network connectivity.

Keywords

Routing (Computer network management); Routing protocols (Computer network protocols); Sensor networks

Disciplines

Computer Engineering | Computer Sciences

Language

English

Comments

Related poster:

http://digitalscholarship.unlv.edu/celebration/2012/april27/6/


Share

COinS