This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Transfers in Broadcast Networks
July 1992 (vol. 41 no. 7)
pp. 842-847

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.

[1] IEEE J. Select. Areas Commun., vol. SAC-2, July 1984.
[2] Special Issue on Mobile Radio Communication,IEEE Trans. Commun., vol. 24, Feb. 1986.
[3] IEEE J. Select. Areas Commun., vol. SAC-4, Mar. 1986.
[4] A. S. Tanenbaum,Computer Networks, Englewood Cliffs, NJ: Prentice-Hall, 1981.
[5] J. A. Silvestor and L. Kleinrock, "On the capacity of multihop slotted ALOHA networks with regular structures,"IEEE Trans. Commun., vol. COM-31, Aug. 1983.
[6] I. Chlamtac and S. Kutten, "On broadcasting in radio networks problem analysis and protocol design,"IEEE Trans. Commun., vol. COM-33, Dec. 1985.
[7] D. J. Baker, A. Ephremides, and J. A. Flynn, "The design and simulation of a mobile radio network with distributed control,"IEEE J. Select. Areas Commun., vol. SAC-2, Jan. 1984.
[8] I. Chlamtac and S. S. Pinter, "Distributed nodes organization algorithm for channel access in a multihop dynamic radio network,"IEEE Trans. Comput., vol. C-36, no. 6, June 1987.
[9] M. J. Post, P. E. Sarachik, and A. S. Kershenbaum, "A biased greedy algorithm for scheduling multihop radio networks," inProc. Conf. Inform. Sci. Syst., pp. 564-572, 1985.
[10] T. Truong, "TDMA in mobile radio networks: Graph partitioning and time slot assignment," inProc. IEEE MILCOM Conf., Oct. 1985.
[11] S. L. Hakimi and E. F. Schmeichel, "Gossiping in radio networks,"Discr. Maths., 1989, submitted for publication.
[12] H. A. Choi and S. L. Hakimi, "Data transfers in networks,"Algorithmica, vol. 3, 1988.
[13] H. A. Choi and S. L. Hakimi, "Data transfers in networks with transceivers,"Networks, vol. 18, no. 3, 1988.
[14] H. A. Choi and S. L. Hakimi, "Scheduling file transfers for trees and odd cycles,"SIAM J. Comput., vol. 16, no. 1, Feb. 1987.
[15] N. Alan, A. Bar-Noy, N. Linial, and D. Peleg, "On the complexity of radio communication," inProc. 21st ACM Symp. Theory Comput, 1989.
[16] J. A. Bondy and U. S. R. Murthy,Graph Theory with Applications. New York: American Elsevier, 1976.
[17] I. Chlamtac and S. Kutten, "Tree-based broadcasting in multihop radio networks,"IEEE Trans. Comput., vol. C-36, no. 10, Oct. 1987.
[18] A. Bagchi, S. L. Hakimi, and E. F. Schmeichel, "Optimal algorithms for all-to-all broadcasts," inProc. 27th Annu. Allerton Conf. Commun., Contr. Comput., Monticello, IL, 1989.
[19] A. Wigderson, "Improving the performance guarantee for approximate graph coloring,"J. ACM, Oct. 1983.
[20] A. Bagchi, "Slot assignment in broadcast networks," manuscript, 1989.
[21] L. G. Coffman Jr., M. R. Garey, D. S. Johnson, and A. S. LaPaugh, "Scheduling file transfers in a distributed network,"SIAM J. Comput., vol. 14, no. 3, 1985.

Index Terms:
data transfers; distributed algorithms; broadcast networks; data link protocols; transmission rights; collision-free access; vertex coloring; rings; trees; graph colouring; protocols; radio networks.
Citation:
A. Bagchi, S.L. Hakimi, "Data Transfers in Broadcast Networks," IEEE Transactions on Computers, vol. 41, no. 7, pp. 842-847, July 1992, doi:10.1109/12.256452
Usage of this product signifies your acceptance of the Terms of Use.