Searcharxiv⌕ Search

arXiv subjects

H. Vincent Poor

Publications and source records attributed to H. Vincent Poor.

At least 901 records · Page 50Linked to original sources
arXiv2008

Energy Efficiency in Multi-Hop CDMA Networks: a Game Theoretic Analysis Considering Operating Costs

A game-theoretic analysis is used to study the effects of receiver choice and transmit power on the energy efficiency of multi-hop networks in which the nodes communicate using Direct-Sequence Code Division Multiple Access (DS-CDMA). A Nash equilibrium of the game in which the network nodes can choose their receivers as well as their transmit powers to maximize the total number of bits they transmit per unit of energy spent (including both transmit and operating energy) is derived. The energy efficiencies resulting from the use of different linear multiuser receivers in this context are compared for the non-cooperative game. Significant gains in energy efficiency are observed when multiuser receivers, particularly the linear minimum mean-square error (MMSE) receiver, are used instead of conventional matched filter receivers.

cs.IT↗
arXiv2008

Optimal Medium Access Control in Cognitive Radios: A Sequential Design Approach

The design of medium access control protocols for a cognitive user wishing to opportunistically exploit frequency bands within parts of the radio spectrum having multiple bands is considered. In the scenario under consideration, the availability probability of each channel is unknown a priori to the cognitive user. Hence efficient medium access strategies must strike a balance between exploring the availability of channels and exploiting the opportunities identified thus far. Using a sequential design approach, an optimal medium access strategy is derived. To avoid the prohibitive computational complexity of this optimal strategy, a low complexity asymptotically optimal strategy is also developed. The proposed strategy does not require any prior statistical knowledge about the traffic pattern on the different channels.

cs.IT↗
arXiv2008

Large Deviations Analysis for the Detection of 2D Hidden Gauss-Markov Random Fields Using Sensor Networks

The detection of hidden two-dimensional Gauss-Markov random fields using sensor networks is considered. Under a conditional autoregressive model, the error exponent for the Neyman-Pearson detector satisfying a fixed level constraint is obtained using the large deviations principle. For a symmetric first order autoregressive model, the error exponent is given explicitly in terms of the SNR and an edge dependence factor (field correlation). The behavior of the error exponent as a function of correlation strength is seen to divide into two regions depending on the value of the SNR. At high SNR, uncorrelated observations maximize the error exponent for a given SNR, whereas there is non-zero optimal correlation at low SNR. Based on the error exponent, the energy efficiency (defined as the ratio of the total information gathered to the total energy required) of ad hoc sensor network for detection is examined for two sensor deployment models: an infinite area model and and infinite density model. For a fixed sensor density, the energy efficiency diminishes to zero at rate O(area^{-1/2}) as the area is increased. On the other hand, non-zero efficiency is possible for increasing density depending on the behavior of the physical correlation as a function of the link length.

cs.IT↗
arXiv2008

Auction-based Resource Allocation for Multi-relay Asynchronous Cooperative Networks

Resource allocation is considered for cooperative transmissions in multiple-relay wireless networks. Two auction mechanisms, SNR auctions and power auctions, are proposed to distributively coordinate the allocation of power among multiple relays. In the SNR auction, a user chooses the relay with the lowest weighted price. In the power auction, a user may choose to use multiple relays simultaneously, depending on the network topology and the relays' prices. Sufficient conditions for the existence (in both auctions) and uniqueness (in the SNR auction) of the Nash equilibrium are given. The fairness of the SNR auction and efficiency of the power auction are further discussed. It is also proven that users can achieve the unique Nash equilibrium distributively via best response updates in a completely asynchronous manner.

cs.IT↗
arXiv2008

Performance Analysis of a Cross-layer Collaborative Beamforming Approach in the Presence of Channel and Phase Errors

Collaborative beamforming enables nodes in a wireless network to transmit a common message over long distances in an energy efficient fashion. However, the process of making available the same message to all collaborating nodes introduces delays. The authors recently proposed a MAC-PHY cross-layer scheme that enables collaborative beamforming with significantly reduced collaboration overhead. The method requires knowledge of node locations and internode channel coefficients. In this paper, the performance of that approach is studied analytically in terms of average beampattern and symbol error probability (SEP) under realistic conditions, i.e., when imperfect channel estimates are used and when there are phase errors in the contributions of the collaborating nodes at the receiver.

cs.IT↗
arXiv2008

Spatial-Spectral Joint Detection for Wideband Spectrum Sensing in Cognitive Radio Networks

Spectrum sensing is an essential functionality that enables cognitive radios to detect spectral holes and opportunistically use under-utilized frequency bands without causing harmful interference to primary networks. Since individual cognitive radios might not be able to reliably detect weak primary signals due to channel fading/shadowing, this paper proposes a cooperative wideband spectrum sensing scheme, referred to as spatial-spectral joint detection, which is based on a linear combination of the local statistics from spatially distributed multiple cognitive radios. The cooperative sensing problem is formulated into an optimization problem, for which suboptimal but efficient solutions can be obtained through mathematical transformation under practical conditions.

cs.IT↗
arXiv2007

On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels

