Performance of Fixed Channel Assignment for Uplink Transmission and Direct Peer-to-Peer Communications in Multihop Cellular Networks

In this paper, we propose a clustered multihop cellular network （cMCN） architecture and study its performance using fixed channel assignment （FCA） scheme for uplink transmission. The proposed cMCN using FCA can be applied with some reuse factors. An analytical model based on Markov chain is developed to analyze its performance and validated through computer simulation. And then, we implement direct peer-to-peer communication （DC） in cMCN by considering more reasonable conditions in practice. DC means that two calls communicate directly instead of going through base stations. The results show that cMCN with FCA can reduce the call blocking probability significantly as compared with the traditional single-hop cellular networks with FCA and can be further reduced by using DC.     

A dynamic channel assignment scheme for clustered multihop cellular networks

Whereas cellular systems have traditionally adopted single‐hop transmissions between the mobile station (MS) and the base station (BS), researchers expect multihop transmission to be utilised in the future. Cellular systems present several challenges, such as channel assignment, which are exacerbated by multimedia service traffic and an increasing number of subscribers. Recently, a clustered multihop cellular network (cMCN) architecture that complements traditional cellular systems has been proposed and studied using fixed channel assignment (FCA). However, the performance of FCA is limited when the traffic pattern varies in a service area. This paper proposes the use of dedicated information ports (DIPs) as clusterheads in cMCN, followed by a multihop dynamic channel assignment (mDCA) scheme. The mDCA works by assigning channels based on information about interference in surrounding cells. Two different channel searching strategies are developed and evaluated. Through computer simulation, we show that the proposed mDCA is able to achieve a significantly improved capacity which is maintained when the number of system channels is increased. Finally, issues regarding the implementation of the mDCA and future work on this topic are discussed. Copyright © 2007 John Wiley & Sons, Ltd.     

Asymmetric FCA for Downlink and Uplink Transmission in Clustered Multihop Cellular Network

A clustered multihop cellular network (CMCN) with virtual cells has been proposed to achieve the characteristics of macrocell/microcell hierarchically overlaid architecture by applying clustering techniques. As a complement to the traditional cellular networks, CMCN is able to incorporate the flexibility of ad hoc networks by allowing multihop transmission. In this paper, we first propose to use dedicated information ports (DIPs) as clusterheads for CMCN; then we analyze the performance of fixed channel assignment (FCA) for downlink transmission in CMCN. Two multi-dimensional Markov chain models are developed to study the call blocking probability. Due to the nature of multihop transmission in CMCN, channel assignment for uplink and downlink transmission is different and unbalanced. We then propose an asymmetric FCA (AFCA) for uplink and downlink transmission in CMCN. By making use of the proposed AFCA for uplink and downlink transmission, we can reduce the call blocking probability significantly as compared with the FCA for traditional single-hop cellular networks. The salient contribution is that the proposed CMCN with AFCA scheme can increase the spectrum efficiency and the system capacity by introducing the structure of CMCN with DIPs for virtual microcells.     

Dynamic Channel Assignment for Multihop Cellular Networks with Any Reuse Factor

A clustered multihop cellular network (cMCN) architecture is recently proposed and studied using fixed channel assignment (FCA) with a reuse factor, N_r=7. In this Letter, we propose and develop a multihop dynamic channel assignment (mDCA) scheme applicable with any reuse factor. The mDCA assigns channels with the knowledge of the information about interference in surrounding cells. Simulations show that the capacity improvements at call blocking probability of 1% for mDCA over the conventional FCA are 96% and 210% for N_r=4 and N_r=7, respectively.     

Virtually fixed channel assignment in cellular mobile networks with recall and handoffs

A promising approach for implementing channel assignment and control in cellular mobile telephone networks is the virtually fixed channel assignment (VFCA) scheme. In VFCA channels are allocated to cells according to the fixed channel assignment (FCA) scheme, but cells are allowed to borrow channels from one another. As such, VFCA maintains the efficiency of FCA, but adds the flexibility lacking in FCA. One feature of a VFCA network is that, to prevent co-channel interference, it requires several channels to be locked to serve a single call that borrows a channel. This feature raises the concern that VFCA may lead to chain reaction in channel borrowing among cells and cause the network performance to degrade, especially under heavy traffic conditions. In this paper, we propose the virtually fixed channel assignment with recall (VFCAWR) scheme: The network is implemented according to VFCA, but a cell can recall a locked channel to service an arriving handoff call, which occurs when a mobile unit crosses the boundary of its cell. We model the network as a three-dimensional Markov chain and derive its steady-state performance. Through modification of this basic model, we evaluate two dynamic channel assignment strategies, the virtual channel reservation (VCR) strategy and the linear switch-over (LSO) strategy, which exploit the unique borrowing/recall capability of VFCAWR to reduce the weighted cost of blocking fresh and handoff calls by reserving several virtual channels (the channels that may be borrowed from adjacent cells when necessary) for handoff calls. We validate the analytical models by simulation; the simulation test cases show that our models accurately predict the system performance measures of interest. Numerical and simulation results also show that both dynamic strategies outperform conventional channel reservation schemes based on fixed channel assignment and hybrid channel assignment. This revised version was published online in June 2006 with corrections to the Cover Date.     

