Analyzing the Effect of Node Density on the Performance of the LAR-1P Algorithm

2012 ◽  
Vol 7 (2) ◽  
pp. 16-29
Author(s):  
Hussein Al-Bahadili ◽  
Ali Maqousi ◽  
Reyadh S. Naoum
Keyword(s):  
Network Performance ◽  
Ad Hoc ◽  
High Density ◽  
Low Density ◽  
Probabilistic Algorithms ◽  
Excellent Performance ◽  
Node Density ◽  
Simulation Results ◽  
Mobile Ad Hoc ◽  
Hoc Networks

The location-aided routing scheme 1 (LAR-1) and probabilistic algorithms are combined together into a new algorithm for route discovery in mobile ad hoc networks (MANETs) called LAR-1P. Simulation results demonstrated that the LAR-1P algorithm reduces the number of retransmissions as compared to LAR-1 without sacrificing network reachability. Furthermore, on a sub-network (zone) scale, the algorithm provides an excellent performance in high-density zones, while in low-density zones; it preserves the performance of LAR-1. This paper provides a detailed analysis of the performance of the LAR-1P algorithm through various simulations, where the actual numerical values for the number of retransmissions and reachability in high- and low-density zones were computed to demonstrate the effectiveness and significance of the algorithm and how it provides better performance than LAR-1 in high-density zones. In addition, the effect of the total number of nodes on the average network performance is also investigated.

scholarly journals Secure opinion sharing for reputation-based systems in mobile ad hoc networks

2020 ◽  
Vol 53 (3-4) ◽  
pp. 748-756
Author(s):  
Abdur Rashid Sangi ◽  
Jianwei Liu ◽  
Mohammed S Alkatheiri ◽  
Satish Anamalamudi
Keyword(s):  
Game Theory ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Network Performance ◽  
Ad Hoc ◽  
Limited Resources ◽  
Virtual Currency ◽  
Simulation Results ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Due to the basic nature of mobile ad hoc networks, that is, infrastructure-less, it is prone to individual or collective misbehaviors by participating node(s). Participating nodes could act selfishly and does cause massive loss to network performance because of limited resources or belonging to a different administrative domain. Reputation-based solutions are widely used to mitigate selfishness. These solutions are to some extent depend on the feedback from participating nodes for any given node which required its secure exchange in an adverse environment. This paper introduces a secure opinion sharing based on network coding to ensure the effectiveness of any reputation against selfishness in an adverse environment. The proposed scheme addresses the threat to opinion exchange in any reputation-based solution with minor changes. In addition, it can be used to exchange secure data in an adverse environment, for example, virtual currency and feedback exchange for credit payment and game theory–based solutions, respectively. Simulation results proved that this scheme achieves excellent opinion exchange ratio, moderate delay, and affordable per cycle overhead.

scholarly journals A Novel Anomaly Behavior Detection Scheme for Mobile Ad Hoc Networks

Electronics ◽  
2021 ◽  
Vol 10 (14) ◽  
pp. 1635
Author(s):  
Neeraj Chugh ◽  
Geetam Singh Tomar ◽  
Robin Singh Bhadoria ◽  
Neetesh Saxena
Keyword(s):  
Anomaly Detection ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Network Performance ◽  
Ad Hoc ◽  
Abnormal Behavior ◽  
Energy Awareness ◽  
Behavior Detection ◽  
Mobile Ad Hoc ◽  
Hoc Networks

To sustain the security services in a Mobile Ad Hoc Networks (MANET), applications in terms of confidentially, authentication, integrity, authorization, key management, and abnormal behavior detection/anomaly detection are significant. The implementation of a sophisticated security mechanism requires a large number of network resources that degrade network performance. In addition, routing protocols designed for MANETs should be energy efficient in order to maximize network performance. In line with this view, this work proposes a new hybrid method called the data-driven zone-based routing protocol (DD-ZRP) for resource-constrained MANETs that incorporate anomaly detection schemes for security and energy awareness using Network Simulator 3. Most of the existing schemes use constant threshold values, which leads to false positive issues in the network. DD-ZRP uses a dynamic threshold to detect anomalies in MANETs. The simulation results show an improved detection ratio and performance for DD-ZRP over existing schemes; the method is substantially better than the prevailing protocols with respect to anomaly detection for security enhancement, energy efficiency, and optimization of available resources.

Simulation Implementation and Performance Analysis of IEEE 802.11e EDCA Protocol

2011 ◽  
Vol 58-60 ◽  
pp. 1429-1434
Author(s):  
Jin Hua Zhou ◽  
Lei Lei ◽  
Wei Kang Liu ◽  
Li Bin Tao
Keyword(s):  
Performance Analysis ◽  
Ad Hoc ◽  
Multimedia Applications ◽  
Ieee 802.11E ◽  
Mac Layer ◽  
Excellent Performance ◽  
Qos Guarantee ◽  
Mobile Ad Hoc ◽  
And Performance ◽  
Hoc Networks

