Channel resource allocation based on graph theory and coloring principle in cellular networks

In order to solve the analysis of the features of the wireless channel and channel allocation problem in mobile communication, with signal propagation environment as the reference, using graph theory to analyze the characteristics of the wireless channel from a macro point of view, at the same time through graph coloring principle of the wireless channel allocation from the microscopic view. Firstly, the channel features of signal transmission environment are analyzed by graph theory. Then, combining the coloring principle of graph theory, the channel of the wireless cellular network can be differentiated. Finally, a channel assignment experiment is designed. On the LINGO platform, the Hungarian algorithm is used to find the distribution scheme of the minimum probability of sub-channel detection in the cognitive terminal in the cellular network. It is shown that the division of distinguishable channels in channel allocation is necessary.

[1]  Derrick Wing Kwan Ng,et al.  Multiobjective Resource Allocation for Secure Communication in Cognitive Radio Networks With Wireless Information and Power Transfer , 2016, IEEE Transactions on Vehicular Technology.

[2]  Theodore S. Rappaport,et al.  Millimeter Wave Mobile Communications for 5G Cellular: It Will Work! , 2013, IEEE Access.

[3]  Tamma Bheemarjuna Reddy,et al.  Interference mitigation in wireless mesh networks through radio co-location aware conflict graphs , 2016, Wirel. Networks.

[4]  D. West.  Introduction to Graph Theory , 1995 .

[5]  Theodore S. Rappaport,et al.  Broadband Millimeter-Wave Propagation Measurements and Models Using Adaptive-Beam Antennas for Outdoor Urban Cellular Communications , 2013, IEEE Transactions on Antennas and Propagation.

[6]  James Gross,et al.  Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks , 2016, Manag. Sci..

[7]  Jianjun Tan,et al.  A Novel Collaborative Partner Selection algorithm Based on Nash Bargaining Game and Hungarian Method for Wireless Networks , 2015, J. Commun..

[8]  Theodore S. Rappaport,et al.  Indoor Office Wideband Millimeter-Wave Propagation Measurements and Channel Models at 28 and 73 GHz for Ultra-Dense 5G Wireless Networks , 2015, IEEE Access.

[9]  Ejaz Ahmed,et al.  Channel Assignment Algorithms in Cognitive Radio Networks: Taxonomy, Open Issues, and Challenges , 2016, IEEE Communications Surveys & Tutorials.

[10]  John W. Chinneck,et al.  Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks , 2016, Eur. J. Oper. Res..

[11]  Mohammadreza Darabi,et al.  Asymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks , 2016, ArXiv.

[12]  Zhang Wen-ju.  Channel Conflict Model Based on Graph N Multiple Coloring Theory , 2013 .

[13]  Fred W. Glover,et al.  A learning-based path relinking algorithm for the bandwidth coloring problem , 2016, Eng. Appl. Artif. Intell..

[14]  Sherali Zeadally,et al.  Spectrum Assignment in Cognitive Radio Networks: A Comprehensive Survey , 2013, IEEE Communications Surveys & Tutorials.

[15]  Shouling Ji,et al.  Optimal routing with scheduling and channel assignment in multi-power multi-radio wireless sensor networks , 2015, Ad Hoc Networks.

[16]  Shanthi Prince,et al.  Perturbation methods to track wireless optical wave propagation in a random medium. , 2016, Journal of the Optical Society of America. A, Optics, image science, and vision.

[17]  Theodore S. Rappaport,et al.  Wideband Millimeter-Wave Propagation Measurements and Channel Models for Future Wireless Communication System Design , 2015, IEEE Transactions on Communications.

[18]  Ali Ghaffari,et al.  Localized quality of service routing protocol with service differentiation for wireless sensor networks , 2011, IEICE Electron. Express.

[19]  Jiming Chen,et al.  Dynamic Channel Assignment for Wireless Sensor Networks: A Regret Matching Based Approach , 2015, IEEE Transactions on Parallel and Distributed Systems.