基于模拟退火的移动业务分布预测算法

该文提出了一种基于模拟退火的业务分布预测算法,该算法采用模拟退火算法求解超定方程组得到业务密度值。并且提出了业务密度权值的计算方法,从而在用模拟退火算法进行业务分布预测的基础上,给出了利用业务密度权值进行业务分布预测的算法。采用实际统计数据计算结果表明,该方法能够有效地预测业务的分布。     

基于语义的NGN融合业务合成算法研究

分析了当前两种基于语义的业务合成算法在应用于电信域和网络域业务融合时的不足,提出了一种新的基于语义的双向链自动业务合成算法,并对该算法的性能进行了详细分析,证明了其在业务的平均合成时间和合成成功率上明显优于已有的相关算法。最后给出了一个融合业务的合成实例,以验证算法的正确性。     

基于GMPLS的动态分布式WDM网状网恢复路由选择算法研究

提出了一种在GMPLS体系下的分布式业务路径和恢复路径在线选路算法，以使光网络在动态业务请求下能有效的利用波长资源。由于该算法对业务路径和恢复路径的选择进行了联合优化，其性能更优于独立业务路径恢复算法(SSPR)。仿真结果表明，利用该算法时业务路径和恢复路径占用的网络总资源明显小于SSPR算法，而恢复时间只比SSPR算法略有增加。     

HSDPA系统中一种感知用户终端缓存状态的QoE保障调度算法

针对HSDPA系统中现有调度算法无法满足实时业务QoE的缺点,提出一种保障实时业务QoE的调度算法。该算法根据用户反馈的信道质量信息和在基站获取到的用户终端缓存状况信息。确定用户的优先级并据此调度优先级最高的用户,进而保证实时业务的吞吐量和QoE需求。仿真结果表明,与轮询调度算法、比例公平调度算法相比,提出的调度算法不仅能够保证实时业务的QoE需求,而且能满足非实时业务基本的吞吐量需求。     

光网络中基于预定组播业务的资源优化

文章利用遗传算法安排光网络中预定组播业务的计算顺序,提出了优化业务顺序的分层图算法和点着色算法,并与按时间顺序安排业务的算法进行了比较.仿真表明,优化排序后,资源优化效果明显.在波长数的优化上,分层图算法比点着色算法性能更好.在分层图算法中,业务放置顺序的优化对组播树总链路数的减少也有一定帮助.     

一种新的HSDPA分组调度算法研究

目前已提出的HSDPA调度算法仅是基于用户的优先级进行数据分组的调度.文章考虑了3G系统的业务多样性,综合考虑用户的优先级和业务的级别,创新性地提出将两类分组调度算法,即基于业务类别的分组调度算法--加权公平排队算法,与基于用户优先级的调度算法--最短队列算法或者最长队列算法相结合后的调度算法.仿真的结果显示,提出的调度算法能满足不同业务要求的QoS.从吞吐量和延时来看,最短队列算法与加权公平排队算法结合方案优于最长队列算法与加权公平排队算法结合的方案.     

一种基于RTO的业务排序算法

业务影响分析是业务连续性计划中较为关键的一步,其最终目标是对企业中业务的重要性进行排序。文中的目的是提出一种企业在进行灾难恢复时,各个业务过程之间恢复优先顺序的排序算法。该算法在设计时基于RTO进行排序,并考虑了业务之间的相互依赖关系对恢复顺序的影响。通过实验显示了该算法的合理性：使用该算法可以更好地实施业务影响分析,缩短分析时间,从而提高整个业务连续性实施过程的效率。     

WiMax终端上行调度算法的研究与设计

在对WiMax终端的不同业务类型调度算法进行分析的基础上,提出了一种有效的上行调度算法实现策略.与传统的基于严格优先级的调度算法相比,本算法在保证各业务QoS参数的基础上,提高了不同业务之间的公平性,使优先级较低的业务也可以获得相应的调度机会.     

SDH自愈环的路由算法研究

