A gradual noisy chaotic neural network for solving the broadcast scheduling problem in packet radio networks

IEEE Transactions on Neural Networks

Volumn 17, Issue 4, 2006, Pages 989-1000

  Wang, Lipo ^a   Shi, Haixiang ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Broadcast scheduling problem; Gradual noisy chaotic neural network; NP complete; Packet radio network

Indexed keywords

CHAOS THEORY; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; OPTIMIZATION; PACKET NETWORKS;

BROADCAST SCHEDULING PROBLEM; GRADUAL NOISY NEURAL NETWORK; PACKET RADIO NETWORK;

NEURAL NETWORKS;

ARTICLE; ARTIFICIAL NEURAL NETWORK; ELECTRICITY; INSTRUMENTATION; NONLINEAR SYSTEM; TELECOMMUNICATION;

ELECTRICITY; NEURAL NETWORKS (COMPUTER); NONLINEAR DYNAMICS; RADIO;

EID: 33746914308     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2006.875976     Document Type: Article

References (29)

1. B. M. Leiner, D. L. Nielson, and F. A. Tobagi, "Issues in packet radio network design," Proc. IEEE, vol. 75, no. 1, pp. 6-20, Jan. 1987.
2. A. Ephremides and T. V. Truong, "Scheduling broadcast in multihop radio networks," IEEE Trans. Commun., vol. 38, no. 6, pp. 456-460, Jun. 1990.
3. N. Funabiki and Y. Takefuji, "A parallel algorithm for broadcast scheduling problems in packet radio networks," IEEE Trans. Commun., vol. 41, no. 6, pp. 828-831, Jun. 1993.
4. G. Wang and N. Ansari, "Optimal broadcast scheduling in packet radio networks using mean field annealing," IEEE J. Sel. Areas Commun., vol. 15, no. 2, pp. 250-260, Feb. 1997.
5. G. Chakraborty and Y. Hirano, "Genetic algorithm for broadcast scheduling in packet radio networks," IEEE World Congr. Computational Intelligence, pp. 183-188, 1998.
6. N. Funabiki and J. Kitamichi, "A gradual neural network algorithm for broadcast scheduling problems in packet radio networks," IEICE Trans. Fund., vol. E82-A, no. 5, pp. 815-824, 1999.
7. J. Yeo, H. Lee, and S. Kim, "An efficient broadcast scheduling algorithm for TDMA ad-hoc networks," Comput. Oper. Res., no. 29, pp. 1793-1806, 2002.
8. 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. Wireless Commun., vol. 2, no. 2, pp. 277-283, Mar. 2003.
9. J. J. Hopfield, "Neurons with graded response have collective computational properties like those of two-state neurons," Proc. Nat. Acad. Sci. USA, vol. 81, pp. 3088-3092, May 1984.
10. J. J. Hopfield and D. W. Tank, "Neural computation of decisions in optimization problems," Biol. Cybern., vol. 52, pp. 141-152, 1985.
11. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimisation by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
12. C. Peterson and J. R. Anderson, "A mean field theory algorithm for neural networks," Complex Syst., vol. 1, pp. 995-1019, 1987.
13. H. Nozawa, "A neural network model as a globally coupled map and applications based on chaos," Chaos, vol. 2, no. 3, pp. 377-386, 1992.
14. H. Nozawa, "Solution of the optimization problem using the neural network model as a globally coupled map," in Towards the Harnessing of ChaosM. Yamaguti, Ed. Amsterdam, The Netherlands: Elsevier Science, 1994, pp. 99-114.
15. L. Chen and K. Aihara, "Transient chaotic neural networks and chaotic simulated annealing," in Towards the Harnessing of Chaos, M. Yamguti, Ed. Amsterdam, The Netherlands: Elsevier Science, 1994, pp. 347-352.
16. L. Chen and K. Aihara, "Chaotic simulated annealing by a neural network model with transient chaos," Neural Netw., vol. 8, no. 6, pp. 915-930, 1995.
17. L. Chen and K. Aihara, "Global searching ability of chaotic neural networks," IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 46, no. 8, pp. 974-993, Aug. 1999.
18. I. Tokuda, K. Aihara, and T. Nagashima, "Adaptive annealing for chaotic optimization," Phys. Rev. E, vol. 58, pp. 5157-5160, 1998.
19. S. Geman and D. Geman, "Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images," IEEE Trans. Pattern Anal. Machine Intell., vol. 6, no. 6, pp. 721-741, Nov. 1984.
20. L. Wang and F. Tian, "Noisy chaotic neural networks for solving combinatorial optimization problems," in Proc. Int. Joint Conf. Neural Networks (IJCNN 2000), Como, Italy, Jul. 24-27, 2000, vol. 4, pp. 37-40.
21. S. Li and L. Wang, "Channel assignment for mobile communications using stochastic chaotic simulated annealing," in Proc. 2001 Int. Work-Conf. Artificial Neural Networks (IWANN2001), J Mira and A. Prieto, Eds., Granada, Spain, Jun. 13-15, 2001, vol. 2084, pp. 757-764, Part I, Lecture Notes in Computer Science.
22. 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. Syst., Man, Cybern. B, Cybern., vol. 34, no. 5, pp. 2119-2125, Oct. 2004.
23. D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1987.
24. R. L. Wang, Z. Tang, and Q. P. Cao, "A Hopfield network learning method for bipartite subgraph problem," IEEE Trans. Neural Netw., vol. 15, no. 6, pp. 1458-1465, Nov. 2004.
25. H. Tang, K. C. Tan, and Z. Yi, "A columnar competitive model for solving combinatorial optimization problems," IEEE Trans. Neural Netw., vol. 15, no. 6, pp. 1568-1573, Nov. 2004.
26. R. S. T. Lee, "A transient-chaotic autoassociative network (TCAN) based on Lee oscillators," IEEE Trans. Neural Netw., vol. 15, no. 5, pp. 1228-1243, Sep. 2004.
27. T. Kwok and K. A. Smith, "A noisy self-organizing neural network with bifurcation dynamics for combinatorial optimization," IEEE Trans. Neural Netw., vol. 15, no. 1, pp. 84-98, Jan. 2004.
28. D. Jungnickel, Graphs, Networks and Algorithms. Berlin, Germany: Springer-Verlag, 1999.
29. N. Funabiki and S. Nishikawa, "A gradual neural-network appraoch for frequency assignment in satellite communication systems," IEEE Trans. Neural Netw., vol. 8, no. 6, pp. 1359-1370, Nov. 1997.