Covering Points of Interest with Mobile Sensors
Found in: IEEE Transactions on Parallel and Distributed Systems
By Milan Erdelj,Tahiry Razafindralambo,David Simplot-Ryl
Issue Date:January 2013
pp. 32-43
The coverage of Points of Interest (PoI) is a classical requirement in mobile wireless sensor applications. Optimizing the sensors self-deployment over a PoI while maintaining the connectivity between the sensors and the base station is thus a fundamental ...

Adaptive router deployment for multimedia services in mobile pervasive environments
Found in: Pervasive Computing and Communications Workshops, IEEE International Conference on
By Karen Miranda,Enrico Natalizio,Tahiry Razafindralambo,Antonella Molinaro
Issue Date:March 2012
pp. 471-474
In this paper, we present an adaptive algorithm to deploy or re-deploy wireless mobile relays in pervasive environments. To that end, we simulate a simple scenario where a wireless router moves between two static nodes, a source and a destination of multim...

Towards Energy-Efficient Algorithm-Based Estimation in Wireless Sensor Networks
Found in: Mobile Ad-hoc and Sensor Networks, International Conference on
By Alia Ghaddar, Tahiry Razafindralambo, Isabelle Simplot-Ryl, David Simplot-Ryl, Samar Tawbi
Issue Date:December 2010
pp. 39-46
A primary purpose of sensing in a sensor network is to collect and aggregate information about a phenomenon of interest. The batteries on today’s wireless sensor barely last a few days, and nodes typically expend a lot of energy in computation and wireless...

Algorithm for data similarity measurements to reduce data redundancy in wireless sensor networks
Found in: A World of Wireless, Mobile and Multimedia Networks, International Symposium on
By Alia Ghaddar, Tahiry Razafindralambo, Isabelle Simplot-Ryl, Samar Tawbi, Abbas Hijazi
Issue Date:June 2010
pp. 1-6
Extending the lifetime of wireless sensor networks remains the most challenging and demanding requirement that impedes large-scale deployments. The basic operation in WSNs is the systematic gathering and transmission of sensed data to a base station for fu...

Connectivity guarantee during wireless sensor networks deployment
Found in: A World of Wireless, Mobile and Multimedia Networks, International Symposium on
By Tahiry Razafindralambo, David Simplot-Ryl
Issue Date:June 2010
pp. 1-6
In this paper, we consider the self-deployment of wireless sensor networks. We present a mechanism which allows to preserve network connectivity during the deployment of mobile wireless sensors. Our algorithm is distributed and is based on a subset of neig...

Scalable Address Allocation Protocol for Mobile Ad Hoc Networks
Found in: Mobile Ad-hoc and Sensor Networks, International Conference on
By Yu Chen, Eric Fleury, Tahiry Razafindralambo
Issue Date:December 2009
pp. 41-48
In this paper, we present for mobile ad hoc networks an efficient distributed address allocation protocol which is immune to topology changes caused by node's mobility. Contrary to the common belief that mobility makes protocol design more difficult, we sh...

Hector is an Energy Efficient Tree-Based Optimized Routing Protocol for Wireless Networks
Found in: Mobile Ad-hoc and Sensor Networks, International Conference on
By Nathalie Mitton, Tahiry Razafindralambo, David Simplot-Ryl, Ivan Stojmenovic
Issue Date:December 2008
pp. 31-38
This paper considers the problem of designing power efficient routing with guaranteed delivery for sensor networks with known distances between neighbors but unknown geographic locations. We propose HECTOR, a hybrid energy efficient tree-based optimized ro...

Multiple coverage with controlled connectivity in wireless sensor networks
Found in: Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks (PE-WASUN '10)
By Antoine Gallais, Julien Beaudaux, Tahiry Razafindralambo
Issue Date:October 2010
pp. 9-16
The k-coverage of the area of interest is a classical requirement in wireless sensor networks, for purposes such as redundancy or multiple supervision of the area. We aim in this article at preserving full k-coverage of the area of interest yet minimizing ...

Dynamic packet aggregation to solve performance anomaly in 802.11 wireless networks
Found in: Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems (MSWiM '06)
By Isabelle Guérin Lassous, Luigi Iannone, Serge Fdida, Tahiry Razafindralambo
Issue Date:October 2006
pp. 247-254
In the widely used 802.11 standard, the so-called performance anomaly is a well-known issue. Several works have tried to solve this problem by introducing mechanisms such as packet fragmentation, backoff adaptation, or packet aggregation during a fixed tim...