Abstract
This paper discusses the use of routing in peer-to-peer radio LANs as a means of coping with a dynamic topology. Routing protocols for radio LANs based on either token passing or CSMA is proposed. These protocols are based on least-cost routing with costs reflecting the quality of radio links between stations. For the case of token passing, it is shown by simulation that there is a trade-off between the efficiency and fairness of the proposed protocol. It is fairer for the multiple access protocol to favor transiting packets over new ones. This is achieved by using exhaustive service for transiting packets and limited-1 service for new ones. On the other hand, it is found to be more efficient to serve all packets exhaustively.
| Original language | English |
|---|---|
| Pages (from-to) | 6 |
| Number of pages | 6 |
| Journal | IEE Colloquium (Digest) |
| Issue number | 56 |
| Publication status | Published - 1996 |
| Event | Proceedings of the 1996 IEE Colloquium Networking Aspects of Radio Communication Systems - London, UK Duration: 11 Mar 1996 → 11 Mar 1996 |