Maximal Scheduling in a Hypergraph Model for Wireless Networks
Qiao Li; Gyouhwan Kim; Negi, R.
Communications, 2008. ICC apos;08. IEEE International Conference on
Volume , Issue , 19-23 May 2008 Page(s):3853 - 3857
Digital Object Identifier   10.1109/ICC.2008.723
Summary:We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by sum interference. We show in an arbitrary network, the successful transmissions under any graph model can be improved by a hypergraph. In some networks, a hypergraph can double the uniform throughput compared to the disk graph. We then analyze the capacity region of maximal scheduling in the hypergraph, where a linear programming (LP) based lower bound is formulated and proven to be tight. We also show that the maximal scheduling in hypergraph can guarantee a certain fraction of the capacity region. Simulation results show that maximal scheduling in hypergraph can achieve about 40% more uniform throughput than in graph for random networks.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.