scispace - formally typeset
Search or ask a question
Topic

Communication channel

About: Communication channel is a research topic. Over the lifetime, 137411 publications have been published within this topic receiving 1715077 citations. The topic is also known as: communication channel & communications channel.


Papers
More filters
Posted Content
TL;DR: This paper considers optimization of point-to-point data transmission with an energy harvesting transmitter which has a limited battery capacity, communicating in a wireless fading channel, and introduces a directional water-filling algorithm which provides a simple and concise interpretation of the necessary optimality conditions.
Abstract: Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the nodes can harvest energy throughout the duration in which communication takes place. As such, transmission policies of the nodes need to adapt to these harvested energy arrivals. In this paper, we consider optimization of point-to-point data transmission with an energy harvesting transmitter which has a limited battery capacity, communicating in a wireless fading channel. We consider two objectives: maximizing the throughput by a deadline, and minimizing the transmission completion time of the communication session. We optimize these objectives by controlling the time sequence of transmit powers subject to energy storage capacity and causality constraints. We, first, study optimal offline policies. We introduce a directional water-filling algorithm which provides a simple and concise interpretation of the necessary optimality conditions. We show the optimality of an adaptive directional water-filling algorithm for the throughput maximization problem. We solve the transmission completion time minimization problem by utilizing its equivalence to its throughput maximization counterpart. Next, we consider online policies. We use stochastic dynamic programming to solve for the optimal online policy that maximizes the average number of bits delivered by a deadline under stochastic fading and energy arrival processes with causal channel state feedback. We also propose near-optimal policies with reduced complexity, and numerically study their performances along with the performances of the offline and online optimal policies under various different configurations.

950 citations

Journal ArticleDOI
TL;DR: The iterative water-filling algorithm can be implemented distributively without the need for centralized control, and it reaches a competitively optimal power allocation by offering an opportunity for loops to negotiate the best use of power and frequency with each other.
Abstract: This paper considers the multiuser power control problem in a frequency-selective interference channel. The interference channel is modeled as a noncooperative game, and the existence and uniqueness of a Nash equilibrium are established for a two-player version of the game. An iterative water-filling algorithm is proposed to efficiently reach the Nash equilibrium. The iterative water-filling algorithm can be implemented distributively without the need for centralized control. It implicitly takes into account the loop transfer functions and cross couplings, and it reaches a competitively optimal power allocation by offering an opportunity for loops to negotiate the best use of power and frequency with each other. When applied to the upstream power backoff problem in very-high bit-rate digital subscriber lines and the downstream spectral compatibility problem in asymmetric digital subscriber lines, the new power control algorithm is found to give a significant performance improvement when compared with existing methods.

946 citations

Journal ArticleDOI
TL;DR: This work proposes a general approach to differential modulation for multiple transmit antennas based on group codes, which can be applied to any number of transmit and receive antennas, and any signal constellation, and can be demodulated with or without channel estimates.
Abstract: Space-time coding and modulation exploit the presence of multiple transmit antennas to improve the performance on multipath radio channels Thus far, most work on space-time coding has assumed that perfect channel estimates are available at the receiver In certain situations, however, it may be difficult or costly to estimate the channel accurately, in which case it is natural to consider the design of modulation techniques that do not require channel estimates at the transmitter or receiver We propose a general approach to differential modulation for multiple transmit antennas based on group codes This approach ran be applied to any number of transmit and receive antennas, and any signal constellation We also derive low-complexity differential receivers, error bounds, and modulator design criteria, which we use to construct optimal differential modulation schemes for two transmit antennas These schemes can be demodulated with or without channel estimates This permits the receiver to exploit channel estimates when they are available The performance degrades by approximately 3 dB when estimates are not available

944 citations

Journal ArticleDOI
TL;DR: In this article, the secrecy capacity region of the fading broadcast channel with confidential messages (BCC) was investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1.
Abstract: The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established, which gives the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. The ergodic performance is first studied. The ergodic secrecy capacity region and the optimal power allocations that achieve the boundary of this region are derived. The outage performance is then studied, where a long-term power constraint is assumed. The power allocation is derived that minimizes the outage probability where either the target rate of the common message or the target rate of the confidential message is not achieved. The power allocation is also derived that minimizes the outage probability where the target rate of the confidential message is not achieved subject to the constraint that the target rate of the common message must be achieved for all channel states.

942 citations

Proceedings ArticleDOI
04 Oct 2004
TL;DR: A key finding is that for radios using narrow-band modulation, the transitional region is not an artifact of the radio non-ideality, as it would exist even with perfect-threshold receivers because of multi-path fading.
Abstract: The wireless sensor networks community, has now an increased understanding of the need for realistic link layer models. Recent experimental studies have shown that real deployments have a "transitional region" with highly unreliable links, and that therefore the idealized perfect-reception-within-range models used in common network simulation tools can be very misleading. In this paper, we use mathematical techniques from communication theory to model and analyze the low power wireless links. The primary contribution of this work is the identification of the causes of the transitional region, and a quantification of their influence. Specifically, we derive expressions for the packet reception rate as a function of distance, and for the width of the transitional region. These expressions incorporate important channel and radio parameters such as the path loss exponent and shadowing variance of the channel; and the modulation and encoding of the radio. A key finding is that for radios using narrow-band modulation, the transitional region is not an artifact of the radio non-ideality, as it would exist even with perfect-threshold receivers because of multi-path fading. However, we hypothesize that radios with mechanisms to combat multi-path effects, such as spread-spectrum and diversity techniques, can reduce the transitional region.

942 citations


Network Information
Related Topics (5)
Wireless
133.4K papers, 1.9M citations
88% related
Network packet
159.7K papers, 2.2M citations
86% related
Wireless network
122.5K papers, 2.1M citations
84% related
Node (networking)
158.3K papers, 1.7M citations
83% related
Wireless sensor network
142K papers, 2.4M citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202270
20214,425
20206,535
20197,160
20187,052
20176,315