The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. The hybrid automatic retransmission request (HARQ) protocol is revisited for a block-fading wire-tap channel, in which two legitimate users communicate over a block-fading channel in the presence of a passive eavesdropper who intercepts the transmissions through an independent block-fading channel. In this model, the transmitter obtains a 1-bit ACK/NACK feedback from the legitimate receiver via an error-free public channel. Both reliability and confidentiality of secure HARQ protocols are studied by the joint consideration of channel coding, secrecy coding, and retransmission protocols. In particular, the error and secrecy performance of repetition time diversity (RTD) and incremental redundancy (INR) protocols are investigated based on good Wyner code sequences, which ensure that the confidential message is decoded successfully by the legitimate receiver and is kept in total ignorance by the eavesdropper for a given set of channel realizations. This paper first illustrates that there exists a good rate-compatible Wyner code family which ensures a secure INR protocol. Next, two types of outage probabilities, connection outage and secrecy outage probabilities are defined in order to characterize the tradeoff between the reliability of the legitimate communication link and the confidentiality with respect to the eavesdropper's link. For a given connection/secrecy outage probability pair, an achievable throughput of secure HARQ protocols is derived for block-fading channels. Finally, both asymptotic analysis and numerical computations demonstrate the benefits of HARQ protocols to throughput and secrecy.

cs.IT↗
arXiv2007

Joint Receiver and Transmitter Optimization for Energy-Efficient CDMA Communications

This paper focuses on the cross-layer issue of joint multiuser detection and resource allocation for energy efficiency in wireless CDMA networks. In particular, assuming that a linear multiuser detector is adopted in the uplink receiver, the case considered is that in which each terminal is allowed to vary its transmit power, spreading code, and uplink receiver in order to maximize its own utility, which is defined as the ratio of data throughput to transmit power. Resorting to a game-theoretic formulation, a non-cooperative game for utility maximization is formulated, and it is proved that a unique Nash equilibrium exists, which, under certain conditions, is also Pareto-optimal. Theoretical results concerning the relationship between the problems of SINR maximization and MSE minimization are given, and, resorting to the tools of large system analysis, a new distributed power control algorithm is implemented, based on very little prior information about the user of interest. The utility profile achieved by the active users in a large CDMA system is also computed, and, moreover, the centralized socially optimum solution is analyzed. Considerations on the extension of the proposed framework to a multi-cell scenario are also briefly detailed. Simulation results confirm that the proposed non-cooperative game largely outperforms competing alternatives, and that it exhibits a quite small performance loss with respect to the socially optimum solution, and only in the case in which the users number exceeds the processing gain. Finally, results also show an excellent agreement between the theoretical closed-form formulas based on large system analysis and the outcome of numerical experiments.

cs.IT↗
arXiv2007

Bayesian sequential change diagnosis

Sequential change diagnosis is the joint problem of detection and identification of a sudden and unobservable change in the distribution of a random sequence. In this problem, the common probability law of a sequence of i.i.d. random variables suddenly changes at some disorder time to one of finitely many alternatives. This disorder time marks the start of a new regime, whose fingerprint is the new law of observations. Both the disorder time and the identity of the new regime are unknown and unobservable. The objective is to detect the regime-change as soon as possible, and, at the same time, to determine its identity as accurately as possible. Prompt and correct diagnosis is crucial for quick execution of the most appropriate measures in response to the new regime, as in fault detection and isolation in industrial processes, and target detection and identification in national defense. The problem is formulated in a Bayesian framework. An optimal sequential decision strategy is found, and an accurate numerical scheme is described for its implementation. Geometrical properties of the optimal strategy are illustrated via numerical examples. The traditional problems of Bayesian change-detection and Bayesian sequential multi-hypothesis testing are solved as special cases. In addition, a solution is obtained for the problem of detection and identification of component failure(s) in a system with suspended animation.

math.PR↗
arXiv2007

Cooperative Multi-Cell Networks: Impact of Limited-Capacity Backhaul and Inter-Users Links

Cooperative technology is expected to have a great impact on the performance of cellular or, more generally, infrastructure networks. Both multicell processing (cooperation among base stations) and relaying (cooperation at the user level) are currently being investigated. In this presentation, recent results regarding the performance of multicell processing and user cooperation under the assumption of limited-capacity interbase station and inter-user links, respectively, are reviewed. The survey focuses on related results derived for non-fading uplink and downlink channels of simple cellular system models. The analytical treatment, facilitated by these simple setups, enhances the insight into the limitations imposed by limited-capacity constraints on the gains achievable by cooperative techniques.

cs.IT↗
arXiv2007

Cognitive Interference Channels with Confidential Messages

The cognitive interference channel with confidential messages is studied. Similarly to the classical two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at the two receivers. It is assumed that there is a common message source (message 1) known to both transmitters, and an additional independent message source (message 2) known only to the cognitive transmitter (transmitter 2). The cognitive receiver (receiver 2) needs to decode both messages, while the non-cognitive receiver (receiver 1) should decode only the common message. Furthermore, message 2 is assumed to be a confidential message which needs to be kept as secret as possible from receiver 1, which is viewed as an eavesdropper with regard to message 2. The level of secrecy is measured by the equivocation rate. A single-letter expression for the capacity-equivocation region of the discrete memoryless cognitive interference channel is established and is further explicitly derived for the Gaussian case. Moreover, particularizing the capacity-equivocation region to the case without a secrecy constraint, establishes a new capacity theorem for a class of interference channels, by providing a converse theorem.

