Channel Access Protocols for Multihop Packet Radio Networks.
Abstract
We first introduce two laws which if obeyed will ensure that nodes will not interfere with one another's transmissions. We then apply these laws to the regular planar networks, i.e., the triangular, square, and hexagonal networks, and place bounds on the capacities that can be achieved by protocols obeying the laws. We also demonstrate that there exist protocols obeying one of the laws which are optimal--optimal in the sense that no other protocol similarly constrained has greater capacity. Next, we show that the application of these laws leads to new random, access protocols for multihop packet radio networks. The first of these is a class called the TREE/TDMA protocols in which two level of control are used on a shared channel: the TREE Protocol is used by nodes to feed a regular backbone of repeaters which uses avoidance, multiple access protocol (CS/CAMA) in which a single level of control used on a shared channel and in which the spatial reuse of the channel is maximized. Analytical and simulation models of the protocols are described and are used to evaluate their operating characteristics. Stability criteria, capacities, and mean packet delay times are all analyzed. We conclude the new protocols are efficient, reliable, flexible, and require hardware and software of modest complexity. Both protocols are described and are used to evaluate their operating characteristics. Stability criteria, capacities, and mean packet delay times are all analyzed. We conclude the new protocols are efficient, reliable, flexible, and require hardware and software of modest complexity. Both protocols exploit spatial reuse to improve channel utilization but neither suffers from the 'hidden area effect'.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1986
- Accession Number
- ADA186074
Entities
People
- Si-taur Wang
Organizations
- University of Michigan