Bita Azimdoost

Learn More
The capacity of a wireless network is studied when nodes communicate with one another in the context of social groups. All the nodes are assumed to have the same number of independent long-range social contacts, one of which each selects randomly as its destination. The Euclidean distance between a source and its social group members follows a power-law(More)
We define composite networks when nodes communicate only with their long-range social contacts and there is no direct link between a node and its long-range contact. Each node has a single long-range contact and all nodes within its transmission range are local contacts for the node. The long-range contact is the destination for each node in the network and(More)
The capacity of a wireless network with n nodes is studied when nodes communicate with one another in the context of social groups. Each node is assumed to have at least one local contact in each of the four directions of the plane in which the wireless network operates, and q(n) independent long-range social contacts forming its social group, one of which(More)
—We study the capacity of random wireless ad hoc networks when nodes are capable multi-packet transmission and reception (MPTR). This paper extends the unified framework of (n, m, k)-cast by Wang et al. [9] with single-packet reception (SPR) capability for each node to MPTR. (n, m, k)-cast considers all types of information dissemination including unicast(More)
—In this paper, we study the effects of social interactions among nodes on the capacity of wireless networks. We consider three scenarios. In the first scenario, the size of the social group for all nodes is fixed while the frequency of communication within members of a social group follows power law distribution. In the second scenario, scale free networks(More)
We examine the in-network optimal content placement and storage allocation problem by formulating a linear program. Our objective is to minimize the overall cost of content delivery subject to total storage budget and link capacity constraints. The solution determines whether/where to keep a copy of a content based on contents ranking distributions. In(More)
—Wireless information-centric networks consider storage one of the network primitives, and propose to cache data within the network in order to improve latency to access content and reduce bandwidth consumption. We study the throughput capacity of an information-centric network when the data cached in each node has a limited lifetime. The results show that(More)
—We are studying some fundamental properties of the interface between control and data planes in Information-Centric Networks.We try to evaluate the traffic between these two planes based on allowing a minimum level of acceptable distortion in the network state representation in the control plane. We apply our framework to content distribution, and see how(More)