A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is
Ad-Hoc, Mobile, and Wireless Networks
We study the algorithmic problem of coordinating transmissions in a wireless network where radio interference constrains concurrent transmissions on wireless links. We focus on pairwise conflicts between the links; these can be described as a conflict graph. Associated with the conflict graph are two fundamental network coordination tasks: (a) finding a nonconflicting set of links with the maximum total weight, and (b) finding a link schedule with the minimum total length. Our work shows thatdoi:10.1007/978-3-540-74823-6_6 dblp:conf/adhoc-now/KaskiPS07 fatcat:jx43nfkwcvd3ppw4r5doixngom