Quality of Information in Mobile Crowdsensing: Survey and Research Challenges

Smartphones have become the most pervasive devices in people's lives, and are clearly transforming the way we live and perceive technology. Today's smartphones benefit from almost ubiquitous Internet connectivity and come equipped with a plethora of inexpensive yet powerful embedded sensors, such as accelerometer, gyroscope, microphone, and camera. This unique combination has enabled revolutionary applications based on the mobile crowdsensing paradigm, such as real-time road traffic monitoring, air and noise pollution, crime control, and wildlife monitoring, just to name a few. Differently from prior sensing paradigms, humans are now the primary actors of the sensing process, since they become fundamental in retrieving reliable and up-to-date information about the event being monitored. As humans may behave unreliably or maliciously, assessing and guaranteeing Quality of Information (QoI) becomes more important than ever. In this paper, we provide a new framework for defining and enforcing the QoI in mobile crowdsensing, and analyze in depth the current state-of-the-art on the topic. We also outline novel research challenges, along with possible directions of future work.Comment: To appear in ACM Transactions on Sensor Networks (TOSN

User Assignment and Resource Allocation for Hierarchical Federated Learning over Wireless Networks

The large population of wireless users is a key driver of data-crowdsourced Machine Learning (ML). However, data privacy remains a significant concern. Federated Learning (FL) encourages data sharing in ML without requiring data to leave users' devices but imposes heavy computation and communications overheads on mobile devices. Hierarchical FL (HFL) alleviates this problem by performing partial model aggregation at edge servers. HFL can effectively reduce energy consumption and latency through effective resource allocation and appropriate user assignment. Nevertheless, resource allocation in HFL involves optimizing multiple variables, and the objective function should consider both energy consumption and latency, making the development of resource allocation algorithms very complicated. Moreover, it is challenging to perform user assignment, which is a combinatorial optimization problem in a large search space. This article proposes a spectrum resource optimization algorithm (SROA) and a two-stage iterative algorithm (TSIA) for HFL. Given an arbitrary user assignment pattern, SROA optimizes CPU frequency, transmit power, and bandwidth to minimize system cost. TSIA aims to find a user assignment pattern that considerably reduces the total system cost. Experimental results demonstrate the superiority of the proposed HFL framework over existing studies in energy and latency reduction.Comment: Under review by IEEE Transactions on Communication

Collaborative Uploading in Heterogeneous Networks: Optimal and Adaptive Strategies

Collaborative uploading describes a type of crowdsourcing scenario in networked environments where a device utilizes multiple paths over neighboring devices to upload content to a centralized processing entity such as a cloud service. Intermediate devices may aggregate and preprocess this data stream. Such scenarios arise in the composition and aggregation of information, e.g., from smartphones or sensors. We use a queuing theoretic description of the collaborative uploading scenario, capturing the ability to split data into chunks that are then transmitted over multiple paths, and finally merged at the destination. We analyze replication and allocation strategies that control the mapping of data to paths and provide closed-form expressions that pinpoint the optimal strategy given a description of the paths' service distributions. Finally, we provide an online path-aware adaptation of the allocation strategy that uses statistical inference to sequentially minimize the expected waiting time for the uploaded data. Numerical results show the effectiveness of the adaptive approach compared to the proportional allocation and a variant of the join-the-shortest-queue allocation, especially for bursty path conditions.Comment: 15 pages, 11 figures, extended version of a conference paper accepted for publication in the Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), 201

Tube streaming: Modelling collaborative media streaming in urban railway networks

We propose a quality assessment framework for crowdsourced media streaming in urban railway networks. We assume that commuters either tune in to some TV/radio channel, or submit requests for content they desire to watch or listen to, which eventually forms a playlist of videos/podcasts/tunes. Given that connectivity is challenged by the movement of trains and the disconnection that this movement causes, users collabo-ratively download (through cellular and WiFi connections) and share content, in order to maintain undisrupted playback. We model collaborative media streaming for the case of the London Underground train network. The proposed quality assessment framework comprises a utility function which characterises the Quality of Experience (QoE) that users (subjectively) perceive and takes into account all the necessary parameters that affect smooth playback. The framework can be used to assess the media streaming quality in any railway network, after adjusting the related parameters. To the best of our knowledge, this is the first study to quantify the perceptual quality of collaborative media streaming in (underground) railway networks from a modelling perspective, as opposed to a systems perspective. Based on real commuter traces from the London Underground network, we evaluate whether audio and video can be streamed to commuters with acceptable QoE. Our results show that even with very high-speed Internet connection, users still experience disruptions, but a carefully designed collaborative mechanism can result in high levels of perceived QoE even in such disruptive scenarios

Connected Vehicles at Signalized Intersections: Traffic Signal Timing Estimation and Optimization

Summary: While traffic signals ensure safety of conflicting movements at intersections, they also cause much delay, wasted fuel, and tailpipe emissions. Frequent stops and goes induced by a series of traffic lights often frustrates passengers. However, the connectivity provided by connected vehicles applications can improve this situation. A uni-directional traffic signal to vehicle communication can be used to guide the connected vehicles to arrive at green which increases their energy efficiency; and in the first part of the dissertation, we propose a traffic signal phase and timing estimator as a complementary solution in situations where timing information is not available directly from traffic signals or a city’s Traffic Management Center. Another approach for improving the intersection flow is optimizing the timing of traditional traffic signals informed by uni-directional communication from connected vehicles. Nevertheless, one can expect further increase in energy efficiency and intersection flow with bi-directional vehicle-signal communication where signals adjust their timings and vehicles their speeds. Autonomous vehicles can further benefit from traffic signal information because they not only process the incoming information rather effortlessly but also can precisely control their speed and arrival time at a green light. The situation can get even better with 100%penetration of autonomous vehicles since a physical traffic light is not needed anymore. However, the optimal scheduling of the autonomous vehicle arrivals at such intersections remains an open problem. The second part of the dissertation attempts to address the scheduling problem formulation and to show its benefits in microsimulation as well as experiments. Intellectual Merit: In the first part of this research, we study the statistical patterns hidden in the connected vehicle historical data stream in order to estimate a signal’s phase and timing (SPaT). The estimated SPaT data communicated in real-time to connected vehicles can help drivers plan over time the best vehicle velocity profile and route of travel. We use low-frequency probe data streams to show what the minimum achievable is in estimating SPaT. We use a public feed of bus location and velocity data in the city of San Francisco as an example data source. We show it is possible to estimate, fairly accurately, cycle times and duration of reds for pre-timed traffic lights traversed by buses using a few days worth of aggregated bus data. Furthermore, we also estimate the start of greens in real-time by monitoring movement of buses across intersections. The results are encouraging, given that each bus sends an update only sporadically (≈ every 200 meters) and that bus passages are infrequent (every 5-10 minutes). The accuracy of the SPaT estimations are ensured even in presence of queues; this is achieved by extending our algorithms to include the influence of queue delay. A connected vehicle test bed is implemented in collaboration with industry. Our estimated SPaT information is communicated uni-directionally to a connected test vehicle for those traffic signals which are not connected. In the second part of the dissertation, another test bed, but with bi-directional communication capability, is implemented to transfer the connected vehicle data to an intelligent intersection controller through cellular network. We propose a novel intersection control scheme at the cyber layer to encourage platoon formation and facilitate uninterrupted intersection passage. The proposed algorithm is presented for an all autonomous vehicle environment at an intersection with no traffic lights. Our three key contributions are in communica-tion, control, and experimental evaluation: i) a scalable mechanism allowing a large number of vehicles to subscribe to the intersection controller, ii) reducing the vehicle-intersection coordination problem to a Mixed Integer Linear Program (MILP), and iii) a Vehicle-in-the-Loop (VIL) test bed with a real vehicle interacting with the intersection control cyber-layer and with our customized microsimulations in a virtual road network environment. The proposed MILP-based controller receives information such as location and speed from each subscribing vehicle and advises vehicles of the optimal time to access the intersection. The access times are computed by periodically solving a MILP with the objective of minimizing intersection delay, while ensuring intersection safety and considering each vehicle’s desired velocity. In order to estimate the fuel consumption reduction potential of the implemented system, a new method is proposed for estimating fuel consumption using the basic engine diagnostic information of the vehicle-in-the-loop car. Broader Impacts: This research can transform not only the way we drive our vehicles at signalized intersec-tions but also the way intersections are managed. As we evaluated in a connected test vehicle in the first part of the dissertation, our SPaT estimations in conjunction with the SPaT information available directly from Traffic Management Centers, enables the drivers to plan over time the best vehicle velocity profile to reduce idling at red lights. Other fuel efficiency and safety functionalities in connected vehicles can also benefit from such information about traffic signals’ phase and timing. For example, advanced engine management strategies can shut down the engine in anticipation of a long idling interval at red, and intersection collision avoidance and active safety systems could foresee potential signal violations at signalized intersections. In addition, as shown in the second part of the dissertation, when a connected traffic signal or intersection con-troller is available, intelligent control methods can plan in real-time the best timings and the lengths of signal phases in response to prevailing traffic conditions with the use of connected vehicle data. Our MILP-based intersection control is proposed for an all autonomous driving environment; and right now, it can be utilized in smart city projects where only autonomous vehicles are allowed to travel. This is expected to transform driving experience in the sense that our linear formulations minimizes the intersection delay and number of stops significantly compared to pre-timed intersections

