Scheduling Problems in Radio Networks Using Hopfield Networks
Department of Mathematical Sciences, Memphis State University Memphis, Tennessee 38152 USAjagota@cs.buffalo.edu
Abstract
We address the problems of link scheduling (LSP) and broadcast scheduling (BSP) in radio networks. We reduce LSP to BSP to graph coloring to independent set to a Hopfield network. All local minima of the Hopfield network represent feasible solutions of the original problem (LSP or BSP). We show that steepest descent (SD) dynamics on the Hopfield network, from different initial states, emulates various graph coloring heuristics. We report on preliminary experiments on BSP using SD dynamics on the Hopfield network.
1 Radio Networks and Scheduling Problems ...
Get Proceedings of the International Workshop on Applications of Neural Networks to Telecommunications now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
