Issue No. 07 - July (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.256452
<p>One of the main methods for designing data link protocols in broadcast networks is based on the allocation of transmission rights to nodes in timeslots guaranteeing collision-free access to the channel. Extensions of certain results on vertex coloring are used to establish bounds on the number of timeslots required for a network to finish transmitting a backlog of data. Such networks are also observed when they are structured as rings and trees. Distributed algorithms for the allocation of timeslots in these networks are presented.</p>
data transfers; distributed algorithms; broadcast networks; data link protocols; transmission rights; collision-free access; vertex coloring; rings; trees; graph colouring; protocols; radio networks.
S.L. Hakimi, A. Bagchi, "Data Transfers in Broadcast Networks", IEEE Transactions on Computers, vol. 41, no. , pp. 842-847, July 1992, doi:10.1109/12.256452