Distributed Connection Admission Control and Dynamic Channel Allocation in Ad hoc-Cellular Networks

Recently, we developed a framework, namely multi-hop TDD CAC and DCA (MTCD), for optimal centralized DCA in multi-hop 4G/4G+ networks. We also proposed two CAC schemes that use a predefined optimization algorithm to ensure that admission is based, to a large extent, on topology maintenance, energy conservation, load balancing, and fairness. In this paper, we address the centralized limitation of MTCD and its computational intractability by proposing a new distributed DCA scheme for autonomous, multi-hop 4G/4G+ networks. The proposed algorithm is termed distributed multi-hop CAC and DCA (DMCD). Unlike MTCD, DMCD allocates channels in a fully distributed manner. In DMCD, channel assignment is not solely contingent upon simple graph coloring, but is also based on the load factors and interference computed by the wireless stations. We also propose distributed per-hop throughput-based CAC (DPTC), which facilitates the gradual admission of the wireless stations pertaining to an A-Cell route in conjunction with DCA using DMCD. To our best knowledge, this is the first solution proposed for distributed CAC in multi-hop 4G/4G+ wireless systems