Nowadays, the Internet of Things (IoT) has become immensely popular in various fields like healthcare, smart cities, and industrial automation. IoT networks are expanding rapidly, including different IoT devices with limited capabilities in terms of power and storage which make the IoT security a crucial issue. IoT Network Intrusion Detection System is one of the most famous solutions that used to identify different types of attack and extract their features (e.g. IP addresses of attackers). The IP address is a valuable feature that can identify malicious traffic of an attacker who attempts to access the IoT network. However, IoT Network Intrusion Detection Systems has different limitations: centralization and scalability which easily allow attackers to access the IoT network. Accordingly, this paper aims to address these issues by proposing a novel collaborative framework called Blockchain-based Collaborative Intrusion Detection Systems (BC-IDSs) that utilizes Blockchain technology to connect several IDSs. The BC-IDSs framework (1) creates a list of malicious IP addresses using IDSs; (2) utilizes Blockchain to share and store the Blacklist; (3) creates a function for duplication check in the Blockchain layer. Further, the implementation of a proof of concept for BC-IDSs framework is presented by using Ethereum Blockchain simulators. Compared to previous works, this paper discusses several types of performance metrics that prove BC-IDSs is able to secure IoT networks. BC-IDSs also increases the scalability by 50% when compared to one of the previous defence work.

Cruising for vacant curbside parking spaces causes waste of time, frustration, waste of fuel, and pollution. This problem has been addressed by centralized solutions that perform parking assignments and communicate them to drivers’ smart phones. These solutions suffer, however, from two intrinsic problems: scalability, as the server has to perform intensive computation and communication with the drivers; and privacy, as the drivers have to disclose their destinations to the server. This article proposes DFPS, a distributed mobile system for free parking assignment. DFPS solves the scalability problem by using the drivers’ smart phones to cooperatively compute the parking assignments, and a centralized dispatcher to receive and distribute parking requests to the network of smart phones. The phones of the parked drivers in DFPS are structured in a K-D tree to serve parking requests in a distributed fashion. DFPS removes the computation from the dispatcher and substantially reduces its communication load. DFPS solves the privacy problem through an entropy-based cloaking technique that runs on drivers’ smart phones and conceals drivers’ destinations from the dispatcher. The evaluation demonstrates that DFPS is scalable and obtains better travel time than a centralized system, while protecting the privacy of drivers’ destinations.

This paper aims to provide an efficient solution for people in a city who drive their cars to visit several destinations, where they need to park for a while, but do not care about the visiting order. This instance of the multi-destination route planning problem is novel in terms of its constraints: the real-time traffic conditions and the real-time free parking conditions in the city. The paper proposes a novel Multi-Destination Vehicle Route Planning (MDVRP) system to optimize the travel time for all drivers. MDVRP's design has two components: a mobile app running on the drivers' smart phones that submits real-time route requests and guides the drivers toward destinations, and a server in the cloud that optimizes the routes by finding the most efficient order to visit the destinations. MDVRP uses TDTSP-FPA, an algorithm that finds the fastest route to the next destination and also assigns free curbside parking spaces that minimize the total travel time for drivers. We evaluate MDVRP using a driver trip dataset that contains real vehicular mobility traces of over two million drivers from the city of Cologne, Germany. By learning the spatio-temporal distribution of real driver destinations from this dataset, we build a novel experimental platform that simulates real, multi-destination driver trips. Extensive simulations executed over this platform demonstrate that TDTSP-FPA delivers the best performance when compared to three baseline algorithms.