24 research outputs found

    An Overview of Security Challenges in Vehicular Ad-Hoc Networks

    Full text link
    © 2017 IEEE. Vehicular Ad hoc Networks (VANET) is emerging as a promising technology of the Intelligent Transportation systems (ITS) due to its potential benefits for travel planning, notifying road hazards, cautioning of emergency scenarios, alleviating congestion, provisioning parking facilities and environmental predicaments. But, the security threats hinder its wide deployment and acceptability by users. This paper gives an overview of the security threats at the various layers of the VANET communication stack and discuss some of the existing solutions, thus concluding why designing a security framework for VANET needs to consider these threats for overcoming security challenges in VANET

    Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

    Full text link
    Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

    Survivability Strategies for Emerging Wireless Networks With Data Mining Techniques: a Case Study With NetLogo and RapidMiner

    Get PDF
    [EN] Emerging wireless networks have brought Internet and communications to more users and areas. Some of the most relevant emerging wireless technologies are Worldwide Interoperability for Microwave Access, Long-Term Evolution Advanced, and ad hoc and mesh networks. An open challenge is to ensure the reliability and robustness of these networks when individual components fail. The survivability and performance of these networks can be especially relevant when emergencies arise in rural areas, for example supporting communications during a medical emergency. This can be done by anticipating failures and finding alternative solutions. This paper proposes using big data analytics techniques, such as decision trees for detecting nodes that are likely to fail, and so avoid them when routing traffic. This can improve the survivability and performance of networks. The current approach is illustrated with an agent based simulator of wireless networks developed with NetLogo and data mining processes designed with RapidMiner. According to the simulated experimentation, the current approach reduced the communication failures by 51.6% when incorporating rule induction for predicting the most reliable routes.This work was supported in part by the research project Construccion de un framework para agilizar el desarrollo de aplicaciones moviles en el a mbito de la salud through the University of Zaragoza and Foundation Ibercaja under Grant JIUZ-2017-TEC-03, in part by the Universidad de Zaragoza, in part by the Fundacion Bancaria Ibercaja, in part by the Fundacion CAI in the Programa Ibercaja-CAI de Estancias de Investigacion under Grant IT1/18, in part by the program Estancias de movilidad en el extranjero Jose Castillejo para jovenes doctores through the Spanish Ministry of Education, Culture and Sport under Grant CAS17/00005, in part by the Desarrollo Colaborativo de Soluciones AAL through the Spanish Ministry of Economy and Competitiveness under Grant TIN2014-57028-R, in part by the Organismo Autonomo Programas Educativos Europeos under Grant 2013-1-CZ1-GRU06-14277, and in part by the Ministerio de Economia y Competitividad in the Programa Estatal de Fomento de la Investigacion Cientifica y Tecnica de Excelencia, Subprograma Estatal de Generacion de Conocimiento within the project under Grant TIN2017-84802-C2-1-P.García-Magariño, I.; Gray, G.; Lacuesta Gilabert, R.; Lloret, J. (2018). Survivability Strategies for Emerging Wireless Networks With Data Mining Techniques: a Case Study With NetLogo and RapidMiner. IEEE Access. 6:27958-27970. https://doi.org/10.1109/ACCESS.2018.2825954S2795827970

    Stability of secure routing protocol in ad hoc wireless network.

    Get PDF
    The contributions of this research are threefold. First, it offers a new routing approach to ad hoc wireless network protocols: the Enhanced Heading-direction Angle Routing Protocol (EHARP), which is an enhancement of HARP based on an on-demand routing scheme. We have added important features to overcome its disadvantages and improve its performance, providing the stability and availability required to guarantee the selection of the best path. Each node in the network is able to classify its neighbouring nodes according to their heading directions into four different zone-direction group. The second contribution is to present a new Secure Enhanced Heading-direction Angle Routing Protocol (SEHARP) for ad hoc networks based on the integration of security mechanisms that could be applied to the EHARP routing protocol. Thirdly, we present a new approach to security of access in hostile environments based on the history and relationships among the nodes and on digital operation certificates. We also propose an access activity diagram which explains the steps taken by a node. Security depends on access to the history of each unit, which is used to calculate the cooperative values of each node in the environment

    D2D-V2X-SDN: Taxonomy and Architecture towards 5G Mobile Communication System

    Get PDF
    In the era of information society and 5G networks, cars are extremely important mobile information carriers. In order to meet the needs of multi-scenario business requirements such as vehicle assisted driving and in-vehicle entertainment, cars need to interact with the outside world. This interconnection and data transmission process is usually called vehicular communication (V2X, Vehicle-to-Everything). Device-to-device (D2D) communication not only has partial nature of communication, but also alleviate the current problem of spectrum scarcity of resources. The application of D2D communication in V2X can meet the requirements of high reliability and low latency, but resource reuse also brings interference. Software-defined networking (SDN) provides an optimal solution for interoperability and flexibility between the V2X and D2D communication. This paper reviews the integration of D2D and V2X communication from the perspective of SDN. The state-of-the-art and architectures of D2D-V2X were discussed. The similarity, characteristics, routing control, location management, patch scheduling and recovery is described. The integrated architecture reviewed in this paper can solve the problems of routing management, interference management and mobile management. It also overcome the disconnection problem between the D2D-V2X in terms of SDN and provides some effective solutions.- Qatar National Research Fund (QNRF) - [UREP27-020-1-003]. - Ministry of Higher Education, Malaysia (MOHE) - [FRGS/1/2018/ICT02/UKM/02/6]. - National Research Foundation of Korea (NRF) - [2019R1C1C1007277]. - Taif University (TU)- [TURSP-2020/260]

    Routing Strategies for Capacity Enhancement in Multi-hop Wireless Ad Hoc Networks

    Get PDF
    This thesis examines a Distributed Interference Impact Probing (DIIP) strategy for Wireless Ad hoc Networks (WANETs), using a novel cross-layer Minimum Impact Routing (MIR) protocol. Perfonnance is judged in tenns of interference reduction ratio, efficiency, and system and user capacity, which are calculated based on the measurement of Disturbed Nodes (DN). A large number of routing algorithms have been proposed with distinctive features aimed to overcome WANET's fundamental challenges, such as routing over a dynamic topology, scheduling broadcast signals using dynamic Media Access Control (MAC), and constraints on network scalability. However, the scalability problem ofWANET cannot simply adapt the frequency reuse mechanism designed for traditional stationary cellular networks due to the relay burden, and there is no single comprehensive algorithm proposed for it. DIIP enhances system and user capacity using a cross layer routing algorithm, MIR, using feedback from DIIP to balance transmit power in order to control hop length, which consequently changes the number of relays along the path. This maximizes the number of simultaneous transmitting nodes, and minimizes the interference impact, i.e. measured in tenns of 'disturbed nodes'. The perfonnance of MIR is examined compared with simple shortest-path routing. A WANET simulation model is configured to simulate both routing algorithms under multiple scenarios. The analysis has shown that once the transmitting range of a node changes, the total number of disturbed nodes along a path changes accordingly, hence the system and user capacity varies with interference impact variation. By carefully selecting a suitable link length, the neighbouring node density can be adjusted to reduce the total number of DN, and thereby allowing a higher spatial reuse ratio. In this case the system capacity can increase significantly as the number of nodes increases. In contrast, if the link length is chosen regardless ofthe negative impact of interference, capacity decreases. In addition, MIR diverts traffic from congested areas, such as the central part of a network or bottleneck points
    corecore