This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Distributed Assignment Algorithms for Multihop Packet Radio Networks
October 1989 (vol. 38 no. 10)
pp. 1353-1361
New distributed dynamic channel assignment algorithms for a multihop packet radio network are introduced. The algorithms ensure conflict-free transmissions by the nodes of the network. The basic idea of the algorithms is to split the shared channel into a control segment and a transmission segment. The control segment is used to avoid conflicts among nodes and to increase the utilization of the

[1] E. Arikan, "Multi-access in packet-radio networks," M.Sc. thesis, Lab. Inform. Decision Syst., MIT, LIDS-TH-1234, Sept. 1982.
[2] L. Kleinrock and M. O. Scholl, "Packet switching in radio channels: New conflict-free multiple access schemes,"IEEE Trans. Commun., vol. COM-28, no. 7, July 1980.
[3] B. Hajek and G. Sasaki, "Link scheduling in polynomial time,"IEEE Trans. Inform. Theory, to be published.
[4] R. G. Ogier, "A decomposition method for optimal link scheduling," inProc. 24th Annu. Allerton Conf.Oct. 1986, pp. 822-823.
[5] R. Nelson and L. Kleinrock, "Spatial TDMA: A collision-free multihop channel access protocol,"IEEE Trans. Commun., vol. COM-33, pp. 934-944, Sept. 1985.
[6] M. J. Post, P. E. Sarachik, and A. S. Kershenbaum, "A 'biased greedy' algorithm for scheduling multi-hop radio networks," inProc. Conf. Inform. Sci. Syst., 1985, pp. 564-572.
[7] M. J. Post, P. E. Sarachik, and A. S. Kershenbaum, "A distributed evolutionary algorithm for reorganizing network communications," inProc. IEEE MILCOM, 1985.
[8] D. J. Baker, J. Wieselthier, and A. Ephremides, "A distributed algorithm for scheduling the activation of links in a self-organizing mobile radio network," inProc. IEEE Int. Conf. Commun., 1982, pp. 2F.6.1-5.
[9] I. Chlamtach and A. Lerner, "Fair algorithm for maximal link activation in multihop packet radio networks,"IEEE Trans. Commun., vol. COM-35, pp. 739-746, July 1987.
[10] 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.
[11] R. Boorstyn and A. Kershenbaum, "Throughout analysis of multihop packet radio," inProc. ICC'80, Seattle, WA, June 1980, pp. 13.6.1- 13.6.6.
[12] F.A. Tobagi and D. H. Shur, "Performance evaluation of channel access schemes in multihop packet radio networks with regular structure by simulation,"Comput. Networks ISDN Syst., vol. 12, pp. 39-60, Aug. 1986.
[13] D. Bersekas and R. Gallager,Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1987.
[14] E. M. Gafni and D. P. Bertsekas, "Distributed algorithms for generating loop-free routes in networks with frequently changing topology,"IEEE Trans. Commun., vol. COM-29, pp. 11-18, Jan. 1981.
[15] V. C. Barbosa and E. M. Gafni, "Concurrency in heavily loaded neighborhood-constrained systems," preprint.
[16] J. Malka, S. Moran, and S. Zaks, "A simple distributed scheduler-- Analysis and applications," Extended Abstract, 1987.

Index Terms:
multihop packet radio networks; distributed dynamic channel assignment; conflict-free transmissions; control segment; transmission segment; time-division multiple access; packet switching; radio networks.
Citation:
I. Cidon, M. Sidi, "Distributed Assignment Algorithms for Multihop Packet Radio Networks," IEEE Transactions on Computers, vol. 38, no. 10, pp. 1353-1361, Oct. 1989, doi:10.1109/12.35830
Usage of this product signifies your acceptance of the Terms of Use.