本文分析了四纤双向共享保护环的几种业务路由算法，对各种算法所需的环路容量配置进行了计算机的随机统计模拟，基于上述模拟结果，讨论了用户接入网、局间中继网等网络所具有的不同业务分布模型与路由算法的关系，探讨了根据网络自身的业务特点选择业务路由算法的方法     

多线速OTN城域网的业务疏导研究

针对未来的通信网络将趋于扁平化并支持各种业务的需求,将多线速应用到城域OTN(光传送网)的业务疏导算法中,对高、低带宽业务进行不同的业务疏导。提出了适合解决大中型网络业务疏导问题的启发式算法,将该算法应用于城域OTN中,并将多线速与单线速网络的结果进行比较,结果证明多线速OTN城域网的业务疏导算法可以降低网络建设成本。     

DS—CDMA系统中的功率分配算法的研究

第三代移动通信系统设计要求支持多媒体通信。由于各个业务在接收端所要求的功率不同,这就要求系统必须进行有效的功率分配。文章提出了一种基于信道特征（如业务量）的功率分配算法,并通过系统分析验证了该算法能确保各种业务的业务质量的同时提高系统的容量。     

一种新的自适应OFDM算法的探讨

在具有多径干扰的无线信道中仅应用传统OFDM既影响通信速率,也浪费资源.由于信道的频率选择性衰落,OFDM系统的每个子信道具有不同的传输能力.文中提出一种计算量较小、简单实用的自适应OFDM算法,在保证通信质量所需BER的前提下,按照各个子信道衰落程度动态的分配比特和功率,使所需要的发射总功率最小.仿真结果表明,采用该自适应OFDM算法可以提高OFDM系统的性能.     

Computationally efficient bandwidth allocation and power control for OFDMA

The paper studies the problem of finding an optimal subcarrier and power allocation strategy for downlink communication to multiple users in an orthogonal-frequency-division multiplexing-based wireless system. The problem of minimizing total power consumption with constraints on bit-error rate and transmission rate for users requiring different classes of service is formulated and simple algorithms with good performance are derived. The problem of joint allocation is divided into two steps. In the first step, the number of subcarriers that each user gets is determined based on the users' average signal-to-noise ratio. The algorithm is shown to find the distribution of subcarriers that minimizes the total power required when every user experiences a flat-fading channel. In the second stage of the algorithm, it finds the best assignment of subcarriers to users. Two different approaches are presented, the rate-craving greedy algorithm and the amplitude-craving greedy algorithm. A single cell with one base station and many mobile stations is considered. Numerical results demonstrate that the proposed low complexity algorithms offer comparable performance with an existing iterative algorithm.     

Prioritized channel assignment in a cellular radio network

Dimensioning procedures for prioritized channel assignment in a cellular radio network are considered. Under the cutoff priority discipline, the prioritized channel assignment procedures for a single cell and multicell system are formulated as nonlinear discrete capacity allocation problems. Exact incremental algorithms which efficiently solve the proposed problems are devised. They are based on the properties of the blocking probabilities of new calls and handoff calls. Given the number of available frequency channels together with the arrival rates and the grade of service (GOS) for both types of calls in each cell, algorithm SP1 generates an optimal channel assignment which ensures priority for handoff calls. Given the arrival rates and distinct GOSs for new and handoff calls, algorithm SP2 finds the minimum number of channels required in each cell. Algorithm MP extends algorithm SP1 to a multicell system and provides the prioritized channel assignment for all calls in the system. The algorithms are very fast and are appropriate for the fair allocation of frequency channels among cells     

多用户自适应调制及功率分配

为了满足新一代无线通信系统的高数据速率、高频谱效率的通信要求,本文提出了基于正交频分复用(OFDM)技术的自适应调制、子载波分配及功率分配方法,它采用的多址方式是码分多址(CDMA).通过上行信道返馈获知下行信道参数,在一定服务质量要求(QoS)、一定传输速率下,通过本文的优化分配算法,使系统的频谱利率最高,所有子载波的发射功率之和最小.将本方法应用在下行同步信道环境下,系统具有较快的收敛速度;与非自适应OFDM比较,用户发射功率有较大降低,是一种工程可适用方案.     

