Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by source-destination pairs of nodes from a metric space. The nodes correspond to devices in a wireless network. Each pair must be assigned a power level and a color such that the pairs in each color class can communicate simultaneously at the specified power levels. The feasibility of simultaneous communication within a color class is defined in terms of the Signal to Interference plus Noise Ratio (SINR) that compares the strength of a signal at a receiver to the sum of the strengths of other signals. The objective is to minimize the number of colors as this corresponds to the time needed to schedule all requests.
We introduce an instance-based measure of interference, denoted by I, that enables us to improve on previous results for the interference scheduling problem. We prove upper and lower bounds in terms of I on the number of steps needed for scheduling a set of requests. For general power assignments, we prove a lower bound of Ω(I / (log Δ log n)) steps, where Δ denotes the aspect ratio of the metric. When restricting to the two-dimensional Euclidean space (as previous work) the bound improves to Ω(I (logΔ). Alternatively, when restricting to linear power assignments, the lower bound improves even to Ω(I). The lower bounds are complemented by an efficient algorithm computing a schedule for linear power assignments using only \(\mathcal O(I \log n)\) steps. A more sophisticated algorithm computes a schedule using even only \(\mathcal O(I + \log^2 n)\) steps. For dense instances in the two-dimensional Euclidean space, this gives a constant factor approximation for scheduling under linear power assignments, which shows that the price for using linear (and, hence, energy-efficient) power assignments is bounded by a factor of \(\mathcal O(\log \Delta)\).
In addition, we extend these results for single-hop scheduling to multi-hop scheduling and combined scheduling and routing problems, where our analysis generalizes previous results towards general metrics and improves on the previous approximation factors.
Unable to display preview. Download preview PDF.
- 2.Banerjee, S., Misra, A.: Minimum energy paths for reliable communication in multi-hop wireless networks. In: Proceedings of the 3rd ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 146–156 (2002)Google Scholar
- 3.Bansal, N., Liu, Z.: Capacity, delay and mobility in wireless ad-hoc networks. In: Conference of the IEEE Communications Society (INFOCOM), vol. 2, pp. 1553–1563 (2003)Google Scholar
- 4.Chafekar, D., Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Cross-layer latency minimization in wireless networks with SINR constraints. In: Proceedings of the 8th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 110–119 (2007)Google Scholar
- 5.Chafekar, D., Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Approximation algorithms for computing capacity of wireless networks with SINR constraints. In: Proceedings of the 27th Conference of the IEEE Communications Society (INFOCOM), pp. 1166–1174 (2008)Google Scholar
- 6.Fanghänel, A., Keßelheim, T., Räcke, H., Vöcking, B.: Oblivious interference scheduling. In: PODC 2009 (submitted, 2009)Google Scholar
- 9.Kozat, U.C., Tassiulas, L.: Network layer support for service discovery in mobile ad hoc networks. In: Proceedings of the 22nd Conference of the IEEE Communications Society (INFOCOM), pp. 1965–1975 (2003)Google Scholar
- 11.Leighton, F.T., Maggs, B.M., Ranade, A.G., Rao, S.B.: Randomized routing and sorting on fixed-connection networks. Journal of Algorithms (1994)Google Scholar
- 12.Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-shop scheduling in O(congestion+dilation) steps. Combinatorica (1994)Google Scholar
- 13.Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How optimal are wireless scheduling protocols? In. In: Proceedings of the 26th Conference of the IEEE Communications Society (INFOCOM), pp. 1433–1441 (2007)Google Scholar
- 14.Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: Proceedings of the 25th Conference of the IEEE Communications Society (INFOCOM), pp. 1–13 (2006)Google Scholar
- 15.Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology control meets SINR: The scheduling complexity of arbitrary topologies. In: Proceedings of the 7th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 310–321 (2006)Google Scholar
- 18.Srinivasan, A., Teo, C.-P.: A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. In: STOC 1997: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, New York, USA, pp. 636–643 (1997)Google Scholar