Skip to main content

Distributed Time Slot Assignment in Wireless Ad Hoc Networks for STDMA

  • Conference paper
Distributed Computing and Internet Technology (ICDCIT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3816))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics