research-article

On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks

Authors:

Stephan BohacekAuthors Info & Claims

WICON '08: Proceedings of the 4th Annual International Conference on Wireless Internet

November 2008

Article No.: 15, Pages 1 - 9

Published: 17 November 2008 Publication History

Abstract

It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Consequently, it is widely believed that optimal scheduling cannot be solved in practical networks. However, there are many cases where there is a significant difference between worst-case complexity and practical complexity. This paper examines the practical complexity of the MWIS problem through extensive computational experimentation. In all, over 10000 topologies are examined. It is found that the MWIS problem can be solved quickly, for example, for a 2048 node topology, it can be solved in approximately one second. Moreover, it appears that the average computational complexity grows polynomially with the number of nodes and linearly with the mean degree of the conflict graph.

References

[1]

L. Tassiulas and A. Ephremides, "Jointly optimal routing and scheduling in packet radio networks", IEEE Trans. on Info. Theory, vol. 38, no. 1, pp. 165--168, Jan 1992.

Digital Library

[2]

E. Arikan, "Some complexity results about packet radio networks", IEEE Trans. on Info. Theory, vol. 30, no. 4, pp. 681--685, Jul 1984.

Digital Library

[3]

L. Bui, A. Eryilmaz, R. Srikant, and X. Wu, "Joint congestion control and distributed schedulingin multihop wireless networks with a node-exclusive interference model", in Infocom, 2006.

[4]

X. Lin and N. B. Shroff, "The impact of imperfect scheduling on cross-layer congestion control in wireless networks", IEEE/ACM Transactions on Networking, vol. 14, no. 2, pp. 302--315, April 2006.

Digital Library

[5]

L. Chen, S. H. Low, M. Chiang, and J. C. Doyle, "Cross-layer congestion control, routing and scheduling design in ad hoc wireless networks", in Infocom, 2006.

[6]

R. M. Karp, "Reducibility among combinatorial problems", in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. Plenum, 1972, pp. 85--103.

[7]

J. Hastad, "Clique is hard to approximate within n ^1-ε." in Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996, pp. 627--636.

Digital Library

[8]

M. Grotschel, L. Lovasz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization. Berlin: Springer-Verlag, 1993.

[9]

T. Matsui, "Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs", in JCDCG, 1998, pp. 194--200.

Digital Library

[10]

G. Valiente, A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs. Springer, 2003, vol. 2906, pp. 129--137.

[11]

G. H. Chen, M. T. Kuo, and J. P. Sheu, "An optimal time algorithm for finding a maximum weight independent set in a tree", BIT, vol. 23, pp. 353--356, 1988.

Digital Library

[12]

G. Minty, "On maximal independent sets of vertices in claw-free graphs", J. Combinatorial Theory, vol. B, no. 28, pp. 284--304, 1980.

[13]

V. E. Alekseev and V. V. Lozin, "Augmenting graphs for independent sets", Rutgers Center of Operations Research, Tech. Rep. 59-2000, 2000.

[14]

V. Klee and G. J. Minty, "How good is the simplex algorithm", in Inequalities III, O. Shisha, Ed. New York: Academic Press, 1972, pp. 159--175.

[15]

J. Nocedal and S. Wright, Numerical Optimization. Springer, 2000.

[16]

ILOG, "CPLEX", 2008.

[17]

Dash Optimization, "Xpress optimizer", 2007.

[18]

V. Damerow, "Average and smoothed complexity of geometric structures", Ph.D. dissertation, Universitat at Paderborn, 2005.

[19]

B. Bollobas, T. I. Fenner, and A. M. Frieze, "An algorithm for finding hamilton cycles in a random graph", in Proceedings of the 17th Annual ACM Symposium on Theory of Computing. ACM, 1985, pp. 430--439.

Digital Library

[20]

L. Perkovic, "Edge coloring, polyhedra and probability", Ph.D. dissertation, Carnegie Mellon University, 1998.

Digital Library

[21]

H. S. Wilf, Algortihms and Complexity. AK Peters, Ltd, 2002, no. available at: http://www.physics.it/lectures/AlgorithmComplexity.pdf.

Digital Library

[22]

A. Goldberg, "On the complexity of the satisfiability problem", New York University, Tech. Rep. Courant Computer Science Report 16, 1979.

[23]

A. Goldberg, P. W. Purdom, and C. A. Brown, "Average time analysis of simplified davis-putnam procedures", Information Processing Letters, vol. 15, pp. 72--75, 1982.

[24]

J. N. Hooker, "Resolution vs. cutting plane solution of interference problems: Some computational experience", Operations Research Letters, vol. 7, pp. 1--7, 1988.

Digital Library

[25]

A. P. Kamath, N. K. Karmarker, K. G. Ramakrishnan, and M. G. C. Resende, "Computational experience with an interior point algorithm on the satisfiability problem", in Proceedings of the Conference on Integer Programming and Combinatorial Optimization. Mathematical Programming Society, 1990, pp. 333--349.

