A parallel algorithm for broadcast scheduling problems in packet radio networks

A parallel algorithm based on an artificial neural network model for broadcast scheduling problems in packet radio networks is presented. The algorithm requires n*m processing elements for an n-mode-m-slot radio network problem. The algorithm is verified by simulating 13 different networks. >

[1]  Yoshiyasu Takefuji,et al.  A parallel algorithm for tiling problems , 1990, IEEE Trans. Neural Networks.

[2]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..

[3]  Yoshiyasu Takefuji,et al.  Artificial neural networks for four-coloring map problems and K-colorability problems , 1991 .

[4]  Yoshiyasu Takefuji,et al.  A parallel algorithm for allocation of spare cells on memory chips , 1991 .

[5]  Imrich Chlamtac,et al.  Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network , 1987, IEEE Transactions on Computers.

[6]  Imrich Chlamtac,et al.  Fair Algorithms for Maximal Link Activation in Multihop Radio Networks , 1987, IEEE Trans. Commun..

[7]  Imrich Chlamtac,et al.  On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.

[8]  Oded Goldreich,et al.  On the np-completeness of certain network testing problems , 1984, Networks.

[9]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[10]  Israel Cidon,et al.  Distributed Assignment Algorithms for Multihop Packet Radio Networks , 1989, IEEE Trans. Computers.

[11]  Yoshiyasu Takefuji.  Spare Allocation Problems , 1992 .

[12]  Y Takefuji,et al.  A Near-Optimum Parallel Planarization Algorithm , 1989, Science.

[13]  Anthony Ephremides,et al.  The Design and Simulation of a Mobile Radio Network with Distributed Control , 1984, IEEE J. Sel. Areas Commun..