Mobile Ad Hoc Networks Protocols Research Articles

Link Availability Based Routing Protocol for Mobile Ad-Hoc Networks based on Link Life Time Prediction

A self-configured MANET has a set of wireless devices. With no prior administration, the Mobile Nodes (MNs) communicate via the wireless links. The limited bandwidth, transmission errors, dynamic topology, energy constraints, and link stability fluctuations lead to node mobility. The links between nodes are unreliable and might break on account of such node mobility. Link breakage leads to the rerouting process at the sender node (where the link breakage occurs) or Source Node (SN). This work proposed Link availability based routing protocol (LBRP) for MANET to attain load balancing via the Multi-Path (MP) communication. The traffic data could completely pass through parallel multiple paths, which enhances the protocol efficiency. On weighing against the existing routing protocols (RPs), the LBRP chiefly considers frequent link failures and unpredictable change in topology. The simulation outcomes validate the proposed LBRP. The LBRP performs well when contrasted to the DSR, ZRP, and AODV in all the experiments. This work would serve as the groundwork for examining and optimizing certain network protocols, and could help in designing algorithms for transport control and medium access.

Congestion Control Through EDA with Shortest Path

Ad hoc mobile networks contain remote nodes linking through electronic media, without any set backend facilities. Disturbance happens in any type of intermediate nodes in these networks when data packages travel from resource to destination, leading to high package loss and also lengthy delay, triggering network efficiency destruction. This paper presents EDAODV congestion and also command directing protocol for mobile ad-hoc networks. Via determining line position and also identifying congestion degrees, EDAODV senses node-level blockage. Based on blockage rates, EDAODV makes use of the uncongested precursor and successor nodes of an overloaded node as well as starts bi-directional processes to determine alternative, uncongested courses in between them for data transmission. The algorithm discovers a lot more non-congested remedies, picking the very best solitary course for data transmission.

Minimum Number of Neighbour Nodes and Transmission Range Based Overhearing Controlled Protocol for Mobile Ad-Hoc Networks

Ad-hoc networks are communications less wireless networks; the most critical problem in mobile ad-hoc networks is energy utilization. Energy could be a restricted resource. All nodes eavesdrops the data transference in its locality and uses energy without need. Nevertheless various existing routing procedures collect route information via eavesdropping. The important reason for more energy utilization is unnecessary eavesdropping and rebroadcasting of RREQ to nodes. We propose a new mechanism to decrease energy consumption called Minimum Number of Neighbor Nodes and Transmission Range Based Overhearing Controlled Protocol. In which node has a choice of whether to send a packet or not by transmit effective info in Announcement Traffic Indication Message (ATIM) window and node selection on the basis of Transmission range and RES. The Proposed protocol is high energy-efficient compared to Conventional 802.11 PSM-established projects.

Performance Evaluation of Reactive Routing Protocols in MANETs in Association with TCP Newreno

We inspect the performance of TCP NewReno protocol for data transfer in Mobile Ad hoc networks (MANETs). Dynamic Source Routing (DSR) protocols and AdHoc On-demand Distance Vector (AODV) are standard reactive routing protocols widely used in MANETs. In addition we also have to consider Transmission Control Protocol (TCP) as essential for MANETs since it is one of the widely used internet protocol for dependable data transmission. TCP has its variants namely TCP Reno, TCP NewReno , TCP Vegas and TCP SACK. In this paper we are evaluating the performance of DSR and AODV in association with TCP Newreno with respect to various parameters such as Average throughput, instant throughput, residual energy, packet delivery ratio. The ns-2 network simulator was used for simulation.

A Trust Based Secured Routing Protocol for Mobile Adhoc Network

Mobile Ad hoc Network (MANET) is a group of wireless mobile nodes that dynamically creates a network without the support of central management. The mobile hosts of MANET network are not restricted to move freely in any direction and thus linking with any other mobile host can be easily done. Without giving any notification to other hosts in the network, they can be switched on or off. Each mobile host must forward traffic, unrelated to its own use and therefore acts as a router. Because of the mobility of wireless nodes, each node must have the capability of managing an autonomous system, or a routing function without requiring any centralized administration. This mobility and autonomy of the wireless nodes along with the transient nature of the end hosts and intermediate host in a communication path creates a dynamic topology of the network. These mobile hosts are connected in an arbitrary manner and as they are highly mobile, the topology changes take place frequently. The rate of change is based on the velocity of the nodes and the challenge is these devices are small and the available transmission power is limited. In this Trust Based Secured Routing Protocol for MANET (TSRPM), certain changes have been made in the design of secure ad hoc routing protocols. First, a modified Diffie Hellman algorithm is implemented; secondly a trust based model has been developed.

