期刊文献+

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

Graph model of channel assignment problem with channel loading
下载PDF
导出
摘要 在无线电网络中,邻近的地理区域内用同一个频道的用户过多就会引起无线电通信的拥塞.增加频道负荷约束,限制同一时间内用相同频道的用户数量来控制这一现象.给出了带有负荷频道约束的私人移动无线电网络的图表示,推广了顶点染色的概念,得到了此问题的有关理论结果. 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.
出处 《山东大学学报(理学版)》 CAS CSCD 北大核心 2005年第4期56-61,65,共7页 Journal of Shandong University(Natural Science)
基金 国家自然科学基金资助项目(10271065) 曲阜师范大学科研启动基金资助项目
关键词 顷道分配 频道负荷 m限制多重染色 channal assignment channel loading m-restricted multicoloring
  • 相关文献

参考文献14

  • 1Hurley S, Whitaker R M, Smith D H. Channel loading in private mobile radio network[J]. Annal of Operations Research, 2001, 107:211 - 224.
  • 2Hale W K. Frequency assignment: Theory and applications[J]. Proceedings of the IEEES, 1980, 68:1 497- 1514.
  • 3Allen S M, Smith D H, Hurley S. Lower bounding techniques for frequency assignment[J]. Discrete Mathematics, 1999, 197/198:41 -52.
  • 4Hurley S, Smith D H, Thiel S U. FASoft: A system for discrete channel frenquency assignment[J]. Radio Sci, 1997, 32(5):1 921 -1 939.
  • 5Hurley S, Smith D H. Bounds for the frequency assignment problem[J]. Discrete Mathematics, 1997, 167/168:571- 582.
  • 6Van den Heuvel J, Leese R A, Shepherd M A. Graph labelling and radio channel assignment[J] .Journal of Graph Theory, 1998, 29:263 - 284.
  • 7Der-Fen L D. T-colorings of graphs[J]. Discrete Mathematics, 1992, 101:203- 212.
  • 8Cozzens M B, Roberts F S. T-colorings of graphs and the channel assignment problem[J]. Congressus Numerantium, 1982, 35:191 -208.
  • 9Tesman B A. T-colorings, list-t-colorings, and set-T-colorings of graphs[ D]. New Jersey: Department of Mathematics, Rutgers University, 1989.
  • 10Erdos P, Rubin A L, Taylor H. Choosability in graphs[J]. Congressus Numerantium, 1979, 26: 125- 157.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部