arXiv subjects

Narayan Mandayam

Publications and source records attributed to Narayan Mandayam.

28 records · Page 2Linked to original sources

arXiv2015

Towards a Consumer-Centric Grid: A Behavioral Perspective

Active consumer participation is seen as an integral part of the emerging smart grid. Examples include demand-side management programs, incorporation of consumer-owned energy storage or renewable energy units, and active energy trading. However, despite the foreseen technological benefits of such consumer-centric grid features, to date, their widespread adoption in practice remains modest. To shed light on this challenge, this paper explores the potential of prospect theory, a Nobel-prize winning theory, as a decision-making framework that can help understand how risk and uncertainty can impact the decisions of smart grid consumers. After introducing the basic notions of prospect theory, several examples drawn from a number of smart grid applications are developed. These results show that a better understanding of the role of human decision-making within the smart grid is paramount for optimizing its operation and expediting the deployment of its various technologies.

eess.SY↗

arXiv2015

Optimal Radiometric Calibration for Camera-Display Communication

We present a novel method for communicating between a camera and display by embedding and recovering hidden and dynamic information within a displayed image. A handheld camera pointed at the display can receive not only the display image, but also the underlying message. These active scenes are fundamentally different from traditional passive scenes like QR codes because image formation is based on display emittance, not surface reflectance. Detecting and decoding the message requires careful photometric modeling for computational message recovery. Unlike standard watermarking and steganography methods that lie outside the domain of computer vision, our message recovery algorithm uses illumination to optically communicate hidden messages in real world scenes. The key innovation of our approach is an algorithm that performs simultaneous radiometric calibration and message recovery in one convex optimization problem. By modeling the photometry of the system using a camera-display transfer function (CDTF), we derive a physics-based kernel function for support vector machine classification. We demonstrate that our method of optimal online radiometric calibration (OORC) leads to an efficient and robust algorithm for computational messaging between nine commercial cameras and displays.

cs.CV↗

arXiv2014

HetNetwork Coding: Scaling Throughput in Heterogeneous Networks using Multiple Radio Interfaces

The explosive demand for data has called for solution approaches that range from spectrally agile cognitive radios with novel spectrum sharing, to use of higher frequency spectrum as well as smaller and denser cell deployments with diverse access technologies, referred to as heterogeneous networks (HetNets). Simultaneously, advances in electronics and storage, has led to the advent of wireless devices equipped with multiple radio interfaces (e.g. WiFi, WiMAX, LTE, etc.) and the ability to store and efficiently process large amounts of data. Motivated by the convergence of HetNets and multi-platform radios, we propose HetNetwork Coding as a means to utilize the available radio interfaces in parallel along with network coding to increase wireless data throughput. Specifically we explore the use of random linear network coding at the network layer where packets can travel through multiple interfaces and be received via multihoming. Using both simulations and experimentation with real hardware on WiFi and WiMAX platforms, we study the scaling of throughput enabled by such HetNetwork coding. We find from our simulations and experiments that the use of this method increases the throughput, with greater gains achieved for cases when the system is heavily loaded or the channel quality is poor. Our results also reveal that the throughput gains achieved scale linearly with the number of radio interfaces at the nodes.

cs.NI↗

arXiv2014

A Game Theoretic Analysis of Collaboration in Wikipedia

Peer production projects such as Wikipedia or open-source software development allow volunteers to collectively create knowledge based products. The inclusive nature of such projects poses difficult challenges for ensuring trustworthiness and combating vandalism. Prior studies in the area deal with descriptive aspects of peer production, failing to capture the idea that while contributors collaborate, they also compete for status in the community and for imposing their views on the product. In this paper we investigate collaborative authoring in Wikipedia where contributors append and overwrite previous contributions to a page. We assume that a contributors goal is to maximize ownership of content sections such that content owned (or originated) by her survived the most recent revision of the page. We model contributors interactions to increase their content ownership as a noncooperative game where a players utility is associated with content owned and cost is a function of effort expended. Our results capture several real life aspects of contributors interactions within peer production projects. We show that at the Nash equilibrium there is an inverse relationship between the effort required to make a contribution and the survival of a contributors content. In other words majority of the content that survives is necessarily contributed by experts who expend relatively less effort than non experts. An empirical analysis of Wikipedia articles provides support for our models predictions. Implications for research and practice are discussed in the context of trustworthy collaboration as well as vandalism.

cs.GT↗

arXiv2012

Optimal Resource Allocation and Relay Selection in Bandwidth Exchange Based Cooperative Forwarding

In this paper, we investigate joint optimal relay selection and resource allocation under bandwidth exchange (BE) enabled incentivized cooperative forwarding in wireless networks. We consider an autonomous network where N nodes transmit data in the uplink to an access point (AP) / base station (BS). We consider the scenario where each node gets an initial amount (equal, optimal based on direct path or arbitrary) of bandwidth, and uses this bandwidth as a flexible incentive for two hop relaying. We focus on alpha-fair network utility maximization (NUM) and outage reduction in this environment. Our contribution is two-fold. First, we propose an incentivized forwarding based resource allocation algorithm which maximizes the global utility while preserving the initial utility of each cooperative node. Second, defining the link weight of each relay pair as the utility gain due to cooperation (over noncooperation), we show that the optimal relay selection in alpha-fair NUM reduces to the maximum weighted matching (MWM) problem in a non-bipartite graph. Numerical results show that the proposed algorithms provide 20- 25% gain in spectral efficiency and 90-98% reduction in outage probability.

cs.IT↗

arXiv2009