Mitigation of Control Channel Jamming under Node Capture Attacks

Availability of service in many wireless networks depends on the ability for network users to establish and maintain communication channels using control messages from base stations and other users. An adversary with knowledge of the underlying communication protocol can mount an efficient denial of service attack by jamming the communication channels used to exchange control messages. The use of spread spectrum techniques can deter an external adversary from such control channel jamming attacks. However, malicious colluding insiders or an adversary who captures or compromises system users is not deterred by spread spectrum, as they know the required spreading sequences. For the case of internal adversaries, we propose a framework for control channel access schemes using the random assignment of cryptographic keys to hide the location of control channels. We propose and evaluate metrics to quantify the probabilistic availability of service under control channel jamming by malicious or compromised users and show that the availability of service degrades gracefully as the number of colluding insiders or compromised users increases. We propose an algorithm called GUIDE for the identification of compromised users in the system based on the set of control channels that are jammed. We evaluate the estimation error using the GUIDE algorithm in terms of the false alarm and miss rates in the identification problem. We discuss various design trade-offs between robustness to control channel jamming and resource expenditure.     

一种多中继协作系统中的功率分配算法

提出了多中继无线通信系统的模型,研究其源节点和各中继节点间功率分配对系统容量的影响,在总功率一定的情况下,探讨了以容量最大化为准则的功率分配算法。对采用非再生协作中继方式的多中继协作通信系统进行了容量分析,并提出了一种低复杂度的最优功率分配算法(Optimum Power Allocation,OPA)。仿真结果表明,该算法相对于平均功率分配算法(Average Power Allocation,APA),系统容量得到了显著提高,在信道条件差的情况下,性能提高更明显。     

Joint relay assignment and power allocation for cooperative communications

In the recent years, cooperative communication is shown to be a promising technology to improve the spatial diversity without additional equipments or antennas. With this communication paradigm, energy can be saved by effective relay assignment and power allocation while achieving the required bandwidth for each transmission pair. Thus, this paper studies the joint relay node assignment and power allocation problem which aims to minimize the total power consumption of the network while providing the efficient bandwidth service. We first analyze the minimum power consumption under the bandwidth requirement for different communication modes. Based on the analytical results, we present a polynomial-time algorithm JRPA to optimally solve this problem. The algorithm first constructs a weighted bipartite graph G based on the given transmission pairs and relay nodes. Then, we adopt the KM method to find out a saturated matching M, and assign the relay nodes to the transmission pairs based on the matching. The optimality of the algorithm is also proved. The simulation results show that JRPA algorithm can save about 34.2% and 18.9% power consumptions compared with the direct transmission and ORA schemes in many situations.     

无线网络多用户干扰下智能发射功率控制算法

针对无线网络多用户互相干扰的问题,通过对发射功率进行智能控制,实现干扰管理,保证多用户通信服务质量。首先,考虑复杂动态无线信道环境,建立以无线通信系统加权数据速率最大化为目标的发射功率控制模型。其次,设计以深度强化学习"行动器-评判器"为基本架构的智能发射功率控制算法,缩短功率控制决策时间。仿真验证表明,所提算法收敛速度快,在10对收发机场景下,计算时间缩短到传统最优算法的1/4。     

无线网络多用户干扰下智能发射功率控制算法

针对无线网络多用户互相干扰的问题,通过对发射功率进行智能控制,实现干扰管理,保证多用户通信服务质量。首先,考虑复杂动态无线信道环境,建立以无线通信系统加权数据速率最大化为目标的发射功率控制模型。其次,设计以深度强化学习"行动器-评判器"为基本架构的智能发射功率控制算法,缩短功率控制决策时间。仿真验证表明,所提算法收敛速度快,在10对收发机场景下,计算时间缩短到传统最优算法的1/4。