Assigning codes in a random wireless network

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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 l > 0, any two stations at distance at most √(1+l)|S| log n/π n from each other are assigned two distinct codes. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Djerourou, F., Lavault, C., Paillard, G., & Ravelomanana, V. (2004). Assigning codes in a random wireless network. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3124, 348–353. https://doi.org/10.1007/978-3-540-27824-5_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free