ACM Home Page
Please provide us with feedback. Feedback
On the performance of slotted ALOHA in a spread spectrum environment
Full text PdfPdf (441 KB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium table of contents
Montréal, Quebec, Canada, United States
Pages: 234 - 241  
Year of Publication: 1984
ISBN:0-89791-136-9
Also published in ...
Authors
Panos Economopoulos  Department of Computer Science, University of Toronto, Toronto, Canada, M5S 1A4
Mart L. Molle  Department of Computer Science, University of Toronto, Toronto, Canada, M5S 1A4
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 23,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800056.802083
What is a DOI?

ABSTRACT

We present an extension of the slotted ALOHA protocol for use in a spread spectrum packet radio environment. With spread spectrum, we assume that N distinct codes are available, and that each code can be treated as a separate channel. Running an independent copy of the protocol on each of these channels would be undesirable, since each user would have to select one channel to monitor for packets addressed to it, inducing a logical partitioning of the user population into N groups. To preserve the logical connectivity of the network, we examine the effect of separating packet transmissions into two parts, a short preamble, which is sent over a public channel, and followed by the body,> which is sent over a private channel. We assume that m of the available codes are used as preamble channels, and the remaining N - m codes are used for actual packet transmissions. If m (@@@@) N, then the network can support broadcast and multicast packets, and still make use of all of the available channels.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
R. E. Kahn, S. A. Gronemeyer, J. Burchfiel, and R. C. Kunzelman, "Advances in Packet Radio Technology," Proceedings of the IEEE 66pp. 1468-1496 (November 1978).
 
3
UCLA Packet Radio Analytical Workshop, UCLA Computer Science Department, (August 10-11, 1982).
 
4
L. Kleinrock and F. A. Tobagi, "Packet Switching in Radio Channels: Part I — Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics," IEEE Transactions on Communications COM-23(12)pp. 1400-1416 (December 1975).
 
5
L. Kleinrock, Queueing Systems, Vol II., Computer Applications, Wiley-Interscience, New York (1976).
 
6
M. L. Molle and L. Kleinrock, "Virtual Time CSMA: A New Protocol with Improved Delay Characteristics," CSD Report No. 810113, Computer Science Department, University of California, Los Angeles (January 13, 1981).

Collaborative Colleagues:
Panos Economopoulos: colleagues
Mart L. Molle: colleagues

Peer to Peer - Readers of this Article have also read: