Search

Your search keyword '"Pignolet, Yvonne"' showing total 128 results
Start Over Author "Pignolet, Yvonne"
128 results on '"Pignolet, Yvonne"'

103. On the power of uniform power: capacity of wireless networks with bounded resources.

Author

Avin, Chen, Lotker, Zvi, and Pignolet, Yvonne-Anne

Subjects
WIRELESS sensor networks, SIGNAL-to-noise ratio, NETWORK performance, WIRELESS sensor nodes, ALGORITHMS
Abstract

The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received much attention in recent years. In this paper, we investigate the question of how much the worst-case performance of uniform and non-uniform power assignments differ under constraints such as a bound on the area where nodes are distributed or restrictions on the maximum power available. We determine the maximum factor by which a non-uniform power assignment can outperform the uniform case in the SINR model. More precisely, we prove that in one-dimensional settings the capacity of a non-uniform assignment exceeds a uniform assignment by at most a factor of $$O(\log L_{\max })$$ when the length of the network is $$L_{\max }$$ . In two-dimensional settings, the uniform assignment is at most a factor of $$O(\log P_{\max })$$ worse than the non-uniform assignment if the maximum power is $$P_{\max }$$ . We provide algorithms that reach this capacity in both cases. These bounds are tight in the sense that previous work gave examples of networks where the lack of power control causes a performance loss in the order of these factors. To complement our theoretical results and to evaluate our algorithms with concrete input networks, we carry out simulations on random wireless networks. The results demonstrate that the link sets generated by the algorithms contain around 20-35 % of all links. As a consequence, engineers and researchers may prefer the uniform model due to its simplicity if this degree of performance deterioration is acceptable. [ABSTRACT FROM AUTHOR]

Published
2017
Full Text
View/download PDF

104. Future Internet for Smart Distribution Systems

Author

Pignolet, Yvonne-Anne, Elias, Holger, Kyntäjä, Timo, Martin Diaz De Cerio, Ignacio, Boëda, Didier, Caire, Raphaël, Garcia, Sylvie, Laboratoire de Génie Electrique de Grenoble (G2ELab), and Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)

Subjects
[SPI.NRJ]Engineering Sciences [physics]/Electric power, ComputingMilieux_MISCELLANEOUS, [SPI.NRJ] Engineering Sciences [physics]/Electric power
Abstract

International audience

Published
2012

110. Algorithmic Challenges in Wireless Networks: Interference, Energy and Incentives

Author

Pignolet, Yvonne Anne, Wattenhofer, Roger, Aspnes, James, and Suri, Subhash

Subjects
Electric engineering, MOBILFUNKNETZE + DRAHTLOSE NACHRICHTENNETZE (NACHRICHTENTECHNIK), ddc:621.3, SIGNAL TRANSMISSION + DATA COMMUNICATION (TELECOMMUNICATIONS), MOBILE RADIO NETWORKS + WIRELESS COMMUNICATIONS NETWORKS (TELECOMMUNICATIONS), SIGNALÜBERTRAGUNG + DATENKOMMUNIKATION (NACHRICHTENTECHNIK)
Published
2009
Full Text
View/download PDF

117. Future Internet for smart distribution systems

Author

Pignolet, Yvonne-Anne, primary, Elias, Holger, additional, Kyntaja, Timo, additional, Diaz de Cerio, Ignacio Martin, additional, Heiles, Jurgen, additional, Boeda, Didier, additional, and Caire, Raphael, additional

Published
2012
Full Text
View/download PDF

124. Brief announcement

Author

Holzer, Stephan, primary, Pignolet, Yvonne Anne, additional, Smula, Jasmin, additional, and Wattenhofer, Roger, additional

Published
2010
Full Text
View/download PDF

127. Tomographic Node Placement Strategies and the Impact of the Routing Model

Author

Pignolet, Yvonne-Anne, Schmid, Stefan, and Tredan, Gilles

Abstract

Tomographic techniques can be used for the fast detection of link failures at low cost. Our paper studies the impact of the routing model on tomographic node placement costs. We present a taxonomy of path routing models and provide optimal and near-optimal algorithms to deploy a minimal number of asymmetric and symmetric tomography nodes for basic network topologies under different routing model classes. Intriguingly, we find that in many cases routing according to a more restrictive routing model gives better results: compared to a more general routing model, computing a good placement is algorithmically more tractable and does not entail high monitoring costs, a desirable trade-off in practice.

Published
2018
Full Text
View/download PDF

128. Never Say Never Probabilistic & Temporal Failure Detectors

Author

Dzung, Dacfey, Guerraoui, Rachid, Kozhaya, David, and Pignolet, Yvonne-Anne

Subjects
Mathematics::Combinatorics, probabilistic links, consensus, failure detection
Abstract

The failure detector approach for solving distributed computing problems has been celebrated for its modularity. This approach allows the construction of algorithms using abstract failure detection mechanisms, defined by axiomatic properties, as building blocks. The minimal synchrony assumptions on communication, which enable to implement the failure detection mechanism, are studied separately. Such synchrony assumptions are typically expressed as eventual guarantees that need to hold, after some point in time, forever and deterministically. But in practice, they never do. Synchrony assumptions may hold only probabilistically and temporarily. In this paper, we study failure detectors in a realistic distributed system N, with asynchrony inflicted by probabilistic synchronous communication. We address the following paradox: an implementation of "consensus with probability 1" is possible in N without using randomness in the algorithm itself, while an implementation of "lozenge S with probability 1" is impossible to achieve in N (lozenge S being the weakest failure detector to solve the consensus problem and many equivalent problems). We circumvent this paradox by introducing a new failure detector lozenge S*, a variant of lozenge S with probabilistic and temporal accuracy. We prove that lozenge S* is implementable in N and we provide an optimal lozenge S* algorithm. Interestingly, we show that lozenge S* can replace lozenge S, in several existing deterministic consensus algorithms using lozenge S, to yield an algorithm that solves "consensus with probability 1". In fact, we show that such result holds for all decisive problems (not only consensus) and also for failure detector lozenge P (not only lozenge S). The resulting algorithms combine the modularity of distributed computing practices with the practicality of networking ones.

Catalog

Books, media, physical & digital resources
See catalog results