On Channel-Discontinuity-Constraint Routing in Wireless Networks

Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to improve 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 satisfies the constraint that no two consecutive links on the path are assigned the same channel, referred to as “Channel Discontinuity Constraint” (CDC). CDC-paths are also quite useful for TDMA system, where preferably every consecutive links along a path are assigned different time slots. This paper contains several contributions. We first present an O(N2 ) distributed algorithm for discovering the shortest CDC-path between given source and destination. For use in wireless networks, we explain how spatial properties can be used for dramatically ...

• Type: Journal
• Year: 2010
• Where: INFOCOM
• Authors: Swaminathan Sankararaman, Alon Efrat, Srinivasan Ramasubramanian, Pankaj K. Agarwal
• Keywords: Algorithm, Communications, Directional Antennas, Distributed Manner, INFOCOM 2010