Power control strategies for multichannel cognitive wireless networks with Opportunistic Interference Cancellation

In this letter, an Opportunistic Interference Cancellation （OIC） is first introduced as a rate control strategy for secondary user in cognitive wireless networks. Based on the OIC rate control method, an optimal power control strategy for multichannel cognitive wireless networks is proposed. The algorithm aims to maximize the total transmit rate of cognitive user through appropriately controlling the transmit power of each subchannel under the constraint that the interference temperature at the primary receiver is below a certain threshold. Three suboptimal power control methods, namely Equal Power Transmission （EPT）, Equal Rate Transmission （ERT） and Equal Interference Transmission （EIT）, are also proposed. The performances of the proposed power control methods are compared through numerical simulations.     

Opportunistic distributed power control with adaptive QoS and fairness for wireless networks

This paper presents a class of distributed power control algorithms for wireless networks which provides quality of service (QoS) fulfillment by exploiting the channel variability opportunistically. It is suitable for traffic sources requiring either a minimum or a prescribed QoS provision, and at the same time provides a fair resource allocation. Practical system constraints such as limitations on transmission power and modulation and coding schemes are considered in this framework. Moreover, it is analytically shown to be more energy efficient than the opportunistic power control. Two algorithms of this class are described and have their performance confronted with opportunistic algorithms. Copyright © 2009 John Wiley & Sons, Ltd.     

Opportunistic call admission control for wireless broadband cognitive networks

Wireless Broadband Cognitive Networks (WBCN) are new trend to better utilization of spectrum and resources. However, in multiservice WBCN networks, call admission control (CAC) is a challenging point to effectively control different traffic loads and prevent the network from being overloaded and thus provide promised quality of service. In this paper, we propose a CAC framework and formulate it as an optimization problem, where the demands of both WBCN service providers and cognitive subscribers are taken into account. To solve the optimization problem, we developed an opportunistic multivariate CAC algorithm based on a joint optimization of utility, weighted fairness, and greedy revenue algorithms. Extensive simulation results show that, the proposed call admission control framework can meet the expectations of both service providers and subscribers in wireless broadband cognitive networks.     

Asymmetric radio resource allocation scheme for OFDMA wireless networks with collaborative relays

This work addresses the radio resource allocation problem for cooperative relay assisted OFDMA wireless network. The relays adopt the decode-and-forward protocol and can cooperatively assist the transmission from source to destination. Recent works on the subject have mainly considered symmetric source-to-relay and relay-to-destination resource allocations, which limits the achievable gains through relaying. In this paper we consider the problem of asymmetric radio resource allocation, where the objective is to maximize the system throughput of the source-to-destination link under various constraints. In particular, we consider optimization of the set of cooperative relays and link asymmetries together with subcarrier and power allocation. We derive theoretical expressions for the solutions and illustrate them through simulations. The results show clear additional performance gains through asymmetric cooperative scheme compared to the other recently proposed resource allocation schemes.     

An Aloha protocol for multihop mobile wireless networks

An Aloha-type access control mechanism for large mobile, multihop, wireless networks is defined and analyzed. This access scheme is designed for the multihop context, where it is important to find a compromise between the spatial density of communications and the range of each transmission. More precisely, the analysis aims at optimizing the product of the number of simultaneously successful transmissions per unit of space (spatial reuse) by the average range of each transmission. The optimization is obtained via an averaging over all Poisson configurations for the location of interfering mobiles, where an exact evaluation of signal over noise ratio is possible. The main mathematical tools stem from stochastic geometry and are spatial versions of the so-called additive and max shot noise processes. The resulting medium access control (MAC) protocol exhibits some interesting properties. First, it can be implemented in a decentralized way provided some local geographic information is available to the mobiles. In addition, its transport capacity is proportional to the square root of the density of mobiles which is the upper bound of Gupta and Kumar. Finally, this protocol is self-adapting to the node density and it does not require prior knowledge of this density.     

A distributed control strategy for wireless ATM networks

