移动通信无线信号覆盖策略

移动通信无线信号覆盖可分三种地区:平原、山区和市区。本文分别说明这三种情况下的覆盖策略。1 平原地区 平原地区应追求以下目标:无死角,无阻塞,无干扰,切换分界线分明。1.1 乡镇的覆盖 平原地区乡镇分布较均匀,在乡镇内设一基站,一般情况下G网可覆盖半径为5km的地区,C网可覆盖半径为7km的地区。如果乡镇     

关于山区复杂地形的交通干线3G覆盖规划探讨

交通干线是区域间、省际间、地区间的重要通道，交通干线的网络覆盖有效满足了用户的移动性需求，保证了用户的业务连续性体验，对用户感知和运营商品牌都有较大的影响。在覆盖方面一般都是基于链路预算和实际DT数据进行网络规划，在平原地区可以得到很好的覆盖效果。但在复杂传播环境的山区交通干线如何在经济性和覆盖效果上取得良好平衡一直是网络规划的难点。本文主要针对山区复杂地形交通干线覆盖规划中的经验进行总结，以期给今后的网络规划中提供一定的参考。     

高山地区网络信号全面覆盖探讨及实现

由于高山地区对无线电波信号的屏蔽和吸收,导致要使高山地区移动通信网络达到全面覆盖,设备投资大,建设难度大.本文针对高山地区这种特殊地形地貌的信号全面覆盖进行了初步探讨,并结合对泰山风景区全面信号覆盖的工程实施,以实际应用进一步阐明了实现高山地区网络全面覆盖的方式和方法.     

河南省DMB-T单频网信号覆盖率的计算

对DMB-T单频网进行了数学建模,采取分区分块算法,并考虑了地球曲率的影响,计算出河南省DMB-T单频网的场强分布,参照欧洲DVB-T标准,DMB-T系统所具有的特征,给出了DMB-T单频网覆盖率的参考标准.计算结果表明,基于16QAM调制解调器的河南省DMB-T单频网的信号能较好地覆盖平原地区.     

地方广播电视节目通过直播卫星传输覆盖应用研究

随着广电总局关于直播卫星业务需求政策的出台,利用直播卫星进行地方节目的传输覆盖成为解决边远山区听广播和看电视的有效手段.基于此,从前端集成、国内信号传输、直播卫星信号覆盖、系统安全管理以及责任区域划分等方面详细介绍曲靖市广播电视台利用直播卫星低成本、高效地提高本地广播电视节目传输覆盖的实践,为解决西部山区群众收看本地广播电视节目问题提供参考.     

TD-LTE在农村场景建设的策略和方案

随着移动互联网应用的普及,农村居民对无线宽带的需求进一步提升。目前大部分城市的主城区和一般城区都实现了TD-LTE网络的覆盖,但农村地区的TD-LTE网络的建设才刚刚起步。农村地区由于面积广,对TD-LTE网络建设的策略提出了新要求。本文简单给出了平原、丘陵和山区等不同场景下了农村TD-LTE网络建设的策略和方案。     

浅谈移动通信无线信号在高速公路隧道覆盖技术

本文主要是结合山区隧道的无线覆盖情况,对移动通信无线信号在高速公路隧道中的覆盖技术进行分析.主要从隧道内分布方案的实施、隧道外投射方案的实施和隧道泄漏电缆方案的实施三个方面展开论述.     

跨台区集中抄表系统在无信号偏远地区的研究应用

青海海北地区地域广阔,电力客户分散,通讯网络（移动、电信）目前已覆盖走部分地区,但仍有部分山区没有网络信号覆盖。目前用电信息采集系统建设已实现所有有网络覆盖地区用户用电信息全采集。偏远山区通信方式不能完全满足用电信息采集系统当前的建设需要,无法实现用电信息采集系统“全覆盖、全采集、全预付费”的建设目标。     

TD-LTE农村基站覆盖能力分析

考虑地形对电波传播的影响,将农村分为平原、丘陵和山区三大场景,并利用理论及模型校正测试分析对比的方法,研究TD-LTE F频段农村基站分场景的覆盖能力,解决了农村覆盖多样性和准确性的问题。     

