By Topic

Novel Hysteretic Noisy Chaotic Neural Network for Broadcast Scheduling Problems in Packet Radio Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Ming Sun ; Coll. of Comput. & Control Eng., Qiqihar Univ., Qiqihar, China ; Lin Zhao ; Wei Cao ; Yaoqun Xu
more authors

Noisy chaotic neural network (NCNN), which can exhibit stochastic chaotic simulated annealing (SCSA), has been proven to be a powerful tool in solving combinatorial optimization problems. In order to retain the excellent optimization property of SCSA and improve the optimization performance of the NCNN using hysteretic dynamics without increasing network parameters, we first construct an equivalent model of the NCNN and then control noises in the equivalent model to propose a novel hysteretic noisy chaotic neural network (HNCNN). Compared with the NCNN, the proposed HNCNN can exhibit both SCSA and hysteretic dynamics without introducing extra system parameters, and can increase the effective convergence toward optimal or near-optimal solutions at higher noise levels. Broadcast scheduling problem (BSP) in packet radio networks (PRNs) is to design an optimal time-division multiple-access (TDMA) frame structure with minimal frame length, maximal channel utilization, and minimal average time delay. In this paper, the proposed HNCNN is applied to solve BSP in PRNs to demonstrate its performance. Simulation results show that the proposed HNCNN with higher noise amplitudes is more likely to find an optimal or near-optimal TDMA frame structure with a minimal average time delay than previous algorithms.

Published in:

Neural Networks, IEEE Transactions on  (Volume:21 ,  Issue: 9 )