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 same cycle, which is globally known. We introduce the concept of local cycles, and present the 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. Supplementing its simplicity, the algorithm also exhibits provable properties: (1) The cycle length at each node is at most twice the optimal. (2) The delay of a message sent on the shortest hops path is a linear function of the number of nodes in the two hops neighborhood of the path.
[1]
A. Hauptschein,et al.
Recognition and Self-Organization of Nodes into DTDMA Nets
,
1981,
IEEE Transactions on Aerospace and Electronic Systems.
[2]
Anthony Ephremides,et al.
The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm
,
1981,
IEEE Trans. Commun..
[3]
Leonard Kleinrock,et al.
Spatial TDMA: A Collision-Free Multihop Channel Access Protocol
,
1985,
IEEE Trans. Commun..
[4]
Thomas G. Robertazzi,et al.
Self-organizing communication networks
,
1986,
IEEE Communications Magazine.
[5]
Imrich Chlamtac,et al.
Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
,
1987,
IEEE Transactions on Computers.