Examining Possible Supplementary Nature of Routing Protocols in Mobile Ad-Hoc Networks (MANETs): A Discussion

Examining Possible Supplementary Nature of Routing Protocols in Mobile Ad-Hoc Networks (MANETs): A Discussion

Comparative Analysis of Swarm Based Routing Protocols in Mobile Ad-Hoc Networks

A Mobile Ad hoc Network (MANET) is a self-arranging (self-ruling) arrangement of portable switches (and related hosts) associated by remote connections the association of which structure a discretionary topology. The switches are allowed to move haphazardly and compose themselves self-assertively, in this way, the system's remote topology may change quickly and unusually. Such a system may work in an independent manner or might be associated with the bigger web working as a crossover fixed/specially appointed system. Swarm Intelligence or SI is a developing field that is recently noticeable by many researchers in the field of network routing. Swarm Intelligence is mainly exhibiting complex behaviors that come up from simple individual behaviors and interactions, which is commonly observed in nature, mainly among social insects like ants, bees, fishes, etc. and they have individual little intelligence and follows basic rules using local information obtained from the surroundings. In this paper, traditional and SI based routing protocols have been discussed and performance comparisons given with is help of different output graphs for routing protocols such as Ant-based AODV (AAODV) and Honeybee based AODV (HAODV) using the NS-2 simulation tool. The performance of routing protocols has been studied in terms of different parameters like throughput and packet delivery ratio (PDR).

AODV-F: A New on Demand Enhanced Distance Vector Routing in Wireless Network

Routing process is the main role in wireless ad-hoc networks. It is a very tedious task to complete successfully in mobile ad-hoc networks. Nodes are frequently changing their positions in mobile ad-hoc networks. In such a challenging environment, there are more chances of packet loss. So many routing protocols have been proposed to recover this loss. In this work, we have proposed a new distance vector routing algorithm that is an enhancement of existing routing protocol in mobile ad-hoc networks. We consider node power, hop count, and maximum speed to decide the next hop during the routing process. Trust values have been calculated by applying the rule based system. This trust value will decide the next hop in the network. To evaluate our proposed algorithm, we have simulated this in a network simulator-2 environment. Normalized routing load, throughput, packet delivery fraction, and delay are considered as the performance metrics to evaluate the proposed work

AODV-F: A New on Demand Enhanced Distance Vector Routing in Wireless Network

Routing process is the main role in wireless ad-hoc networks. It is a very tedious task to complete successfully in mobile ad-hoc networks. Nodes are frequently changing their positions in mobile ad-hoc networks. In such a challenging environment, there are more chances of packet loss. So many routing protocols have been proposed to recover this loss. In this work, we have proposed a new distance vector routing algorithm that is an enhancement of existing routing protocol in mobile ad-hoc networks. We consider node power, hop count, and maximum speed to decide the next hop during the routing process. Trust values have been calculated by applying the rule based system. This trust value will decide the next hop in the network. To evaluate our proposed algorithm, we have simulated this in a network simulator-2 environment. Normalized routing load, throughput, packet delivery fraction, and delay are considered as the performance metrics to evaluate the proposed work.

Grid based Bio-Inspired Energy Efficient Trusted Hybrid Routing Protocol for MANET

Device to device (D2D) data communication in cellular wireless network can be done either directly from source equipment (SE) to destination equipment (DE) or through relay equipment (RE). This type of network mainly known as Wireless ad hoc networks. Mobile ad-hoc networks (MANETs) have constraints such as such as limited power, route failure, bandwidth allocation, and computational complexity. The major impact on the performance of network depends on routing strategy. Routing strategy for matching the multi constraints of network is so far challenge in conventional network. MANETs suffers from dynamic movement of node, power, dynamic routing and storage complexity. Dynamic movement force the computation of re-routing, which act as extra computational burden on the system. In this paper, we propose the Grid Cluster based Multi-Objective Genetic Algorithm for Energy Efficient Trusted Network (gCMOGAEETN) algorithm for finding optimal routes from a given SE to a given DE. Our simulation results show that gCMOGAEETN algorithms are efficient in solving these routing problems and are capable of finding the optimal solutions at lower complexity than the ’brute-force’ exhaustive search, when the number of user equipment (UEs) is higher than or equal to 50. The analytical and simulation result shows that proposed method exhibit significantly higher performance than optimal adaptive forwarding strategy (OAFS), sub-optimal adaptive forwarding strategy (SAFS), memory enhanced genetic algorithm (MEGA), Elitism-based Immigrants Genetic algorithm (EIGA), dynamic load-balanced clustering problem (DLBCP) and Genetic Algorithm Based Optimization of Clustering (GABOC)..

