A distributed scheduling algorithm for a bluetooth scatternet

Johansson, Niklas; Körner, Ulf; Tassiulas, Leandros

doi:10.1016/s1388-3437(01)80111-6

Cited by 36 publications

(25 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this asynchronous TDMA setting, slots are wasted when nodes switch time references as slaves. This phenomenon has been reported in the scatternet scheduling literature [4][5][6][7][8] as a source of overhead. However, no formal study has examined its effect on the system's ability to allocate bandwidth.…”

Section: Introductionmentioning

confidence: 56%

“…Emphasis is placed on distributed schemes-the approaches can be categorized according to the degree of coordination they offer. 'Hard' coordination schemes [8,15] provide deterministic allocations via conflict-free scheduling; however, a certain degree of implementation complexity and communication overhead is needed to maintain the conflict-free property under topology dynamics. 'Soft' coordination schemes [5][6][7] trade off perfectly conflict-free transmissions for lower complexity.…”

Section: The Case Of Bluetoothmentioning

confidence: 99%

See 1 more Smart Citation

Asynchronous TDMA ad hoc networks: scheduling and performance

Salonidis

2004

Trans Emerging Tel Tech

View full text Add to dashboard Cite

SUMMARYA common assumption of time division multiple access (TDMA)-based wireless ad hoc networks is the existence of network-wide slot synchronization. Such a mechanism is difficult to support in practice. In asynchronous TDMA systems, each link uses a local time slot reference provided by the hardware clock tick of one of the node endpoints. Inevitably, slots are wasted when nodes switch time slot references. This restricts the rate allocations that can be supported when compared to a perfectly synchronized system. To address this practical performance issue, we first introduce a general framework for conflict-free scheduling in asynchronous TDMA networks. We then propose scheduling algorithms that target overhead minimization while ensuring upper bounds on the generated overhead. Through extensive simulations the algorithm performances are evaluated in the context of Bluetooth, a wireless technology that operates according to the asynchronous TDMA communication paradigm.

show abstract

Section: Introductionmentioning

confidence: 56%

Section: The Case Of Bluetoothmentioning

confidence: 99%

Asynchronous TDMA ad hoc networks: scheduling and performance

Salonidis

2004

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…Several methods have been proposed for solving the inter-cluster scheduling problem [1] and these are often based on rendezvous points [19]. A rendezvous point is a particular time slot when the gateway should be present in a specific cluster, for exchange of data with this cluster's master, i.e., rendezvous points are required for each cluster the gateway is a member of.…”

Section: Introductionmentioning

confidence: 99%

“…A rendezvous point is a particular time slot when the gateway should be present in a specific cluster, for exchange of data with this cluster's master, i.e., rendezvous points are required for each cluster the gateway is a member of. The global optimal inter-cluster schedule is NP-complete [19]. However, local suboptimal solutions based on random methods can be constructed using rendezvous windows with pseudorandom length [20].…”

Section: Introductionmentioning

confidence: 99%

The use of clustered wireless multihop networks in industrial settings

Bilstrup

Svensson

et al. 2007

2007 IEEE Conference on Emerging Technologies &Amp; Factory Automation (EFTA 2007)

View full text Add to dashboard Cite

show abstract

“…The earlier work was focused on guaranteeing end-to-end connectivity whenever that was feasible [1], [8], [14]. Transmission scheduling algorithms that provide some guarantees on the rates obtained by each link have lately been proposed [6], [7], [15], [11], [22]. The quality of service perceived by the applications, however, depends on the end-to-end bandwidth allocated to the multihop sessions.…”

mentioning

confidence: 99%