Date: October 8, 2004

Time: 3:00 pm

Location: GCATT Room 325

Speaker(s): Kevin Chan

Title: Wireless Sensor Network Overview

Abstract:
Wireless Sensor networks have received interest in the research community in the past few years. These networks consist of many sensor nodes that are randomly deployed into a sensor field. These nodes are limited in communication range, computational ability and available energy. Design issues consider these sensor nodes attempting to wirelessly communicate sensed information back to a central base station. In this talk we consider graph theoretic properties as they apply to wireless sensor networks. We have looked at k-connectivity, coverage and shortest path properties of wireless sensor networks. These graph theoretic properties are analyzed in the presence of unreliable links and unreliable sensor nodes. Additionally, we look at routing protocols for these networks and consider some specific problems encountered in the study of wireless sensor networks.

Bio:
Kevin Chan was born in Troy, Michigan in June 1979. He received his B.S. in Electrical and Computer Engineering and Engineering and Public Policy from Carnegie Mellon University in 2001. He received his M.S. from Georgia Tech in 2003 and is currently working at Georgia Tech (in the Center of Signal and Image Processing) on his PhD under the supervision of Dr. Faramarz Fekri. His research interests in wireless sensor networks include security, routing algorithms, and graph theoretic qualities.

Date:	October 8, 2004
Time:	3:00 pm
Location:	GCATT Room 325
Speaker(s):	Kevin Chan
Title:	Wireless Sensor Network Overview
Abstract:	Wireless Sensor networks have received interest in the research community in the past few years. These networks consist of many sensor nodes that are randomly deployed into a sensor field. These nodes are limited in communication range, computational ability and available energy. Design issues consider these sensor nodes attempting to wirelessly communicate sensed information back to a central base station. In this talk we consider graph theoretic properties as they apply to wireless sensor networks. We have looked at k-connectivity, coverage and shortest path properties of wireless sensor networks. These graph theoretic properties are analyzed in the presence of unreliable links and unreliable sensor nodes. Additionally, we look at routing protocols for these networks and consider some specific problems encountered in the study of wireless sensor networks.
Bio:	Kevin Chan was born in Troy, Michigan in June 1979. He received his B.S. in Electrical and Computer Engineering and Engineering and Public Policy from Carnegie Mellon University in 2001. He received his M.S. from Georgia Tech in 2003 and is currently working at Georgia Tech (in the Center of Signal and Image Processing) on his PhD under the supervision of Dr. Faramarz Fekri. His research interests in wireless sensor networks include security, routing algorithms, and graph theoretic qualities.