Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms
A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria
SIAM Journal on Computing
A Unified Framework and Algorithm for (T/F/C)DMA Channel Assignment in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Proceedings of the 9th annual international conference on Mobile computing and networking
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 12th annual international conference on Mobile computing and networking
The capacity of wireless networks
IEEE Transactions on Information Theory
A tutorial on cross-layer optimization in wireless networks
IEEE Journal on Selected Areas in Communications
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Exact and approximate link scheduling algorithms under the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Improved Algorithms for Latency Minimization in Wireless Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Wireless Communication Is in APX
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Structure and algorithms in the SINR wireless model
ACM SIGACT News
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
The limit of information propagation speed in large-scale multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
The design and evaluation of fair scheduling in wireless mesh networks
Journal of Computer and System Sciences
Improved algorithms for latency minimization in wireless networks
Theoretical Computer Science
Algorithms for scheduling with power control in wireless networks
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Nearly optimal bounds for distributed wireless scheduling in the SINR model
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Capacity of wireless networks under SINR interference constraints
Wireless Networks
Wireless capacity with oblivious power in general metrics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Multi-hop routing and scheduling in wireless networks in the SINR model
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Wireless capacity with arbitrary gain matrix
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
On the capacity of oblivious powers
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Low-complexity scheduling for wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Wireless scheduling with power control
ACM Transactions on Algorithms (TALG)
Adaptive energy-efficient scheduling for hierarchical wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Constant-approximation for optimal data aggregation with physical interference
Journal of Global Optimization
Hi-index | 0.00 |
Recently, there has been substantial interest in the design of cross-layer 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-graph-theoretic models for radio interference to design such cross-layer protocols. In this paper we study the problem of designing cross-layer 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 source-destination 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 layer --- this allows us to improve the overall performance while preserving the modularity of the layered structure.