Security in Ad-Hoc Networks

Author(s):  
Muhammad Mahmudul Islam ◽  
Ronald Pose ◽  
Carlo Kopp

Due to the nature of wireless media, dynamic network topology, resource constraints, and lack of any base station or access point, security in ad-hoc networks is more challenging than with cabled networks. In this chapter, we discuss various attacks on the network layer of ad-hoc networks. We also review security protocols that protect network layer operations from various attacks.

Author(s):  
Mamata Rath ◽  
Bibudhendu Pati ◽  
Jhum Swain

With faster expansion of mobile networks and quicker increment of web clients, more individuals approach worldwide data and communication innovation, because of which the issues of utilizing web as a worldwide stage and empowering the savvy protests and machines to coordinate, discuss, register, and ascertain slowly develops. In mobile ad-hoc networks (MANETs) and vehicular ad-hoc networks (VANET), the mobile stations and vehicles are self-reconfigurable as per the difference in network topology. Joint action between convenient centers is more basic because of the way that they confront significant difficulties, for example, frailty to work securely while protecting its advantages and performing secure guiding among center points. In the presence of vindictive hubs, one of the rule challenges in MANET is to plot ground-breaking security course of action that can shield MANET from different routing assaults.


Author(s):  
Chi-Kin Chau ◽  
Jon Crowcroft ◽  
Kang-Won Lee ◽  
Starsky H.Y. Wong

Because of the increasing number of diverse routing protocols proposed to deal with the network dynamics in mobile ad hoc networks (MANETs), the heterogeneity of MANETs has increased dramatically. While many of these extant proposals only concern enhancing routing in a single domain, little attention has been given to the interoperations among heterogeneous MANETs. Moreover, the existing inter-domain routing protocols (i.e., BGP) that have been designed for the Internet cannot cope with the new challenges derived from the MANETs, such as (1) the rapid dynamic changes of network topology due to mobility, and (2) the larger diversity in intra-domain ad hoc routing protocols. In this chapter, the authors address some of the major challenges and identify new directions to the development of seamless inter-domain routing for enabling end-to-end communications over heterogeneous MANET domains.


Author(s):  
Rakesh Kumar Singh

Mobile Ad Hoc Network (MANET) is a collection of communication devices or nodes that wish to communicate without any fixed infrastructure. The nodes in MANET themselves are responsible for dynamically discovering other nodes to communicate. A number of challenges like open peer-to-peer network architecture, stringent resource constraints, shared wireless medium, dynamic network topology etc. are posed in MANET. In this research, we identify the existent security threats an ad hoc network faces, the security services required to be achieved and the countermeasures for attacks in each layer. To accomplish our goal, we have done literature survey in gathering information related to various types of attacks and solutions, as well as we have made comparative study to address the threats in different layers. Finally, we have identified the challenges and proposed solutions to overcome them. There is no general algorithm that suits well against the most commonly known attacks such as wormhole, rushing attack, etc.


Computers ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 6 ◽  
Author(s):  
Abdallah Sobehy ◽  
Eric Renault ◽  
Paul Muhlethaler

Location services for ad-hoc networks are of indispensable value for a wide range of applications, such as the Internet of Things (IoT) and vehicular ad-hoc networks (VANETs). Each context requires a solution that addresses the specific needs of the application. For instance, IoT sensor nodes have resource constraints (i.e., computational capabilities), and so a localization service should be highly efficient to conserve the lifespan of these nodes. We propose an optimized energy-aware and low computational solution, requiring 3-GPS equipped nodes (anchor nodes) in the network. Moreover, the computations are lightweight and can be implemented distributively among nodes. Knowing the maximum range of communication for all nodes and distances between 1-hop neighbors, each node localizes itself and shares its location with the network in an efficient manner. We simulate our proposed algorithm in a NS-3 simulator, and compare our solution with state-of-the-art methods. Our method is capable of localizing more nodes (≈90% of nodes in a network with an average degree ≈10).


2020 ◽  
Vol 9 (2) ◽  
pp. 23 ◽  
Author(s):  
Rajorshi Biswas ◽  
Jie Wu

Cognitive radio (CR) technology is envisioned to use wireless spectrum opportunistically when the primary user (PU) is not using it. In cognitive radio ad-hoc networks (CRAHNs), the mobile users form a distributed multi-hop network using the unused spectrum. The qualities of the channels are different in different locations. When a user moves from one place to another, it needs to switch the channel to maintain the quality-of-service (QoS) required by different applications. The QoS of a channel depends on the amount of usage. A user can select the channels that meet the QoS requirement during its movement. In this paper, we study the mobility patterns of users, predict their next locations and probabilities to move there based on its history. We extract the mobility patterns from each user’s location history and match the recent trajectory with the patterns to find future locations. We construct a spectrum database using Wi-Fi access point location data and the free space path loss formula. We propose a machine learning-based mechanism to predict spectrum status of some missing locations in the spectrum database. We formulate a problem to select the current channel in order to minimize the total number of channel switches during a certain number of next moves of a user. We conduct an extensive simulation combining real and synthetic datasets to support our model.


2014 ◽  
Vol 13 (10) ◽  
pp. 2185-2198 ◽  
Author(s):  
Floriano De Rango ◽  
Peppino Fazio ◽  
Francesco Scarcello ◽  
Francesco Conte

2019 ◽  
Vol 15 (9) ◽  
pp. 155014771987807
Author(s):  
Fei Ding ◽  
Xiaojun Sun ◽  
Xiaojin Ding ◽  
Ruoyu Su ◽  
Dengyin Zhang ◽  
...  

The authentication scheme for vehicular ad hoc networks aims to improve the security and integrity of message delivery. The base station manages a large number of vehicular nodes, so the security communications are non-trivial. In this article, we propose an amplify-and-forward strategy for a dual-hop cooperative network in order to improve secure communications for vehicular ad hoc networks. We assume that each vehicular node equipped with a single antenna and derive closed-form expressions for the secure communication rate calculation. Moreover, we propose a cooperative strategy by jointly considering average power scaling and instantaneous power scaling, which are proved to be able to achieve information security. The simulation result shows that the proposed scheme can achieve better performance in scenarios with different signal-to-noise ratio.


Sign in / Sign up

Export Citation Format

Share Document