#### Filter Results:

#### Publication Year

1981

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Computing optimal routes in massively dense adhoc networks becomes intractable as the number of nodes becomes very large. One recent approach to solve this problem is to use a fluid type approximation in which the whole network is replaced by a continuum plain. Various paradigms from physics have been used recently in order to solve the continuum model. We… (More)

— We consider massively dense ad-hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area with location and congestion dependent costs. We study both the global optimal solution as well as the non-cooperative routing problem among a large population of users. Each… (More)

In this paper we study the optimal placement and optimal number of active relay nodes through the traffic density in mobile sensor ad-hoc networks. We consider a setting in which a set of mobile sensor sources is creating data and a set of mobile sensor destinations receiving that data. We make the assumption that the network is massively dense, i.e., there… (More)

In this work, we propose a multi-layer market for vehicle-to-grid energy trading. In the macro layer, we consider a double auction mechanism, under which the utility company act as an auctioneer and energy buyers and sellers interact. This double auction mechanism is strategy-proof and converges asymptotically. In the micro layer, the aggregators, which are… (More)

—The classic optimal transportation problem consists in finding the most cost-effective way of moving masses from one set of locations to another, minimizing its transportation cost. The formulation of this problem and its solution have been useful to understand various mathematical, economical, and control theory phenomena, such as, e.g., Witsenhausen's… (More)

In this paper, we study the capacity limits of dense multi-antenna systems. We derive asymptotic capacity expressions for point-to-point and broadcast channels by applying recent tools from random matrix theory. In the case of broadcast channels, we focus on linear precoding techniques. We found that the asymptotic capacity depends only on the ratio between… (More)

Non-cooperative game theory has gained much interest as a paradigm for decentralized control in communication networks. It allows to get rid of the need for a centralized controller. Decentralizing the decision making may result in situations where agents (decision makers) do not have the same view of the network: the information available to agents vary… (More)

We study the routing problem in massively dense static ad-hoc networks as the node density increases. We use a fluid approximation in which the graph providing the available routes becomes so dense that it can be approximated by a continuous area which inherits from the original problem the cost structure: a cost density is defined at each point on the… (More)

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion… (More)

One of the main objectives of data mining is to help companies determine to which potential customers to market and how many resources to allocate to these potential customers. Most previous works on competitive influence in social networks focus on the first issue. In this work, our focus is on the second issue, i.e., we are interested on the competitive… (More)