异构蜂窝网络中用户关联与基站功率的协同优化

为实现异构蜂窝网络中宏基站和小基站之间的负载均衡,提出了一种基于效用函数最大化模型的用户关联机制和基站功率控制的协同优化方案.通过迭代算法求解该协同优化问题,首先在基站功率固定的情况下求得最佳用户关联策略,然后在所得的用户关联策略基础上通过Zoutendijk可行方向法求得基站最佳功率.通过协同优化获得的用户关联策略和基站功率控制实现了基站之间的负载均衡,通过降低宏基站功率和关闭闲置小基站降低了基站的能耗.仿真实验表明,所提方案和不实施功率控制的用户关联策略相比,实现了宏基站与小基站之间的负载均衡,降低了宏基站对小基站用户的干扰,提升了小基站用户的信号干扰噪声比,用户速率中位值提高了20％.     

云边协同中的资源调度优化

随着业务类型的丰富和多样化,低时延、高带宽、数据私密性、高可靠性等成为业务普遍的要求。边缘计算、雾计算、分布式云、算力网络等方案相继被提出,并在产学研各界引发了深度的研究和探索。针对“多级的算力分布以及算力的协同将是未来算力结构的主流”这一观点,产业内外达成了共识,算力管理、分配、调度等与资源优化相关的问题也成为当下的研究热点和重点攻关方向。为此,面向未来的算力供给结构,首先描述了学术界、产业界资源调度优化问题的最新进展,总结了当前的主要方法论和工程实施架构;然后,针对两种典型的云边协同场景,从场景拆分、调度目标、求解方案依次进行分析,给出了适应场景特性的资源调度优化参考方案。     

信源信道联合编码技术用于AVS传输的研究

针对误码信道和信源编码的统计特性,提出了一种基于AVS视频序列的联合编码技术,按照重要性对AVS视频层序列码流进行分组重排,信道编码器根据码流信息对其进行比重不等的保护措施,以较低复杂度的运算实现了码率的优化分配.实验表明,与现有的等差错保护相比,在高误码信道中能有效提高AVS码流抗误码性能.     

Joint optimization of power and distance to minimize outage probability in transparent DF relay network

In this paper, we jointly optimize the position of the relay node and transmission power ratio of the source node over the relay node to minimize the outage probability, which can provide guidance for IEEE 802.16j transparent relay node configuration. The result indicates that the outage probability is minimum when the relay is positioned at the midway between the source and the destination, and the transmission power ratio of the source node over the relay node is 11:9. Copyright © 2009 John Wiley & Sons, Ltd.     

Approach to problem of minimizing network power consumption based on robust optimization

In this paper, a green and robust optimization model is introduced to minimize network power consumption, which allows fluctuations of traffic demands between source‐destination pairs in the network. Our model is based on the green hose model, where the traffic is bounded by just total outgoing and incoming amount at each node. In addition to the green hose model, we use the ellipsoidal uncertainty set to allow a different type of fluctuations in traffic demands. Here, the total amount of squared errors in traffic demands is bounded by a constant which controls the total admissible fluctuations over the network. Applying the conic duality, we formulate our model in the form of mixed‐integer second order cone programming (MISOCP) problem. Furthermore, we establish a relationship between our model and the green hose model with bound of link traffic (HLT) model, an developed version of the hose model known as the HLT. Numerical results demonstrate that each of the MISOCP problems can be solved to its optimality in a reasonable time by a general MISOCP solver, and that the proposed model has different tendency in performance with the green hose and green HLT models.     

最小功耗的中继选择与功率分配的联合优化

研究采用放大转发协议的单向和双向中继网络中的中继选择与功率分配的联合优化策略。该策略以一定服务质量(QoS)要求为约束条件,以最小化中继网络中各节点的总功率为目标,建立优化问题。运用凸优化技术,得到了该优化问题的闭合解。仿真结果表明在满足相同的QoS要求下,该最优联合策略较传统的随机选择与等功率分配策略具有较低的功率消耗。     

家庭基站系统中的联合信道与功率控制算法

摘 要：本文提出了一种联合信道分配与功率控制算法,通过优化目标将家庭网络的信道分配和功率控制结合,限定干扰范围,采用凸优化和次梯度方法,求解出功率的闭合式,优化了家庭网络的容量。算法又将家庭网络容量与宏网络容量联系,使宏网络容量得到了提升。仿真结果表明,与单纯的功率控制算法相比,本文算法提高了系统容量。     

Joint subchannel and power allocation in multiuser OFDM systems with minimal rate constraints

