Anaïs Vergne

Learn More
This paper aims to validate the β-Ginibre point process as a model for the distribution of base station locations in a cellular network. The β-Ginibre is a repulsive point process in which repulsion is controlled by the β parameter. When β tends to zero, the point process converges in law towards a Poisson point process. If β equals to one it becomes a(More)
This paper evaluates and compares different Coordinated MultiPoint (CoMP) Joint Processing (JP) schemes. We consider the LTE-Advanced codebook-based schemes, where the serving beams are taken from a pre-determined codebook. We namely consider Single User Joint Processing (SUJP) and Multiple Users Joint Processing (MUJP) with two variants: Least Interfering(More)
Homology theory provides new and powerful solutions to address the coverage problems in wireless sensor networks (WSNs). They are based on algebraic objects, such as Čech complex and Rips complex. Čech complex gives accurate information about coverage quality, but requires a precise knowledge of the relative locations of nodes. This assumption is(More)
Considering a damaged wireless network, presenting coverage holes or disconnected components, we propose a disaster recovery algorithm repairing the network. It provides the list of locations where to put new nodes to patch the coverage holes and mend the disconnected components. In order to do this we first consider the simplicial complex representation of(More)
—In this paper, we introduce an algorithm which constructs the generalizedČech complex. The generalizedČech complex represents the topology of a wireless network whose cells are different in size. This complex is often used in many application to locate the boundary holes or to save energy consumption in wireless networks. The complexity of a construction(More)
—In this paper, we present an algorithm for the recovery of wireless networks after a disaster. Considering a damaged wireless network, presenting coverage holes or/and many disconnected components, we propose a disaster recovery algorithm which repairs the network. It provides the list of locations where to put new nodes in order to patch the coverage(More)
—In this paper, a novel resource allocation scheme based on discrete Cournot-Nash equilibria and optimal transport theory is proposed. The originality of this framework lies in the joint optimization of downlink bandwidth allocation and cooperation between base stations. A tractable formalization is given in the form of a quadratic optimization problem. A(More)