Skip to main content

Assigning Codes in a Random Wireless Network

  • Conference paper
Telecommunications and Networking - ICT 2004 (ICT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3124))

Included in the following conference series:

  • 1171 Accesses

Abstract

In this paper we present an algorithm that can assign codes in the Code Division Multiple Access (CDMA) framework for multihop ad hoc wireless networks. In CDMA framework, collisions are eliminated by assigning orthogonal codes to the stations such that the spectrum of frequency can be used by all transmitters of the network at the same time. In our setting, a large number n of distinguishable stations (e.g. sensors) are randomly deployed in a given area of size |S|. We propose an efficient and fully distributed algorithm, which assigns codes to the nodes of our network so that, for any ℓ > 0, any two stations at distance at most \(\sqrt{(1+\ell) \, |S| \, \log{n}/{\pi \, n}}\) from each other are assigned two distinct codes.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

References

  1. Battiti, R., Bertossi, A.A., Bonuccelli, M.A.: Assigning Codes in Wireless Networks: Bounds and Scaling Properties. Wireless Networks 5, 195–209 (1999)

    Article  Google Scholar 

  2. Bollobàs, B.: Modern graph theory. Graduate Texts in Mathematics. Springer, Berlin (1998)

    MATH  Google Scholar 

  3. Corless, R.M., Gonnet, G.H., Hare, D.E.G., Jeffrey, D.J., Knuth, D.E.: On the Lambert W Function. Advances in Computational Mathematics 5, 329–359 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Hall, P.: Introduction to the Theory of Coverage Processes. Birkhäuser, Basel (1988)

    MATH  Google Scholar 

  5. Kushilevitz, E., Mansour, Y.: An Ω(Dlog(N/D)) Lower Bound for Broadcast in Radio Networks. SIAM Journal on Comput 27(3), 702–712 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Miles, R.E.: On the Homogenous Planar Poisson Point Process. Math. Biosciences 6, 85–127 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  7. Perkins, C.E.: Ad Hoc Networking. Addison-Wesley, Reading (2001)

    Google Scholar 

  8. Ravelomanana, V.: Asymptotic Critical Ranges for Coverage Properties in Wireless Sensor Networks. Available upon request (2003) (in submitted)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Djerourou, F., Lavault, C., Paillard, G., Ravelomanana, V. (2004). Assigning Codes in a Random Wireless Network. In: de Souza, J.N., Dini, P., Lorenz, P. (eds) Telecommunications and Networking - ICT 2004. ICT 2004. Lecture Notes in Computer Science, vol 3124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27824-5_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27824-5_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22571-3

  • Online ISBN: 978-3-540-27824-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics