Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas

Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, nodes with multiple radios, and point-to-point longdistance wireless links established using high-gain directional antennas mounted on high towers. It has been demonstrated previously that in such network architectures, nodes can transmit concurrently on multiple radios, as well as receive concurrently on multiple radios. However, concurrent transmission on one radio, and reception on another radio causes interference. Under this scheduling constraint, given a set of source-destination demand rates, we consider the problem of satisfying the maximum fraction of each demand (also called the maximum concurrent flow problem). We give a novel joint routing and scheduling scheme for this problem, based on linear programming and graph coloring. We analyze our algorithm theoretically and prove that at least 50% of a ...

• Type: Journal
• Year: 2010
• Where: INFOCOM
• Authors: Partha Dutta, Vivek Mhatre, Debmalya Panigrahi, Rajeev Rastogi
• Keywords: Communications, INFOCOM 2010, Maximum Concurrent Flow, Multi-hop Wireless Networks, Multiple Radios