Power-Efficient Spatial Reusable Channel Assignment Scheme in WLAN Mesh Networks

Interference has strong effect on the available bandwidth of wireless local area network (WLAN) based mesh networks. The channel assignment problem for multi-radio multi-channel multihop WLAN mesh networks is complex NP-hard, and channel assignment, routing and power control are tightly coupled. To mitigate the co-channel interference and improve capacity in multi-channel and multi-interface WLAN mesh networks, a power-efficient spatial reusable channel assignment scheme is proposed, which considers both channel diversity and spatial reusability to reduce co-channel interference by joint adjusting channel, transmission power and routing. In order to assign channel appropriately, an efficient power control scheme and a simple heuristic algorithm is introduced to achieve this objective, which adjust the channel and power level of each radio according to the current channel conditions so as to increase the opportunity of channel spatial reusability. The proposed channel assignment scheme also takes load, capacity and interference of links into consideration. Simulation results show the effectiveness of our approach and demonstrate that the proposed scheme can get better performance than other approaches in terms of throughput, blocking ratio, energy consumption and end-to-end delay.     

Combined ICA and FCA Schemes for a Hierarchical Network

A combined idle channel assignment (ICA) and fixed channel assignment (FCA) scheme is proposed to improve the traffic performance in a hierarchical network. This dual-mode network integrates the Frequency Division Duplex (FDD) and Time Division Duplex (TDD) modes of the Universal Mobile Telecommunication System (UMTS) and Terrestrial Radio Access (UTRA) in a given cell. This approach includes a high traffic load area and a blocked area as an example to evaluate the traffic performance. The ICA threshold and network timeout period effects on the traffic performance of this integrated dual-mode network are also investigated. The analytical results show that the handoff failure probabilities of the integrated dual-mode network can be reduced significantly with a minimal increase in the new call blocking probability when the combined ICA and FCA scheme replaces the FCA scheme. The integrated dual-mode network using the combined ICA and FCA scheme also increases the carried traffic. The traffic performance improvements for non-uniformly generated new calls are more significant than those for uniformly generated new calls when the combined ICA and FCA scheme is used. An increase in the high ICA threshold will result in an increase in the total carried traffic and an increase in the new call blocking and handoff failure probabilities for higher-tiered and low-tiered systems located in the high traffic load area. The traffic performance was evaluated using the discrete time simulation method to validate the analysis results.     

Performance analysis of microcell/macrocell with reuse partitioning in TDMA‐based cellular systems

System capacity and grade of service (GoS) are both important for the rapid growth of cellular communication services. In this paper, we propose a two‐tier TDMA‐based cellular system with macrocell overlaid on microcell clusters by implementing fixed channel assignment (FCA) scheme and fixed reuse partitioning (FRP) scheme in microcell layer and macrocell layer, respectively, named FCA–FRP overlay scheme. Improvement can be achieved in both system capacity and GoS. Theoretical analysis based on the overlay scheme without overflow and with overflow is first presented. It shows that the simulation results are agreed with the analytical results. Then, simulation results, obtained from the overlay scheme with and without overflow, show that the performance in terms of the call blocking probability, the call dropping probability and system capacity of such a system can be greatly improved compared with a conventional one‐tier cellular system deployed with FCA or FRP scheme. Copyright © 2008 John Wiley & Sons, Ltd.     

Energy-efficient joint relay node selection and power allocation over multihop relaying cellular networks toward LTE-Advanced

Cooperative relaying is emerging as an effective technology to fulfill requirements on high data rate coverage in next-generation cellular networks,like long term evolution-advanced (LTE-Advanced).In this paper,we propose a distributed joint relay node (RN) selection and power allocation scheme over multihop relaying cellular networks toward LTE-Advanced,taking both the wireless channel state and RNs’ residual energy into consideration.We formulate the multihop relaying cellular network as a restless bandit system.The first-order finite-state Markov chain is used to characterize the time-varying channel and residual energy state transitions.With this stochastic optimization formulation,the optimal policy has indexability property that dramatically reduces the computational complexity.Simulation results demonstrate that the proposed scheme can efficiently enhance the expected system reward,compared with other existing algorithms.     

On the throughput enhancement of the downstream channel in cellular radio networks through multihop relaying