cs.IT↗
arXiv2007

Cognitive Medium Access: Exploration, Exploitation and Competition

This paper establishes the equivalence between cognitive medium access and the competitive multi-armed bandit problem. First, the scenario in which a single cognitive user wishes to opportunistically exploit the availability of empty frequency bands in the spectrum with multiple bands is considered. In this scenario, the availability probability of each channel is unknown to the cognitive user a priori. Hence efficient medium access strategies must strike a balance between exploring the availability of other free channels and exploiting the opportunities identified thus far. By adopting a Bayesian approach for this classical bandit problem, the optimal medium access strategy is derived and its underlying recursive structure is illustrated via examples. To avoid the prohibitive computational complexity of the optimal strategy, a low complexity asymptotically optimal strategy is developed. The proposed strategy does not require any prior statistical knowledge about the traffic pattern on the different channels. Next, the multi-cognitive user scenario is considered and low complexity medium access protocols, which strike the optimal balance between exploration and exploitation in such competitive environments, are developed. Finally, this formalism is extended to the case in which each cognitive user is capable of sensing and using multiple channels simultaneously.

cs.IT↗
arXiv2007

Secrecy Capacity of the Wiretap Channel with Noisy Feedback

In this work, the role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is investigated. A model is considered in which the feed-forward and feedback signals share the same noisy channel. More specifically, a discrete memoryless modulo-additive channel with a full-duplex destination node is considered first, and it is shown that a judicious use of feedback increases the perfect secrecy capacity to the capacity of the source-destination channel in the absence of the wiretapper. In the achievability scheme, the feedback signal corresponds to a private key, known only to the destination. Then a half-duplex system is considered, for which a novel feedback technique that always achieves a positive perfect secrecy rate (even when the source-wiretapper channel is less noisy than the source-destination channel) is proposed. These results hinge on the modulo-additive property of the channel, which is exploited by the destination to perform encryption over the channel without revealing its key to the source.

cs.IT↗
arXiv2007

Cooperative Multiplexing in a Half Duplex Relay Network: Performance and Constraints

Previous work on relay networks has concentrated primarily on the diversity benefits of such techniques. This paper explores the possibility of also obtaining multiplexing gain in a relay network, while retaining diversity gain. Specifically, consider a network in which a single source node is equipped with one antenna and a destination is equipped with two antennas. It is shown that, in certain scenarios, by adding a relay with two antennas and using a successive relaying protocol, the diversity multiplexing tradeoff performance of the network can be lower bounded by that of a 2 by 2 MIMO channel, when the decode-and-forward protocol is applied at the relay. A distributed D-BLAST architecture is developed, in which parallel channel coding is applied to achieve this tradeoff. A space-time coding strategy, which can bring a maximal multiplexing gain of more than one, is also derived for this scenario. As will be shown, while this space-time coding strategy exploits maximal diversity for a small multiplexing gain, the proposed successive relaying scheme offers a significant performance advantage for higher data rate transmission. In addition to the specific results shown here, these ideas open a new direction for exploiting the benefits of wireless relay networks.

cs.IT↗
arXiv2007

Secrecy Capacity Region of a Multi-Antenna Gaussian Broadcast Channel with Confidential Messages

In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with information-theoretic secrecy. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multi-antenna Gaussian broadcast channel with confidential messages (MGBC-CM). Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer bound prove to be consistent with the boundary of the secret dirty-paper coding achievable rate region, and hence, the secrecy capacity region of the MGBC-CM is established. Finally, two numerical examples demonstrate that both users can achieve positive rates simultaneously under the information-theoretic secrecy requirement.

cs.IT↗
arXiv2007

Voice Service Support in Mobile Ad Hoc Networks

Mobile ad hoc networks are expected to support voice traffic. The requirement for small delay and jitter of voice traffic poses a significant challenge for medium access control (MAC) in such networks. User mobility makes it more complex due to the associated dynamic path attenuation. In this paper, a MAC scheme for mobile ad hoc networks supporting voice traffic is proposed. With the aid of a low-power probe prior to DATA transmissions, resource reservation is achieved in a distributed manner, thus leading to small delay and jitter. The proposed scheme can automatically adapt to dynamic path attenuation in a mobile environment. Simulation results demonstrate the effectiveness of the proposed scheme.

cs.IT↗
arXiv2007

Secrecy Capacity Region of Binary and Gaussian Multiple Access Channels

A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for the destination. Moreover, user 1 wishes to keep its confidential information as secret as possible from user 2. A deterministic GMAC is first studied, and the capacity-equivocation region and the secrecy capacity region are obtained. Two main classes of the GMAC are then studied: the binary GMAC and the Gaussian GMAC. For both channels, the capacity-equivocation region and the secrecy capacity region are established.

cs.IT↗