A novel cryptography based privacy preserving solution for urban mobility and traffic control

© 2015 IEEE. Due to the proliferation of high-speed mobile networks and powerful smartphones featuring on-board GPS and multi-modal sensors devices, urban sensing has recently emerged as a novel computing paradigm for enabling future smart cities. However, users\u27 privacy protection represents currently one of the biggest challenges which can significantly impact the engagement of people and the widespread adoption of such applications. In this paper, we propose a novel trajectory privacy-preserving architecture for urban sensing and traffic control applications. We show that our approach maintains the privacy of users while reducing the performance overhead of cryptographic computations. We further demonstrate that our solution is simple, scalable, and is robust against external attacks in maintaining data privacy and confidentiality of the users

A Line-Based Data Dissemination protocol for Wireless Sensor Networks with Mobile Sink

International audienceIn wireless sensor networks, data dissemination is generally performed from the sensor nodes towards a static sink. In this paper, we address the particular case where the sink is mobile, according to an unpredictable mobility pattern. First, we study existing approaches. As an alternative, we present the Line-Based Data Dissemination (LBDD) protocol. Next, we analytically evaluate the communication cost of this protocol and we compare it to other approaches. Finally, realistic simulations are performed and results show that LBDD outperforms previous approaches and presents the best tradeoff among the evaluated protocols

Analytical Evaluation of Virtual Infrastructures for Data Dissemination in Wireless Sensor Networks with Mobile Sink

International audienceIn this paper, we address the problem of data dissemination in wireless sensor networks (WSN) with mobile sink(s). In such a context, the difficulty is for sensor nodes to efficiently track the sink and report the requested data to the sink location. As flat architectures and flooding-based protocols do not scale, overlaying a virtual infrastructure over the physical network has often been investigated as an interesting strategy for an efficient data dissemination in wireless sensor networks. This virtual infrastructure acts as a rendez-vous area for queries and data reports. The main contribution of this paper is to make an analytical comparative study of a variety of virtual infrastructure topologies. The communication cost and the path stretch are evaluated both in the worst and average cases. Finally, existing data dissemination protocols are compared on different applications scenarios

Strategies for Data Dissemination to Mobile Sinks in Wireless Sensor Networks

International audienceA wireless sensor network is a multihop wireless network consisting of spatially distributed autonomous sensors with sensing, computation, and wireless communication capabilities. Generally, each sensor has the task to monitor and measure ambient conditions and disseminate the collected data toward a base station, or sink, for data post-analysis and processing. Many data dissemination protocols have been proposed to allow the dissemination of the collected data toward a static sink. Recently, mobile sinks were shown to be more energy-effective than static ones. In this article, existing data dissemination protocols supporting mobile sinks are summarized. In addition, sink mobility is analyzed, as well as its impact on energy consumption and the network lifetime

Dissémination dans les réseaux de capteurs avec puits mobiles

National audienceDans cet article, nous proposons une nouvelle structure virtuelle permettant une dissémination efficace dans les réseaux de capteurs avec puits mobiles. Nous étudions analytiquement le coût de communication dans le pire cas. Ensuite, nous simulons et comparons notre proposition à d'autres techniques proposées dans la littérature

Smart Tracking System for School Buses Using Passive RFID Technology to Enhance Child Safety

Abstract-Millions of children need to be moved from home to school and vice versa every day. For parents, obtaining a safe transport for their children is a critical issue. Many children find themselves locked in a school bus in the bus parking lot after falling asleep on their way to school, miss the bus, step into the wrong bus, or leave at the wrong station with no method to track them. This research tested the applicability of radio frequency identification (RFID) technology in tracking and monitoring children during their trip to and from school on school busses. The child safety system developed in this research utilized the passive RFID tracking technology due to its efficient tracking capabilities, low cost, and easy maintenance. To explore the technical feasibility of the proposed system, a set of tests were performed in the lab and with the public. These experiments showed that the RFID tags were effective and stable enough to be used for successfully tracking and monitoring children using the bus. When asked to give their feedback of the solution through a questionnaire, more than 95% of the parents see that such a solution will take their anxiety and worry away and will provide them a tool to track their kids during commuting to and from their schools. Index Terms-School buses, passive RFID, child safety, tracking system

Neighbor discovery in multi-hop wireless networks: evaluation and dimensioning with interferences considerations

International audienceIn this paper, we study the impact of collisions and interferences on a neighbor discovery process in the context of multi-hop wireless networks. We consider three models in which interferences and collisions are handled in very different ways. From an ideal channel where simultaneous transmissions do not interfere, we derive an alternate channel where simultaneous transmissions are considered two-by-two under the form of collisions, to finally reach a more realistic channel where simultaneous transmissions are handled under the form of shot-noise interferences. In these models, we analytically compute the link probability success between two neighbors as well as the expected number of nodes that correctly receive a Hello packet. Using this analysis, we show that if the neighbor discovery process is asymptotically equivalent in the three models, it offers very different behaviors locally in time. In particular, the scalability of the process is not the same depending on the way interferences are handled. Finally, we apply our results to the dimensioning of a Hello protocol parameters. We propose a method to adapt the protocol parameters to meet application constraints on the neighbor discovery process and to minimize the protocol energy consumption