Cellular networks are expected to be upgraded to offer Personal Communication Services (PCS). The mobility management and wireless call control approach used in cellular networks are currently being proposed for use in PCS networks. Recent work indicates that both the signaling load and database update rates caused by these mobility management and call control procedures will increase significantly in next generation PCS networks. In this paper, we propose and analyze a new cluster-based architecture and define algorithms to effectively handle mobility management and call control functions for PCS. We assume an ATM network infrastructure. Some of the key aspects of our proposal include simplifying the mobile location and tracking function, performing connection setup in segments, eliminating the need for user service profile downloads between networks, and more efficient routing of connections by removing the need for an anchor switch. Advantages of this approach include a reduction in signaling traffic load, improved call/connection setup delays, and more efficient routing of connections. We carry out an analysis of our solution for high-tier PCS applications.     

基于信息覆盖的无线传感器网络访问控制机制

通过周期性地信息扩散,设计THC(two-hop cover)算法,使传感器节点能够在用户移动过程中及时得到用户的认证信息.基于THC算法,引入Merkle散列树和单向链等安全机制,采用分布式的访问控制模式,提出了适用于随机移动用户的传感器网络访问控制机制.分析和实验表明,本机制既适用移动用户,也适用静止用户,计算、通信、存储开销低,能够抵制节点捕获、重放、DoS等攻击.     

Distributed multichannel assignment with congestion control in wireless mesh networks

In Multichannel Wireless Mesh Network architecture, topology discovery, traffic profiling, channel assignment and routing are essential. From the existing work done so far, we can observe that no work has been carried out on the combined solution of multichannel assignment with routing protocol and congestion control. In this paper, we propose to design a Distributed Multichannel Assignment with Congestion control (DMAC) routing protocol. In this protocol, a traffic‐aware metric provides the solution for multichannel assignment and congestion control. Hence, the proposed protocol can improve the throughput and channel utilization to a very high extent. The proposed algorithm avoids self‐interference by not assigning a channel to any link whose incident links have already been assigned channels. By our simulation results, we show that our proposed protocol attains high throughput and delivery ratio along with reduced delay. Copyright © 2011 John Wiley & Sons, Ltd.     

A generalized framework for distributed power control in wireless networks

Most power control algorithms that aim at hitting a signal-to-interference ratio (SIR) target fall within Yates' framework. However, for delay-tolerable applications, it is unnecessary to maintain the SIR at a certain level all the time. To maximize throughput, one should increase one's power when the interference level is low, and the information transmission rate is adjusted accordingly by adaptive modulation and coding techniques. This approach is called opportunistic communications. In this paper, we generalize Yates' result and establish a new framework, which is applicable to systems supporting opportunistic communications and with heterogeneous service requirements. Simulation results show that our proposed algorithm yields significant improvement in throughput when compared with the conventional target tracking approach.     

Rate control with distributed joint diversity and power control for wireless networks

Two rate control algorithms with distributed joint diversity and power control are proposed for wireless networks. We prove that with the proposed algorithms, the allowed transmitting rate can converge to the individual rate requirement with which the QoS requirement can be satisfied, and each user can share the bandwidth according to the pre-specified setting so that certain fairness can be maintained among the users in the same cell. Simulation results also show that the scheme with rate control gains larger throughput than the scheme without rate control.     

无线传感器网络的簇头功率控制技术

在军事侦察与环境监测中,无线传感器网络一般部署在无人区域或危险区域,不能依靠人对系统进行配置与管理.网络节点通过撒播造成分簇后密度不均,影响了网络性能.由于同簇节点通信使用同一信道,簇的大小直接关系到每个节点的通信能力.当簇内节点个数处于一个合适的范围时,网络才能发挥最好的性能.因此需要对簇头进行功率控制来优化网络结构.针对这一缺乏准确数学模型的过程,提出一种基于PID的模糊自适应的变步长簇头功率控制方案,把簇内节点数目控制在一个合理的范围内.其特点是概念简单、易于理解和提高系统的鲁棒性,仿真结果从理论上证明了通过控制分簇大小以后,网络的寿命和通信能力都有所增加.     

Multichannel random access in OFDMA wireless networks

