Capturing individual mobility patterns has become a crucial issue for a tremendous number of applications, often requiring the use of privacy-invasive or energy-consuming sensors and online services. In parallel to this, the proliferation of wireless network access points (APs), scattered in a very dense manner in many geographical areas, is now opening up new technological opportunities. In this work, we demonstrate the use of network discovery data passively collected from Wi-Fi APs to infer mobility indicators. This local approach can potentially be implemented on any device with a communication interface, and allows for continuous and long-term data collection. The demo showcases a multi-platform mobile app (DISCO) and is presented alongside an extended desktop analysis toolbox. Additional material can be found online1.

This demo paper presents a new sensor focusing on the measurement of real time foot plantar pressure distribution. IEE S.A. releases a single insole-solution for daily usage in order to acquire information on the plantar load dispersion in a large range of shoe configurations. The new High-Dynamic Force-Sensing Resistor (HD-FSR) multi-cell smart insole sensor enables advanced real-time gait analysis applications.

Researchers and manufacturers are currently putting a lot of efforts to design, improve and deploy the Internet of Things, involving a significant number of constrained and low cost embedded devices deployed in large scales with low power consumption, low bandwidth and limited communication range. For instance we can easily build a network composed by multiple sensors distributed in a building in order to monitor temperature in different offices. This kind of architecture is generally centralized as all sensors are mainly programmed to periodically transmit their data to the sink. The specific IPv6 Routing Protocol for Low-power and Lossy Networks (RPL) had been designed in order to enable such communications. Support for point-to-point traffic is also available. In fact new applications may also consider peer-to-peer communications between any nodes of the network. In that case, RPL is not optimal as data packets are forwarded in respect with longer paths with larger metrics. In this paper we propose to study the effectiveness of RPL compared to a shortest path algorithm such like the Dijkstra's algorithm. We suggest to analyze peer-to-peer communications inside random wireless sensor network topologies with size limited to 250 nodes, corresponding to a reasonable cluster size. We have built a particular simulation environment named Network Analysis and Routing eVALuation (NARVAL). This toolbox permits to generate random topologies in order to study the impact of routing algorithms on the effectiveness of communication protocols. In our work, we first generated many random network topologies where we selected a sink node. We built the Destination Oriented Directed Acyclic Graph (DODAG) from the chosen sink in respect with the RPL algorithm. We finally performed all paths between each couple of two distinct sensor nodes and compared them to the corresponding shortest paths obtained by the Dijkstra's algorithm. This approach permits to retrieve some statistics on the path extension between RPL and the Dijkstra's algorithm. We also analyzed the impact of the sink position and the network size on this path extension.

In this paper, we propose Well-Connected Dominating Set Channel Assignment (WCDS-CA), a distributed hybrid algorithm that uses a well-connected dominating set to perform a selection of communication channels in wireless sensor networks in such a way that the number of channels used and interference among sensor nodes remains minimal. Since the network topology allows each sensor node to be equipped with several radio interfaces, a set of parents and leaves are statically assigned to a single fixed channel. The routers are assigned to several orthogonal channels using the corresponding radio interfaces in such a way that they can switch dynamically to the static channels of parent nodes in order to minimize network interference. The tree based on Breadth-First Search is built out from the sink, with the result that the shortest between each sensor and the sink is established. This allows the data to be efficiently propagated from parent to router to parent towards the sink in order to reduce the number of individual transmissions. We compare the results obtained with those for a single channel by taking the common links used by each node on each channel and packets transmitted as performance criteria, and show that our proposal gives better results in dense wireless sensor networks.

This paper compares different alternative aggregation techniques for Wireless Sensor Networks Optimization based on tree construction. The main idea is to efficiently elect parent nodes responsible of data aggregation according to their connectivity degree. Thus, the quantity of data transmitted on the network remains minimal during the transfer from all sensors towards the sink. Simulations have shown that our new approach provides a better performance than existing techniques such as BFS, DFS and flooding, especially in terms of quantity of data packets transmitted from all sensor towards the sink.

This contribution aims to show how path diversity can reduce the high variability of the Internet traffic. We attempt to improve the traffic behavior of a connection between two network entities. The most used transmission protocols as TCP and UDP are not capable to carry out all the traffic generated by the Internet as they lead to congestion and packet loss out of the connections required QoS. We present here the state of our research based on the discovery of disjoint connection paths on a network topology. We have designed a new transmission protocol that takes advantage of route diversity. We propose a TCP protocol based on Multiple Paths MPTCP for a data transmission between two network entities in a well-defined environment. Multipath routing and multipath transport protocols seem to be a relevant solution to avoid the drawbacks generated by the use of a single path for each data connection. MPTCP aims to avoid or reduce the congestions appearance and the high variability of the Internet traffic. A simulator has been developed on top of Scilab in order to evaluate the gain provided by the route diversity.

This contribution is attempting to show how a route diversity can improve the traffic behavior of a connection between two network entities. The most used transmission protocols TCP and UDP control the quasi-totality of the Internet traffic. However they are not capable to carry out all the traffic generated by the Internet as they lead to congestion and packet loss out of the quality of service required specially for critical connections that need to be treat with a higher priority. In this paper, we focus on multipath routing and multipath transport protocols that seem to be a relevant solution to avoid the drawbacks generated by the use of a single path by each connection packet. Pushing connection packets on multiple paths during all the data transaction should bring a better QoS. We mention a new protocol design for the next generation Internet. This protocol has been developed in order to avoid or reduce the congestions appearance and the high variability of the Internet traffic. We suggest a TCP protocol based on Multiple Paths MPTCP for a data transmission between two network entities in a well-defined environment. A simulator has been developed in order to evaluate the gain provided by the route diversity.