Indexing schemes for multichannel data broadcasting in mobile databases
International Journal of Wireless and Mobile Computing
High performance computing and communications
The Journal of Supercomputing
A mixed neural-genetic algorithm for the broadcast scheduling problem
IEEE Transactions on Wireless Communications
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Optimal broadcast scheduling in packet radio networks using mean field annealing
IEEE Journal on Selected Areas in Communications
On chaotic simulated annealing
IEEE Transactions on Neural Networks
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
This paper presents a novel approach to optimizing network packet transfer scheme through introducing a new method for on-demand chaotic noise injection strategy for the Broadcast Scheduling Problem (BSP). Packet radio networks have many applications, while finding an optimized scheduling to transmit data is proven to be a NP-hard problem. The objective of the proposed method is to find an optimal time division multiple access (TDMA) frame, based on maximizing the channel utilization. The proposed method benefits from an on-demand noise injection policy, which injects noise based on the status of neuron and its neighborhoods. The method is superior to other Noise Chaotic Neural Networks (NCNN) that suffer from blind injection policy. The experimental result shows that, in most cases, the proposed on-demand noise injection algorithm finds the best solution with minimal average time delay and maximum channel utilization.