Dynamic Nature Of MANETs Research Articles

ASDSR: An Adaptive Stable DSR Routing Protocol for Mobile Ad-hoc Networks

<p class="Abstract">Abstract—The process of finding a route between the transmitter and the receiver node in the Mobile Adhoc Networks (MANets) is a renewed issue that is becoming more and more interesting to the researchers as this type of networks grow and expand. The dynamic nature of MANET and the limited capabilities of wireless nodes in terms of memory size and battery charge are the most important obstacles to the routing (path-finding) process between nodes. In this research, we introduced a new protocol based on the well-known DSR protocol to add a mechanism that controls the RREQ Flooding process, which aims to reach more stable (life-long) routes while reducing the overhead of routing process caused by link breakage between nodes and reduce the overhead of network flooding with RREQ messages with each attempt to find a path. In this proposed mechanism, a specific group is selected from within the devices adjacent to the transmitter to be sent RREQ so that these devices are selected based on the stability evaluation criterion. The stability criterion is calculated based on three weighted factors: the speed of the node, the out-degree value (the number of adjacent nodes), and the number of tracks stored in the device memory. The proportion of devices selected is automatically changed adaptively to ensure that the expected throughput of this network is achieved. The proposed protocol was tested using simulation where results showed that ASDSR proved an enhancement in route stability about (0.13), and a decrease in the number of deleted routes by (9%), while maintaining the expected packet delivery ratio of the original DSR by about (0.86).</p>

A bio-inspired clustering in mobile adhoc networks for internet of things based on honey bee and genetic algorithm

In mobile adhoc networks for internet of things, the size of routing table can be reduced with the help of clustering structure. The dynamic nature of MANETs and its complexity make it a type of network with high topology changes. To reduce the topology maintenance overhead, the cluster based structure may be used. Hence, it is highly desirable to design an algorithm that adopts quickly to topology dynamics and form balanced and stable clusters. In this article, the formulation of clustering problem is carried out initially. Later, an algorithm on the basis of honey bee algorithm, genetic algorithm and tabu search (GBTC) for internet of things is proposed. In this algorithm, the individual (bee) represents a possbile clustering structure and its fitness is evaluated on the basis of its stability and load balancing. A method is presented by merging the properties of honey bee and genetic algorithms to help the population to cope with the topology dynamics and produce top quality solutions that are closely related to each other. The simulation results conducted for validation show that the proposed work forms balance and stable clusters. The simulation results are compared with algorithms that do not consider the dynamic optimization requirements. The GTBC outperform existing algorithms in terms of network lifetime and clustering overhead etc.

Multiclass ELM Based Smart Trustworthy IDS for MANETs

The dynamic nature of MANET makes it susceptible to several security breaches. A system that observes these kinds of unwanted activities is known as intrusion detection system (IDS). An IDS is responsible to alert the network, in case of any threat observation. This paper broadens the scope of IDS by considering intrusion response also. The proposed work is organized into several phases such as feature selection, trust degree computation, classification and decision making. Intelligent agents are employed to handle all the aforementioned phases. Features of KDD Cup ’99 are reduced from 41 to 17 to minimize the training time and to improve the accuracy of the system. Feature selection is achieved by information gain ratio. The trust degree is computed by the combination of packet delivery ratio, behavior and available energy of a node. The trust degree parameters are vital elements in the classification and the decision-making phase. Extreme learning machine (ELM) is employed as the classifier to categorize nodes into trustworthy, partially trustworthy and malicious. The performance of the system is evaluated in different scenarios such as with/without feature selection and with/without trust degree computation, with respect to detection accuracy, misclassification rate and detection time. The classification accuracy of SVM, MLP, ELM and ELM with trust is also compared.

Applying QoS in MANET using Stigmergy of Ants

research is focusing on implementation of MANET for various commercial applications. But providing quality of service in Mobile Ad Hoc Networks is not an easy task due to the resource limitations and dynamic nature of MANETs. This paper presents a proposal for maintaining quality of service parameter for communication in MANET. This proposal is mainly inspired by the concept of swarm intelligence exhibited by group of ants when they search for food. Diffserv like service classes can be made available through this proposed approach. The approach has inherited advantage of robustness and fast convergence from swarm intelligent system, which makes it a better choice over existing QoS algorithms for MANET.

