Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks

Simple item page
dc.citation.bibtexNametechreporten_US
dc.citation.journalTitleIEEE INFOCOMen_US
dc.contributor.authorKabbani, Abdulen_US
dc.contributor.authorSalonidis, Theodorosen_US
dc.contributor.authorKnightly, Edwarden_US
dc.contributor.orgCenter for Multimedia Communications (http://cmc.rice.edu/)en_US
dc.date.accessioned2007-10-31T00:48:52Zen_US
dc.date.available2007-10-31T00:48:52Zen_US
dc.date.issued2007en_US
dc.date.modified2006-08-14en_US
dc.date.submitted2006-08-14en_US
dc.descriptionTech Reporten_US
dc.description.abstractWe introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks, such a maximum throughput protocol has been notoriously hard to realize because (i) even if global topology information is available, the problem of computing the optimal link transmission set at each slot is NP-complete (ii) no bounds exist on the number of steps required for such a computation (per-slot overhead). For the logical tree structures induced by the WBN traffic matrices, we first introduce a centralized algorithm that solves the optimal scheduling problem in a number of steps at most linear in the number of nodes in the network. This is achieved by discovering and exploiting a novel set of graph-theoretical properties of the WBN contention graph. Guided by the centralized algorithm, we design a distributed protocol where, at the beginning of each slot, nodes coordinate and incrementally compute the optimal link transmission set. We then introduce an algorithm to compute the minimum number of steps to complete this computation, thus minimizing the per-slot overhead. Using both analysis and simulations, we show that in practice our protocol yields low overhead when implemented over existing wireless technologies and significantly outperforms existing suboptimal distributed slotted scheduling mechanisms.en_US
dc.identifier.citationA. Kabbani, T. Salonidis and E. Knightly, "Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks," <i>IEEE INFOCOM,</i> 2007.en_US
dc.identifier.doihttp://dx.doi.org/10.1109/INFCOM.2007.239en_US
dc.identifier.urihttps://hdl.handle.net/1911/19996en_US
dc.language.isoengen_US
dc.relation.projecthttp://ece.rice.edu/~thsalonen_US
dc.subjectWireless networksen_US
dc.subjectSchedulingen_US
dc.subjectGraph Theoryen_US
dc.subjectDistributed MAC protocolsen_US
dc.subject.keywordWireless networksen_US
dc.subject.keywordSchedulingen_US
dc.subject.keywordGraph Theoryen_US
dc.subject.keywordDistributed MAC protocolsen_US
dc.titleDistributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networksen_US
dc.typeReporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Kab2006Aug9Distribute.PDF
Size:
255.12 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications