Paper Info
Title
Throughput behavior of the n-ary stack algorithm in mobile networks with capture
Abstract
The emergence of wireless and personal communication networks has brought random access protocols for packet radio networks back to the research forefronts. Most such protocols are based on the ever popular ALOHA protocol. Unfortunately, this protocol is inherently unstable and requires sophisticated schemes to stabilize it. Another class of random access schemes, called limited sensing or stack algorithms, has been proposed that is stable and allows for the dynamic incorporation of new stations into the network. In this paper, we will review the simple to implement n-ary Stack Algorithm, and we will demonstrate its performance in the presence of capture under various system parameters. As a by-product of this work, we will show that random access schemes have throughput conditions that are sensitive to the traffic generation process.
Year
DOI
Venue
1995
10.1109/LCN.1995.527374
Minneapolis, MN
Keywords
Field
DocType
access protocols,performance evaluation,wireless LAN,limited sensing,mobile networks,n-ary stack algorithm,packet radio networks,random access protocols,random access schemes,stack algorithms
Traffic generation model,Wireless,Telecommunications network,Aloha,Packet radio networks,Computer science,Computer network,Algorithm,Throughput,Wireless lan,Distributed computing,Random access
Conference
ISSN
ISBN
Citations 
0742-1303
0-8186-7162-9
0
PageRank 
References 
Authors
0.34
6
1
Name
Order
Citations
PageRank
Chatschik Bisdikian121.76