Master of Science in Computer Science
First Committee Member
Laxmi P. Gewali
Second Committee Member
John T. Minor
Third Committee Member
Fourth Committee Member
Number of Pages
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.
Routing (Computer network management); Routing protocols (Computer network protocols); Sensor networks
Computer Engineering | Computer Sciences
University of Nevada, Las Vegas
Amatya, Umang, "Node Filtering and Face Routing for Sensor Network" (2012). UNLV Theses, Dissertations, Professional Papers, and Capstones. 1653.
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/