Video streaming over Ad hoc on-demand distance vector routing protocol

Video streaming is content sent in compressed form over the netwoks and viwed the users progressively. The transmission of video with the end goal that it can be prepared as consistent and nonstop stream. The point is that to give client support to client at anyplace and at whatever time. Mobile Ad hoc Networks (MANETs) are considered an attractive nertwork for information transmission in many applications where the customer programme can begin showing the information before the whole record has been transmitted. Ad hoc On-demand Distance Vector (AODV) protocol is considered as one of the most important routing protocols in MANET. However, routing protocols assume a crucial part in transmission of information over the network. This paper investigates the performance of AODV Routing Protocol under video traffic over PHY IEEE 802.11g. The protocol model was developed in OPNET. Different outcomes from simulation based models are analyzed and appropriate reasons are also discussed. A different scenarios of video streaming were used. The metric in terms of throughput, end to end delay, packet delivery ratio and routing overhead were measured. A comparision with GRP and GRP are also reported.

SocialMANET: A Publish/Subscribe Events Dissemination Protocol for Mobile Ad-Hoc Networks

The popularization of mobile equipment capable of communicating autonomously nowadays offers the possibility of thinking more seriously about a mode of communication in which stakeholders communicate in an ad-hoc manner and use mobility to convey information. However, due to their mobile nature, such equipments are limited by their low energy and storage capacity. Algorithms designed for them must therefore be able to deal with these limitations. In this paper, we present SocialMANET, a distributed publish/subscribe events dissemination protocol for mobile ad-hoc networks. It implements the hierarchical subjects subscription model which, in addition to allowing to formulate refined subscriptions requests close to the content-based subscription model, also permits to minimize the number of subscriptions required to receive events in several topics: to this end, we have proposed a strategy for generating subject identifiers based on the dynamic level numbering technique. Through the use of a dedicated message format that we have defined, SocialMANET minimizes the number of exchanges required between terminals during (fugitive) contacts to detect and respond to their needs by making the best use of the information extracted from these exchanges. This message format, coupled with the concept of lazily altruistic nodes that we propose, allows SocialMANET to guarantee a high rate of events receipt, even in situations where the interests of the network nodes tend to diverge: the results of the simulations conducted show that, compared to other dissemination protocols of the literature, SocialMANET guarantees a better rate of receiving event while minimizing the power consumption of network nodes. We also present in this paper an application prototype for the dissemination of academic informations within a community of students; it’s based on an implementation of SocialMANET.

Extended OLSR and AODV based on multi-criteria decision making method

Recently, multi-metric routing protocols have been proposed to enhance the performance of the typical single metric routing protocols in mobile ad-hoc networks. Generally, most of them employ simple value computation to derive a cost value as a way by combining multiple metrics. However, this simple approach fails to define the relationship or priorities between multiple metrics. To overcome this limitation, in this study, we apply the multi-criteria decision making (MCDM) method to determine the weight factors between the metrics. We define criteria to accommodate multiple metric in logical way and decide a better path. For the case studies, we extend the existing proactive and reactive routing protocols, that is, ad-hoc on-demand distance vector (AODV) and optimized link state routing protocol (OLSR). In AODV, we present a strategy for modifying the route request and route reply mechanism to generate a stable path using the MCDM. On the other hand, in OLSR, we propose a modification strategy of MPR selection algorithm to maintain a stable topology using the MCDM. The simulation results show that proposed routing scheme reduces the routing overhead by 15% and 13%, packet loss rate by 12% and 14%, and end-to-end delay by 21% and 19% approximately, compared with other routing schemes such as fixed weighted AODV, OLSR and MCDM based geographical routing protocol.

Multi-Objective Optimization Assisted Network Condition Aware QOS-Routing Protocol for MANETS: MNCQM