In this paper, we study the effect of multihop relaying on the throughput of the downstream channel in cellular networks. In particular, we compare the throughput of the multihop system with that of the conventional cellular system, demonstrating the achievable throughput improvement by the multihop relaying. We also propose a hybrid control strategy for the multihop relaying, in which we advocate the use of both, the direct transmission and the multihop relaying. Our study shows that most of the throughput gain can be obtained with the use of a two- and three-hop relaying scheme. Substantial throughput improvement could be additionally obtained by operating the concurrent relaying transmission in conjunction with the nonconcurrent transmission. We also argue here that the multihop relaying technology can be utilized for mitigating unfairness in quality-of-service (QoS), which comes about due to the location-dependent signal quality. Our results show that the multihop system can provide more even QoS over the cell area. The multihop cellular network architecture can also be utilized as a self-configuring network mechanism that efficiently accommodates variability of traffic distribution. We have studied the throughput improvement for the uniform, as well as for the nonuniform traffic distribution, and we conclude that the use of multihop relaying in cellular networks would be relatively robust to changes in the actual traffic distribution.     

Multi-hop Network Bandwidth Management Scheme Based on Cooperative Bargaining Models

Multi-hop cellular network (MCN) can preserve the advantages of traditional single-hop cellular networks and ad hoc relaying networks. In multi-hop network, efficient bandwidth management plays an important role in determining network performance. In this paper, a new bandwidth management scheme is proposed for MCNs. By integrating the Nash and Kalai–Smorodinsky bargaining models, the proposed scheme adaptively controls the wireless bandwidth to maximize network efficiency. In the proposed Nash and Kalai–Smorodinsky bargaining models, bargaining powers are decided according to the real-time negotiation process. It is a powerful method for resolving conflicts and enables the system to fairly and effectively control the bandwidth management problem. With a simulation study, it is demonstrated that the proposed scheme approximates an optimized solution under widely diverse traffic load intensities.     

能量收集认知多跳中继网络中断性能分析及优化

针对能量收集认知无线网络中的多跳中继传输问题,该文构建了一种新的具有主网络干扰的功率信标(PB)辅助能量收集认知多跳中继网络模型,并提出单向传输方案。在干扰链路统计信道状态信息场景下,推导了次网络精确和渐近总中断概率闭合式。针对精确总中断概率表达式的复杂性和非凸性,采用自适应混沌粒子群优化(ACPSO)算法对次网络总中断性能进行优化。仿真结果表明,PB功率、干扰约束、次网络跳数、能量收集比率、主接收端数目和信道容量阈值等参数对中断性能影响显著,所提算法能快速和有效地对网络中断性能进行优化。     

Space Partitioning Hybrid Channel Assignment Scheme for Cellular Networks

The conventional approach of hybrid channel assignment strategy in cellular networks is rather inefficient due to the fact that it does not take advantage of the FCA scheme to the extreme. In this paper, we divide a cell into two parts: inner cell region and outer cell region, and apply the dynamic channel assignment and the fixed channel assignment schemes to the inner region and out region, respectively, in an attempt to fully utilize the strengths of the channel assignment schemes. In the performance evaluation, we demonstrate that the channel reuse efficiency has been improved compared to the FCA and DCA schemes. We also calculate the probability of an intracell handoff due to the use of the space partitioning. The proposed scheme can be adapted to a multi-tier structure with high/low speed mobile users, and hot spots.     

A medium access control scheme for TDD-CDMA cellular networks with two-hop relay architecture

In this paper, we propose a multihop medium access control (mMAC) scheme for time division duplexing-code division multiple access (TDD-CDMA) cellular networks with two-hop relay architecture to support packet data transmission. The proposed mMAC is based on joint CDMA/PRMA (packet reservation multiple access) protocol and it includes BCH code selection, power control and multihop relaying. Simulation results reveal that cellular networks with two-hop relay architecture with the proposed mMAC scheme can substantially provide a good performance as well as larger cell coverage as compared to conventional TDD-CDMA single-hop cellular networks.     

多跳CC-HARQ中继网络的频谱有效性跨层设计

在瑞利衰落信道中,为改善采用Chase合并混合自动重传请求( CC-HARQ)协议的多跳中继网络的频谱效率性能,考虑发送帧长和发送功率的跨层优化,研究了提升其频谱效率的跨层优化策略。不同于传统的中断概率分析,通过利用对数域线性阈值的平均误帧率估计方法,给出了多跳CC-HARQ协议频谱效率的精确表达式,在发送功率固定时设计了最优发送帧长策略,在发送帧长固定时设计了最优发送功率分配方案,进一步提出了跨层的联合优化方案。仿真结果验证了所设计优化方案在理论上的正确性和有效性,同时在仿真中可以观察到采用跨层的优化策略后,多跳 CC-HARQ中继网络的频谱效率获得了显著的提升,其中跨层的联合优化方案比传统的固定帧长等功率策略在频谱效率上提升了0.014 b/s·Hz-1。     