In this paper, we focus on IEEE 802.11e enhanced distributed channel access (EDCA) protocol, which can provide QoS guarantee for multimedia applications in mobile ad hoc networks. First, we briefly explain the concept of EDCA protocol. Then we implement EDCA protocol in GloMoSim via configuring special contention parameters for multimedia applications and introducing a virtual collision disposal mechanism in the MAC layer. In the end, we provide performance analysis for EDCA protocol through plentiful simulations. The simulation results show an excellent performance of the EDCA protocol we proposed.

scholarly journals Classification Algorithm Based on Nodes Similarity for MANETs

2019 ◽  
Vol 15 (05) ◽  
pp. 86
Author(s):  
Ali Choukri ◽  
Younes Hamzaoui ◽  
Mohammed Amnai ◽  
Youssef Fakhri
Keyword(s):  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Network Performance ◽  
Ad Hoc ◽  
Cluster Structure ◽  
Classification Algorithms ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Initial Pattern ◽  
Additional Calculation

This article describes an algorithm of classification by similarity of nodes in a MANET (Clustering). To optimize a network performance without influencing others, we must act only on the cluster structure. Any additional calculation clutters more the system. To overcome this limitation, a strong classification method is needed. The purpose of classification algorithms is the search for an optimal partition. This optimum is obtained iteratively refining an initial pattern randomly selected by reallocating objects around mobile centers. In order to partition the nodes into clusters, we used this technique (iterative reallocation) from the well known k-means algorithm. The algorithm conception is based on the k-means method that we improved and adapted to make it suitable for mobile ad hoc networks. The algorithm is implemented on OLSR giving birth to a new routing protocol: OLSRKmeans.

A Hierarchical Algorithm for Mobile Ad-Hoc Networks

2014 ◽  
Vol 602-605 ◽  
pp. 3135-3139
Author(s):  
Juan Yang ◽  
Zhi Jun Zhang ◽  
Jian Lu Luo
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Feature Fusion ◽  
Gibbs Random Field ◽  
Hierarchical Algorithm ◽  
Maximum A Posterior ◽  
Simulation Results ◽  
Mobile Ad Hoc ◽  
Hoc Networks

For mobile ad hoc networks, hierarchical algorithm can reduce communication relay and enhance the QoS of MANETs. In this paper, A hierarchical algorithm-FGM algorithm is proposed. This algorithm based on dynamic node’s Multi-feature fusion and Gibbs Random Field—Maximum a Posterior. The simulation results verify the effectiveness of the algorithm.

scholarly journals A Protocol for Content-Based Communication in Disconnected Mobile Ad Hoc Networks

2010 ◽  
Vol 6 (2) ◽  
pp. 123-154 ◽  
Author(s):  
Julien Haillot ◽  
Frédéric Guidec
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Information Flows ◽  
Opportunistic Networking ◽  
Simulation Results ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Delay Tolerant ◽  
Intermittently Connected

In content-based communication, information flows towards interested hosts rather than towards specifically set destinations. This new style of communication perfectly fits the needs of applications dedicated to information sharing, news distribution, service advertisement and discovery, etc. In this paper we address the problem of supporting content-based communication in partially or intermittently connected mobile ad hoc networks (MANETs). The protocol we designed leverages on the concepts of opportunistic networking and delay-tolerant networking in order to account for the absence of end-to-end connectivity in disconnected MANETs. The paper provides an overview of the protocol, as well as simulation results that show how this protocol can perform in realistic conditions.

An Efficient Selfishness Control Mechanism for Mobile Ad hoc Networks

2021 ◽  
pp. 432-449
Author(s):  
D. Rajalakshmi ◽  
Meena K.
Keyword(s):  
Real Time ◽  
Network Performance ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Resource Constraints ◽  
Selfish Nodes ◽  
Security Issue ◽  
Malicious Nodes ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A MANET (mobile ad hoc network) is a self-organized wireless network. This network is more vulnerable to security failure due to dynamic topology, infrastructure-less environment, and energy consumption. Based on this security issue, routing in MANET is very difficult in real time. In these kinds of networks, the mobility and resource constraints could lead to divide the networks and minimize the performance of the entire network. In real time it is not possible because some selfish nodes interacts with other nodes partially or may not share the data entirely. These kind of malicious or selfish nodes degrade the network performance. In this chapter, the authors proposed and implemented the effect of malicious activities in a MANETs using self-centered friendship tree routing. It's a novel replica model motivated by the social relationship. Using this technique, it detects the malicious nodes and prevents hacking issues in routing protocol in future routes.

Sign in / Sign up

Export Citation Format

Share Document