Papers by Nathalie Mitton
Proceedings of the 17th ACM Symposium on QoS and Security for Wireless and Mobile Networks
In this paper, we investigate and present how to generate application traces of IoT (Internet of ... more In this paper, we investigate and present how to generate application traces of IoT (Internet of Things) Applications in an automated, repeatable and reproducible manner. By using the FIT IoT-Lab large scale testbed and relying on state-of-the-art software engineering techniques, we are able to produce, collect and share artifacts and datasets in an automated way. This makes it easy to track the impact of software updates or changes in the radio environment both on a small scale, e.g. during a single day, and on a large scale, e.g. during several weeks. By providing both the source code for the trace generation as well as the resulting datasets, we hope to reduce the learning curve to develop such applications and encourage reusability as well as pave the way for the replication of our results. While we focus in this work on IoT networks, we believe such an approach could be of used in many other networking domains. CCS CONCEPTS • Networks → Network experimentation; Ad hoc networks; • Computer systems organization → Sensor networks.
Towards a smart city based on cloud of things, a survey on the smart city vision and paradigms
Geographic routing protocols show good properties for Wireless Sensor Networks (WSN). They are st... more Geographic routing protocols show good properties for Wireless Sensor Networks (WSN). They are stateless, local and scalable. However they require that each node of the network is aware of its own position. While it may be possible to equip each node with GPS receiver, even if it is costly, there are some issues and receiving a usable GPS signal may be difficult in some situations. For these reasons, we propose a geographic routing algorithm, called HGA, able to take advantages of position informations of nodes when available but also able to continue the routing in a more traditional way if position information is not available. We show with simulations that our algorithm offers an alternative solution to classical routing algorithm (non-geographic) and offers better performances for network with a density above 25 and more than 5% of nodes are aware of their position.
MobileR: Multi-hop energy efficient localised mobile georouting in wireless sensor and actuator networks
A novel family of geometric planar graphs for wireless ad hoc networks
Energy-based Clustering for Wireless Sensor Network Lifetime Optimization
2019 27th Telecommunications Forum (TELFOR), Nov 1, 2019
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific re... more HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Distributed Computing Systems …, 2010
One of the notoriously difficult problems in vehicular ad-hoc networks (VANET) is to ensure that ... more One of the notoriously difficult problems in vehicular ad-hoc networks (VANET) is to ensure that established routing paths do not break before the end of data transmission. This is a difficult problem because the network topology is constantly changing and the wireless communication links are inherently unstable, due to high node mobility. In this paper we classify existing VANET routing protocols into five categories: connectivitybased, mobility-based, infrastructure-based, geographic-locationbased, and probability-model-based, according to their employed routing metrics. For each category, we present the general design ideas and state of the art. Our objective is to attract more attention to the VANET routing problem and encourage more research efforts on developing reliable solutions.
From Topology Control to Communication Aspects
Sensors
Four new algorithms (RFTA1, RFTA2, GFGF2A, and RFTA2GE) handling the event in wireless sensor and... more Four new algorithms (RFTA1, RFTA2, GFGF2A, and RFTA2GE) handling the event in wireless sensor and robot networks based on the greedy-face-greedy (GFG) routing extended with auctions are proposed in this paper. In this paper, we assume that all robots are mobile, and after the event is found (reported by sensors), the goal is to allocate the task to the most suitable robot to act upon the event, using either distance or the robots’ remaining energy as metrics. The proposed algorithms consist of two phases. The first phase of algorithms is based on face routing, and we introduced the parameter called search radius (SR) at the end of this first phase. Routing is considered successful if the found robot is inside SR. After that, the second phase, based on auctions, is initiated by the robot found in SR trying to find a more suitable one. In the simulations, network lifetime and communication costs are measured and used for comparison. We compare our algorithms with similar algorithms fr...
From Topology Control to Communication Aspects
A GPS-less on-demand mobile sink-assisted data collection in wireless sensor networks
2014 IFIP Wireless Days (WD), 2014
2013 International Conference on Wireless Communications and Signal Processing, 2013
This paper considers the Slepian-Wolf coding based data aggregation problem and the corresponding... more This paper considers the Slepian-Wolf coding based data aggregation problem and the corresponding dependable clustering problem in wireless sensor networks (WSNs). A dependable Slepian-Wolf coding based clustering (D-SWC) algorithm is proposed to provide dependable clustering against cluster-head failures. The proposed D-SWC algorithm attempts to elect a primary cluster head and a backup cluster head for each cluster member during clustering so that once a failure occurs to the primary cluster head the cluster members within the failed cluster can promptly switchover to the backup cluster head and thus recover the connectivity of the failed cluster to the data sink without waiting for the next-round clustering to be performed. Simulation results show that the D-SWC algorithm can effectively increase the amount of data transmitted to the data sink as compared with an existing nondependable clustering algorithm for Slepian-Wolf coding based data aggregation in WSNs.
Using Location Services to Autonomously Drive Flying Mobile Sinks in Wireless Sensor Networks
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2014
Ad-Hoc, Mobile, and Wireless Networks, 2007
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in... more Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing protocols are preferred because sensor networks have limited battery life. Location aware routing protocols are good candidates for sensor network applications, nevertheless they need either an external location service like GPS or Galileo (which are bulky, energy consuming devices) or internal location services providing non-unique virtual coordinates ...
This paper focuses on Mobile Wireless Sensor Network based dynamic event coverage. Mobility is ex... more This paper focuses on Mobile Wireless Sensor Network based dynamic event coverage. Mobility is exploited in order to improve both the power consumption and the coverage of specific Zone of Interest (ZoI) that can change dynamically over time. Controlled mobility of the devices is achieved by the design of two distributed and local algorithms. The first algorithm is based on Particle Swarm Optimization (PSO) and Virtual Forces. We modify the classical PSO approach to propose a totally distributed algorithm, which only needs for the mobile sensors to receive local information from the neighbors to update their velocity and trajectory (PSO-S). This new distributed version of the PSO is combined with a distributed version of the Virtual Forces Algorithm (VFA). The second algorithm is a distributed implementation of the VFA that we call VFA-D. To the best of our knowledge, these two approaches are novel in their distributed character, scalability and implementability on small and resourceconstrained devices. We show that the proposed algorithms are reactive, i.e. they are able to capture in an effective fashion the events in the sensor field even if the position of the events changes over time. To show the effectiveness of the proposed techniques, we perform many simulations to compare both the PSO-S and the VFA-D schemes with a centralized version of the VFA. Simulations show the good performance in terms of coverage and energy consumption as well as the high reactivity of both PSO-S and VFA-D when the ZoI changes.
Existing theoretical and simulation studies on georouting appear detached from experimental studi... more Existing theoretical and simulation studies on georouting appear detached from experimental studies in real environments. We set up our test environment by using WSN430 wireless sensor nodes. To overcome the need for significant number of wireless nodes required to perform a realistic experiment in high density network, we introduce a novel approach -emulation by using relatively small number of nodes in 1-hop experimental setup. Source node is a fixed sensor, all available sensors are candidate forwarding neighbors with virtual destination. Source node makes one forwarding step, destination position is adjusted, and the same source again searches for best forwarder. We compare three georouting algorithms. We introduce here Greedy geographical routing Algorithms in a REal environment (GARE) which builds a RNG by using ET X(uv) |uv| as edge weight (ET X(uv) counts all transmissions and possibly acknowledgments between two nodes until message is received), and selects RNG neighbor with greatest progress toward destination (if none of RNG neighbors has progress, all neighbors are considered). Our experiments show that GARE is significantly more efficient than existing XTC algorithm (applying RNG on ET X(uv)) in energy consumption. COP GARE selects neighbor with progress that minimizes ET X(uv) |uv| , and outperforms both algorithms.
Mobile Sensor Networks, 2009
Existing theoretical and simulation studies on georouting appear detached from experimental studi... more Existing theoretical and simulation studies on georouting appear detached from experimental studies in real environments. We set up our test environment by using WSN430 wireless sensor nodes. To overcome the need for significant number of wireless nodes required to perform a realistic experiment in high density network, we introduce a novel approach -emulation by using relatively small number of nodes in 1-hop experimental setup. Source node is a fixed sensor, all available sensors are candidate forwarding neighbors with virtual destination. Source node makes one forwarding step, destination position is adjusted, and the same source again searches for best forwarder. We compare three georouting algorithms. We introduce here Greedy geographical routing Algorithms in a REal environment (GARE) which builds a RNG by using ET X(uv) |uv| as edge weight (ET X(uv) counts all transmissions and possibly acknowledgments between two nodes until message is received), and selects RNG neighbor with greatest progress toward destination (if none of RNG neighbors has progress, all neighbors are considered). Our experiments show that GARE is significantly more efficient than existing XTC algorithm (applying RNG on ET X(uv)) in energy consumption. COP GARE selects neighbor with progress that minimizes ET X(uv) |uv| , and outperforms both algorithms.
2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks, 2009
Existing theoretical and simulation studies on georouting appear detached from experimental studi... more Existing theoretical and simulation studies on georouting appear detached from experimental studies in real environments. We set up our test environment by using WSN430 wireless sensor nodes. To overcome the need for significant number of wireless nodes required to perform a realistic experiment in high density network, we introduce a novel approach -emulation by using relatively small number of nodes in 1-hop experimental setup. Source node is a fixed sensor, all available sensors are candidate forwarding neighbors with virtual destination. Source node makes one forwarding step, destination position is adjusted, and the same source again searches for best forwarder. We compare three georouting algorithms. We introduce here Greedy geographical routing Algorithms in a REal environment (GARE) which builds a RNG by using ET X(uv) |uv| as edge weight (ET X(uv) counts all transmissions and possibly acknowledgments between two nodes until message is received), and selects RNG neighbor with greatest progress toward destination (if none of RNG neighbors has progress, all neighbors are considered). Our experiments show that GARE is significantly more efficient than existing XTC algorithm (applying RNG on ET X(uv)) in energy consumption. COP GARE selects neighbor with progress that minimizes ET X(uv) |uv| , and outperforms both algorithms.
How to Improve CSMA-Based MAC Protocol for Dense RFID Reader-to-Reader Networks?
Lecture Notes in Computer Science, 2014
Uploads
Papers by Nathalie Mitton