Selective Jamming of LoRaWAN using Commodity Hardware

Long range, low power networks are rapidly gaining acceptance in the Internet of Things (IoT) due to their ability to economically support long-range sensing and control applications while providing multi-year battery life. LoRa is a key example of this new class of network and is being deployed at large scale in several countries worldwide. As these networks move out of the lab and into the real world, they expose a large cyber-physical attack surface. Securing these networks is therefore both critical and urgent. This paper highlights security issues in LoRa and LoRaWAN that arise due to the choice of a robust but slow modulation type in the protocol. We exploit these issues to develop a suite of practical attacks based around selective jamming. These attacks are conducted and evaluated using commodity hardware. The paper concludes by suggesting a range of countermeasures that can be used to mitigate the attacks.Comment: Mobiquitous 2017, November 7-10, 2017, Melbourne, VIC, Australi

Providing over-the-horizon awareness to driver support systems

Vehicle-to-vehicle communications is a promising technique for driver support systems to increase traffic safety and efficiency. A proposed system is the Congestion Assistant [1], which aims at supporting drivers when approaching and driving in a traffic jam. Studies have shown great potential for the Congestion Assistant to reduce the impact of congestion, even at low penetration. However, these studies assumed complete and instantaneous availability of information regarding position and velocity of vehicles ahead. In this paper, we introduce a system where vehicles collaboratively build a so-called TrafficMap, providing over-the-horizon awareness. The idea is that this TrafficMap provides highly compressed information that is both essential and sufficient for the Congestion Assistant to operate. Moreover, this TrafficMap can be built in a distributed way, where only a limited subset of the vehicles have to alter it and/or forward it in the upstream direction. Initial simulation experiments show that our proposed system provides vehicles with a highly compressed view of the traffic ahead with only limited communication

Information collection algorithm for vehicular ad-hoc networks (application domain: Urban Traffic Wireless Vehicular Ad-Hoc Networks (VANETs))

Vehicle to vehicle communication (V2VC) is one of the modern approaches for exchanging and generating traffic information with (yet to be realized) potential to improve road safety, driving comfort and traffic control. In this research, we present a novel algorithm which is based on V2V communication, uses in-vehicle sensor information and in collaboration with the other vehicles' sensor information can detect road conditions and determine the geographical area where this road condition exists – e.g. geographical area where there is traffic density, unusual traffic behaviour, a range of weather conditions (raining), etc. The algorithms' built-in automatic geographical restriction of the data collection, aggregation and dissemination mechanisms allows warning messages to be received by any car, not necessarily sharing the identified road condition, which may then be used to identify the optimum route taken by the vehicle e.g. avoid bottlenecks or dangerous areas including accidents or congestions on their current routes. This research covers the middle ground between MANET [1] and collaborative data generation based on knowledge granularity (aggregation). It investigates the possibility of designing, implementing and modelling of the functionality of an algorithm (as part of the design of an intelligent node in an Intelligent Transportation System - ITS) that ensures active participation in the formation, routing and general network support of MANETs and also helps in-car traffic information and real-time control generation and distribution. The work is natural extension of the efforts of several large EU projects like DRIVE [2], GST [3] and SAFESPOT [4]

An Improved Simulated Annealing Technique for Enhanced Mobility in Smart Cities

Vehicular traffic congestion is a significant problem that arises in many cities. This is due to the increasing number of vehicles that are driving on city roads of limited capacity. The vehicular congestion significantly impacts travel distance, travel time, fuel consumption and air pollution. Avoidance of traffic congestion and providing drivers with optimal paths are not trivial tasks. The key contribution of this work consists of the developed approach for dynamic calculation of optimal traffic routes. Two attributes (the average travel speed of the traffic and the roads’ length) are utilized by the proposed method to find the optimal paths. The average travel speed values can be obtained from the sensors deployed in smart cities and communicated to vehicles via the Internet of Vehicles and roadside communication units. The performance of the proposed algorithm is compared to three other algorithms: the simulated annealing weighted sum, the simulated annealing technique for order preference by similarity to the ideal solution and the Dijkstra algorithm. The weighted sum and technique for order preference by similarity to the ideal solution methods are used to formulate different attributes in the simulated annealing cost function. According to the Sheffield scenario, simulation results show that the improved simulated annealing technique for order preference by similarity to the ideal solution method improves the traffic performance in the presence of congestion by an overall average of 19.22% in terms of travel time, fuel consumption and CO2 emissions as compared to other algorithms; also, similar performance patterns were achieved for the Birmingham test scenario

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Vehicle density in VANET Applications

This paper analyzes how street-level traffic data affects routing in VANETs applications. First, we offer a general review about which protocols and techniques would fit best for VANET applications. We selected five main technical aspects (Transmission, Routing, Quality of Service, Security and Location) that we consider are differential aspects of VANETs from current Ad-Hoc Networks. Second, the paper analyzes how to configure each technical aspect according to the goal of a wide range of VANET applications. Third, we look at the routing aspect in depth, specifically focusing on how vehicle density affects routing, which protocols are the best option when there is a high/low density, etc. Finally, this research implements a sensor technology, based on an acoustics sensor that has been deployed around the city of Xalapa in México, to obtain reliable information on the real-time density of vehicles. The levels of density were discretized and the obtained data samples were used to feed a traffic simulator, which allowed us to obtain a global picture of the density of the central area of the city. According to the specific levels of vehicle density at a specific moment and place, VANET applications may adapt the routing protocol in a real-time wayPeer ReviewedPostprint (published version

QF-MAC: Adaptive, Local Channel Hopping for Interference Avoidance in Wireless Meshes

The throughput efficiency of a wireless mesh network with potentially malicious external or internal interference can be significantly improved by equipping routers with multi-radio access over multiple channels. For reliably mitigating the effect of interference, frequency diversity (e.g., channel hopping) and time diversity (e.g., carrier sense multiple access) are conventionally leveraged to schedule communication channels. However, multi-radio scheduling over a limited set of channels to minimize the effect of interference and maximize network performance in the presence of concurrent network flows remains a challenging problem. The state-of-the-practice in channel scheduling of multi-radios reveals not only gaps in achieving network capacity but also significant communication overhead. This paper proposes an adaptive channel hopping algorithm for multi-radio communication, QuickFire MAC (QF-MAC), that assigns per-node, per-flow ``local'' channel hopping sequences, using only one-hop neighborhood coordination. QF-MAC achieves a substantial enhancement of throughput and latency with low control overhead. QF-MAC also achieves robustness against network dynamics, i.e., mobility and external interference, and selective jamming attacker where a global channel hopping sequence (e.g., TSCH) fails to sustain the communication performance. Our simulation results quantify the performance gains of QF-MAC in terms of goodput, latency, reliability, communication overhead, and jamming tolerance, both in the presence and absence of mobility, across diverse configurations of network densities, sizes, and concurrent flows