Industry 4.0 is a revolution in manufacturing by introducing disruptive technologies such as Internet of Things (IoT) and cloud-computing into the heart of the factory. The resulting increased automation and the improved production synergy between stocks, supply chains and customer demands, come along with the threats and attacks from the Internet. Despite extensive literature on the cybersecurity topic, many actors in manufacturing factories are just realizing the impact of cybersecurity in the preservation of their business. This paper introduces step-by-step the concepts and practical aspects of an Industry 4.0 manufacturing factory that are related to cybersecurity. Based on a subdivision of a typical factory into several generic perimeters, we present the vulnerabilities and threats regarding the network and devices usually found in each perimeter. Therefore, it is more efficient to present the recent proposals of the literature regarding cybersecurity guidelines and solutions in Industry 4.0. Instead of spreading a lot of references regarding every aspect of cybersecurity, we focused on a limited number of papers among the recent references. However, for each paper, we provide the details about the purpose of the proposal, the methodology adopted, the technical solution developed and its evaluation by the authors. These solutions range from classical cybersecurity countermeasures to innovative ones, such as those based on honeypots and digital twins. In order to deliver a review also useful to non scientists, we present our guidelines along with those of some organizations involved in cybersecurity harmonization and standardization in the world.

No abstract

Vehicular communications can be achieved through the infrastructure (Vehicle-to-infrastructure network, V2I), as well as directly through vehicle-to-vehicle communication (V2V) via ad hoc networks. In V2V communications, the routing protocols are designed in order to optimize the dissemination of messages. This paper presents an evaluation of routing protocols such as the Optimized Link State Routing (OLSR), Ad hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Geographic Routing Protocol (GRP), while considering both vehicular safety application requirements and mobility models based on real-world traces of vehicular traffic. The results show that, though proactive routing protocols perform better in this context, the four routing protocols fail to fulfill the safety application requirements on the delay metric even for a reasonable number of vehicles.

No abstract

Routing protocols for vehicular ad hoc networks resort to clustering in order to optimize network performance. Concerning the Optimized Link State Routing (OLSR) protocol and the plethora of its derivatives, the multipoint relaying (MPR) technique has proven its efficiency as an accurate clustering scheme over the last two decades. However, it has been emphasized recently that the MPR technique, which was originally designed for open areas, does not benefit from the particular configuration of road sections which are intrinsically spatially constrained. A clustering scheme exploiting this particularity, namely Chain-Branch-Leaf (CBL), has been introduced in order to enhance the flooding of broadcast traffic, including that related to routing operations. In this paper, both MPR and CBL are evaluated through MATLAB simulation over several scenarios based on realistic road configurations and traffic generated with SUMO simulator. The results show that CBL actually reduces the number of nodes acting as relays (cluster-heads) in the network, thus decreasing the routing traffic related to creation and retransmission of topology control (TC) messages. Also, they show that, with CBL, the nodes chosen as relays remain longer in this role, thus favoring the overall network stability, and that most of the nodes remain attached longer to the same relay than with the MPR technique.

The objective of the multipoint relay (MPR) technique is to reduce the number of redundant retransmissions, while ensuring reliable delivery of broadcast messages in wireless networks. To do this, it is necessary to select a small set of re-transmitter nodes, called multipoint relays. Selecting multipoint relays is a fundamental operation in the optimized link-state routing (OLSR) protocol. Research on MPR selection commonly focuses on heuristics. We propose to model MPR selection as a mixed-integer program. Solving this model optimally provides the means to accurately analyse and compare MPR selection heuristics. We also propose a new method for exploring the graph model of the network in order to satisfy the required constraints optimally. We call this exploration method reversible marking. We then combine this reversible marking mechanism with the simple greedy heuristic to create a new OLSR-compliant MPR selection heuristic. Testing has shown that our heuristic offers a good compromise between the need to minimise the number of MPR and the need to insure good coverage.Keywords: optimized link state routing protocol; OLSR; multipoint relay selection; reversible marking.Reference to this paper should be made as follows: Gantsou, D., Sondi, P. and Hanafi, S. (2009) 'Revisiting multipoint relay selection in the optimized link state routing protocol', Int.

No abstract

No abstract