Events & News
Colloquium
| Category | Lecture |
| Date | Thursday, December 18, 2008 |
| Time | 11:00 am |
| Location | GS 906 |
| Speaker | Swaminathan Sankararaman |
| Affiliation | Computer Science Department |
On Channel-Discontinuity-Constraint Routing in Wireless Networks
Multi-channel wireless networks are increasingly being employed as infrastructure networks in metro areas. The main problem with employing wireless networks is the interference in the communication between nodes in the network. Thus, the focus of research in this area is to minimize the interference and improve throughput. Employing directional antennas minimizes the area of transmission and hence, improves spatial throughput. In such networks, given a source and destination, it is of interest to compute an optimal path and channel assignment on every link in the path such that the path bandwidth is the same as that of the link bandwidth and such a path must satisfy the constraint that no two consecutive links on the path are assigned the same channel, referred to as “Channel Discontinuity Constraint”, CDC.
We present an efficient distributed algorithm for this problem. We also present a sparse network topology, termed as a spanner which can be used for joint routing and channel assignment in wireless networks.