| Student: | Andrew Rodriguez |
| School: | The University of Texas at San Antonio |
| E-mail: | adrodrig@dimax.rutgers.edu |
| Research Areas: | Some Graph Theory -> Wireless Sensor Network Communication |
| Project Name: | Experimental Evaluation of Hop-optimal Networks in the Weak Sensor Model |
| Faculty Advisor: |
Dr. Farach-Colton, Professor of Computer Science
Rutgers University |
| Graduate Student Advisor: |
Miguel Mosteiro, Graduate Student in Computer Science
Rutgers University |
| Graduate Student Advisor: |
Rohan Fernandes, Graduate Student in Computer Science
Rutgers University |
Project ResultsRandom Geometric Graph (RGG) simulatedratio of radius of connectivity to width of plane == r/l
and more in progress ... |
TalksTime: 2005-06-24Place: CoRE 431 Title: Preliminary Talk: "Experimental Evaluation of Hop-optimal Networks in the Weak Sensor Model" Time: 2005-07-29 Place: CoRE 331 Title: Final Talk: "Experimental Evaluation of Hop-optimal Networks in the Weak Sensor Model" Abstract: Andrew Rodriguez, The University of Texas at San Antonio Mentors: Martin Farach-Colton, Ph.D., Mr. Rohan Fernandes, and Mr. Miguel Mosteiro Department of Computer Science Rutgers University Experimental evaluation of hop-optimal networks in the weak sensor model A sensor network is a computer network of many spatially distributed devices using sensor nodes to monitor conditions, such as temperature, pressure, motion, or environmental pollutants at different locations. These devices are usually small and inexpensive so that they can be produced and deployed in large quantities. As a consequence of their size and price, their abilities and resources in terms of energy, memory, computational speed and bandwidth are quite limited. Due to these limited capabilities of the sensor nodes, even network initialization is a nontrivial task. Given the Weak Sensor Model (WSM) that specifies the restricted working conditions of such nodes, I seek to experimentally evaluate an optimal distributed algorithm for sensor network formation developed by Dr. Farach-Colton, et al. at Rutgers University. The model that describes the topology of such a resulting network is a Constant-degree Hop-optimal Spanning Subgraph (CHSG). The CHSG, hence the network, has asymptotically optimal hop-stretch. In this work, properties of the network obtained by this algorithm, such as connectivity and hop-stretch, are evaluated through simulation. |