Orthogonal frequency-division multiple access (OFDMA) systems are considered promising candidates for implementing next-generation wireless communication systems. They provide multiple channels that can be accessed via random access schemes. However, traditional random access schemes could result in an excessive amount of access delay. To address this issue, we develop a fast retrial scheme that is based on slotted Aloha and exploits the structure of OFDMA. A salient feature of this scheme is that when collisions occur instead of retrials occuring randomly in time, they occur randomly in frequency, i.e., the scheme randomly selects the subchannels for retrial. To further achieve fast access, retrials are designed to follow the 1-persistent type, i.e., no exponential backoff. To achieve the maximum throughput, we limit the maximum number of allowed retrials according to the load condition. We also consider the issue of designing for an appropriate reuse factor for random access channels in order to overcome the intercell interference problem in OFDMA multicell environments. Our finding is that full sharing, i.e., a reuse factor of one, performs best for given random access channels. Through analysis and simulation, we confirm that our fast retrial algorithm has the advantage of high throughput and low access delay, and the full sharing policy for random access channels shows high throughput as well as low collision.     

A distributed mobility control scheme in LISP networks

The locator identifier separation protocol (LISP) has been made as an identifier-locator separation scheme for scalable Internet routing. However, the LISP was originally designed for fixed network environment, rather than for mobile network environment. In particular, the existing LISP mobility control schemes use a centralized map server to process all the control traffics, and thus they are intrinsically subject to some limitations in mobile environment, such as large overhead of mapping control traffics at central map server and degradation of handover performance. To overcome these problems, we propose a distributed mobility control scheme in LISP networks. In the proposed scheme, we assume that a mobile host has a hierarchical endpoint identifier which contains the information of its home network domain. Each domain has a distributed map server (DMS) for distributed mapping management of Endpoint Identifiers (EIDs) and Locators (LOCs). For roaming support, each DMS maintains a home EID register and a visiting EID register which are used to keep the EID-LOC mappings for mobile hosts in the distributed manner. For performance analysis, we compare the control traffic overhead (CTO) at map servers, the signaling delay required for EID-LOC mapping management, and the handover delay for the existing and proposed schemes. From numerical results, it is shown that the proposed distributed scheme can give better performance than the existing centralized schemes in terms of CTO, total signaling delay for EID-LOC mapping management, and handover delay.     

Opportunistic multichannel driving scheme for low power mobile TFT-LCD driver IC

A novel source driving scheme called opportunistic multichannel driving (OMCD) is proposed for use in mobile TFT-LCD driver ICs (T-LDIs). In the OMCD scheme, the operation of the source drivers of a T-LDI is controlled by the equivalence of RGB colour data for adjacent pixels. That is, one source driver drives the neighbouring source lines as well as the corresponding one when the colour data of adjacent pixcels are identical to each other. With this scheme, all the source drivers associated with the neighbouring source lines can be completely turned off, allowing the reduction of static and dynamic current of these drivers. A test chip was fabricated in a 5 V/0.8 /spl mu/m 2.5 V/0.25 /spl mu/m triple-metal CMOS process, and the experimental result shows that the power reduction of 12-21% was obtained with die size overhead less than 0.5%.     

On distributed power control in full duplex wireless networks

In this paper, we first consider the problem of distributed power control in a Full Duplex (FD) wireless network consisting of multiple pairs of nodes, within which each node needs to communicate with its corresponding node. We aim to find the optimal transmition power for the FD transmitters such that the network-wide capacity is maximized. Based on the high Signal-to-Interference-Plus-Noise Ratio (SINR) approximation and a more general approximation method for logarithm functions, we develop effective distributed power control algorithms with the dual decomposition approach. We also extend the work to the general FD network scenario, which can be decomposed into subproblems of isolated nodes, paths, and cycles. The corresponding power control problem is then be solved with the distributed algorithm. The proposed algorithms are validated with simulation studies.     

Multiservice allocation for multiaccess wireless systems

