共查询到18条相似文献，搜索用时 53 毫秒
1.
2.
分层异构无线网络(HetNet)能显著提高无线网络容量,扩展无线覆盖范围和节省基站能耗,已经成为后4G和5G的热门技术,但其网络理论性能以及如何优化设计逼近理论性能一直是业界研究的难点和热点问题。针对分层异构无线网络节点服从泊松点分布的特性,给出了分层异构网络在专门接入和共享接入策略下的网络理论性能,如成功接入概率、平均面积频谱效率、能量效率等,并仿真评估了影响理论性能的关键因素,探讨了优化分层异构无线网络性能的各种方法。 相似文献
3.
4.
传统宏蜂窝(macro cell)与低功率小蜂窝(small cell)共存的分层异构组网方案能有效地提高无线通信系统的容量.但宏蜂窝与小蜂窝间的同频干扰严重影响了通信质量,并阻碍了系统容量的进一步提升.近年来,利用MIMO预编码及空域衰落特性进行干扰抑制的相关技术成为新的研究热点.本文着重介绍分层异构无线网络中基于MIMO预编码的干扰抑制技术的研究进展.以典型的双层异构下行网络为例,分析了利用多天线预编码进行干扰抑制的基本方法,并在此基础上介绍了多种基于MIMO预编码的新型干扰抑制方案,最后讨论了分层异构网络中干扰抑制技术的未来研究方向. 相似文献
5.
6.
7.
8.
9.
10.
11.
Lexi Xu Yue Chen Kok Keong Chai John Schormans Laurie Cuthbert 《Wireless Communications and Mobile Computing》2015,15(7):1171-1187
Mobility load balancing (MLB) redistributes the traffic load across the networks to improve the spectrum utilisation. This paper proposes a self‐organising cluster‐based cooperative load balancing scheme to overcome the problems faced by MLB. The proposed scheme is composed of a cell clustering stage and a cooperative traffic shifting stage. In the cell clustering stage, a user‐vote model is proposed to address the virtual partner problem. In the cooperative traffic shifting stage, both inter‐cluster and intra‐cluster cooperations are developed. A relative load response model is designed as the inter‐cluster cooperation mechanism to mitigate the aggravating load problem. Within each cluster, a traffic offloading optimisation algorithm is designed to reduce the hot‐spot cell's load and also to minimise its partners’ average call blocking probability. Simulation results show that the user‐vote‐assisted clustering algorithm can select two suitable partners to effectively reduce call blocking probability and decrease the number of handover offset adjustments. The relative load response model can address public partner being heavily loaded through cooperation between clusters. The effectiveness of the traffic offloading optimisation algorithm is both mathematically proven and validated by simulation. Results show that the performance of the proposed cluster‐based cooperative load balancing scheme outperforms the conventional MLB. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
12.
Call Blocking Performance Study for PCS Networks under More Realistic Mobility Assumptions 总被引：1，自引：0，他引：1
In the micro-cell-based PCS networks, due to the high user mobility, handoffs occur more frequently. Hence, the classical assumptions, such as the exponential assumptions for channel holding time and call inter-arrival time, may not be valid. In this paper, we investigate the call blocking performance for PCS networks using a semi-analytic and semi-simulation approach. We first construct a simulation model as the base for our performance study, using which the handoff traffic is studied. Then we present a few possible approximation models from which analytical results for call blocking performance metrics can be obtained and compared with the simulation results. We show that for a certain parameter range, such approximations may provide appropriate results for call blocking performance. Finally, using the simulation model, we investigate how various factors, such as the high moments, the variance of cell residence time, mobility factors and the new call traffic load affect the call blocking performance. Our study shows that all these factors may have a significant impact on call blocking performance metrics such as call blocking probability, call incompletion probability and call dropping probability. This research provides a strong motivation for the necessity of reexamining the validity of analytical results obtained from classical teletraffic theory when dealing with the emerging wireless systems. 相似文献
13.
14.
提出了一种应用于异构无线网络环境的基于多目标优化的业务接入控制算法.该算法以业务占用总资源最少、业务阻塞率最低和网络间负载最均衡为目标建立了多目标优化控制模型,采用高斯和戒上型组合隶属函数将多目标问题模糊化,利用最大化满意度指标法将多目标问题转化为单目标问题,并通过遗传算法求得最优解.仿真结果表明,所提算法能在兼顾各网络资源高效利用的同时,保证业务接入的可靠性,并相对于参考算法有效降低了业务阻塞率. 相似文献
15.
G.I. Tsiropoulos D.G. Stratogiannis Hsiao‐Hwa Chen P.G. Cottis 《International Journal of Communication Systems》2014,27(3):521-528
Resource reservation or the other prioritization strategies adopted by Call Admission Control (CAC) schemes in wireless networks lead to unfair resource allocation to users belonging to different service classes (SCs) due to high divergence among the respective call blocking probabilities (CBPs). In this paper, we propose dynamic optimization of probabilistic CAC (P‐CAC) schemes to assure CAC fairness among users of different SCs in wireless networks. The approach is based on users utility combined with fairness optimization, aiming at dynamically determining the probability value in the P‐CAC scheme. This optimal probability is adjusted to network ongoing traffic, CBPs of each SC, prioritization levels characterizing the SCs supported, and the users risk aversion, which reflects their behavior toward the perceived QoS. The existence and uniqueness of the optimal probability that leads to absolute fairness among the users of a wireless network are proven. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
16.
Call admission control is one of the key elements to guarantee the handoff call dropping probability in cellular networks. Among numerous proposals in the literature, the distributed call admission control policy (DCAC) seems to be promising, due to its simplicity and adaptability to changing traffic. However, one crucial assumption used in DCAC is that the actually admitted new calls has to obey a Poisson process to enter the network after the call admission control. Given the dynamic and distributed nature of the control process, this can neither be validated nor be easily implemented. In this paper, we will first discuss a generalized DCAC which eliminates the above assumption and can be used in general environments. Then, a mobility-aware DCAC is introduced, which considers the difference of handoff support between low and high mobility calls in making the CAC decision in order to improve channel utilization. The performance of the modified DCAC scheme is investigated through simulation studies. 相似文献
17.
In this paper, we present an analytical model of adaptive channel preemption (ACP) for small‐cell embedded large‐cellular (SCELC) networks. An SCELC network consists of a fixed base station (FBS) with large coverage and many embedded base stations (EBS) with relatively small coverage. Channel capacity in an FBS cell may become insufficient when traffic is unexpectedly increased particularly in some special occasion. This paper considers two aspects of dynamically allocating channels for an SCELC network. First, by increasing one or more EBS cells within an FBS cell, the proposed ACP can reduce blocking probability of new calls. Second, to reduce dropping probability of handoff calls, the proposed ACP allows a handoff call to preempt an on‐going call, when the latter is located in an EBS cell or in the overlapping area of two adjacent FBS cells. For the purpose of performance evaluation, we build an analytical model with 4‐tuple Markov chains. Numerical results reveal that embedding one or more EBS cells inside an FBS cell needs to be done carefully since it results in a tradeoff between the reduction of new‐call blocking probability and the increase of handoff‐call dropping probability. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
18.
To solve the problem of unbalanced loads and the short network lifetime of heterogeneous wireless sensor networks, this paper proposes a node-selection algorithm based on energy balance and dynamic adjustment. The spacing and energy of the nodes are calculated according to the proximity to the network nodes and the characteristics of the link structure. The direction factor and the energy-adjustment factor are introduced to optimize the node-selection probability in order to realize the dynamic selection of network nodes. On this basis, the target path is selected by the relevance of the nodes, and nodes with insufficient energy values are excluded in real time by the establishment of the node-selection mechanism, which guarantees the normal operation of the network and a balanced energy consumption. Simulation results show that this algorithm can effectively extend the network lifetime, and it has better stability, higher accuracy, and an enhanced data-receiving rate in sufficient time. 相似文献
