Cross-layer latency minimization in wireless networks with SINR constraints

作者: Deepti Chafekar , V.S. Anil Kumar , Madhav V. Marathe , Srinivasan Parthasarathy , Aravind Srinivasan

DOI: 10.1145/1288107.1288123

关键词:

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

参考文章(32)
Xiaojun Lin, N.B. Shroff, The impact of imperfect scheduling on cross-layer rate control in wireless networks international conference on computer communications. ,vol. 3, pp. 1804- 1814 ,(2005) , 10.1109/INFCOM.2005.1498460
Gurashish Brar, Douglas M. Blough, Paolo Santi, Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks acm/ieee international conference on mobile computing and networking. pp. 2- 13 ,(2006) , 10.1145/1161089.1161092
Prabhakar Raghavan, Clark D. Tompson, Randomized rounding: a technique for provably good algorithms and algorithmic proofs Combinatorica. ,vol. 7, pp. 365- 374 ,(1987) , 10.1007/BF02579324
Aravind Srinivasan, Chung-Piaw Teo, A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria SIAM Journal on Computing. ,vol. 30, pp. 2051- 2068 ,(2001) , 10.1137/S0097539798335596
Herman Chernoff, A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations Annals of Mathematical Statistics. ,vol. 23, pp. 493- 507 ,(1952) , 10.1214/AOMS/1177729330
S. Ramanathan, Errol L. Lloyd, Scheduling algorithms for multi-hop radio networks Conference proceedings on Communications architectures & protocols - SIGCOMM '92. ,vol. 22, pp. 211- 222 ,(1992) , 10.1145/144179.144283
Patrik Björklund, Peter Värbrand, Di Yuan, A Column Generation Method for Spatial TDMA Scheduling in Ad Hoc Networks ad hoc networks. ,vol. 2, pp. 405- 418 ,(2004) , 10.1016/J.ADHOC.2003.09.002
Aravind Srinivasan, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, End-to-end packet-scheduling in wireless ad-hoc networks symposium on discrete algorithms. pp. 1021- 1030 ,(2004) , 10.5555/982792.982945
F. T. Leighton, Bruce M. Maggs, Satish B. Rao, Packet routing and job-shop scheduling in O (congestion+dilation) steps Combinatorica. ,vol. 14, pp. 167- 186 ,(1994) , 10.1007/BF01215349
T. Moscibroda, R. Wattenhofer, The Complexity of Connectivity in Wireless Networks ieee international conference computer and communications. pp. 1- 13 ,(2006) , 10.1109/INFOCOM.2006.23