Fuzzy Based Load and Stability Aware Routing for Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) are very promising wireless technology and they support wide range of applications. Due to the dynamic nature of MANETS, their routing process faces several challenges. In this paper, we propose a new, Load and Stability Aware Ad Hoc on-demand Distance Vector protocol (LSA-AODV) for efficient data transmission in MANET. It applies fuzzy logic to stability metric and traffic density of the route. The ultimate intend is to select a reliable path for data communication and to reduce the number of route breakages, collisions and contention. It also utilizes stability and traffic density metrics to control broadcasting of routing messages. This protocol is compared with other similar routing protocols: LBAR and AODV. We use ns-2 for simulation. Our simulation results show that, the proposed protocol outperforms the existing routing protocols in terms of end-to-end delay and packet delivery ratio. It also considerably reduced the routing overhead.

A New Approach of Location Based Routing in MANETs

The highly dynamic nature of MANETs results in frequent and unpredictable changes in the network topology, which add to the difficulty and complexity to routing among the mobile nodes within the network. Thus, establishing communication among mobile nodes is a great challenge in itself, resulting in network overloading & discarding of data packets. Nodes can change position quite frequently, which means we need a routing protocol that quickly adapts to the topology changes which is our objective.  In this paper focus has been put on the strategy to address the packet drop ratio which is an integral and important factor of communication in MANETs by minimizing the request zone. In Mobile Ad-Hoc Networks, as the coverage area increases the packet drop ratio also increases which degrades the network performance and Quality of Service (QOS).Location Aware Routing  will be used as a base protocol for the proposed work which is a class of Reactive protocol to design optimized routing algorithm.

Trust and context view-based knowledge sharing in MANets

Mobile ad-hoc networks (MANets) are self-organised, infrastructure-less networks formed by interaction among the users present in the environment. Due to dynamic nature of MANets, it is difficult for the users to find out peers who are both trustworthy and capable of providing relevant information. To deal with these issues, this paper proposes a trust and context view-based knowledge sharing system (TACKSS) built over a framework of mobile agent groups to coordinate the activities of a group of users. The users are clustered into physical groups (on the basis of their location) and contextual views (on the basis of their academic interest). Cooperation in the system is ensured by awarding trust and reputation-based incentives to the users who participate in knowledge exchange as well as routing processes. The proposed work is validated through a university case study simulated in JADE 4.0 and Netbeans. The results indicate that there is a positive correlation between incentives and cooperative behaviour of the users.

Message efficient global snapshot recording using a self stabilizing spanning tree in a MANET

Distributed snapshots are a significant paradigm for distributed systems. These are applied for constructing checkpoint protocols, apart from investigating, testing, or proving properties in distributed executions such as deadlocks and termination. Though a number of snapshot algorithms exist for traditional distributed systems, they cannot be directly applied to mobile ad hoc networks due to the constraints of topology and hostile conditions in which the MANETs operate. The paper presents an algorithm for recording the global state of a clustered and multi-hop mobile ad hoc network. The proposed algorithm imposes a self stabilizing spanning tree upon the network topology to reduce the message overhead in the system due to the algorithm and to deal with the dynamic nature of MANETs. Moreover, the protocol handles concurrent snapshot initiation and does not require FIFO channels. The message complexity of snapshot recording is O(n-1) where n is the number of clusters in the system

A Hierarchical Identity Based Key Management Scheme in Tactical Mobile Ad Hoc Networks

Hierarchical key management schemes would serve well for military applications where the organization of the network is already hierarchical in nature. Most of the existing key management schemes concentrate only on network structures and key allocation algorithms, ignoring attributes of the nodes themselves. Due to the distributed and dynamic nature of MANETs, it is possible to show that there is a security benefit to be attained when the node states are considered in the process of constructing a private key generator (PKG). In this paper, we propose a distributed hierarchical key management scheme in which nodes can get their keys updated either from their parent nodes or a threshold of sibling nodes. The dynamic node selection process is formulated as a stochastic problem and the proposed scheme can select the best nodes to be used as PKGs from all available ones considering their security conditions and energy states. Simulation results show that the proposed scheme can decrease network compromising probability and increase network lifetime in tactical MANETs.