In this paper, we study the adaptive resource allocation in multiuser orthogonal frequency division multiplexing (OFDM) systems. We try to maximize the sum capacity of an OFDM system with given transmission power budget, while meeting users' minimal rate requirements. Unlike other resource allocation schemes, which generally separate subchannel allocation and power distribution into independent procedures, our proposed algorithm implements joint subchannel and power allocation. Given a set of subchannels, the required power to satisfy a user's minimal rate constraint is calculated by water‐filling policy. Then, the user who requires the maximum power to meet the rate requirement has a priority to obtain an additional subchannel. The procedure continues until all subchannels are consumed, by which time the consumed power to meet all users' rate requirements is also worked out. Finally, the margin power is allocated among all subchannels in an optimal manner to maximize the sum capacity of the OFDM system. Simulation results show that our proposed algorithm performs better than other existing ones. The solution produced by our proposed algorithm is close to the upper bound, while its complexity is relatively lower compared with other methods, which makes it attractive for applications. Copyright © 2012 John Wiley & Sons, Ltd.     

Joint problem of power optimal connectivity and coverage in wireless sensor networks

This work considers a multi-hop sensor network and addresses the problem of minimizing power consumption in each sensor node locally while ensuring two global (i.e., network wide) properties: (i) communication connectivity, and (ii) sensing coverage. A sensor node saves energy by suspending its sensing and communication activities according to a Markovian stochastic process. We show that a power level to induce a coverage radius is sufficient for connectivity provided that w(n)→∞. The paper presents a Markov model and its solution for steady state distributions to determine the operation of a single node. Given the steady state probabilities, we construct a non-linear optimization problem to minimize the power consumption. Simulation studies to examine the collective behavior of large number of sensor nodes produce results that are predicted by the analytical model.     

分布式视频编码技术的研究现状及其展望

分布式视频编码(DVC)是建立在多信源信息编码理论基础上的一种新的视频编码榧架。在对目前分布式编码文献进行分析和综合基础之上,本文首先阐述了分布式视频编码的理论基础和应用背景,然后分析介绍了目前几种典型的分布式编码算法,给出了空间域Wyner-Ziv视频编码和频域wyner-Ziv视频编码的仿真结果和分析,最后对当的影响分布式编码的几个关键问题进行剖析和展望。     

Successively Structured Gaussian Two-terminal Source Coding

Multiterminal source coding refers to separate encoding and joint decoding of multiple correlated sources. Joint decoding requires all the messages to be decoded simultaneously which is exponentially more complex than a sequence of single-message decodings. Inspired by previous work on successive coding, we apply the successive Wyner-Ziv coding, which is inherently a low complexity approach of obtaining a prescribed distortion, to the two-terminal source coding scheme. First, we consider 1-helper problem where one source provides partial side information to the decoder to help the reconstruction of the main source. Our results show that the successive coding strategy is an optimal strategy in the sense of achieving the rate-distortion function. By developing connections between source encoding and data fusion steps, it is shown that the whole rate-distortion region for the 2-terminal source coding problem is achievable using the successive coding strategy. Comparing the performance of the sequential coding with the performance of the successive coding, we show that there is no sum-rate loss when the side information is not available at the encoder. This result is of special interest in some applications such as video coding where there are processing and storage constraints at the encoder. Finally, we provide an achievable rate-distortion region for the m-terminal source coding.

认知网中感知时间和功率控制的联合优化机制

针对认知无线网中为了最大化认知用户的吞吐量问题,提出了一种感知时间和功率控制的联合优化机制。该机制保证认知系统在低于一定干扰限制下,将认知用户吞吐量描述成为一个多约束优化问题,从理论上分析了最优功率分配方案与最优感知时间分配方案。根据理论分析结果,设计了联合迭代机制通过确定合适的感知参数从而达到最大化认知用户吞吐量的目的。仿真结果表明：提出的联合优化机制复杂度较低,并且该方案的认知吞吐量性能最接近理论最优方案的性能。     

多进制霍夫曼编码方法及最优性证明

信源编码最常用的翟夫曼可变长编码是性能最优的唯一可译即时码。在讨论编码方法时常以二进制为例进行。多进制的霍夫曼编码如何进行,怎样证明得到的编码一定是平均码长最短的唯一可译即时码,是本文讨论和证明的主题。     

水火电力系统节能调度模型与优化方法研究

本文针对水火电力系统节能调度模型与优化方法进行分析研究.     

Optimal power and subcarrier allocation with partial side information for downlink OFDMA system

In this paper,we investigate the power and subcarrier allocation issue in the case of partial side information for downlink orthogonal frequency division multiple access(OFDMA)system.Relaxation method is utilized to characterize the necessary conditions of the optimal solution and the uniqueness of the optimal solution is proved.The game theoretical concept,surplus function is also introduced to analyze the optimal solution.Based on the theoretical analysis,we propose iterative surplus balancing algorithm(ISBA)that can jointly assign the power and subcarriers in multiple rounds,and then the optimality of ISBA is proved.Simulation results are presented to show the characteristics of the theoretical analysis and ISBA.     

