A hybrid neural network for optimal TDMA transmission scheduling in packet radio networks

Proceedings of the International Joint Conference on Neural Networks

Volumn 5, Issue , 2005, Pages 3210-3213

  Shi, Haixiang ^a   Wang, Lipo ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; GENETIC ALGORITHMS; PACKET NETWORKS; PROBLEM SOLVING; SCHEDULING; TIME DIVISION MULTIPLE ACCESS;

BROADCAST SCHEDULING PROBLEM; MAXIMUM NODE TRANSMISSION; PACKET RADIO NETWORKS; TRANSMISSION ASSIGNMENTS;

NEURAL NETWORKS;

EID: 31944445754     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IJCNN.2005.1556441     Document Type: Conference Paper

References (14)

1. A. Ephremides and T. V. Truong, "Scheduling broadcast in multihop radio networks," IEEE Trans. on Communications, vol. 38, pp. 456-460, Apr. 1990.
2. N. Funabiki, Y. Takefuji, "A parallel algorithm for broadcast scheduling problems in packet radio networks," IEEE Trans. on Communications, vol. 41, no. 6, pp. 828-831, Jun. 1993.
3. G. Wang and N. Ansari, "Optimal broadcast scheduling in packet radio networks using mean field annealing," IEEE Journal on Selected Areas in Communications, vol. 15, no. 2, pp. 250-260, Feb. 1997.
4. G. Chakraborty and Y. Hirano, "Genetic algorithm for broadcast scheduling in packet radio networks," IEEE World Congress on Computational Intelligence, 1998, pp. 183-188.
5. N. Funabiki and J. Kitamichi, "A gradual neural network algorithm for broadcast scheduling problems in packet radio networks," IEICE Trans. Fundamentals, vol E82-A, no. 5, pp. 815-824, May 1999.
6. J. Yeo, H. Lee and S. Kim, "An efficient broadcast scheduling algorithm for TDMA ad-hoc networks," Computer & Operations Research, no. 29, pp. 1793-1806, 2002.
7. S. Salcedo-Sanz, C. Bousoño-Calzón and A. R. Figueiras-Vidal, "A mixed neural-genetic algorithm for the broadcast scheduling problem," IEEE Trans. on Wireless communications, vol. 2, no. 2, pp. 277-283, March 2003.
8. Christofides N. Graph TheoryłAn Algorithmic Approach. New York: Academic Press Inc., 1975.
9. L. Chen and K. Aihara, "Transient chaotic neural networks and chaotic simulated annealing," M.Yamguti(ed.),Towards the Harnessing of chaos. Amsterdam, Elsevier Science Publishers B.V., 1994, pp. 347-352.
10. L. Chen and K. Aihara, "Chaotic simulated annealing by a neural network model with transient chaos," Neural Networks, vol. 8, no. 6, pp. 915-930, 1995.
11. L. Wang and F. Tian, "Noisy chaotic neural networks for solving combinatorial optimization problems," Proc. International Joint Conference on Neural Networks. (IJCNN 2000, Como, Italy, July 24-27), 2000, vol. 4, pp. 37-40.
12. Sa Li and Lipo Wang, "Channel assignment for mobile communications using stochastic chaotic simulated annealing". Proceedings of the 2001 International Work-Conference on Artificial Neural Networks (IWANN2001Granada, Spain, June 13-15, 2001Mira, Jose; Prieto, Alberto (Eds.)), Part I, Lecture Notes in Computer Science, 2001, vol. 2084, pp. 757-764.
13. L. Wang, S. Li, F. Tian, and X. Fu, "A noisy chaotic neural network for solving combinatorial optimization problems: Stochastic chaotic simulated annealing", IEEE Trans. System, Man. Cybern, Part B - Cybernetics, vol. 34, no. 5, pp. 2119-2125, 2004.
14. D. Bertsekas and R. Gallager, "Data networks," Englewood Cliffs, NJ: Prentice-Hall, 1987.