Pierre Leone
University of Geneva
74 Papers
578 Citations
Pierre Leone is an academic researcher from University of Geneva. The author has contributed to research in topics: Wireless sensor network & Geographic routing. The author has an hindex of 16, co-authored 70 publications. Previous affiliations of Pierre Leone include École Polytechnique Fédérale de Lausanne.
Chat about Author
Papers
•Journal Article
An optimal data propagation algorithm for maximizing the lifespan of sensor networks
TL;DR: In this paper, the authors consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes and show that maximizing the lifespan, balancing the energy among individual sensors and maximizing the message flow in the network are equivalent.
89
Optimal data gathering paths and energy-balance mechanisms in wireless networks
Aubin Jarry,Pierre Leone,Sotiris Nikoletseas,José D. P. Rolim +3 more
- 01 Aug 2011
TL;DR: It is proven that for energy-balanced data propagation, Pareto optimal routing and flow maximization are equivalent, and also it is proved that flowmaxization is equivalent to maximizing the network lifetime.
An adaptive blind algorithm for energy balanced data propagation in wireless sensors networks
Pierre Leone,Sotiris Nikoletseas,José D. P. Rolim +2 more
- 30 Jun 2005
TL;DR: This paper considers the problem of energy balanced data propagation in wireless sensor networks and generalise previous works by allowing realistic energy assignment and presents two new algorithms, one based on stochastic estimation methods and one adaptive to environmental changes.
40
Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms
Luminita Moraru,Pierre Leone,Sotiris Nikoletseas,José D. P. Rolim +3 more
- 22 Oct 2007
TL;DR: This paper is presenting a novel geographic routing algorithm with obstacle avoidance properties that performs much better in terms of path length thus minimizing latency, space, overall traffic and energy consumption.
33
•Book Chapter
Order barriers for symplectic multi-value methods
Ernst Hairer,Pierre Leone +1 more
- 01 Jan 1998
TL;DR: It is proved that the order of the multi-value method has to be at least twice its stage order, which means that multistep methods can never be symplectic; the only symplectic one-leg method is the implicit mid-point rule, and the Gauss methods are theonly symplectic Runge-Kutta collocation methods.