scholarly journals Cohen Kappa Reliability Factor-based Mitigation Mechanism for Enhancing Cooperation in Ad hoc Networks

2020 ◽  
Vol 9 (4) ◽  
pp. 166-172
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Test Reliability ◽  
Mobile Nodes ◽  
Reliability Factor ◽  
Energy Consumptions ◽  
Hoc Networks ◽  
Detection Schemes ◽  
Byzantine Nodes ◽  
Reducing Energy

This paper presents a Cohen Kappa Reliability Factor-based Mitigation Mechanism (CKRFMM) for enabling trustworthy detection of Byzantine nodes. This detection process is achieved by estimating the reliability of the mobile nodes calculated through Cohen Kappa Reliability Factor (CKRF). CKRFMM reconfirms the byzantine behavior of active mobile nodes through Pareto function. Pareto function is a predominant re-test reliability estimator available in the classical theory of statistics. The simulation experimentation conducted using ns-2 of the CKRFMM is determined to be excellent in reducing energy consumptions, network delay compared to the benchmarked byzantine node detection schemes considered for investigation.

scholarly journals Energy Efficient and robust routing with RPAR Protocol in Ad Hoc Networks

2017 ◽  
Vol 7 (1.1) ◽  
pp. 477
Author(s):  
Joshua Reginald Pullagura ◽  
D Venkata Rao
Keyword(s):  
Ad Hoc Networks ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Life Time ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Energy Efficient Routing ◽  
Hop Count ◽  
Routing Mechanism ◽  
Hoc Networks

In ad hoc network, the topology of network changes frequently due to the mobile nature of nodes where the communication is possible without any fixed network infrastructure. Mobile nodes are battery operated and so energy efficient routing should be provided which increases the network life time. The existing routing mechanisms do not consider both hop count and energy of nodes for data transmission. In this paper we propose a routing mechanism where data transfer from source to destination is based on the minimum hop count and residual energy of mobile nodes. The proposed RPAR protocol shows better performance when compared to existing Energy power aware routing  protocol .The analysis is carried out by using network simulator (NS-2), the simulation results shows that the proposed routing mechanism provides energy efficient and reliable  routing in ad hoc networks.

scholarly journals Simulation of Cryptographic Algorithms in IPSec on Ad-Hoc Networks

2017 ◽  
Vol 28 (1) ◽  
pp. 31-46
Author(s):  
A.A. Adas A.A. Adas
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Data Communication ◽  
Secure Routing ◽  
Security Model ◽  
Mobile Nodes ◽  
New Paradigm ◽  
Hoc Networks ◽  
Ipsec Protocol

This paper focuses on secure data communication between nodes in Ad-Hoc networks by employing IPSec (Internet Protocol Security). In wireless communication, Ad-Hoc network is a new paradigm since, which is used for highly sensitive and emergency operations. Ad-Hoc network is considered a number of mobile nodes that are connected through wireless interfaces and moves arbitrarily. Ensuring security is one of the main issues due to its infrastructure less solutions. This research aims for IPSec protocol that provides security for an Ad-Hoc networking in a various applications. IPSec incorporates security model, i.e. AES (Advanced Encryption Standard) into its framework. In this work, we consider the problem of incorporating security mechanisms to securing data communication for Ad-Hoc networks. We look at AODV routing protocol (Ad-Hoc On-Demand Distance Vector) in detail and it is used for secure routing. Simulation of IPSec protocol is simulated using NS-3 simulator. Results from NS-3 simulator is compared with AH, ESP, and AES in terms of Quality of Service parameters throughput, average processing time and average end-to-end delay.

Security Issues in Mobile Ad Hoc Networks

2014 ◽  
pp. 176-221 ◽  
Author(s):  
Sunil Kumar ◽  
Kamlesh Dutta
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobile Nodes ◽  
Security Vulnerabilities ◽  
Security Issues ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A Mobile Ad hoc NETwork (MANET) is a self-organizing, infrastructure-less network of mobile nodes connecting by wireless links. In operation, the nodes of MANETs do not have a central control mechanism. It is known for its properties of routable network, where each node acts as a router to forward packets to other specific nodes in the network. The unique properties of MANET have made it useful for large number of applications and led to a number of security challenges. Security in the mobile ad hoc network is a very critical job and requires the consideration of different security issues on all the layers of communication. The countermeasures are the functions that reduce or eliminate security vulnerabilities and attacks. This chapter provides a comprehensive study of all prominent attacks in Mobile Ad Hoc Networks described in the literature. It also provides various proactive and reactive approaches proposed to secure the MANETs. Moreover, it also points to areas of research that need to be investigated in the future.

