Sciweavers

95 search results - page 4 / 19
» Filling and slotting: analysis and algorithms
Sort
View
ICC
2007
IEEE
139views Communications» more  ICC 2007»
14 years 1 months ago
Distributed Link Scheduling for TDMA Mesh Networks
— We present a distributed scheduling algorithm for provisioning of guaranteed link bandwidths in ad hoc mesh networks. The guaranteed link bandwidths are necessary to provide de...
Petar Djukic, Shahrokh Valaee
TWC
2010
13 years 2 months ago
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting, considerable attention. While several criteria have be...
Virag Shah, Neelesh B. Mehta, Raymond Yim
INFOCOM
2007
IEEE
14 years 1 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We 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...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
INFOCOM
2008
IEEE
14 years 1 months ago
Prioritized Repeated Eliminations Multiple Access: A Novel Protocol for Wireless Networks
—A new and simple MAC protocol is proposed. Each node transmits a burst with length sampled from a geometric distribution with parameter q followed by a carrier sense slot. A nod...
Greger Wikstrand, Thomas Nilsson, Mark S. Doughert...
EOR
2008
88views more  EOR 2008»
13 years 7 months ago
Algorithmic analysis of the Geo/Geo/c
In this paper, we consider a discrete-time queue of Geo/Geo/c type with geometric repeated attempts. It is known that its continuous counterpart, namely the M/M/c queue with expon...
Jesus R. Artalejo, Antonis Economou, Antonio G&oac...