Abstract
A basic problem in radio networks is the distributed setting of transmission schedules which allow collision-free reuse of the same frequency. The common principle of existing transmission scheduling protocols is the time-oriented, cyclic assignment of transmission rights. Such protocols assume that nodes use the same cycle, which is globally known. The authors introduce the concept of local cycles, and present a local-cycle-assignment algorithm. The local cycle of each node is a function of its neighborhood, so that no global knowledge is required. The algorithm is simple and thus practical for implementation.
Original language | English |
---|---|
Pages | 801-806 |
Number of pages | 6 |
State | Published - 1987 |
Externally published | Yes |