This paper proposes two novel hidden node problem aware routing metrics for wireless local area network (WLAN) mesh networks. To select the path that is least affected by the serious hidden node problem, we propose two routing metrics, MNn and MPCP, that take into account the number of neighboring nodes (Nn) and the packet collision probability (PCP), respectively. The PCP is estimated from neighbor information that is periodically gathered as state announcement packets, which include the transmission time ratio and the neighbor list. Simulation results show that the first proposed MNn routing metric tends to be less effective as the number of WLAN nodes increases, i.e., the mesh network becomes denser. On the other hand, with an acceptable increased in the control overhead in the mesh network due to the neighbor information, the second proposed MPCP routing metric improves the number of allowable concurrent voice over Internet Protocol (VoIP) calls and the user datagram protocol (UDP) data throughput compared to the MNn metric. The MPCP also provides better performance than the other conventional routing metrics, the hop count, and the Airtime proposed in IEEE 802.11s.

This paper proposes the dynamic resource assignment (DRA) scheme in the multi-carrier mesh-topology millimeter-wave (MMW) broadband entrance networks. In the DRA scheme, the radio path allocation and the frequency channel assignment techniques are deployed to maximize the network throughput. In the radio path allocation technique, the traffic load is distributed into the appropriate paths. On the other hand, the frequency channel assignment is performed based on the linear programming (LP) method. As the results, the proposed DRA scheme yields higher throughput performance than the conventional scheme using the random frequency channel assignment. In addition, the proposed scheme can guarantee the throughput performance when the number of frequency channels is 36 and the input load is no more than 9 Gbps. Moreover, the proposed scheme can yield the satisfaction sub-optimum throughput with the small computational complexity.

In Long-Term Evolution (LTE)-Advanced, a heterogeneous network in which femtocells and picocells overlay macrocells is being extensively discussed in addition to traditional well-planned macrocell deployment to improve further the system throughput. In heterogeneous network deployment, cell selection as well as inter-cell interference coordination (ICIC) is very important to improve the system and cell-edge throughput. Therefore, this paper investigates three cell selection methods associated with ICIC in heterogeneous networks in the LTE-Advanced downlink: Signal-to-interference plus noise power ratio (SINR)-based cell selection, reference signal received power (RSRP)-based cell selection, and reference signal received quality (RSRQ)-based cell selection. The results of simulations (4 picocells and 25 sets of user equipment are uniformly located within 1 macrocell) that assume a full buffer model show that the downlink cell and cell-edge user throughput levels of RSRP-based cell selection are degraded by approximately 2% and 11% compared to those for SINR-based cell selection under the condition of maximizing the cell-edge user throughput due to the impairment of the interference level. Furthermore, it is shown that the downlink cell-edge user throughput of RSRQ-based cell selection is improved by approximately 5%, although overall cell throughput is degraded by approximately 6% compared to that for SINR-based cell selection under the condition of maximizing the cell-edge user throughput.

This paper proposes the constraint availability and bandwidth shortest path (CABSP) selection algorithm and the extension of the adaptive modulation scheme to the CABSP (CABSP-AM) selection algorithm in the millimeter-wave (MMW) broadband entrance network for wireless heterogeneous systems. The CABSP algorithm considers the availability denoted as the quality of the MMW which is severely affected by the rainfall. The CABSP-AM algorithm, moreover, is proposed to further make more efficient use of bandwidth resources by considering the QoS requirements of each class of service in multimedia communication. As the results, the CABSP algorithm yields higher throughput performance than the conventional constraint shortest path (CSP) selection algorithm, but lower than the CABSP-AM algorithm. The spectrum efficiency improvements of the CABSP-AM over the CABSP are about 1.36 and 1.48 fold in case of error sensitive and non-sensitive classes respectively.