Theory of maximum packing and related channel assignment strategies for cellular radio networks
暂无分享,去创建一个
[1] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..
[2] Frank Kelly,et al. Stochastic Models of Computer Communication Systems , 1985 .
[3] S. Zachary,et al. Loss networks , 2009, 0903.0640.
[4] David Everitt,et al. Performance analysis of cellular mobile communication systems with dynamic channel assignment , 1989, IEEE J. Sel. Areas Commun..
[5] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[6] D. Everitt. Traffic engineering of the radio interface for cellular mobile networks , 1994 .
[7] Chính T. Hoàng,et al. Some properties of minimal imperfect graphs , 1996, Discret. Math..
[8] Thomas Niessen,et al. Optimal Channel Allocation for Several Types of Cellular Radio Networks , 1997, Discret. Appl. Math..
[9] Romano Fantacci,et al. Handover and dynamic channel allocation techniques in mobile cellular networks , 1995 .
[10] Miltiades E. Anagnostou,et al. Optimal channel assignment in cellular networks , 1995 .
[11] Rudolf Mathar,et al. Channel assignment in cellular radio networks , 1993 .
[12] Scott Jordan,et al. A performance bound on dynamic channel allocation in cellular systems: equal load , 1994 .
[13] Peter G. Taylor,et al. Modeling Handovers in Cellular Mobile Networks with Dynamic Channel Allocation , 1995, Oper. Res..
[14] Paul-Andre Raymond,et al. Performance analysis of cellular networks , 1991, IEEE Trans. Commun..