David Simplot-Ryl

David Simplot-Ryl
National Institute for Research in Computer Science and Control | INRIA · Centre de recherche Inria Lille - Nord Europe

About

167
Publications
11,872
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
3,782
Citations

Publications

Publications (167)
Book
Wireless sensor networks have gained much attention these last years thanks to the great set of applications that accelerated the technological advances. Such networks have been widely investigated and many books and articles have been published about the new challenges they pose and how to address them. One of these challenges is node mobility: se...
Article
Full-text available
In k-anycasting, a sensor wants to report event information to any k sinks in the network. In this paper, we describe KanGuRou, the first position-based energy efficient k-anycast routing which guarantees the packet delivery to k sinks as long as the connected component that contains s also contains at least k sinks. A node s running KanGuRou first...
Conference Paper
Full-text available
HELLO protocol or neighborhood discovery is essential in wireless ad hoc networks. It makes the rules for nodes to claim their existence/aliveness. In the presence of node mobility, no fix optimal HELLO frequency and optimal transmission range exist to maintain accurate neighborhood tables while reducing the energy consumption and bandwidth occupat...
Article
In this paper, we address the problem of peer-to-peer networking for data dissemination among actors in wireless sensor and actor networks (WSANs), which consist of static sensors, responsible for environment monitoring, and mobile actors, in charge of data collection and task performing. This problem has not been received much attention although p...
Article
Full-text available
We propose a radically new family of geometric graphs, i.e., Hypocomb (HC), Reduced Hypocomb (RHC), and Local Hypocomb (LHC). HC and RHC are extracted from a complete graph; LHC is extracted from a Unit Disk Graph (UDG). We analytically study their properties including connectivity, planarity, and degree bound. All these graphs are connected (provi...
Chapter
This chapter examines the different techniques used to access medium radio in wireless sensor networks. It summarizes and describes a large proportion of the medium access control (MAC) protocols and techniques. MAC protocols proposed in the literature require the use of common parameters to evaluate and compare their performance. The parameters ar...
Article
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 issue. This paper addresses the problem of autonomous deployment of mobile sensors that need t...
Article
Full-text available
Wireless sensor networks are of energy-constrained nature, which calls for energy efficient protocols as a primary design goal. Thus, minimizing energy consumption is a main challenge.We are concerned in howcollected data by sensors, can be processed to increase the relevance of certain mass of data and reduce the overall data traffic. Since sensor...
Article
Full-text available
We thank all the reviewers for their helpful feedback and suggestions to improve the quality of each paper.
Article
Full-text available
This paper considers the problem of designing power efficient routing with guaranteed delivery for sensor networks with unknown geographic locations. We propose HECTOR, a hybrid energy efficient tree-based optimized routing protocol, based on two sets of virtual coordinates. One set is based on rooted tree coordinates, and the other is based on hop...
Article
Full-text available
In typical mobile wireless sensor networks, flows sent from collecting sensors to a sink could traverse inefficient resource expensive paths and experience arbitrary delays. This is particularly problematic in event-based sensor network where flows are of great importance. In this paper, we are interested in energy-aware routing algorithms that exp...
Article
Full-text available
In mobile-beacon assisted sensor localization, beacon mobility scheduling aims to determine the best beacon trajectory so that each sensor receives sufficient beacon signals and becomes localized with minimum delay. We propose a novel DeteRministic dynamic bEAcon Mobility Scheduling (DREAMS) algorithm, without requiring any prior knowledge of the s...
Conference Paper
Full-text available
In k-anycasting, a sensor wants to report event information to any k sinks in the network. This is important to gain in reliability and efficiency in wireless sensor and actor networks. In this paper, we describe KanGuRou, the first position-based energy efficient k-anycast routing which guarantees the packet delivery to k sinks as long as the conn...
Article
The current specification of the IEEE 802.15.4 standard for beacon-enabled wireless sensor networks does not define how the fraction of the time that wireless nodes are active, known as the duty cycle, needs to be configured in order to achieve the optimal ...
Conference Paper
We consider a path-scheduling problem at a resource constrained node A that transmits two types of flows to a given destination through alternate paths. Type-1 flow is assumed to have a higher priority than type-2 flow thus, it is never rejected upon arrival. Type-2 flow, on the other hand, may be denied admission to the queue. Once accepted to the...
Article
IntroductionPreliminariesBroadcasting ProtocolsEvaluation of PerformancesConclusion GlossaryCross References
Article
In the last few years, a stimulating idea is fast emerging in the wireless scenario: the pervasive presence around us of a variety of ¿things¿ or ¿objects¿ such as devices, sensors, actuators, and mobile phones, which, through unique addressing schemes, are able to interact with each other and cooperate with their neighboring ¿smart¿ components to...
Article
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 localized and is based on a subset of neighbors for motion decision. Our algorithm maintains a connected topology regardless of the direct...
Conference Paper
Full-text available
In mobile-beacon assisted sensor localization, beacon mobility scheduling aims to determine the best beacon trajectory so that each sensor receives sufficient beacon signals with minimum delay. We propose a novel DeteRministic bEAcon Mobility Scheduling (DREAMS) algorithm, without requiring any prior knowledge of the sensory field. In this algorith...
Conference Paper
Full-text available
In a Radio-Frequency IDentification network, while several readers are placed close together to improve coverage and consequently read rate, reader-reader collision problems happen frequently and inevitably. High probability of collision not only impairs the benefit of multi-reader deployment, but also results in misreadings in moving RFID tags. In...
Article
Full-text available
Following the “Internet of Things” concept, each object is associated with a unique identifier which will allow to retrieve information about it in large databases. In the process of managing a large amount of objects, and consequently a large amount of events from readers, without overloading the network, these events have to be filtered and aggre...
Article
Full-text available
Nowadays, we daily meet new wireless technologies. This is often achieved through the use of RFID (Radio Frequency IDentification) tags and wireless sensors. Our environment and surrounding objects become communicating. New applications thus arise in domains such as logistic, health, rescue and environment preservation. Embedding such devices in va...
Conference Paper
Full-text available
Topology control in wireless sensor networks is an important issue for scalability and energy efficiency. It is often based on graph reduction performed through the use of Gabriel Graph or Relative Neighborhood Graph. This graph reduction is usually based on geometric values. In this paper we tackle the problem of possible connectivity loss in the...
Conference Paper
Full-text available
A substitution network is a rapidly deployable backup wireless solution to quickly react to network topology changes due to failures or to flash crowd effects on the base network. Unlike other ad hoc and mesh solutions, a substitution network does not attempt to provide new services to customers but rather to restore and maintain at least some of t...
Conference Paper
Hello protocol is the basic technique for neighborhood discovery in wireless ad hoc networks. It requires nodes to claim their existence/aliveness by periodic ‘hello’ messages. Central to a hello protocol is the determination of ‘hello’ message transmission rate. No fixed optimal rate exists in the presence of node mobility. The rate should in fact...
Conference Paper
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 sink is thus a fundamental issue. This article addresses the problem of autonomous deployment of mobile sensors that need to cove...
Article
Full-text available
We propose a radically new family of geometric graphs, i.e., Hypocomb, Reduced Hypocomb and Local Hypocomb. The first two are extracted from a complete graph; the last is extracted from a Unit Disk Graph (UDG). We analytically study their properties including connectivity, planarity and degree bound. All these graphs are connected (provided the ori...
Article
Ad hoc networks are expected to have some critical connectivity properties before partitioning. Timely partition prediction signals action for improving fault tolerance and performing some data or service replication so that the network can continue functioning after partition does occur. This article surveys existing prediction concepts and discus...
Article
Ad hoc networks are expected to have some critical connectivity properties before partitioning. Timely partition prediction signals action for improving fault tolerance and performing some data or service replication so that the network can continue functioning after partition does occur. This article surveys existing prediction concepts and discus...
Conference Paper
Full-text available
In mobile wireless sensor networks, flows sent from data collecting sensors to a sink could traverse inefficient resource expensive paths. Such paths may have several negative effects such as devices battery depletion that may cause the network to be disconnected and packets to experience arbitrary delays. This is particularly problematic in eventb...
Chapter
Geometric routing protocols are a memoryless and scalable approach which uses position information for routing. Principles of geometric routing approaches are very simple. Every node is assumed to be aware of the location of itself, of its neighbors, and of the destination. Based only on these information, every node is able to perform a routing de...
Article
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 communication. Hence, the energy efficiency of the system is a major issue. Different represe...
Conference Paper
Full-text available
SensLAB's goal is to provide a very large scale open wireless sensor network testbed, by deploying 1024 nodes over 4 interconnected sites, and to offer a reference tool for the wireless sensor network community. Our demonstration purpose is to illustrate what the SensLAB1 platform offers through a case study: an animal tracking application needing...
Conference Paper
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 neighbours for motion decision. Our algorithm maintains a connected topology regardless of the dir...
Chapter
Full-text available
The RFID middleware is a set of components which aims to manage RFID readers, deals with RFID-events and data, and is connected to end-user applications. The middleware is located between readers and business applications. This chapter describes the general architecture of such a middleware. Section 1 descibes the management of readers, i.e. reader...
Book
In this book, the authors provide an insight into the field of RFID systems with an emphasis on networking aspects and research challenges related to passive Ultra High Frequency (UHF) RFID systems. The book reviews various algorithms, protocols and design solutions that have been developed within the area, including most recent advances. In additi...
Article
Full-text available
We propose a radically new family of geometric graphs, i.e., Hypocomb, Reduced Hypocomb and Local Hypocomb. The first two are extracted from a complete graph; the last is extracted from a Unit Disk Graph (UDG). We analytically study their properties including connectivity, planarity and degree bound. All these graphs are connected (provided the ori...
Conference Paper
Full-text available
OLSR is a well-known proactive protocol for wireless networks. Although very efficient by many points, it suffers from the drawbacks of not taking into account QoS metrics such as delay or bandwidth. To overcome this pitfall, some QOLSR (QoS OLSR) solutions have been designed. Nevertheless, they still provide weak performance regarding QoS metrics....
Chapter
Coverage is a functional basis of any sensor network. The impact on coverage from stochastic node dropping and inevitable node failure, coupling with controlled node mobility, gives rise to the problem of movement-assisted sensor placement in wireless sensor and actuator networks (WSAN). One or more actuators may carry sensors, and drop them at pro...
Article
L'identification par radiofréquence (RFID) déclenche des craintes dont certaines résulteraient d'une surestimation des risques engendrés par les usages envisagés à ce jour.
Article
Full-text available
Nous introduisons EtE, le premier protocole de routage géographique qui soit à la fois économe en énergie et garantissant la livraison. EtE combine les points forts de techniques existantes que sont le coût sur progrès et le routage Greedy-Face-Greedy. Les résultats de simulation montrent que EtE présente une consommation énergétique non seulement...
Conference Paper
Full-text available
In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has higher priority to be covered than a distant one. A localized sensor self-deployment algorithm, named Greedy-Rotation-Greedy (GRG) [10], has recently been proposed for constructing...
Article
Full-text available
We propose, EtE, a novel end-to-end localized routing protocol for wireless sensor networks that is energy-efficient and guarantees delivery. To forward a packet, a node s in graph G computes the cost of the energy weighted shortest path between s and each of its neighbors in the forward direction towards the destination which minimizes the ratio o...
Conference Paper
We study the minimum range assignment problem that consists in finding the range assignment that minimizes energy consumption in the network. We exhibit one bad behavior of classical graph reduction-based approaches: they only consider the sum of edges' weight as an optimization criterion. We then design a new graph reduction algorithm (the minimum...
Conference Paper
Full-text available
Following the ldquoInternet of thingsrdquo concept, each object will be associated with a unique identifier which will allow to retrieve information about it in large databases. In the process of retrieving information, this identifier (ID) may have to be translated into different formats (e.g. domain name style format for object name service query...
Conference Paper
Full-text available
In the anycasting problem, a sensor wants to report event information to one of sinks or actors. We describe the first localized anycasting algorithms that guarantee delivery for connected multi-sink sensor-actor networks. Let S(x) be the closest actor/sink to sensor x, and |xS(x)| be distance between them. In greedy phase, a node s forwards the pa...
Article
Full-text available
We propose several localized algorithms to achieve energy-efficient broadcasting in wireless multihop networks using directional antennas. Each node needs to know only geographic position of itself and its neighbors. Our first protocol is called DRBOP and it follows the one-to-one communication model to reach to all nodes in the relative neighborho...
Conference Paper
A range assignement in a wireless sensor network is a function that assigns to each node a communication range in order to minimize its energy consumption while preserving the quality of the network. We study the range assignment problem in a network modelized with a realistic physical layer. In this case, the classical notion of connectivity is no...
Conference Paper
Full-text available
We propose a localized sensor localization scheme making full use of controlled mobility of a location-aware actor and the connectivity of the sensor network. It contains two new algorithms: a unscented particle filter (UPF) based localization algorithm and an actor mobility scheduling algorithm. The former is an application of UPF. It enables sens...
Conference Paper
We describe how to build a relative neighborhood graph on a real network without any positioning system. We base the computation of the RNG on a RSSI weight function and show how to adapt transmission power to the resulting graph.
Article
The ONS is a central lookup service used in the EPCglobal network for retrieving the location of information about a specific EPC. This centralized solution lacks scalability and fault tolerance. We present the design principles of a distributed solution for ONS lookup service. In distributed systems, the problem of providing a scalable location se...
Article
Full-text available
In this paper, we consider the self-deployment of wireless sensor network. We present a deployment strategy for mobile wireless sensor network which maximizes the sensors covered area with the constraint that the resulting deployment provides a connected topology. Our deployment algorithm is distributed and is based on subset of neighbour for motio...
Article
Full-text available
La collecte des données est un des enjeux majeurs dans les réseaux de capteurs. En effet, les communications induites par la transmission de données réduisent considérablement la durée de vie du réseau. Une des techniques utilisées pour réduire la quantité de données transférées est l'agrégation et selon le type des données étudiées, une des possib...
Article
Full-text available
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 routing protocol, based on two sets of virtual coordinates. One set is based on rooted tree coor...
Conference Paper
Full-text available
We propose a novel localized routing protocol for wireless sensor networks (WSN) that is energy-efficient and guarantees delivery. We prove that it is constant factor of the optimum for dense networks. To forward a packet, a node s in graph G computes the cost of the energy weighted shortest path (SP) between s and each of its neighbors which are c...
Article
Full-text available
We propose a novel localized routing protocol for wireless sensor networks (WSN) that is energy-efficient and guarantees delivery. We prove that it is constant factor of the optimum for dense networks. To forward a packet, a node $s$ in graph $G$ computes the cost of the energy weighted shortest path (SP) between $s$ and each of its neighbors which...
Conference Paper
We present a localized geographic multicast scheme, MSTEAM, based on the construction of local minimum spanning trees (MSTs), that requires information only on 1-hop neighbors. A message replication occurs when the MST spanning the current node and the set of destinations has multiple edges originated at the current node. Destinations spanned by th...
Article
We investigate broadcasting and energy preservation in ad hoc networks. One of the best known algorithm, the Broadcast Incremental Power (BIP) protocol, constructs an efficient spanning tree rooted at a given node. It offers very good results in terms of energy savings, but its computation is centralized and it is a real problem in ad hoc networks....
Article
Full-text available
We propose several localized sensor area coverage protocols for heterogeneous sensors, each with arbitrary sensing and transmission radii. The approach has a very small communication overhead since prior knowledge about neighbor existence is not required. Each node selects a random time out and listens to messages sent by other nodes before the tim...
Article
La conception d'une pile de communication pour une application pour réseaux de capteurs est fastidieuse. En effet, il faut déterminer les protocoles les plus aptes à convenir à cette application bien particulière. Il faut donc disposer d'un moyen pour les comparer en tenant compte des caractèristiques de l'application et de ses besoins. Nous propos...
Article
It is now commonly accepted that the unit disk graph used to model the physical layer in wireless networks does not reflect real radio transmissions, and that a more realistic model should be considered for experimental simulations. Previous work on realistic scenarios has been focused on unicast, however broadcast requirements are fundamentally di...
Article
We present a minimum spanning tree based energy aware multicast protocol (MSTEAM), which is a localized geographic multicast routing scheme designed for ad hoc and sensor networks. It uses locally-built minimum spanning trees (MST) as an efficient approximation of the optimal multicasting backbone. Using an MST is highly relevant in the context of...
Conference Paper
In this paper, we are interested in simple routing protocols, for wireless sensor networks. One of the major challenging issue in sensor networks is that nodes rely on batteries with limited capacity. Therefore, to extend the life of the sensors and the reliability of the network, an efficient routing algorithm can reduce/optimize energy consumptio...