4,047 research outputs found

    Security and Privacy Issues in Wireless Mesh Networks: A Survey

    Full text link
    This book chapter identifies various security threats in wireless mesh network (WMN). Keeping in mind the critical requirement of security and user privacy in WMNs, this chapter provides a comprehensive overview of various possible attacks on different layers of the communication protocol stack for WMNs and their corresponding defense mechanisms. First, it identifies the security vulnerabilities in the physical, link, network, transport, application layers. Furthermore, various possible attacks on the key management protocols, user authentication and access control protocols, and user privacy preservation protocols are presented. After enumerating various possible attacks, the chapter provides a detailed discussion on various existing security mechanisms and protocols to defend against and wherever possible prevent the possible attacks. Comparative analyses are also presented on the security schemes with regards to the cryptographic schemes used, key management strategies deployed, use of any trusted third party, computation and communication overhead involved etc. The chapter then presents a brief discussion on various trust management approaches for WMNs since trust and reputation-based schemes are increasingly becoming popular for enforcing security in wireless networks. A number of open problems in security and privacy issues for WMNs are subsequently discussed before the chapter is finally concluded.Comment: 62 pages, 12 figures, 6 tables. This chapter is an extension of the author's previous submission in arXiv submission: arXiv:1102.1226. There are some text overlaps with the previous submissio

    Virtual Single Network Path by Integrating Multiple and Heterogeneous Challenged Networks

    Get PDF
    Motivated by the question of how to quickly transfer large files if multiple and heterogeneous networks are available but each has insufficient performance for a requested task, we propose a data transfer framework for integrating multiple and heterogeneous challenged access networks, in which long delays, heavy packet losses, and frequent disconnections are observed. An important feature of this framework is to transmit the control information separately from the transmission of data information, where they are flexibly transferred on different types of communication media (network paths) in different ways, and to provide a virtual single network path between the two nodes. We describe the design of the mechanisms of this framework such as the retransmission, the rate adjustment of each data flow, and the data-flow setup control. We validate a prototype implementation through two different experiments using terrestrial networks and a satellite communication system

    Quality and Availability of spectrum based routing for Cognitive radio enabled IoT networks

    Get PDF
    With the recent emergence and its wide spread applicability Internet of Things (IoT) is putting pressure on network resources and most importantly on availability of spectrum. Spectrum scarcity is the issue to be addressed in networking within IoT. Cognitive radio is the technology which addresses the problem of spectrum scarcity in an efficient way. Equipping the IoT devices with cognitive radio capability will lead to a new dimension called cognitive radio enabled IoT devices. To achieve ON-demand IoT solutions and interference free communications cognitive radio enabled IoT devices will become an effective platform for many applications. As there is high dynamicity in availability of spectrum it is challenging for designing an efficient routing protocol for secondary users in cognitive device networks. In this work we are going to estimate spectrum quality and spectrum availability based on two parameters called global information about spectrum usage and instant spectrum status information. Enhanced energy detector is used at each and every node for better probability of detection. For estimating spectrum quality and availability we are introducing novel routing metrics. To have restriction on the number of reroutings and to increase the performance of routing in our proposed routing metric only one retransmission is allowed. Then, two algorithms for routing are designed for evaluating the performance of routing and we find that the bit error rates of proposed algorithms (nodes are dynamic) have decreased a lot when compared to conventional methods (Nodes are static) and throughput of proposed algorithm also improved a lot

    Reliable Message Dissemination in Mobile Vehicular Networks

    Full text link
    Les rĂ©seaux vĂ©hiculaires accueillent une multitude d’applications d’info-divertissement et de sĂ©curitĂ©. Les applications de sĂ©curitĂ© visent Ă  amĂ©liorer la sĂ©curitĂ© sur les routes (Ă©viter les accidents), tandis que les applications d’info-divertissement visent Ă  amĂ©liorer l'expĂ©rience des passagers. Les applications de sĂ©curitĂ© ont des exigences rigides en termes de dĂ©lais et de fiabilitĂ© ; en effet, la diffusion des messages d’urgence (envoyĂ©s par un vĂ©hicule/Ă©metteur) devrait ĂȘtre fiable et rapide. Notons que, pour diffuser des informations sur une zone de taille plus grande que celle couverte par la portĂ©e de transmission d’un Ă©metteur, il est nĂ©cessaire d’utiliser un mĂ©canisme de transmission multi-sauts. De nombreuses approches ont Ă©tĂ© proposĂ©es pour assurer la fiabilitĂ© et le dĂ©lai des dites applications. Toutefois, ces mĂ©thodes prĂ©sentent plusieurs lacunes. Cette thĂšse, nous proposons trois contributions. La premiĂšre contribution aborde la question de la diffusion fiable des messages d’urgence. A cet Ă©gard, un nouveau schĂ©ma, appelĂ© REMD, a Ă©tĂ© proposĂ©. Ce schĂ©ma utilise la rĂ©pĂ©tition de message pour offrir une fiabilitĂ© garantie, Ă  chaque saut, tout en assurant un court dĂ©lai. REMD calcule un nombre optimal de rĂ©pĂ©titions en se basant sur l’estimation de la qualitĂ© de rĂ©ception de lien dans plusieurs locations (appelĂ©es cellules) Ă  l’intĂ©rieur de la zone couverte par la portĂ©e de transmission de l’émetteur. REMD suppose que les qualitĂ©s de rĂ©ception de lien des cellules adjacentes sont indĂ©pendantes. Il sĂ©lectionne, Ă©galement, un nombre de vĂ©hicules, appelĂ©s relais, qui coopĂšrent dans le contexte de la rĂ©pĂ©tition du message d’urgence pour assurer la fiabilitĂ© en multi-sauts. La deuxiĂšme contribution, appelĂ©e BCRB, vise Ă  amĂ©liorer REMD ; elle suppose que les qualitĂ©s de rĂ©ception de lien des cellules adjacentes sont dĂ©pendantes ce qui est, gĂ©nĂ©ralement, plus rĂ©aliste. BCRB utilise les rĂ©seaux BayĂ©siens pour modĂ©liser les dĂ©pendances en vue d’estimer la qualitĂ© du lien de rĂ©ception avec une meilleure prĂ©cision. La troisiĂšme contribution, appelĂ©e RICS, offre un accĂšs fiable Ă  Internet. RICS propose un modĂšle d’optimisation, avec une rĂ©solution exacte optimale Ă  l'aide d’une technique de rĂ©duction de la dimension spatiale, pour le dĂ©ploiement des passerelles. Chaque passerelle utilise BCRB pour Ă©tablir une communication fiable avec les vĂ©hicules.Vehicular networks aim to enable a plethora of safety and infotainment applications. Safety applications aim to preserve people's lives (e.g., by helping in avoiding crashes) while infotainment applications focus on enhancing the passengers’ experience. These applications, especially safety applications, have stringent requirements in terms of reliability and delay; indeed, dissemination of an emergency message (e.g., by a vehicle/sender involved in a crash) should be reliable while satisfying short delay requirements. Note, that multi-hop dissemination is needed to reach all vehicles, in the target area, that may be outside the transmission range of the sender. Several schemes have been proposed to provide reliability and short delay for vehicular applications. However, these schemes have several limitations. Thus, the design of new solutions, to meet the requirement of vehicular applications in terms of reliability while keeping low end-to-end delay, is required. In this thesis, we propose three schemes. The first scheme is a multi-hop reliable emergency message dissemination scheme, called REMD, which guarantees a predefined reliability , using message repetitions/retransmissions, while satisfying short delay requirements. It computes an optimal number of repetitions based on the estimation of link reception quality at different locations (called cells) in the transmission range of the sender; REMD assumes that link reception qualities of adjacent cells are independent. It also adequately selects a number of vehicles, called forwarders, that cooperate in repeating the emergency message with the objective to satisfy multi-hop reliability requirements. The second scheme, called BCRB, overcomes the shortcoming of REMD by assuming that link reception qualities of adjacent cells are dependent which is more realistic in real-life scenarios. BCRB makes use of Bayesian networks to model these dependencies; this allows for more accurate estimation of link reception qualities leading to better performance of BCRB. The third scheme, called RICS, provides internet access to vehicles by establishing multi-hop reliable paths to gateways. In RICS, the gateway placement is modeled as a k-center optimisation problem. A space dimension reduction technique is used to solve the problem in exact time. Each gateway makes use of BCRB to establish reliable communication paths to vehicles
    • 

    corecore