3 research outputs found
Numerical solutions of continuum equilibria for routing in dense ad-hoc networks
International audienceWe 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 limit plain; it is a function of the location and the congestion at that point. We solve numerically the routing problem for the case where the cost density is linear with respect to congestion and we obtain a result of convergence via Finite Elements Method
Magnetworks: how mobility impacts the design of Mobile Networks
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 are so many sources,
destinations, and relay nodes, that it is best to describe the network in terms
of macroscopic parameters, such as their spatial density, rather than in terms
of microscopic parameters, such as their individual placements.
We focus on a particular physical layer model that is characterized by the
following assumptions: i) the nodes must only transport the data from the
sources to the destinations, and do not need to sense the data at the sources,
or deliver them at the destinations once the data arrive at their physical
locations, and ii) the nodes have limited bandwidth available to them, but they
use it optimally to locally achieve the network capacity.
In this setting, the optimal distribution of nodes induces a traffic density
that resembles the electric displacement that will be created if we substitute
the sources and destinations with positive and negative charges respectively.
The analogy between the two settings is very tight and have a direct
interpretation in wireless sensor networks
Methodologies for Analyzing Equilibria in Wireless Games
Under certain assumptions in terms of information and models, equilibria
correspond to possible stable outcomes in conflicting or cooperative scenarios
where rational entities interact. For wireless engineers, it is of paramount
importance to be able to predict and even ensure such states at which the
network will effectively operate. In this article, we provide non-exhaustive
methodologies for characterizing equilibria in wireless games in terms of
existence, uniqueness, selection, and efficiency.Comment: To appear in IEEE Signal Processing Magazine, Sep. 200