Broadcast scheduling in wireless multihop networks using a neural-network-based hybrid algorithm

✍ Scribed by Haixiang Shi; Lipo Wang

• Publisher: Elsevier Science
• Year: 2005
• Tongue: English
• Weight: 173 KB
• Volume: 18
• Category: Article
• ISSN: 0893-6080
• DOI: 10.1016/j.neunet.2005.06.013

✦ Synopsis

In wireless multihop networks, the objective of the broadcast scheduling problem is to find a conflict free transmission schedule for each node at different time slots in a fixed length time cycle, called TDMA cycle. The optimization criterion is to find an optimal TDMA schedule with minimal TDMA cycle length and maximal node transmissions. In this paper we propose a two-stage hybrid method to solve this broadcast scheduling problem in wireless multihop networks. In the first stage, we use a sequential vertex-coloring algorithm to obtain a minimal TDMA frame length. In the second stage, we apply the noisy chaotic neural network to find the maximum node transmission based on the results obtained in the previous stage. Simulation results show that this hybrid method outperforms previous approaches, such as mean field annealing, a hybrid of the Hopfield neural network and genetic algorithms, the sequential vertex coloring algorithm, and the gradual neural network.