Planning of operation of communications links in packet radio networks, using a graph-coloring algorithm

被引:0
作者
Kheifets, E.M.
机构
关键词
Computer Networks--Management - Mathematical Techniques--Graph Theory - Radio Systems; Mobile;
D O I
暂无
中图分类号
学科分类号
摘要
The author considers the problem of allocating time segments between network nodes and of eliminating conflicts; this problem reduces to one of coloring the vertices of a finite nonoriented graph. A method of solving the problem, involving self-training based on a sequential algorithm, is proposed. Computer experiments demonstrate that the method is effective in coloring graphs containing hundreds of vertices.
引用
收藏
页码:34 / 37
相关论文
empty
未找到相关数据