Abstract
AbstractA 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. Copyright © 2003 AEI
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