Information-theoretically Secret Key Generation for Fading Wireless Channels

The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, and uniquely shared by a given transmitter-receiver pair. The complexity associated with a richly scattering environment implies that the short-term fading process is inherently hard to predict and best modeled stochastically, with rapid decorrelation properties in space, time and frequency. In this paper, we demonstrate how the channel state between a wireless transmitter and receiver can be used as the basis for building practical secret key generation protocols between two entities. We begin by presenting a scheme based on level crossings of the fading process, which is well-suited for the Rayleigh and Rician fading models associated with a richly scattering environment. Our level crossing algorithm is simple, and incorporates a self-authenticating mechanism to prevent adversarial manipulation of message exchanges during the protocol. Since the level crossing algorithm is best suited for fading processes that exhibit symmetry in their underlying distribution, we present a second and more powerful approach that is suited for more general channel state distributions. This second approach is motivated by observations from quantizing jointly Gaussian processes, but exploits empirical measurements to set quantization boundaries and a heuristic log likelihood ratio estimate to achieve an improved secret key generation rate. We validate both proposed protocols through experimentations using a customized 802.11a platform, and show for the typical WiFi channel that reliable secret key establishment can be accomplished at rates on the order of 10 bits/second.

cs.CR↗

arXiv2009

Fingerprints in the Ether: Using the Physical Layer for Wireless Authentication

The wireless medium contains domain-specific information that can be used to complement and enhance traditional security mechanisms. In this paper we propose ways to exploit the fact that, in a typically rich scattering environment, the radio channel response decorrelates quite rapidly in space. Specifically, we describe a physical-layer algorithm that combines channel probing (M complex frequency response samples over a bandwidth W) with hypothesis testing to determine whether current and prior communication attempts are made by the same user (same channel response). In this way, legitimate users can be reliably authenticated and false users can be reliably detected. To evaluate the feasibility of our algorithm, we simulate spatially variable channel responses in real environments using the WiSE ray-tracing tool; and we analyze the ability of a receiver to discriminate between transmitters (users) based on their channel frequency responses in a given office environment. For several rooms in the extremities of the building we considered, we have confirmed the efficacy of our approach under static channel conditions. For example, measuring five frequency response samples over a bandwidth of 100 MHz and using a transmit power of 100 mW, valid users can be verified with 99% confidence while rejecting false users with greater than 95% confidence.

cs.CR↗

arXiv2009

MIMO-Assisted Channel-Based Authentication in Wireless Networks

Multiple-input multiple-output (MIMO) techniques allow for multiplexing and/or diversity gain, and will be widely deployed in future wireless systems. In this paper, we propose a MIMO-assisted channel-based authentication scheme, exploiting current channel estimation mechanisms in MIMO systems to detect spoofing attacks with very low overhead. In this scheme, the use of multiple antennas provides extra dimensions of channel estimation data, and thus leads to a "security gain" over single-input single-output (SISO) systems. We investigate the security gain of MIMO systems in several system configurations via simulations for a specific real indoor environment using ray-tracing software. We also discuss the effect of increasing the number of transmit and receive antennas on the security gain and contrast that to the diversity/multiplexing gain.

cs.CR↗

arXiv2009

Using the Physical Layer for Wireless Authentication in Time-Variant Channels

The wireless medium contains domain-specific information that can be used to complement and enhance traditional security mechanisms. In this paper we propose ways to exploit the spatial variability of the radio channel response in a rich scattering environment, as is typical of indoor environments. Specifically, we describe a physical-layer authentication algorithm that utilizes channel probing and hypothesis testing to determine whether current and prior communication attempts are made by the same transmit terminal. In this way, legitimate users can be reliably authenticated and false users can be reliably detected. We analyze the ability of a receiver to discriminate between transmitters (users) according to their channel frequency responses. This work is based on a generalized channel response with both spatial and temporal variability, and considers correlations among the time, frequency and spatial domains. Simulation results, using the ray-tracing tool WiSE to generate the time-averaged response, verify the efficacy of the approach under realistic channel conditions, as well as its capability to work under unknown channel variations.

cs.CR↗

arXiv2009

Opportunistic Communications in Fading Multiaccess Relay Channels

The problem of optimal resource allocation is studied for ergodic fading orthogonal multiaccess relay channels (MARCs) in which the users (sources) communicate with a destination with the aid of a half-duplex relay that transmits on a channel orthogonal to that used by the transmitting sources. Under the assumption that the instantaneous fading state information is available at all nodes, the maximum sum-rate and the optimal user and relay power allocations (policies) are developed for a decode-and-forward (DF) relay. With the observation that a DF relay results in two multiaccess channels, one at the relay and the other at the destination, a single known lemma on the sum-rate of two intersecting polymatroids is used to determine the DF sum-rate and the optimal user and relay policies. The lemma also enables a broad topological classification of fading MARCs into one of three types. The first type is the set of partially clustered MARCs where a user is clustered either with the relay or with the destination such that the users waterfill on their bottle-neck links to the distant receiver. The second type is the set of clustered MARCs where all users are either proximal to the relay or to the destination such that opportunistic multiuser scheduling to one of the receivers is optimal. The third type consists of arbitrarily clustered MARCs which are a combination of the first two types, and for this type it is shown that the optimal policies are opportunistic non-waterfilling solutions. The analysis is extended to develop the rate region of a K-user orthogonal half-duplex MARC. Finally, cutset outer bounds are used to show that DF achieves the capacity region for a class of clustered orthogonal half-duplex MARCs.

cs.IT↗