Abstract
In this paper, a distributed technique is proposed to assign time slots to the nodes of an ad hoc network for Spatial Time Division Media Access (STDMA) to facilitate collision-free communication. An upper bound is established on the length of the time cycle assuming a constant bound on the degree of each node. The proposed algorithm is augmented to adapt with incremental changes in the topology.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhattacharjee, S., Das, N. (2005). Distributed Time Slot Assignment in Wireless Ad Hoc Networks for STDMA. In: Chakraborty, G. (eds) Distributed Computing and Internet Technology. ICDCIT 2005. Lecture Notes in Computer Science, vol 3816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604655_13
Download citation
DOI: https://doi.org/10.1007/11604655_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30999-4
Online ISBN: 978-3-540-32429-4
eBook Packages: Computer ScienceComputer Science (R0)