A resilient buffer allocation scheme in active queue management: a stochastic cooperative game theoretic approach

During the last decade, a plentiful number of active queue management schemes have been proposed, but their main objectives are simply allocating the buffer resource to all flows evenly, or protecting responsive flows from being degraded by unresponsive flows. However, the sending rates of the responsive flows can be determined diversely, and not all unresponsive flows have aggressively high sending rates. Furthermore, it is rational to reserve a portion of the buffer resource for certain privileged traffic. Grounded by these evidences, in this paper, we present a resilient active queue management algorithm, named Prior‐Core‐based Buffer Allocation considering diverse congestion control algorithms, fair‐unresponsive flows, and some privileged traffic. Our approach is based on stochastic cooperative game theory, where the payoffs yielded by cooperation are described by random variables, and the core is defined only over the distribution of these random payoffs; the core in this situation is called the prior‐core. As a result, it is shown that our buffer allocation, yielded by the prior‐core, achieves completely fair allocation for those flows whose requirement does not exceed the fair‐share regardless of the responsiveness, whereas aggressive flows are restricted according to availability of the buffer; all these are verified through ns‐2 simulation experiments. Copyright © 2014 John Wiley & Sons, Ltd.     

Joint optimization of spectrum sensing and accessing in multiuser multiple‐input single‐output cognitive networks

In this paper, a joint spectrum sensing and accessing optimization framework for a multiuser cognitive network is proposed to significantly improve spectrum efficiency. For such a cognitive network, there are two important and limited resources that should be distributed in a comprehensive manner, namely feedback bits and time duration. First, regarding the feedback bits, there are two components: sensing component (used to convey various users' sensing results) and accessing component (used to feedback channel state information). A large sensing component can support more users to perform cooperative sensing, which results in high sensing precision. However, a large accessing component is preferred as well, as it has a direct impact on the performance in the multiuser cognitive network when multi‐antenna technique, such as zero‐forcing beamforming, is utilized. Second, the tradeoff of sensing and accessing duration in a transmission interval needs to be determined, so that the sum transmission rate is optimized while satisfying the interference constraint. In addition, the aforementioned two resources are interrelated and inversive under some conditions. Specifically, sensing time can be saved by utilizing more sensing feedback bits for a given performance objective. Hence, the resources should be allocation in a jointly manner. Based on the joint optimization framework and the intrinsic relationship between the two resources, we propose two joint resource allocation schemes by maximizing the average sum transmission rate in a multiuser multi‐antenna cognitive network. Simulation results show that, by adopting the joint resource allocation schemes, obvious performance gain can be obtained over the traditional fixed strategies.Copyright © 2014 John Wiley & Sons, Ltd.     

IPTV助推数字家庭时代的到来

不同行业都在关注数字家庭的发展，但数字家庭发展缓慢的现状不容忽视。现阶段来看通信和媒体娱乐业务是数字家庭市场需求的重点，基于电信网络的数字家庭通过借助IPTV的音视频和增值应用业务可以顺应此要求。IPTV业务包括基本的音视频广播、点播、时移业务，以及信息服务、音视频通信、互动游戏、即时通讯、卡拉OK、远程教育等增值应用服务，非常适合数字家庭的发展需要，将使数字家庭的应用变得更为现实。未来，进一步推动数字家庭发展需要在易用性和业务创新两个方面取得突破，需要通过设备间的协同工作，为用户提供基于数据、语音、视频的三重业务新体验。     

异步协作通信中三协作方信道与延迟估计算法

无线通信是采用多节点协作分集方式发送信号的,故具有很大的优势,但缺点是所传输的信号是异步的,因此采用协作分集方式发送信号亟需消除这种异步的影响。为此,给出了块平坦衰落信道延迟估计算法,采用训练序列附加在信息码上作为循环前缀,通过循环前缀来获得已知符号,再利用已知符号来消除异步。结果表明,该方案完全能消除异步,信道估计达到了克拉默拉奥下限,误码率和MRC（最大比合并）方式相同,且带有完全的分集阶数,初步达到了消除信号异步影响的目的。     

协同作战系统的时间同步

协同作战中需要高精度的时间同步将各站点在同一时间获得的信息融合,从而获得精确的敌方目标态势图来作出相应的对策。结合传统算法TPSN中的同步封包交换及FPST中的根节点动态选取,设计在无GPS授时状态下,协同作战系统中适用的时间同步算法及具体的同步方案。保证了同步网络的健壮性及伸缩性,其理论上可达到的同步精度符合协同作战的需求。     

Resource allocation using time division multiple access over wireless relay networks

This article considers a wireless network consisting of multiple sources that communicate with the corresponding destination utilizing a single half-duplex relay, whereas, the sources use the relay opportunistically. By integrating the information theory with the concept of effective capacity, this article proposes a dynamic time allocation strategy over the wireless relay network that aims at maximizing the relay network throughput, subject to a given delay quality of service （QoS） constraint, where time division multiple access （TDMA） is applied in the relay network. The simulation results show that the proposed allocation strategy can significantly improve the effective capacity as compared to the traditional equal time allocation strategy.     

无线Mesh网络可扩展性相关技术

无线移动通信中传输的数据密度持续增长对无线Mesh网络的系统性能提出了挑战。在无线自组织网络中,由于存在随着节点数目的增加而平均节点容量逐步降低的规律,因此无线Mesh网络的大规模组网难以实施。无线Mesh网络可扩展性对于增强无线Mesh网络的自适应组网能力至关重要,因此,文章对在Mesh基站和Mesh移动台上采用的与可扩展性相关的关键技术,如信道分配技术、智能路由技术、多天线技术、节点分类和QoS分级技术、协作传输技术等,进行了探讨。     

基于Turbo协同分集的通信方案的性能仿真

本文基于Turbo码和协同通信的相关理论,提出一种新的基于Turbo协同分集的协同通信方案。在加性高斯白噪声和瑞利快衰落的两种信道条件下的仿真结果表明,基于Turbo协同分集的协同通信方案比现有的基于Turbo编码的协同通信方案具有更优的误比特率性能。     

结构数字化样机在舰载雷达上的探索

随着数字化、网络化和三维技术的发展,雷达的结构设计从传统的CAD／CAE向全三维数字化协同设计和仿真的方向发展。本文对舰栽雷达结构数字化样机的建设进行了探索。通过协同研发平台实现了雷达研制过程中过程、工具、数据、知识的一体化管理,提高了雷达结构设计效率和质量。     

An analytical model for the performance evaluation of stack‐based Web cache replacement algorithms

Web caching has been the solution of choice to web latency problems. The efficiency of a Web cache is strongly affected by the replacement algorithm used to decide which objects to evict once the cache is saturated. Numerous web cache replacement algorithms have appeared in the literature. Despite their diversity, a large number of them belong to a class known as stack‐based algorithms. These algorithms are evaluated mainly via trace‐driven simulation. The very few analytical models reported in the literature were targeted at one particular replacement algorithm, namely least recently used (LRU) or least frequently used (LFU). Further they provide a formula for the evaluation of the Hit Ratio only. The main contribution of this paper is an analytical model for the performance evaluation of any stack‐based web cache replacement algorithm. The model provides formulae for the prediction of the object Hit Ratio, the byte Hit Ratio, and the delay saving ratio. The model is validated against extensive discrete event trace‐driven simulations of the three popular stack‐based algorithms, LRU, LFU, and SIZE, using NLANR and DEC traces. Results show that the analytical model achieves very good accuracy. The mean error deviation between analytical and simulation results is at most 6% for LRU, 6% for the LFU, and 10% for the SIZE stack‐based algorithms. Copyright © 2009 John Wiley & Sons, Ltd.