安徽省分钟降雨率分布特征

利用安徽省2017—2019年81个国家级气象站实测分钟降雨率资料，统计站点分钟降雨率累积分布，对安徽省分钟降雨率的时空分布特征进行分析，并将实测降雨率与ITU降雨率模型预测结果进行对比.结果表明:安徽省山区的分钟降雨率累积分布整体上高于其他地区，淮北平原东部在小于0.03%时间概率点时呈现出较高分钟降雨率累积分布；山区受地形降雨影响，高海拔处分钟降雨率总体上高于低海拔处；平原地区的R（0.01）年际变化较其他地区显著；2017年、2018年和2019年的降雨最坏月份分别为8月、7月和6月.实测分钟降雨率分布与ITU模型预测结果总体上保持一致，在0.03%时间概率点以内，模型预测结果整体偏低；在淮北平原和山区高海拔处，模型预测结果误差较大.     

A smart technique for determining base-station locations in anurban environment

With the increasing demand for cheaper and better wireless communication services from customers, and the tendency to move toward smaller cell sizes, it is becoming very important to optimally design the cell geometry and deploy the minimum number of base stations to provide maximum possible coverage. We consider how to optimally determine the locations for the placement of base stations for a wireless system in an urban setting, given the cell coverage. An algorithm is presented that determines the optimal locations of the base stations without performing an exhaustive search. Using this algorithm, a 20-25% decrease in the number of base stations required has been observed for simulated environments. The computational complexity of the proposed algorithm is also discussed     

Stochastic geometry based models for modeling cellular networks in urban areas

Recently a new approach to modeling cellular networks has been proposed based on the Poisson point process (PPP). Unlike the traditional, popular hexagonal grid model for the locations of base stations, the PPP model is tractable. It has been shown by Andrews et al. (in IEEE Trans Commun 59(11):3122–3134, 2011) that the hexagonal grid model provides upper bounds of the coverage probability while the PPP model gives lower bounds. In this paper, we perform a comprehensive comparison of the PPP and the hexagonal grid models with real base station deployments in urban areas worldwide provided by the open source project OpenCellID. Our simulations show that the PPP model gives upper bounds of the coverage probabilities for urban areas and is more accurate than the hexagonal grid model. In addition, we show that the Poisson cluster process is able to accurately model the base station location distribution.     

Overlapping coverage with reuse partitioning in cellularcommunication systems

In cellular communication systems overlapping coverage areas of nearby base stations provide some users with access to more than one base. This can be used to improve teletraffic performance. Mobile users who are distant from base stations are helped most by this because they are more likely to be in communication range of other nearby bases. Reuse partitioning, on the other hand, tends to be most helpful to users that are close to base stations, because they can use channels from more partitions. This paper considers the combined use of overlapping coverage and reuse partitioning so that all users gain some advantage. We develop an analytical model for such systems. Theoretical traffic performance characteristics are obtained and compared with those for fixed channel assignment schemes. Priority for handoff calls is considered. Simulation results validate the analysis     

基于真实信号强度的覆盖分析

随着城乡一体化的快速发展,城市大型建筑密度增大,乡镇建筑增多,导致部分场所信号覆盖减弱甚至无信号覆盖.已建成的专网通信系统无法满足不断变化的信号覆盖需求,迫切需要通过新增站点的方式进行扩容补盲.为掌控PDT系统信号覆盖情况,有效实现对PDT系统的扩容补盲,文章研究了一种信号覆盖检测技术,通过整合PDT系统的场强数据达到对信号覆盖的准确分析,为扩容补盲提供有力依据.     

面向空天应急通信系统的空地连续覆盖技术研究与应用

摘 要：为了解决大型固定翼无人机应急基站覆盖范围小、覆盖不连续的问题，提出一种无人机应急基站连续覆盖的设计方案。通过对机载基站单天线覆盖能力的分析，提出内侧天线加边缘天线的多幅天线覆盖方案，并结合无人机飞行的滚转角、俯仰角等参数，设计保证连续覆盖的多天线挂装的安装方案。根据 3GPP 传播损耗模型进行链路预算，根据连续覆盖面积需求，规划无人机飞行方案。仿真和飞行测试结果表明，所提方案能在不使用云台智能控制天线角度的情况下，实现空中移动基站对地面50 km²面积的连续覆盖。     