Reservation MAC Protocols for Ad-Hoc Networks

2011 ◽  
pp. 103-119
Author(s):  
Ghalem Boudour ◽  
Cédric Teyssié ◽  
Mammeri Zoubir
Keyword(s):  
Comparative Analysis ◽  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Resource Reservation ◽  
Fixed Number ◽  
Mac Protocols ◽  
Ieee 802.11E ◽  
Mobile Nodes ◽  
Hoc Networks ◽  
Bandwidth Guarantees

Multimedia and real-time applications require bandwidth guarantees, which may be achieved by resource reservation. Several researches were done to propose efficient reservation MAC protocols for ad-hoc networks. In these schemes, channel is segmented into super-frames composed of fixed number of slots. They allocate slots to each traffic source, and make sure that neighbor nodes record the reservation in order to ensure consistency of reservations between neighbor nodes. However, resource reservation in ad-hoc networks remain a very challenging task due to the instability of radio channels, node mobility and lack of coordination between mobile nodes. Proposed reservation MAC protocols like CATA, FPRP, R-CSMA and SRMA/PA have limitations and are suitable only for particular situations. In this paper, we propose a comparative analysis of the most representative reservation MAC protocols. We identify the major issues unresolved by reservation MAC protocols. A performance evaluation and comparative analysis with the IEEE 802.11e are achieved through the NS-2 simulator.

Handoff Schemes in Mobile Environments

2020 ◽  
Vol 11 (1) ◽  
pp. 55-72
Author(s):  
Libin Thomas ◽  
J Sandeep ◽  
Bhargavi Goswami ◽  
Joy Paulose
Keyword(s):  
Ad Hoc Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Environments ◽  
Mobile Nodes ◽  
Mobile Environment ◽  
Coverage Area ◽  
Communication Links ◽  
Hoc Networks ◽  
Handoff Schemes

Vehicular ad-hoc networks are one of the most popular applications of Ad-hoc networks, where networks are formed without any sort of physical connecting medium and can be formed whenever required. It is an area in networks that has enjoyed a considerable amount of attention for quite some time. Due to the highly mobile environment where these networks find their usability, it can be understood that there are a lot of problems with respect to maintaining the communication links between the moving vehicular nodes and the static infrastructures which act as the access points (AP) for these moving vehicular mobile nodes (MN). The coverage area of each AP is limited and as such, the connections need to be re-established time and again between the MNs and the closest accessible AP. Handoff is the process involved here, which deals with selecting the optimal APs as well as the best network available for data transmission. In this article, the authors compare various handoff methods and categorize them based on the different approaches they follow.

scholarly journals Optimally-balanced Hash Tree Generation in Ad Hoc Networks

2011 ◽  
Vol 6 (1) ◽  
Author(s):  
Vijay Ram Ghorpade ◽  
Yashwant V. Joshi ◽  
Ramchandra R. Manthalkar
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Node ◽  
Public Key ◽  
Mobile Nodes ◽  
Tree Structures ◽  
Tree Generation ◽  
Balanced Structure ◽  
Hoc Networks ◽  
Specific Number

Ideally a hash tree is a perfect binary tree with leaves equal to power of two. Each leaf node in this type of tree can represent a mobile node in an ad hoc network. Each leaf in the tree contains hash value of mobile node’s identification (ID) and public key (PK). Such a tree can be used for authenticating PK in ad hoc networks. Most of the previous works based on hash tree assumed perfect hash tree structures, which can be used efficiently only in networks with a specific number of mobile nodes. Practically the number of mobile nodes may not be always equal to a power of two and the conventional algorithms may result in an inefficient tree structure. In this paper the issue of generating a hash tree is addressed by proposing an algorithm to generate an optimally-balanced structure for a complete hash tree. It is demonstrated through both the mathematical analysis and simulation that such a tree is optimally-balanced and can efficiently be used for public key authentication in ad hoc networks.

Sign in / Sign up

Export Citation Format

Share Document