LSLalitha Sankaranarayanan

Lalitha Sankaranarayanan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Lalitha Sankaranarayanan has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Opportunistic Communications in an Orthogonal Multiaccess Relay Channel

    by Lalitha Sankar, Yingbin Liang, H. Vincent Poor, Narayan Mandayam

    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.


  • Open Access

    Opportunistic Communications in an Orthogonal Multiaccess Relay Channel

    by Lalitha Sankar, Yingbin Liang, H. Vincent Poor, Narayan B. Mandayam

    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.

  • Coalitional Games in Gaussian Interference Channels

    by Suhas Mathur, Lalitha Sankaranarayanan, Narayan B. Mandayam

    The formation of coalitions in a Gaussian interference channel where the receivers are allowed to cooperate is studied under the framework of coalitional game theory. Allowing any arbitrary sharing of the total rate achieved by a coalition between its member links, it is shown that the grand coalition (coalition of all links) maximizes spectrum utilization and is also stable, that is, the links in this coalition have no incentives to leave and form other coalitions. The issue of fairness in allocating rates to members of a grand coalition is addressed via a Nash bargaining solution where each link utility is modeled as the rate gained by being in a coalition relative to the rate achieved in the interference channel. Further, a rate allocation solution using proportional fairness is also presented and the results are illustrated with examples


  • Coalitional Games in Receiver Cooperation for Spectrum Sharing

    by Suhas Mathur, Lalitha Sankaranarayanan, Narayan B. Mandayam

    The issue of sharing spectrum through receiver cooperation in wireless networks is studied under the framework of coalitional game theory. In particular, we consider two illustrative network models: (1) a Gaussian interference channel with receiver cooperation and (2) a multiple access channel (MAC) with linear multiuser detection. Allowing any arbitrary sharing of the sum-rate achieved by a coalition between member links in a Gaussian interference channel, it is shown that the grand coalition (coalition of all receivers) maximizes spectrum utilization and is also stable. For the linear MMSE multiuser detector, it is shown that the grand coalition is always stable and sum-rate maximizing, while for the decorrelating multiuser detector, the above observation is shown to be true only in the high SNR regime. Finally, transmitter cooperation in the context of a Gaussian interference channel is discussed, with focus on some open problems and a simplified framework for the resulting coalitional game is proposed.


  • Coalitional Games in Cooperative Radio Networks

    by Suhas Mathur, Lalitha Sankaranarayanan, Narayan B. Mandayam

    The framework of coalitional game theory is used to study the formation of coalitions in an M-link wireless interference channel when either the transmitters or the receivers cooperate. It is shown that the stable coalition structure, i.e., the coalition structure for which users have no incentives to defect, depends upon the apportioning scheme chosen to distribute the cooperative rate gains between the coalition members. Under both a flexible (transferable) and fixed (non-transferable) apportioning scheme, the stable coalitions formed by cooperating receivers are presented. The problem of determining stable coalitions for the case of cooperating transmitters is discussed.