arXiv subjects

Narayan B. Mandayam

Publications and source records attributed to Narayan B. Mandayam.

47 records · Page 3Linked to original sources

arXiv2014

Integrating Energy Storage into the Smart Grid: A Prospect Theoretic Approach

In this paper, the interactions and energy exchange decisions of a number of geographically distributed storage units are studied under decision-making involving end-users. In particular, a noncooperative game is formulated between customer-owned storage units where each storage unit's owner can decide on whether to charge or discharge energy with a given probability so as to maximize a utility that reflects the tradeoff between the monetary transactions from charging/discharging and the penalty from power regulation. Unlike existing game-theoretic works which assume that players make their decisions rationally and objectively, we use the new framework of prospect theory (PT) to explicitly incorporate the users' subjective perceptions of their expected utilities. For the two-player game, we show the existence of a proper mixed Nash equilibrium for both the standard game-theoretic case and the case with PT considerations. Simulation results show that incorporating user behavior via PT reveals several important insights into load management as well as economics of energy storage usage. For instance, the results show that deviations from conventional game theory, as predicted by PT, can lead to undesirable grid loads and revenues thus requiring the power company to revisit its pricing schemes and the customers to reassess their energy storage usage choices.

cs.GT↗

arXiv2013

Dynamic Radio Resource Management for Random Network Coding: Power Control and CSMA Backoff Control

Resource allocation in wireless networks typically occurs at PHY/MAC layers, while random network coding (RNC) is a network layer strategy. An interesting question is how resource allocation mechanisms can be tuned to improve RNC performance. By means of a differential equation framework which models RNC throughput in terms of lower layer parameters, we propose a gradient based approach that can dynamically allocate MAC and PHY layer resources with the goal of maximizing the minimum network coding throughput among all the destination nodes in a RNC multicast. We exemplify this general approach with two resource allocation problems: (i) power control to improve network coding throughput, and (ii) CSMA mean backoff delay control to improve network coding throughput. We design both centralized algorithms and online algorithms for power control and CSMA backoff control. Our evaluations, including numerically solving the differential equations in the centralized algorithm and an event-driven simulation for the online algorithm, show that such gradient based dynamic resource allocation yields significant throughput improvement of the destination nodes in RNC. Further, our numerical results reveal that network coding aware power control can regain the broadcast advantage of wireless transmissions to improve the throughput.

cs.NI↗

arXiv2013

Cellular Systems with Many Antennas: Large System Analysis under Pilot Contamination

Base stations with a large number of transmit antennas have the potential to serve a large number of users simultaneously at higher rates. They also promise a lower power consumption due to coherent combining at the receiver. However, the receiver processing in the uplink relies on the channel estimates which are known to suffer from pilot interference. In this work, we perform an uplink large system analysis of multi-cell multi-antenna system when the receiver employs a matched filtering with a pilot contaminated estimate. We find the asymptotic Signal to Interference plus Noise Ratio (SINR) as the number of antennas and number of users per base station grow large while maintaining a fixed ratio. To do this, we make use of the similarity of the uplink received signal in a multi-antenna system to the representation of the received signal in CDMA systems. The asymptotic SINR expression explicitly captures the effect of pilot contamination and that of interference averaging. This also explains the SINR performance of receiver processing schemes at different regimes such as instances when the number of antennas are comparable to number of users as well as when antennas exceed greatly the number of users. Finally, we also propose that the adaptive MMSE symbol detection scheme, which does not require the explicit channel knowledge, can be employed for cellular systems with large number of antennas.

cs.IT↗

arXiv2012

Implementation of Distributed Time Exchange Based Cooperative Forwarding

In this paper, we design and implement time exchange (TE) based cooperative forwarding where nodes use transmission time slots as incentives for relaying. We focus on distributed joint time slot exchange and relay selection in the sum goodput maximization of the overall network. We formulate the design objective as a mixed integer nonlinear programming (MINLP) problem and provide a polynomial time distributed solution of the MINLP. We implement the designed algorithm in the software defined radio enabled USRP nodes of the ORBIT indoor wireless testbed. The ORBIT grid is used as a global control plane for exchange of control information between the USRP nodes. Experimental results suggest that TE can significantly increase the sum goodput of the network. We also demonstrate the performance of a goodput optimization algorithm that is proportionally fair.

cs.IT↗

arXiv2012

Analyzing Random Network Coding with Differential Equations and Differential Inclusions

We develop a framework based on differential equations (DE) and differential inclusions (DI) for analyzing Random Network Coding (RNC), as well as a nonlinear variant referred to as Random Coupon (RC), in a wireless network. The DEDI framework serves as a powerful numerical and analytical tool to study RNC. We demonstrate its versatility by proving theoretical results on multicast information flows in a wireless network using RNC or RC. We also demonstrate the accuracy and flexibility of the performance analysis enabled by this framework via illustrative examples of networks with multiple multicast sessions, user cooperation and arbitrary topologies.

cs.IT↗

arXiv2008

Relay vs. User Cooperation in Time-Duplexed Multiaccess Networks

The performance of user-cooperation in a multi-access network is compared to that of using a wireless relay. Using the total transmit and processing power consumed at all nodes as a cost metric, the outage probabilities achieved by dynamic decode-and-forward (DDF) and amplify-and-forward (AF) are compared for the two networks. A geometry-inclusive high signal-to-noise ratio (SNR) outage analysis in conjunction with area-averaged numerical simulations shows that user and relay cooperation achieve a maximum diversity of K and 2 respectively for a K-user multiaccess network under both DDF and AF. However, when accounting for energy costs of processing and communication, relay cooperation can be more energy efficient than user cooperation, i.e., relay cooperation achieves coding (SNR) gains, particularly in the low SNR regime, that override the diversity advantage of user cooperation.

