Femtocell基站休眠机制研究

Femtocell基站是解决蜂窝覆盖问题的一种有效途径,然而Femtocell基站大能耗已成为一个紧迫的问题。分析了Femtocell基站传统的固定周期休眠机制算法,提出了两种改进的自适应休眠机制。其设计思想分别为:改进方案A通过引入休眠周期因子改变增长倍数,动态调整休眠周期;改进方案B通过上一次休眠周期状态的阶数来确定初始休眠的间隔时间,降低休眠模式下的能量消耗。并对两种改进的休眠方案进行Markov分析和Matlab仿真,结果表明,两种改进休眠方案均有比较大的能量改善,改进方案A比较适应环境变化小、通话率高的单基站通信;改进方案B能在通话率波动比较大的范围内保持良好性能,且性能最好,适应多基站协作的通信。     

分层异构网络中基于负载预测分组的家庭基站频谱分配算法研究

针对分层异构网络中严重的干扰问题,提出一种基于负载预测分组的家庭基站频谱分配算法。该算法通过对各个家庭基站以及宏基站的历史负载信息优化得到对未来时段的负载预测信息。利用得到的各家庭基站的负载预测值对小区内的家庭基站进行分组,通过分组后每个小组独立地使用和分配频谱资源,从而有效的降低家庭基站之间的同层干扰。仿真数据表明由于采用了基于负载预测分组的家庭基站频谱分配算法,系统的SINR和吞吐量都有明显的提高,干扰得到了有效的抑制。     

基于保护邻居基站主载波的载波（重）选算法

毫微基站(Femtocell)的引入,给无线网络的干扰管理带来新的挑战。在动态部署Femtocell的网络中,每个进入网络的基站选一个载波作为主载波,主载波提供小区的全局覆盖和初始化接入服务。主载波选择的好坏,直接影响小区边缘用户的通信质量。本文提出基于保护邻居基站主载波的家庭基站载波重选算法,基站借助用户测量汇报得到背景干扰信息,重选主载波;本算法着重考虑对邻居基站边缘用户影响,降低小区边缘干扰。仿真结果表明,该算法可以提高系统平均吞吐量和边缘用户的频谱效率。     

基于最大化容量增益的小区关闭算法

随着智能终端的大量使用,使得传统的异构网络很难满足用户对数据速率的追求,面对这样的需求,小小区技术成为了未来移动通信的热点.然而在此场景下,小区间干扰严重制约着系统容量的提升.为了解决这一问题,一些小小区关闭策略被提出,如随机关闭、基于负载关闭等算法,但是这些方法的应用都没有考虑小区的系统容量.所以对基于每个小小区基站关闭前后带来系统容量增益进行了研究,有效地选择合适的小小区基站关闭策略,来减少小区间干扰,从而提高小区的系统容量.最后,仿真比较了基站在全开情况以及随机关闭和基于负载状况关闭的系统吞吐量,结果验证了所提方案的有效性.     

Femtocell关键技术研究及前景分析

对于移动通信网络来说，增加系统容量最可靠的方法是使发射器和接收器彼此靠近，这样可建立更高质量的无线链路，也更利于应用空间分集技术。在商用系统中使用类似方法将不可避免地涉及到部署更多的网络基础设施，类似方案包括微蜂窝、Wi-Fi、分布式天线或中继。Femtocell，即毫微小区或家庭基站，是一种更加物美价廉的替代方案。Femtocell一般由用户在家庭环境中安装使用，以获得更好的室内网络覆盖。该文对Femtocell网络技术的基本技术特点、国际标准化情况及运营商商用部署的挑战等问题进行了综合的分析，并对Femtocell未来的研究方向进行了分析建议。     

基于容量最优化的设备间通信资源分配方案

在蜂窝网络中通过复用蜂窝系统中已使用的频谱资源,来增加蜂窝系统的频谱利用率,减少基站的负载.同时,通过使用模糊C均值(FCM)算法对复用相同资源的设备间(D2D)通信用户对进行分簇,达到减小复用同频带D2D通信用户对(DU)之间干扰的目的.通过贪婪算法对每一簇DU对进行资源分配,达到减小蜂窝用户与DU之间的干扰的目的.仿真结果显示,相比于随机分簇和随机复用的资源分配方案,FCM算法与贪婪算法的资源分配方案更有效地提高了系统总容量.     

C-RAN架构下一种基于分形定理的载波迁移预测算法

作为C-RAN关键技术之一的实时虚拟化技术要求实现硬件处理资源的虚拟化管理,实现物理资源的动态分配和负载均衡,保证虚拟基站的实时性,处理时延和抖动可控。为提高物理资源的动态分配和负载均衡的效率,在传统虚拟机迁移策略基础上结合分形理论,提出一种动态载波迁移预测算法,避免了因瞬时负载峰值触发载波迁移而带来不必要的迁移开销。该算法通过对物理资源负载离散历史数据进行分形拼贴拟合出完整负载曲线,然后根据分形维度不变性实现对未来数据的预测。为实现对该算法的仿真,结合C-RAN的系统架构搭建了一个基于并行离散事件仿真(parallel discrete event simulation PDES)的验证平台,仿真结果表明该算法能在有效减少虚拟基站迁移次数的同时确保达到负载均衡的目的。     

基于流量预测的资源分配策略研究

在超密集网络中，针对小基站密集部署会导致干扰加剧和资源分配难度加大等问题，提出了一种基于流量预测和着色图的信道资源分配方案。首先，利用深度学习工具实现对网络中未来时隙的流量预测；其次，将不相邻的小基站分配到同一集群以缓减网络中的共道干扰；最后，结合流量预测的结果和着色图为每个小基站分配合适的子信道。通过仿真验证了所提算法的可行性和有效性。结果表明，通过机器学习能够有效预测小基站的流量波动，同时基于流量预测的信道分配方案可以有效降低系统干扰、提升频谱利用率和系统吞吐量。     

基于Femtocell分层无线网络的切换算法

为了解决传统切换算法在包含家庭基站(Femtocell)的分层网络场景中无法适用的问题,提出一种综合信号强度判决和动态门限的切换算法。首先,在基于信号强度判决时使用RSS作为门限值,提高系统接入能力;然后利用基于动态时延的TQ算法和连续的RSS测量比较判定,降低冗余切换。仿真结果表明,算法不仅提高了MS切换到Femtocell的概率和Femtocell服务时间,而且降低了冗余切换概率,延展了Femtocell的应用场景。     

WCDMA基站天线的选择

基站天线如同整个移动通信系统的触角,在通信过程中起着举足轻重的作用。本文对WCDMA基站天线的选择做了个浅议,以期对未来3G基站建设作出一定的指导作用。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.