Joint optimization of time and frequency synchronization based on polynomial sequences for OFDM systems

In orthogonal frequency division multiplexing (OFDM) systems, time and frequency synchronization are two critical elements for guaranteeing the orthogonality of OFDM subcarriers. Conventionally, with the employment of pseudo-noise (PN) sequences in preamble design, the preamble information is not fully utilized in both symbol timing offset acquisition and carrier frequency offset estimation. In this article, a new synchronization algorithm is proposed for jointly optimizing the time and frequency synchronization. This algorithm uses polynomial sequences as synchronization preamble instead of PN sequences. Theoretical analysis and simulation results indicate that the proposed algorithm is much more accurate and reliable than other existing methods.     

Adaptive power control and beam-forming joint optimization in cognitive radio networks

A novel adaptive power control and beam-forming joint optimization algorithm is proposed in cognitive radio(CR) underlay networks,where cognitive network share spectrum with primary network which spectrum is licensed.In this paper,both primary base station(PBS) and cognitive base station(CBS) are all equipped with multi antennas,while each primary user(PU) and cognitive user(CU) has only one antenna.Different from traditional algorithms,an adaptive weight factor generating solution is supplied to different access users(both PUs and CUs) in this paper,and the different priority of users is also considered,because PUs have higher priority,the weight factor of PUs is fixed as constant and signal-to-interference and noise ratio(SINR) threshold is unchanged,while for CUs,it is set adaptively and SINR threshold is also changed accordingly.Using this algorithm,the transmit power is decreased,which relax the strict requirements for power amplifier in communication systems.And moreover,owing to PUS has fixed SINR threshold,the calculated SINR at receiver is nearly unchanged,but for CUs,the SINR is changing with the adaptive weight factor.Under the assurance of quality of service(QoS) of PUs,the solution in this paper can enable CRs access to the CR network according to adaptive SINR threshold,therefore which supplies higher spectrum utilization efficiency.     

卫星通信系统中功率与时隙资源联合分配算法

提出联合优化卫星通信系统中的功率和时隙资源的方法,以提高星上有限资源的使用能效。挖掘了功率和时隙资源在容量提升上的相互补充相互依存关系,考虑了多个地球站的信道条件和容量需求的差异性,建立了资源联合分配的状态组合模型,以适应各地球站的多资源利用模式。并以最大化能效为目标,设计了联合分配的迭代对偶优化（IDO）算法,以较低复杂度获得了最优联合分配方案。仿真分析表明,资源联合优化比非联合优化提高了能量利用效率,尤其在频率资源（载波数目）较少时优势更加明显。     

Joint optimization method of failure probability and fiber-link load balancing in flexible bandwidth optical network

In order to gain insight into the relationship between the failure probability and the spectrum efficiency,both failure probability (FP) and load balancing (LB) were attempted to minimize in flexible bandwidth optical networks.An optimized FP-LB algorithm was developed to reduce failure probability and to improve the spectrum efficiency,and a traditional algorithm was further introduced for comparison in flexible bandwidth optical networks.Simulation results show that the optimized FP-LB algorithm reduces 69.8% blocking probability,45.3% spectrum occupancy rate,and 41.9% average failure probability compared to the traditional algorithm.Obviously,the optimized FP-LB algorithm achieves the joint optimization of both failure probability and load balancing.     

Time and power scheduling in an ad hoc network with bidirectional relaying and network coding

Network coding (NC) is a technique that allows intermediate nodes to combine the received packets from multiple links and forwarded to subsequent nodes. Compared with pure relaying, using NC in a wireless network, one can potentially improve the network throughput, but it increases the complexity of resource allocations as the quality of one transmission is often affected by the transmission conditions of multiple links. In this paper, we consider an ad hoc network, where all the links have bidirectional communications, and a relay node forwards traffic between the source and the destination nodes using NC. All transmissions share the same frequency channel, and simultaneous transmissions cause interference to each other. We consider both digital NC and analog NC strategies, referred to as DNC and ANC, respectively, and schedule transmission time and power of the nodes in order to maximize the overall network throughput. For DNC, an optimum scheduling is formulated and solved by assuming that a central controller is available to collect all the link gain information and make the scheduling decisions. Distributed scheduling schemes are proposed for networks using DNC and ANC. Our results indicate that the proposed scheduling scheme for DNC achieves higher throughput than pure relaying, and the scheduling scheme for ANC can achieve higher throughput than both DNC and pure relaying under certain conditions. Copyright © 2013 John Wiley & Sons, Ltd.