Download now Free registration required
Multi-channel wireless networks are increasingly being employed as infrastructure networks in metro areas. In addition, nodes in these networks employ directional antennas to improve spatial throughput. In such networks, given a source and destination, it is of interest to compute a path and channel assignment on every link in the path such that the path bandwidth is the same as that of the link bandwidth. 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." In this paper, the authors develop two graph expansion techniques to compute the minimum cost path between a given node pair that satisfy the channel discontinuity constraint.
- Format: PDF
- Size: 1035.4 KB