Digital Library

[26]

D. G. Mitchell, B. Selman, and H. J. Levesque, "Hard and easy distributions for SAT problems", in Proceedings of the Tenth National Conference on Artificial Intelligence, P. Rosenbloom and P. Szolovits, Eds. Menlo Park, California: AAAI Press, 1992, pp. 459--465. {Online}. Available: citeseer.ist.psu.edu/mitchell92hard.html

Digital Library

[27]

S. Bohacek and P. Wang, "Practical computation of optimal schedules in multihop wireless networks", submitted 2007, available at http://udelmodels.eecis.udel.edu.

Digital Library

[28]

P. Wang and S. Bohacek, "Communication models for capacity optimization in mesh networks", in ACM PE-WASUN 2008, Vancouver, Canada, 2008.

Digital Library

[29]

K. Jain, J. Padhye, V. Padmanabhan, and L. Qiu, "Impact of interference on multi-hop wireless network performance", in Proceedings of ACM MobiCom, San Diego, CA, September 2003, pp. 66--80.

Digital Library

[30]

T. Rappaport, Wireless Communications - Principles and Practice. Prentice Hall, 2002.

Digital Library

[31]

S. Bohacek, V. Sridhara, and J. Kim, "UDel Models", available at: http://udelmodels.eecis.udel.edu/.

Cited By

Wang PBohacek S(2011)Practical computation of optimal schedules in multihop wireless networksIEEE/ACM Transactions on Networking10.1109/TNET.2011.211146219:2(305-318)Online publication date: 1-Apr-2011
https://dl.acm.org/doi/10.1109/TNET.2011.2111462
Wang PMatyjas JMedley M(2010)Joint spectrum allocation and scheduling in multi-radio multi-channel cognitive radio wireless networksProceedings of the 33rd IEEE conference on Sarnoff10.5555/1843486.1843531(231-236)Online publication date: 12-Apr-2010
https://dl.acm.org/doi/10.5555/1843486.1843531
Bohacek SWang PBononi LLassous I(2008)Communication models for throughput optimization in mesh networksProceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks10.1145/1454609.1454627(80-87)Online publication date: 27-Oct-2008
https://dl.acm.org/doi/10.1145/1454609.1454627

Index Terms

On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
1. Networks
  1. Network types
    1. Mobile networks
    2. Wireless access networks

Recommendations

A note on greedy algorithms for the maximum weighted independent set problem

In this paper, we consider three simple and natural greedy algorithms for the maximum weighted independent set problem. We show that two of them output an independent set of weight at least Σ_v∈V(G) W(v)/[d(v) + 1] and the third algorithm outputs an ...
Read More
Distributed greedy approximation to maximum weighted independent set for scheduling with fading channels

It has been known that scheduling algorithms designed to achieve throughput optimality and good delay performance often require solving the Maximum Weighted Independent Set (MWIS) problem. However, under most realistic network settings, the MWIS problem ...
Read More
Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract)
Computing and Combinatorics
Abstract
The maximum independent set problem is one of the most important problems in graph algorithms and has been extensively studied in the line of research on the worst-case analysis of exact algorithms for NP-hard problems. In the weighted version, ... $^{}^{}$
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

WICON '08: Proceedings of the 4th Annual International Conference on Wireless Internet

November 2008

682 pages

ISBN:9789639799363

General Chairs:
Xudong Wang
Ohio State University
,
Ness Shroff
TeraNovi Technologies, Inc.

Sponsors

XIRRUS
Intel: Intel
ICST

Publisher

ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)

Brussels, Belgium

Publication History

Published: 17 November 2008

Check for updates

Author Tags

Qualifiers

Research-article

Conference

WICON08

Sponsor:

Intel

WICON08: The 4th International Wireless Internet Conference

November 17 - 19, 2008

Hawaii, Maui, USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
134
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Wang PBohacek S(2011)Practical computation of optimal schedules in multihop wireless networksIEEE/ACM Transactions on Networking10.1109/TNET.2011.211146219:2(305-318)Online publication date: 1-Apr-2011
https://dl.acm.org/doi/10.1109/TNET.2011.2111462
Wang PMatyjas JMedley M(2010)Joint spectrum allocation and scheduling in multi-radio multi-channel cognitive radio wireless networksProceedings of the 33rd IEEE conference on Sarnoff10.5555/1843486.1843531(231-236)Online publication date: 12-Apr-2010
https://dl.acm.org/doi/10.5555/1843486.1843531
Bohacek SWang PBononi LLassous I(2008)Communication models for throughput optimization in mesh networksProceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks10.1145/1454609.1454627(80-87)Online publication date: 27-Oct-2008
https://dl.acm.org/doi/10.1145/1454609.1454627

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents