Effect of AMC on fixed‐rate traffic with hard delay constraints in mobile broadband systems

The adaptive modulation and coding (AMC) technique, which has been adopted by advanced mobile telecommunication systems, supports a flexible response to the random radio behaviour. As a result, the attained transmission rate over a wireless link is time varying. Hence, resource demands are not deterministic but fluctuating even for calls with constant bit rate service requirements. Consequently, constant bit rate calls are susceptible to a forced call termination because of insufficient resources not only in a target cell during inter‐cell handoffs but also in a serving cell during radio link deterioration. Furthermore, call blocking and dropping probabilities depend on radio propagation conditions among other factors and therefore they are dissimilar throughout a service area. The latter leads to unfairness problems. We analytically measure the impact of AMC on fixed‐rate service with hard delay constraints such as voice for different signal, mobility and traffic conditions. We consider a reference case (call requests are admitted into the system provided there are enough free resources) and two classes of admission control approaches: traditional (only inter‐cell handoffs are prioritised) and modified (all ongoing calls are prioritised). The reported results reveal conditions for which AMC affects voice call performance and can serve as guidelines on admission control design. Copyright © 2013 John Wiley & Sons, Ltd.     

A cross‐layer TCP for providing fairness in wireless mesh networks

The fair allocation of resources among different nodes is one of the critical problems in wireless mesh networks. Existing solutions mainly focus on rate‐limitation policies or distributed fair MAC schemes at the potential expense of total network utilization. This paper investigates a special starvation problem among TCP flows that are different hops away from the BS, as well as its recently proposed solution, the ‘Minimum Content Window’ policy based on IEEE 802.11e. It is found that the aggregate throughput degrades sharply because the effect of this policy on the TCP congestion mechanism has been overlooked. This paper proposes a priority‐based congestion control by using ‘Cross‐Layer Explicit Congestion Notification’. Analysis and simulation results demonstrate that our scheme can improve the fairness of TCP flows while the aggregate throughput is at least 20% higher than the ‘Minimum Content Window’ policy. Copyright © 2011 John Wiley & Sons, Ltd.     

具有完善机密性的可证实电子邮件协议

本文提出了一个具有完善保密性的可证实电子邮件协议ＰＣＣＭＰ,它不仅具有文（１）中协议的安全性,而且为电子邮件提供了完善的机密性,使包括邮局在内的任何第三方都不能了解电子的邮件的内容。     

基于身份公平的匿名多接收者签密方案

针对Lal等人所提出的基于身份的多接收者签密方案中存在的暴露接收者身份信息隐私性和解密不公平的问题,应用拉格拉日插值方法,提出一种满足接收者身份匿名性和解密公平性的新的多接收者签密方案。基于双线性 Diffie-Hellman 问题和计算 Diffie-Hellman 问题,对随机模预言模型下的 IND-sMIBSC-CCA2和EUF-sMIBSC-CMA的安全性进行了证明,验证本方案具有保密性和不可否认性。     

公平的多方并发签名方案

Tonien等在ISC2006上首次提出了多方并发签名体制,但Xie和谭指出Tonien等的方案并不满足公平性,进而分别重新构造了多方并发签名方案。分别对Xie和谭的多方并发签名方案进行了分析,指出他们的方案也不满足公平性,进而正式定义了公平多方并发签名的安全模型,并基于双线性对及多方密钥协商技术重新构造了一个多方并发签名方案。分析表明,在随机预言模型下,假设CDH问题是难解的,新方案同时满足正确性、不可伪造性、模糊性、并发性和公平性,并且与同类方案相比,新方案在签名长度、计算量、通信代价方面效率较高。     

Nash bargaining solution based multi-cell and multi-user interference alignment scheme for cellular networks

In wireless cellular networks, the interference alignment （IA） is a promising technique for interference management. A new IA scheme for downlink cellular network with multi-cell and multi-user was proposed, in the proposed scheme, the interference in the networks is divided into inter-cell interference （ICI） among cells and inter-user interference （IUI） in each cell. The ICI is aligned onto a multi-dimensional subspace by multiplying the ICI alignment precoding matrix which is designed by the singular value decomposition （SVD） scheme at the base station （BS） side. The aligned ICI is eliminated by timing the interference suppression matrix which is designed by zero-forcing （ZF） scheme at the user equipment （UE） side. Meanwhile, the IUI is aligned by multiplying the IUI alignment precoding matrix which is designed based on Nash bargaining solution （NBS） in game theory. The NBS is solved by the particle swarm optimization （PSO） method. Simulations show that, compared with the traditional ZF IA scheme, the proposed scheme can obtain higher data rate and guarantee the data rate fairness of UEs with little additional complexity.     

基于无线传感器网络的跨层拥塞控制协议

无线传感器网络(WSN)中由拥塞引起的大量分组重传以及重传多次失败后的分组丢弃会导致较长的时延、较高的分组丢失率和较多的能量消耗.为了准确探测和控制网络拥塞,提出了一种基于跨层设计的拥塞控制协议,即上行拥塞控制(UCC)协议.该协议利用节点在媒质接人控制(MAC)层中未占用的缓冲器区间大小和所预测的通信流量作为该节点的...     

Temporal fairness guarantee in multi-rate wireless LANs for per-flow protection

Wireless LAN technologies such as IEEE 802.11a and 802.11b support high bandwidth and multi-rate data transmission to match the channel condition (i.e., signal to noise ratio). While some wireless packet fair queuing algorithms to achieve the per-flow throughput fairness have been proposed, they are not appropriate for guaranteeing QoS in multi-rate wireless LAN environments. We propose a wireless packet scheduling algorithm that uses the multi-state (multi-rate) wireless channel model and performs packet scheduling by taking into account the channel usage time of each flow. The proposed algorithm aims at per-flow protection by providing equal channel usage time for each flow. To achieve the per-flow protection, we propose a temporally fair scheduling algorithm called Contention-Aware Temporally fair Scheduling (CATS) which provides equal channel usage time for each flow. Channel usage time is defined as the sum of the packet transmission time and the contention overhead time due to the CSMA/CA mechanism. The CATS algorithm provides per-flow protection in wireless LAN environments where the channel qualities of mobile stations are dynamic over time, and where the packet sizes are application-dependent. We also extend CATS to Decentralized-CATS (D-CATS) to provide per-flow protection in the uplink transmission. Using an NS-2 simulation, we evaluate the fairness property of both CATS and D-CATS in various scenarios. Simulation results show that the throughput of mobile stations with stable link conditions is not degraded by the mobility (or link instability) of other stations or by packet size variations. D-CATS also shows less delay and less delay jitter than FIFO. In addition, since D-CATS can coordinate the number of contending mobile stations, the overall throughput is not degraded as the number of mobile stations increases. This work was supported in part by the Brain Korea 21 project of Ministry of Education and in part by the National Research Laboratory project of Ministry of Science and Technology, 2004, Korea.     

Resource Allocation Algorithm for Multi‐cell Cognitive Radio Networks with Imperfect Spectrum Sensing and Proportional Fairness

This paper addresses the resource allocation (RA) problem in multi‐cell cognitive radio networks. Besides the interference power threshold to limit the interference on primary users PUs caused by cognitive users CUs, a proportional fairness constraint is used to guarantee fairness among multiple cognitive cells and the impact of imperfect spectrum sensing is taken into account. Additional constraints in typical real communication scenarios are also considered—such as a transmission power constraint of the cognitive base stations, unique subcarrier allocation to at most one CU, and others. The resulting RA problem belongs to the class of NP‐hard problems. A computationally efficient optimal algorithm cannot therefore be found. Consequently, we propose a suboptimal RA algorithm composed of two modules: a subcarrier allocation module implemented by the immune algorithm, and a power control module using an improved sub‐gradient method. To further enhance algorithm performance, these two modules are executed successively, and the sequence is repeated twice. We conduct extensive simulation experiments, which demonstrate that our proposed algorithm outperforms existing algorithms.     

基于共享资源量的动态多资源公平分配策略

针对云计算共享系统中多资源分配问题,提出一种基于共享资源量的动态多资源公平分配策略。该策略根据不同用户资源需求和共享资源量建立一个线性规划模型,同时证明该模型满足公平分配的4个重要属性：动态帕累托最优、激励共享、动态无嫉妒性和防止策略性操作,而且给出一种改进的动态多资源公平分配算法来提高算法运行效率。实验结果表明,所提动态多资源公平分配策略能够在满足任务资源需求的同时,尽可能保证公平分配下最大化占优资源份额,并且改进的分配算法能够有效地提高资源的分配效率。