ASAnand Srinivas

Anand Srinivas

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Anand Srinivas has a total of 5 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Construction and Maintenance of Wireless Mobile Backbone Networks

    by Anand Srinivas, Gil Zussman, Eytan Modiano

    We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as mobile backbone nodes and provide a backbone over which end-to-end communication can take place. Our approach consists of controlling the mobility of the backbone nodes in order to maintain connectivity. We formulate the problem of minimizing the number of backbone nodes and refer to it as the Connected Disk Cover (CDC) problem. We show that it can be decomposed into the Geometric Disk Cover (GDC) problem and the Steiner Tree Problem with Minimum Number of Steiner Points (STP-MSP). We prove that if these subproblems are solved separately by gamma- and delta-approximation algorithms, the approximation ratio of the joint solution is gamma+delta. Then, we focus on the two subproblems and present a number of distributed approximation algorithms that maintain a solution to the GDC problem under mobility. A new approach to the solution of the STP-MSP is also described. We show that this approach can be extended in order to obtain a joint approximate solution to the CDC problem. Finally, we evaluate the performance of the algorithms via simulation and show that the proposed GDC algorithms perform very well under mobility and that the new approach for the joint solution can significantly reduce the number of mobile backbone nodes.


  • Joint Topology Design and Frequency Allocation for Fixed Wireless SDR Networks

    by Li-Wei Chen, Nick Martin, Carlos Cabrera, Anand Srinivas

    This paper considers the problem of connecting a collection of nodes to a backbone network. Each node may be directly connected to the backbone, at some cost, or it may communicate wirelessly to a directly connected hub and share its connection, at the "cost" of using spectrum for the wireless link. This problem arises in diverse areas such as cellular network backhaul and overlays of ad-hoc networks and wide area networks. We consider the joint problem of designing the topology and the frequency assignment at the same time, to minimize both cost and spectrum usage. We formulate the problem as an ILP and show that the complexity requirements make an exact solution infeasible. We then derive two heuristics one based on simulated annealing, the other based on greedy graph matchings and show that we are able to obtain nearly optimal solutions at significantly reduced complexity.