cs.IT↗

arXiv2008

Coalitions in Cooperative Wireless Networks

Cooperation between rational users in wireless networks is studied using coalitional game theory. Using the rate achieved by a user as its utility, it is shown that the stable coalition structure, i.e., set of coalitions from which users have no incentives to defect, depends on the manner in which the rate gains are apportioned among the cooperating users. Specifically, the stability of the grand coalition (GC), i.e., the coalition of all users, is studied. Transmitter and receiver cooperation in an interference channel (IC) are studied as illustrative cooperative models to determine the stable coalitions for both flexible (transferable) and fixed (non-transferable) apportioning schemes. It is shown that the stable sum-rate optimal coalition when only receivers cooperate by jointly decoding (transferable) is the GC. The stability of the GC depends on the detector when receivers cooperate using linear multiuser detectors (non-transferable). Transmitter cooperation is studied assuming that all receivers cooperate perfectly and that users outside a coalition act as jammers. The stability of the GC is studied for both the case of perfectly cooperating transmitters (transferrable) and under a partial decode-and-forward strategy (non-transferable). In both cases, the stability is shown to depend on the channel gains and the transmitter jamming strengths.

cs.GT↗

arXiv2008

On the Sum-Capacity of Degraded Gaussian Multiaccess Relay Channels

The sum-capacity is studied for a K-user degraded Gaussian multiaccess relay channel (MARC) where the multiaccess signal received at the destination from the K sources and relay is a degraded version of the signal received at the relay from all sources, given the transmit signal at the relay. An outer bound on the capacity region is developed using cutset bounds. An achievable rate region is obtained for the decode-and-forward (DF) strategy. It is shown that for every choice of input distribution, the rate regions for the inner (DF) and outer bounds are given by the intersection of two K-dimensional polymatroids, one resulting from the multiaccess link at the relay and the other from that at the destination. Although the inner and outer bound rate regions are not identical in general, for both cases, a classical result on the intersection of two polymatroids is used to show that the intersection belongs to either the set of active cases or inactive cases, where the two bounds on the K-user sum-rate are active or inactive, respectively. It is shown that DF achieves the capacity region for a class of degraded Gaussian MARCs in which the relay has a high SNR link to the destination relative to the multiaccess link from the sources to the relay. Otherwise, DF is shown to achieve the sum-capacity for an active class of degraded Gaussian MARCs for which the DF sum-rate is maximized by a polymatroid intersection belonging to the set of active cases. This class is shown to include the class of symmetric Gaussian MARCs where all users transmit at the same power.

cs.IT↗

arXiv2007

Opportunistic Communications in an Orthogonal Multiaccess Relay Channel

The problem of resource allocation is studied for a two-user fading orthogonal multiaccess relay channel (MARC) where both users (sources) communicate with a destination in the presence of a relay. A half-duplex relay is considered that transmits on a channel orthogonal to that used by the sources. The instantaneous fading state between every transmit-receive pair in this network is assumed to be known at both the transmitter and receiver. Under an average power constraint at each source and the relay, the sum-rate for the achievable strategy of decode-and-forward (DF) is maximized over all power allocations (policies) at the sources and relay. It is shown that the sum-rate maximizing policy exploits the multiuser fading diversity to reveal the optimality of opportunistic channel use by each user. A geometric interpretation of the optimal power policy is also presented.

cs.IT↗

arXiv2005

A Utility-Based Approach to Power Control and Receiver Design in Wireless Data Networks

In this work, the cross-layer design problem of joint multiuser detection and power control is studied using a game-theoretic approach. The uplink of a direct-sequence code division multiple access (DS-CDMA) data network is considered and a non-cooperative game is proposed in which users in the network are allowed to choose their uplink receivers as well as their transmit powers to maximize their own utilities. The utility function measures the number of reliable bits transmitted by the user per joule of energy consumed. Focusing on linear receivers, the Nash equilibrium for the proposed game is derived. It is shown that the equilibrium is one where the powers are SIR-balanced with the minimum mean square error (MMSE) detector as the receiver. In addition, this framework is used to study power control games for the matched filter, the decorrelator, and the MMSE detector; and the receivers' performance is compared in terms of the utilities achieved at equilibrium (in bits/Joule). The optimal cooperative solution is also discussed and compared with the non-cooperative approach. Extensions of the results to the case of multiple receive antennas are also presented. In addition, an admission control scheme based on maximizing the total utility in the network is proposed.

cs.IT↗

arXiv2005

A Non-Cooperative Power Control Game for Multi-Carrier CDMA Systems

In this work, a non-cooperative power control game for multi-carrier CDMA systems is proposed. In the proposed game, each user needs to decide how much power to transmit over each carrier to maximize its overall utility. The utility function considered here measures the number of reliable bits transmitted per joule of energy consumed. It is shown that the user's utility is maximized when the user transmits only on the carrier with the best "effective channel". The existence and uniqueness of Nash equilibrium for the proposed game are investigated and the properties of equilibrium are studied. Also, an iterative and distributed algorithm for reaching the equilibrium (if it exists) is presented. It is shown that the proposed approach results in a significant improvement in the total utility achieved at equilibrium compared to the case in which each user maximizes its utility over each carrier independently.

cs.IT↗