带频道负荷的频道分配问题的图论模型  

Graph model of channel assignment problem with channel loading

作　　者：孔淑兰[1] 董振宁[2] 

机构地区：[1]哈尔滨工业大学深圳研究生院 [2]广东工业大学经济管理学院,广东广州510090

出　　处：《山东大学学报（理学版）》2005年第4期56-61,65,共7页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(10271065);曲阜师范大学科研启动基金资助项目

摘　　要：在无线电网络中,邻近的地理区域内用同一个频道的用户过多就会引起无线电通信的拥塞.增加频道负荷约束,限制同一时间内用相同频道的用户数量来控制这一现象.给出了带有负荷频道约束的私人移动无线电网络的图表示,推广了顶点染色的概念,得到了此问题的有关理论结果.Radio traffic congestion occurs in a radio network when too many users simultaneously transmit on the same channel within close geographical proximity. Such congestion can be prevented by imposing channel loading constraints, which restrict the number of users that operate the same channel at the same time. First, the graph formulation of channel assignment problem with channel loading in private mobile radio networks is introduced and abstracted as a graph m-restricted multicoloring. Then some theoretical results on the problem are obtained.

关 键 词：顷道分配 频道负荷 m限制多重染色 

分 类 号：TP01[自动化与计算机技术] O157.5[理学—数学]