This paper discusses principles for allocating multiple bearer services onto different subsystems in multiaccess wireless systems. Based on the included subsystem's multiservice capacities, under certain constraints near-optimum subsystem service allocations that maximize combined multiservice capacity are derived through simple optimization procedures. These favorable service allocations are either extreme points where services, as far as possible, are allocated to the subsystems best at supporting them, or they are characterized by the relative efficiency of supporting services being equal in all subsystems. The consequences of this include that services should typically be mixed in subsystems with convex capacity regions and isolated in subsystems with concave capacity regions. Simple user assignment algorithms based on this are also discussed. Additionally, illustrating the main findings of the analysis, some system examples are given, including a case study with combined global system for mobile communications (GSM) and wideband code-division multiple-access (WCDMA) systems. The gain of using the proposed service allocation principles compared to a reference case of maintaining equal service mixes in all subsystems depends on the shape of the subsystem capacity regions; the more different the capacity regions, the larger the gain. In the GSM and WCDMA case study, capacity gains of up to 100% in terms of supported data users for a fixed voice traffic load are achieved.     

ARC: the analytical rate control scheme for real-time traffic in wireless networks

Next-generation wireless Internet (NGWI) is expected to provide a wide range of services including real-time multimedia to mobile users. However, the real-time multimedia traffic transport requires rate control deployment to protect shared Internet from unfairness and further congestion collapse. The transmission rate control method must also achieve high throughput and satisfy multimedia requirements such as delay or jitter bound. However, the existing solutions are mostly for the wired Internet, and hence, they do not address the challenges in the wireless environments which are characterized by high bit error rates. In this paper, a new analytical rate control (ARC) protocol for real-time multimedia traffic over wireless networks is presented. It is intended to achieve high throughput and multimedia support for real-time traffic flows while preserving fairness to the TCP sources sharing the same wired link resources. Based on the end-to-end path model, the desired behavior of a TCP source over lossy links is captured via renewal theory. The resulting asymptotic throughput equation is designated as the driving equation for the proposed rate control method. Performance evaluation via simulation experiments reveals that ARC achieves high throughput and meets multimedia traffic expectations without violating good citizenship rules for the shared Internet.     

MobiCast: A multicast scheme for wireless networks

In this paper, we propose a multicast scheme known as MobiCast that is suitable for mobile hosts in an internetwork environment with small wireless cells. Our scheme adopts a hierarchical mobility management approach to isolate the mobility of the mobile hosts from the main multicast delivery tree. Each foreign domain has a domain foreign agent. We have simulated our scheme using the Network Simulator and the measurements show that our multicast scheme is effective in minimizing disruptions to a multicast session due to the handoffs of the mobile group member, as well as reducing packet loss when a mobile host crosses cell boundaries during a multicast session.     

A bit-map-assisted dynamic queue protocol for multiaccess wireless networks with multiple packet reception

A novel network-assisted (signal processing based) medium access control (MAC) protocol known as the bit-map-assisted dynamic queue (BMDQ) is presented. The protocol is explicitly designed for a wireless slotted system with multiple packet reception (MPR) capability. In the proposed protocol, the traffic in the channel is viewed as a flow of transmission periods (TPs). Each TP has a bit-map (BM) slot at the beginning followed by a data transmission period (DP). The BM slot is reserved for user detection so that accurate knowledge of the active user set (AUS) can be obtained. Then, given the knowledge of the AUS and the channel MPR matrix, the number of users that can access the channel simultaneously in each packet slot in the DP is chosen to maximize the conditional throughput of every packet slot. Compared with other conventional and network-assisted MAC protocols, the proposed BMDQ protocol yields better performance. Its maximum steady-state throughput is close to the channel MPR capacity, and it can achieve the same throughput with lower traffic load and smaller delay. Performance issues are investigated analytically and via simulations.     

OFDMA上行无线网络中资源块和功率的分配

正交频分复用多址接入(OFDMA)技术已经广泛应用于宽带无线网络,比如IEEE 802.16(WiMAX)和3GPP长期演进技术(LTE)。现有的提高系统吞吐量的主要方法是通过增加移动台的发射功率来提高移动台的传输速率。本文研究了在OFDMA无线网络上行传输中的资源块和功率联合分配问题。目标是满足基本传输要求前提下减少移动台的功率损耗。由于优化方程是NP-hard模型,所以本文利用注水技术的优势提出了一个启发式算法。仿真结果表明启发式算法性能接近最优解,特别是网络处于非饱和条件下。