NDLI: Maximum weighted matching with interference constraints

Content Provider	IEEE Xplore Digital Library
Author	Sharma, G. Shroff, N.B. Mazumdar, R.R.
Copyright Year	2006
Description	Author affiliation: Center for Wireless Syst. & Applications, Purdue Univ., West Lafayette, IN (Sharma, G.; Shroff, N.B.)
Abstract	In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization problem, we introduce a new class of weighted matching problems, namely maximum weighted K-valid matching problems (MWKVMPs). For K = 1, MWKVMP corresponds to the well studied maximum weighted matching problem (MWMP) in the literature, which can be solved in polynomial time. We prove several interesting results concerning the hardness of these problems for K ges 2. In particular, we show that MWKVMP does not even belong to APX; where APX denotes the class of problems to which a constant factor approximation can be obtained in polynomial time. Our results have strong implications concerning the hardness of scheduling transmissions in multi-hop wireless systems
Starting Page	5
Ending Page	74
File Size	202577
Page Count	70
File Format	PDF
ISBN	0769525202
DOI	10.1109/PERCOMW.2006.79
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-03-13
Publisher Place	Italy
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Interference constraints Polynomials Aggregates Application software Wireless communication Bidirectional control Throughput Pervasive computing Conferences
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Power Efficient Throughput Maximization in Multi-Hop Wireless Networks

Maximum weighted matching with interference constraints.

Adaptable Pervasive Flows - An Emerging Technology for Pervasive Adaptation

Maximum weighted matching with interference constraints (2006)

On the complexity of scheduling in wireless networks

Maximizing throughput in MIMO networks with variable rate streams

Greedy scheduling in multihop wireless networks

A weighted interference estimation scheme for interface switching wireless mesh networks

Pervasive Computing with Frugal Objects

Maximum weighted matching with interference constraints

Similar Documents

Power Efficient Throughput Maximization in Multi-Hop Wireless Networks

Maximum weighted matching with interference constraints.

Adaptable Pervasive Flows - An Emerging Technology for Pervasive Adaptation

Maximum weighted matching with interference constraints (2006)

On the complexity of scheduling in wireless networks

Maximizing throughput in MIMO networks with variable rate streams

Greedy scheduling in multihop wireless networks

A weighted interference estimation scheme for interface switching wireless mesh networks

Pervasive Computing with Frugal Objects

Maximum weighted matching with interference constraints