Random-Access Algorithms for Environments with Capture.
Abstract
Communication networks have seen a remarkable rise in both applications and theoretical study in the past twenty years. An increased demand for flexible and easily modified communication systems has supported recent interest in applications of communication networks to a wide variety of problems such as mobile packet radio, distributed sensor systems, satellite networks, and a plethora of applications in integrated computer communications. Such systems are typically characterized by a large number of users attempting to communicate with a central node via a common communication media. The multiaccess communication problem examines how to utilize most efficiently the available communication resources. This thesis proposes two random-access algorithms appropriate for operation in networks employing capture (that is, the correct reception of a single transmission in the presence of multiple transmissions). Both the paradigmatic ternary-feedback model as well as an enriched-feedback scheme are considered. After observing the regenerative properties of these algorithms, several results from renewal theory are employed to compute the throughput and delay characteristics of the proposed algorithms. It is shown that significant performance improvements (as compared to non-capture systems) are possible using systems with capture and employing appropriate random-access algorithms. Extensive numerical results are included.
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 19, 1988
- Accession Number
- ADA194303
Entities
People
- D. F. Lyons
- P. Papantoni-kazakos
Organizations
- University of Virginia