TCP Throughput Enhancement over Wireless Mesh Networks

TCP is the predominant technology used on the Internet to support upper layer applications with reliable data transfer and congestion control services. Furthermore, it is expected that traditional TCP applications (e.g., Internet access) will continue to constitute the major traffic component during the initial deployment of wireless mesh networks. However, TCP is known for its poor throughput performance in wireless multihop transmission environments. For this article, we conducted simulations to examine the impact of two channel interference problems, the hidden terminal and exposed terminal, on TCP transmissions over wireless mesh networks. We also propose a multichannel assignment algorithm for constructing a wireless mesh network that satisfies the spatial channel reuse property and eliminates the hidden terminal problem. The simulation results demonstrate the effectiveness of the proposed approach in improving the performance of TCP in wireless multihop networks.     

Supporting Asymmetric Traffic in a TDD/CDMA Cellular Network via Interference-Aware Dynamic Channel Allocation and Space–Time LMMSE Joint Detection

In a time-division duplexing (TDD)/code-division multiple-access (CDMA) cellular network with asymmetric data traffic, dynamic channel allocation (DCA) enhances resource utilization compared with fixed channel allocation (FCA). However, it also induces base-to-base and mobile-to-mobile crossed-slot intercell interference, which can severely degrade system performance. To deal with this problem, a decentralized scheme is proposed, which combines an interference-aware DCA algorithm with space–time linear minimum-mean-square-error (LMMSE) joint detection at the base and mobile stations. The former assigns active links to timeslots in a way that crossed-slot interference is mitigated, while the latter suppresses the remaining intercell interference (along with intersymbol and intracell interference), exploiting its spatio-temporal autocorrelation statistics. The performance of this scheme is evaluated in terms of downlink and uplink signal-to-interference-plus-noise ratio (SINR) outage and average throughput via analytical approximations and Monte Carlo simulations, and it is compared with that of benchmark random DCA (RDCA) and FCA schemes. The cases of single- and dual-antenna reception with perfect and imperfect channel state information are examined. It is shown that the proposed scheme achieves higher average throughput than FCA (particularly for dual-antenna reception) as well as RDCA (for heavy traffic loads). These throughput gains are more significant in uplink than in downlink.      

Novel Section‐Based Joint Network Coding and Scheduling Scheme in WMNs: JNCS

Guaranteeing quality of service over a multihop wireless network is difficult because end‐to‐end (ETE) delay is accumulated at each hop in a multihop flow. Recently, research has been conducted on network coding (NC) schemes as an alternative mechanism to significantly increase the utilization of valuable resources in multihop wireless networks. This paper proposes a new section‐based joint NC and scheduling scheme that can reduce ETE delay and enhance resource efficiency in a multihop wireless network. Next, this paper derives the average ETE delay of the proposed scheme and simulates a TDMA network where the proposed scheme is deployed. Finally, this paper compares the performance of the proposed scheme with that of the conventional sequential scheduling scheme. From the performance analysis and simulation results, the proposed scheme gives more delay‐ and energy‐efficient slot assignments even if the NC operation is applied, resulting in a use of fewer network resources and a reduction in ETE delay.     

Interference Mitigation Based on Radio Aware Channel Assignment for Wireless Mesh Networks

An intricate network deployment for high demand users leads to simultaneous transmission in wireless mesh networks. Multiple radios are adapted to individual nodes for improving network performance and Quality of Service (QoS). However, whenever multiple radios are assigned to the same channel, co-located radio interference occurs, which poses a major drawback. This paper proposes a Radio aware Channel Assignment (Ra-CA) mechanism based on a direct graphical model for mitigation of interference in multi-radio multi-channel networks. Initially, the co-located radio interference is identified by classifying non-interfering links for simultaneous transmission in the network. Proposed channel assignment mechanism helps in allocating the minimal number of channels to the network that mitigate co-located radio interference. Performance analysis of the proposed Ra-CA strategy is carried out compared with other existing techniques, like Breadth First Search-Channel Assignment (BFS-CA) and Maximal Independent Set Channel Assignment (MaIS-CA), in multi-radio networks. Simulation results demonstrate that the proposed channel assignment scheme is more efficient compared to the existing ones, in terms of QoS parameters like, packet drop rate, packet delivery ratio, transmission delay and throughput.     

Handoff prioritisation with implicit channel reservation indistributed dynamic channel assignment algorithms

A new distributed dynamic channel assignment scheme with implicit channel reservation for handoff prioritisation is proposed. This scheme reduces the degree of computation and communications among base stations required for channel reservation and achieves a capacity similar to that of the maximum packing algorithm. For 40 total channels, the proposed algorithm achieves a 116% capacity increase relative to the nonprioritised fixed channel assignment (FCA) scheme and 93% relative to FCA with optimum channel reservation