8818412
A Counterexample to Cover's$2P$Conjecture on Gaussian Feedback Capacity
We provide a counterexample to Cover's conjecture that the feedback capacity CFB of an additive Gaussian noise channel under power constraint P be no greater than the nonfeedback capacity C of the same channel under power constraint 2P, i.e., CFB(P) les C(2P)
8966837
Channel capacity and state estimation for state-dependent Gaussian channels
We formulate a problem of state information transmission over a state-dependent channel with states known at the transmitter. In particular, we solve a problem of minimizing the mean-squared channel state estimation error E/spl par/S/sup n/ - S/spl circ//sup n//spl par/ for a state-dependent additive Gaussian channel Y/sup n/ = X/sup n/ + S/sup n/ + Z/sup n/ with an independent and identically distributed (i.i.d.) Gaussian state sequence S/sup n/ = (S/sub 1/, ..., S/sub n/) known at the transmitter and an unknown i.i.d. additive Gaussian noise Z/sup n/. We show that a simple technique of direct state amplification (i.e., X/sup n/ = /spl alpha/S/sup n/), where the transmitter uses its entire power budget to amplify the channel state, yields the minimum mean-squared state estimation error. This same channel can also be used to send additional independent information at the expense of a higher channel state estimation error. We characterize the optimal tradeoff between the rate R of the independent information that can be reliably transmitted and the mean-squared state estimation error D. We show that any optimal (R, D) tradeoff pair can be achieved via a simple power-sharing technique, whereby the transmitter power is appropriately allocated between pure information transmission and state amplification.
80432
Resource sharing and pipelining in coarse-grained reconfigurable architecture for domain-specific optimization
Coarse-grained reconfigurable architectures aim to achieve goals of both high performance and flexibility. However, existing reconfigurable array architectures require many resources without considering the specific application domain. Functional resources that take long latency and/or large area can be pipelined and/or shared among the processing elements. Therefore, the hardware cost and the delay can be effectively reduced without any performance degradation for some application domains. We suggest such a reconfigurable array architecture template and a design space exploration flow for domain-specific optimization. Experimental results show that our approach is much more efficient, in both performance and area, compared to existing reconfigurable architectures.
199790
Secure group communication using robust contributory key agreement
Contributory group key agreement protocols generate group keys based on contributions of all group members. Particularly appropriate for relatively small collaborative peer groups, these protocols are resilient to many types of attacks. Unlike most group key distribution protocols, contributory group key agreement protocols offer strong security properties such as key independence and perfect forward secrecy. We present the first robust contributory key agreement protocol resilient to any sequence of group changes. The protocol, based on the Group Diffie-Hellman contributory key agreement, uses the services of a group communication system supporting virtual synchrony semantics. We prove that it provides both virtual synchrony and the security properties of Group Diffie-Hellman, in the presence of any sequence of (potentially cascading) node failures, recoveries, network partitions, and heals. We implemented a secure group communication service, Secure Spread, based on our robust key agreement protocol and Spread group communication system. To illustrate its practicality, we compare the costs of establishing a secure group with the proposed protocol and a protocol based on centralized group key management, adapted to offer equivalent security properties.
43170896
MCCA: A high-throughput MAC strategy for next-generation WLANs
Wireless LAN technology has been shown to he a revolutionary development during the last decade. Recently popularized IEEE 802.11a/g-based products can support up to 54 Mb/s physical layer rate and provide wireless access to the Internet. However, in order to deal robustly with the unreliable wireless nature, the 802.11 medium access control protocol has a relatively large overhead and hence, the throughput performance is much worse than the underlying physical layer rate. Moreover, along with many emerging applications and services over WLANs, such as voice over WLAN and audio/video streaming, the demand lor faster and higher- capacity WLANs has been growing recently. In this article, we propose a new medium access control protocol for the next-generation high-speed WLANs. The proposed medium access control, called multi-user polling controlled channel access, is composed of two components: multi-layer frame aggregation, which performs aggregation at both the medium access control and the physical layers; and multi-user polling, used to reduce the contention overhead and in turn, achieve higher network utilization. Multi-user polling controlled channel access is compared with the 802.11e-enhanced distributed channel access medium access control. Highly enhanced medium access control efficiency can be achieved by applying multi-user polling controlled channel access. We show the improved medium access control performance in terms of the aggregate throughput of non-QoS Hows with relevant QoS requirements.
15690106
Genetic Search For Fixed Channel Assignment Problem With Limited Bandwidth
We propose a hybrid genetic algorithm for the fixed channel assignment problem with limited bandwidth. A local optimization algorithm was devised to enhance the genetic algorithm's fine-tunning. In a matrix representation, the local optimization algorithm improves on a chromosome by horizontal and vertical moves of channels. The crossover is directly performed on two-dimensional matrices. Experimental results showed dramatic improvement against previous works.
284019
Simple and fault-tolerant key agreement for dynamic collaborative groups
Secure group communication is an increasingly popular research area having received much attention in recent years. The fundamental challenge revolves around secure and efcient group key management. While centralized methods are often appropriate for key distribution in large groups, many collaborative group settings require distributed key agreement techniques. This work investigates a novel approach to group key agreement by blending binary key trees with DiAEe-Hellman key exchange. The resultant protocol suite is very simple, secure and fault-tolerant. Moreover, its eAEciency surpasses that of prior art.