Privacy-Preserving Blockchain-Based Federated Learning for IoT Devices

Home appliance manufacturers strive to obtain feedback from users to improve their products and services to build a smart home system. To help manufacturers develop a smart home system, we design a federated learning (FL) system leveraging the reputation mechanism to assist home appliance manufacturers to train a machine learning model based on customers' data. Then, manufacturers can predict customers' requirements and consumption behaviors in the future. The working flow of the system includes two stages: in the first stage, customers train the initial model provided by the manufacturer using both the mobile phone and the mobile edge computing (MEC) server. Customers collect data from various home appliances using phones, and then they download and train the initial model with their local data. After deriving local models, customers sign on their models and send them to the blockchain. In case customers or manufacturers are malicious, we use the blockchain to replace the centralized aggregator in the traditional FL system. Since records on the blockchain are untampered, malicious customers or manufacturers' activities are traceable. In the second stage, manufacturers select customers or organizations as miners for calculating the averaged model using received models from customers. By the end of the crowdsourcing task, one of the miners, who is selected as the temporary leader, uploads the model to the blockchain. To protect customers' privacy and improve the test accuracy, we enforce differential privacy on the extracted features and propose a new normalization technique. We experimentally demonstrate that our normalization technique outperforms batch normalization when features are under differential privacy protection. In addition, to attract more customers to participate in the crowdsourcing FL task, we design an incentive mechanism to award participants.Comment: This paper appears in IEEE Internet of Things Journal (IoT-J

Delivering IoT Services in Smart Cities and Environmental Monitoring through Collective Awareness, Mobile Crowdsensing and Open Data

The Internet of Things (IoT) is the paradigm that allows us to interact with the real world by means of networking-enabled devices and convert physical phenomena into valuable digital knowledge. Such a rapidly evolving field leveraged the explosion of a number of technologies, standards and platforms. Consequently, different IoT ecosystems behave as closed islands and do not interoperate with each other, thus the potential of the number of connected objects in the world is far from being totally unleashed. Typically, research efforts in tackling such challenge tend to propose a new IoT platforms or standards, however, such solutions find obstacles in keeping up the pace at which the field is evolving. Our work is different, in that it originates from the following observation: in use cases that depend on common phenomena such as Smart Cities or environmental monitoring a lot of useful data for applications is already in place somewhere or devices capable of collecting such data are already deployed. For such scenarios, we propose and study the use of Collective Awareness Paradigms (CAP), which offload data collection to a crowd of participants. We bring three main contributions: we study the feasibility of using Open Data coming from heterogeneous sources, focusing particularly on crowdsourced and user-contributed data that has the drawback of being incomplete and we then propose a State-of-the-Art algorith that automatically classifies raw crowdsourced sensor data; we design a data collection framework that uses Mobile Crowdsensing (MCS) and puts the participants and the stakeholders in a coordinated interaction together with a distributed data collection algorithm that prevents the users from collecting too much or too less data; (3) we design a Service Oriented Architecture that constitutes a unique interface to the raw data collected through CAPs through their aggregation into ad-hoc services, moreover, we provide a prototype implementation