DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yi, Yung | - |
dc.contributor.author | Chiang, M. | - |
dc.date.accessioned | 2013-03-27T10:52:06Z | - |
dc.date.available | 2013-03-27T10:52:06Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2008 | - |
dc.identifier.citation | IEEE International Conference on Communications, v., no., pp.3105 - 3109 | - |
dc.identifier.issn | 0536-1486 | - |
dc.identifier.uri | http://hdl.handle.net/10203/161813 | - |
dc.description.abstract | We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technology advances and heterogeneity in wireless networks lead to various interference patterns. Thus, a scheduling algorithm geared into a specific interference model (typically one-hop or two-hop in literature) may be limited in its applicability. In this paper, we tackle this problem, and develop a family of scheduling algorithms (which guarantees throughput and delay performance) for M-hop interference models. To achieve such a goal, we use the concept of vertex augmentation, and for a given M, the family of parameterized algorithms are proposed and the tradeoffs among throughput, complexity, and delay are studied. ?2008 IEEE. | - |
dc.language | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers | - |
dc.title | Wireless scheduling algorithms with O(1) overhead for M-hop interference model | - |
dc.type | Conference | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 3105 | - |
dc.citation.endingpage | 3109 | - |
dc.citation.publicationname | IEEE International Conference on Communications | - |
dc.identifier.conferencecountry | China | - |
dc.identifier.conferencecountry | China | - |
dc.contributor.localauthor | Yi, Yung | - |
dc.contributor.nonIdAuthor | Chiang, M. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.