Cross-layer latency minimization in wireless networks with SINR constraints

Abstract

Recently, there has been substantial interest in the design of crosslayer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g. latency, energy, rate) by jointly optimizing the performance of multiple layers of the protocol stack. Algorithm designers often use geometric-graphtheoretic models for radio interference to design such cross-layer protocols. In this paper we study the problem of designing crosslayer protocols for multi-hop wireless networks using a more realistic Signal to Interference plus Noise Ratio (SINR) model for radio interference. The following cross-layer latency minimization problem is studied: Given a set V of transceivers, and a set of sourcedestination pairs, (i) choose power levels for all the transceivers, (ii) choose routes for all connections, and (iii) construct an end-to-end schedule such that the SINR constraints are satisfied at each time step so as to minimize the make-span of the schedule (the time by which all packets have reached their respective destinations). We present a polynomial-time algorithm with provable worst-case performance guarantee for this cross-layer latency minimization problem. As corollaries of the algorithmic technique we show that a number of variants of the cross-layer latency minimization problem can also be approximated efficiently in polynomial time. Our work extends the results of Kumar et al. (Proc. SODA, 2004) and Moscibroda et al. (Proc. MOBIHOC, 2006). Although our algorithm considers multiple layers of the protocol stack, it can naturally be viewed as compositions of tasks specific to each layerthis allows us to improve the overall performance while preserving the modularity of the layered structure.

A constant approximation algorithm for link scheduling in arbitrary networks under physical interference model

“…In [15], a power-assignment algorithm which schedules a strongly connected set of links in poly-logarithmic time is presented. In [3], the combined problem of routing and power control is addressed.…”

Efficient data aggregation in multi-hop wireless sensor networks under physical interference model

“…In [19], a power-assignment algorithm which schedules a strongly connected set of links in poly-logarithmic time is presented. In [4], the combined problem of routing and power control is addressed.…”

Joint Link Scheduling and Topology Control for Wireless Sensor Networks with SINR Constraints

“…For example, a joint link scheduling, topology control and routing solution with a much shorter provable scheduling length can be very challenging (Chafekar et al, 2007).…”