The exponential rise in wireless communication systems and allied applications has revitalized academiaindustries to achieve more efficient data transmission system to meet Quality-of-Service (QoS) demands. Amongst major wireless communication techniques, Mobile Ad-hoc Network (MANET) is found potential to provide decentralized and infrastructure less communication among multiple distributed nodes across network region. However, dynamic network conditions such as changing topology, congestion, packet drop, intrusion possibilities etc often make MANET’s routing a tedious task. On the other hand, mobile network feature broadens the horizon for intruders to penetrate the network and causes performance degradation. Unlike classical MANET protocols where major efforts have been made on single network parameter based routing decision, this research paper proposes a novel Elitist Genetic Algorithm (EGA) Multi-Objective Optimization assisted Network Condition Aware QoS-Routing Protocol for Mobile Ad-hoc Networks (MNCQM). Our proposed MNCQM protocol exhibits two phase implementation where at first it performs node-profiling under dynamic network topology for which three factors; irregular MAC information exchange, queuing overflow and topological variations have been considered. Towards this objective node features like Packet Forwarding Probability (PFP) at the MAC layer, Success Probability of Data Transmission (SPDT) of a neighboring node, and Probability of Successful Data Delivery (PSDD) have been obtained to estimate Node-Trustworthiness Index (NTI), which is further used to eliminate untrustworthy nodes. In the second phase of implementation, a novel Evolutionary Computing assisted nondisjoint best forwarding path selection model is developed that exploits node’s and allied link’s connectivity and availability features to identify the quasi-sub-optimal forwarding paths. EGA algorithm intends to reduce hop-counts, connectivity-loss and node or link unavailability to estimate best forwarding node. One key feature of the proposed model is dual-supplementary forwarding path selection that enables alternate path formation in case of link outage and thus avoids any iterative network discovery phase.

Designing a New Scalable Autoconfiguration Protocol with Optimal Header Selection for Large Scale MANETs

Autoconfiguration in mobile ad hoc network (MANET) is a challenging task to be accomplished in hostile environment. Moreover, a mobile node in MANET is usually configured with a unique IP address for providing better communication and to connect it with an IP network. Essentially, the nodes in wired networks are autoconfigured using a commonly known Dynamic Host Configuration Protocol (DHCP) server. However, MANET exhibits the intrinsic characteristics (i.e., distributed, dynamic and multi-hop) in nature; hence, it is hard to adopt DHCP server for autoconfiguration of nodes in MANET without applying significant modifications in auto-configuration scheme. This paper proposes an efficient IPV6 Duplicate address Elimination Autoconfiguration protocol for MANETs (IDEAM) which comprises the member and the cluster head (CH) nodes organized in a hierarchical fashion. Further, the proposed protocol considers the global connectivity exhibiting reduced communication overhead among the nodes. Initially, our proposed auto-configuration protocol encourages the Duplicate Address Detection (DAD) operation by selecting a controller node from the prefixed group members using a joining node in the network. In other words, the DAD operation is performed perfectly by a selected controller node on behalf of the new joining node. Thus, our proposed protocol becomes more effective and behaves better in the minimization of overhead by considerably eliminating the DAD messages broadcast in the network. Also, we imposed a new Flower pollination based gray wolf optimization (FPGWO) algorithm for selecting an optimal header among the group members by considering various node parameters (i.e., node location, resources and node density) to avoid unnecessary broadcasting of additional weight messages about each node in the network. The simulation results proved the efficiency of our proposed protocol in terms of scalability and in the minimization of overhead. Also, an effectual method provided by our proposed approach enhances the activity of marginal nodes over the group for healing the network that degrades its performance followed by the splitting and merging operation.

Integrating African Buffalo Optimization Algorithm in AODV Routing Protocol for improving the QoS of MANET

A Mobile Ad-Hoc Network (MANET) is made up of wireless mobile nodes that do not require a central infrastructure or administration to establish a network. It is possible for the MANET nodes to function as a router or host. MANET works with an independent multi-hop mobile network which can be used in several real-time applications. Thus, an important issue associated with MANET is the identification of paths with high-level Quality of Service (QoS), like topology. The purpose of having a QoS-aware protocol in MANETs is to enable the discovery of paths that are more efficient between the source and destination nodes of the network and hence, the need for QoS. In this paper, a novel algorithm which can be used in the African Buffalo Optimization (ABO) to improve the QoS of routing protocol MANETs. With ABO, path selection is optimized in the Ad-hoc On-demand Distance Vector (AODV) routing protocol. Results of the test revealed that when ABO is used in AODV, delay and energy-aware routing protocol is manifested.

Enhanced data security in MANET using trust‐based Bayesian statistical model with RSSI by AOMDV

