Exact and approximate link scheduling algorithms under the physical interference model

DIALM-POMC'08: Proceedings of the ACM 5th International Workshop on Foundations of Mobile Computing

Volumn , Issue , 2008, Pages 45-54

  Hua, Qiang Sheng ^a   Lau, Francis C M ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Ad hoc networks; Coloring; Constraint satisfaction problem; Counting; Inclusion exclusion principle; Link scheduling; Physical interference model; Sensor networks; Sinr; Wireless

Indexed keywords

CONSTRAINT SATISFACTION PROBLEM; COUNTING; INCLUSION-EXCLUSION PRINCIPLE; LINK SCHEDULING; PHYSICAL INTERFERENCE MODEL; SINR; WIRELESS;

AD HOC NETWORKS; APPROXIMATION ALGORITHMS; COLORING; POLYNOMIAL APPROXIMATION; SENSOR NETWORKS; SET THEORY; STEELMAKING; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

SCHEDULING ALGORITHMS;

EID: 65249127422     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400863.1400874     Document Type: Conference Paper

References (33)

1. M. Andersin, Z. Rosberg and J. Zander. Gradual Removals in Cellular PCS with Constrained Power Control and Noise. Wireless Network, 2(1): 27-43, 1996.
2. A. Behzad and I. Rubin. Optimum Integrated Link Scheduling and Power Control for Multihop Wireless Networks. IEEE Transactions on Vehicular Technology, 56(1):194-205, 2007.
3. A. Björklund, T. Husfeldt, P. Kaski and Mikko Koivisto. Fourier Meets Möbius: Fast Subset Convolution. In Proc. 39th Annual ACM Symposium on Theory of Computing (STOC), San Diego, California, US, June 2007.
4. A. Björklund and T. Husfeldt. Inclusion-Exclusion Algorithms for Counting Set Partitions. In Proc. 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Berkeley, California, US, Oct. 2006.
5. A. Björklund, T. Husfeldt, and M. Koivisto. Set Partitioning via Inclusion-Exclusion. SUM Journal on Computing, to appear.
6. S. A. Borbash and A. Ephremides. Wireless Link Scheduling With Power Control and SINR Constraints. IEEE Transactions on Information Theory, 52(11): 5106-5111, 2006.
7. G. Brar, D. Blough, and P. Santi. Computationally Efficient Scheduling with the Physical Interference Model for Throughput Improvement in Wireless Mesh Networks. In Proc. 12th Annual International Conference on Mobile Computing and Networking (MOBICOM), Los Angeles, CA, USA, Sept. 2006.
8. M. Caramia and P. Dell'olmo. Constraint Propagation in Graph Coloring. Journal of Heuristics, 8(1):83-107, 2002.
9. D. Chafekar, V, S. A. Kumar, M. V. Marathe, S. Parthasarathy and A. Srinivasan. Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. In Proc. 27th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), Phoenix, AZ, US, April 2008.
10. D. Chafekar, V. S. A. Kumar, M. V. Marathe, S. Parthasarathy and A. Srinivasan. Cross-Layer Latency Minimization in Wireless Networks with SINR Constraints. In Proc. 8th ACMInternational Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Montreal, Canada, Sept. 2007.
11. T. ElBatt and A. Ephremides. Joint Scheduling and Power Control for Wireless Ad-hoc Networks. In Proc. INFOCOM, New York, US, June 2002.
12. T. Erlebach, K. Jansen and E. Seidel. Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. SIAM Journal on Computing: 34(6): 1302-1323, 2005.
13. F. V. Fomin, F. Grandoni and D. Kratsch. Measure and Conquer: a Simple O(2∧0.288n) Independent Set Algorithm. In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Miami, Florida, US, Jan. 2006.
14. M. Fürer and S. P. Kasiviswanathan. Algorithms for Counting 2-Sat Solutions and Colorings with Applications. In Proc. 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM), Portland, OR, US, June 2007.
15. O. Goussevskaia, Y. A. Oswald, and R.Wattenhofer. Complexity in Geometric SINR. In Proc. MOBIHOC, Montreal, Canada, Sept. 2007.
16. Piyush Gupta and P. R. Kumar. The Capacity of Wireless Networks. IEEE Transactions on Information Theory, 46(2):388-404, 2000.
17. B.E. Hajek and G.H. Sasaki. Link Scheduling in Polynomial Time. IEEE Transactions on Information Theory, 34(5): 910-917, 1988.
18. Q.-S. Hua and F. C. M. Lau. The Scheduling and Energy Complexity of Strong Connectivity in Ultra-Wideband Networks. In Proc. 9th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM), Torremolinos, Malaga, Spain, Oct. 2006.
19. Q.-S. Hua and F.C.M. Lau. Balancing the Scheduling and Energy Complexities in Wireless Networks. Submitted to MSWiM'08.
20. M. Koivisto. An O*(2∧n) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion-Exclusion. In Proc. FOCS, Berkeley, California, US, Oct. 2006.
21. T. Locher, P. von Rickenbach, and R. Wattenhofer. Sensor Networks Continue to Puzzle: Selected Open Problems (Invited paper). In Proc. 9th International Conference on Distributed Computing and Networking (ICDCN), Kolkata, India, Jan. 2008.
22. J.W. Moon and L. Moser. On Cliques in Graphs. Israel Journal of Mathematics, Vol. 3, pp. 23-28, 1965.
23. T. Moscibroda, Y. A. Oswald, and R. Wattenhofer. How Optimal are Wireless Scheduling Protocols? In Proc. INFOCOM, Anchorage, Alaska, US, May 2007.
24. T. Moscibroda. The Worst-Case Capacity of Wireless Sensor Networks. In Proc. 6th International Conference on Information Processing in Sensor Networks (IPSN), Cambridge, Massachusetts, US, April 2007.
25. T. Moscibroda, R. Wattenhofer, and Y. Weber. Protocol Design Beyond Graph-Based Models. In Proc. 5th Workshop on Hot Topics in Networks (HotNets), Irvine, California, US, Nov. 2006.
26. T. Moscibroda and R. Wattenhofer. The Complexity of Connectivity in Wireless Networks. In Proc. INFOCOM, Barcelona, Spain, April 2006.
27. T. Moscibroda, R. Wattenhofer, and A. Zollinger. Topology Control Meets SINR: The Scheduling Complexity of Arbitrary Topologies. In Proc. MOBIHOC, Florence, Italy, May 2006.
28. S. U. Pillai, T. Suel, and S. Cha. The Perron-Frobenius Theorem, and Some of its Applications. IEEE Signal Processing Magazine, 22(2):62-75, 2005.
29. A.Richa, C.Scheideler, P.Santi, An O(log n) Dominating Set Protocol for Wireless Ad Hoc Networks under the Physical Interference Model. In Proc. MOBIHOC, Hong Kong, China, May 2008.
30. G. Sharma, R.R. Mazumdar and N.B. Shroff. On the Complexity of Scheduling in Wireless Networks. In Proc. MOBICOM, Los Angeles, CA, USA, Sept. 2006.
31. V. V.Vazirani. Approximation Algorithms. Berlin: Springer, 2003.
32. R. J. Wood and M. J. O'Neill. An Always Convergent Method for Finding the Spectral Radius of an Irreducible Non-Negative Matrix. The ANZIAM Journal, V45:C474-C485, 2004.
33. J. Zander. Performance of Optimum Transmitter Power Control in Cellular Radio Systems. IEEE Transactions on Vehicular Technology, 41(1):57-62, 1992.