无线发射台远程自动化监控系统在广播电视中的应用研究

通常情况下广播电视主要采用中短波台与高山台无线发射的形式,实现无线信号的覆盖目的。而对于中短波台与高山台而言,多数均与市区距离很远,监控的难度很大,只能通过人员留守的方式监督管理,浪费人力资源与成本。而在广播电视中应用无线发射台远程自动化监控系统,可以利用远程监控的方式来开展监督管理工作,代替人工完成监督工作与分析工作。因此,在广播电视实际发展的进程中,应积极采用无线发射台远程自动化监控系统,为其后续发展夯实基础。     

浅析CDMA网络密集市区覆盖解决方案

密集市区无线传播环境复杂,用户众多,是CDMA网络需要重点覆盖的区域.本文分析了密集市区无线传播环境,根据特定环境下的CDMA网络覆盖特点,提出了各种区域的覆盖解决方案.对于商业中心区应结合室外基站和室内分布系统加强深度覆盖.高层建筑通过基站分裂小区,安装特定的天线,天线上仰等方式进行大部分楼层的覆盖,电梯、建筑物底层、地下停车场通过室内分布系统完善覆盖.密集住宅小区通过在小区外围设站,或者通过射频拉远方式对住宅区进行覆盖,并结合天线美化与伪装,直放站信号源和分布系统进行覆盖.密集城中村通过基站、直放站等信号源结合室外分布系统,选取合适的天线及安装位置进行覆盖.     

Obstacles constrained group mobility models in event-driven wireless networks with movable base stations

In this paper, we propose a protocol for dynamic reconfiguration of ad-hoc wireless networks with movable base stations in presence of obstacles. Hosts are assigned to base stations according to a probabilistic throughput function based on both the quality of the signal and the base station load. In order to optimize space coverage, base stations cluster hosts using a distributed clustering algorithm. Obstacles may interfere with transmission and obstruct base stations and hosts movement. To overcome this problem, we perform base stations repositioning making use of a motion planning algorithm on the visibility graph based on an extension of the bottleneck matching technique.We implemented the protocol on top of the NS2 simulator as an extension of the AODV. We tested it using both Random Way Point and Reference Point Group mobility models properly adapted to deal with obstacles.Experimental analysis shows that the protocol ensures the total space coverage together with a good throughput on the realistic model (Reference Point Group) outperforming both the standard AODV and DSR.     

WCDMA网络高铁覆盖技术分析

根据高速铁路覆盖的特点,建议WCDMA高铁覆盖初期采用公网方式,按AMR12.2kbit/s做连续覆盖。通过链路预算分析,以及多条高铁线路的实测结果,给出了基站站间距取值建议,最后列出了改善高铁覆盖、减少切换的技术措施。     

Cell planning with capacity expansion in mobile communications: atabu search approach

The cell planning problem with capacity expansion is examined in wireless communications. The problem decides the location and capacity of each new base station to cover expanded and increased traffic demand. The objective is to minimize the cost of new base stations. The coverage by the new and existing base stations is constrained to satisfy a proper portion of traffic demands. The received signal power at the base station also has to meet the receiver sensitivity. The cell planning is formulated as an integer linear programming problem and solved by a tabu search algorithm. In the tabu search intensification by add and drop move is implemented by short-term memory embodied by two tabu lists. Diversification is designed to investigate proper capacities of new base stations and to restart the tabu search from new base station locations. Computational results show that the proposed tabu search is highly effective. A 10% cost reduction is obtained by the diversification strategies. The gap from the optimal solutions is approximately 1~5% in problems that can be handled in appropriate time limits. The proposed tabu search also outperforms the parallel genetic algorithm. The cost reduction by the tabu search approaches 10~20% in problems: with 2500 traffic demand areas (TDAs) in code division multiple access (CDMA)