SummaryA Mobile Ad‐hoc Network (MANET) is a form of mobile node which is known for its random movement and communication to other nodes without the need for any infrastructure. The Bayesian statistical model helps a routing protocol in MANET in getting a high mobility trusted node that relies on the outcome of the prediction. Fuzzy logic has been of immense use for trust in the calculation of RSSI value that helps finding a reliable and trusted route from source to destination. This innovative proposal that uses fuzzy logic in AOMDV is referred to as the Fuzzy trust with RSSI in Ad hoc On‐demand Multipath Distance Vector (FT‐AOMDV). It is known for its help in finding a reliable path in mobile Ad Hoc Networks. Simulation was conducted using a NS‐2 network simulator under various scenarios that include varying node speeds and varying malicious nodes for the evaluation of the efficiency of the protocols. Metrics that include delivery ratio, end‐to‐end delay, routing packet overhead, and throughput have been used in the comparison of FT‐AOMDV with AOMDV, TB‐AOMDV1, and TB‐AOMDV2.

A Cluster-Driven Energy Routing Protocol for Optimal Network Lifetime in Ad Hoc Networks

Mobile Ad hoc Network (MANET) is a group of networked mobile devices working in a cooperative manner. Due to usage, these devices quickly run out of battery power in critical situations and consequently fail in packet transmission. Power-Efficient Gathering in Sensor Information Systems (PEGASIS) and Dynamic State algorithm are two research works with unique energy efficiency concepts that, if harmonized and refined, will deliver a better optimized energy-efficient routing protocol for MANETs. This study, therefore, proposes PEGADyn – a hybrid version of PEGASIS and Dynamic State algorithm for a new energy-efficient routing protocol in ad hoc networks. PEGADyn creates a virtual grid classification of nodes based on current location, followed by a cluster formation of nodes in each virtual grid created. In each cluster and virtual grid formed, cluster heads (CHs) and designated cluster heads (dCH) are selected based on their energy levels. CHs and dCHs are used for communication between clusters and virtual grids. The use of CHs and dCHs limits communication overheads among nodes, reducing the energy expended and increasing the network lifetime. A simulation comparison of PEGADyn with PEGASIS and Dynamic State shows PEGADyn to be better in extending network lifetime and maintaining network throughput.

Reputation-based secure routing protocol in mobile ad-hoc network using Jaya Cuckoo optimization

The advancements in Mobile Ad-hoc Network (MANET) are suitable to wide applications, which involve military applications, civilian domains, and disaster recovery systems. It is assumed that the nodes present in the routing protocols of MANETs are cooperative and trustworthy. This assumption makes MANET more prone to manipulation and interception, which generates several possibilities of different suspicious attacks, such as Denial of Service (DoS) attacks. Hence, security is considered as an important parameter as the network is fond of suspicious attacks. This paper addresses the security issues by proposing an optimization algorithm, named Jaya Cuckoo Search (JCS) algorithm, which is the combination of Jaya algorithm and Cuckoo Search (CS) algorithm for initiating secure route among the MANET nodes so that the path attained is feasible and secure. The proposed JCS algorithm uses a fitness function, which considers a multiobjective function using parameters, such as distance, link lifetime, delay, energy, trust, along with the reputation factor to select a secured path. The JCS algorithm shows maximum performance with energy, throughput, and PDR values as 27.826[Formula: see text]J, 0.554, and 0.628, respectively.

An QoS Aware Link Defined OLSR (LD-OLSR) Routing Protocol for MANETS

Mobile Adhoc Networks (MANETS) are gaining popularity because of interconnected networks. Routing is a key issue which needs to be addressed for efficient forwarding of packets from source to destination. Optimized Link State Routing (OLSR) is a proactive or table driven routing protocol in MANETS which works on the principal of link sensing. Multi Point Relay (MPR) node is mainly responsible for forwarding of topology control messages in OLSR. In this work MPR node is selected on the basis of node’s willingness to be selected as MPR. Wireless links are generally much inferior and prone to link losses. Frequent link failures result in lesser QoS parameters such as lesser throughput, higher end to end delay, higher latency and less utilization of link bandwidth. Link quality is an important metric to be taken as a research topic while deciding routing protocol. Routing protocols suggested by many authors have proffered minimum hop routing which contains lossy links in wireless medium resulting in reduction of throughput. In this work, Link Defined OLSR (OLSR-LD) is proposed which considers quality of link while making routing decision. Extensive Simulations were performed using NS-2 Simulator by varying pause time of nodes, simulation time of nodes and speed of nodes.