A Novel Approach towards Link Stability in MANET’s Using Coordinate Position

Advances in remote innovation and hand-held processing systems have acquired transformation in mobile communication’s area. The expanding mobility of people over the globe created interest for infrastructureless and rapidly deployable portable systems. Such systems are alluded to as Mobile Adhoc Networks (MANET). Generally, nodes in MANETs additionally work as a router while they are allowed to roam while transmitting with each other. This paper gives a proposal approach towards the coordinate based link stability and the same is shown with the help of proposed flowchart

L-AOMDV- An Efficient Proposed Approach in MANETs

Mobile Ad hoc Network (MANET) is a collection of mobile devices and is self configuring, dynamically changing, multi-hop wireless network which forms a communication network via multi hop wireless network connection, it is a self-organizing network, without any central control. Nodes in the network communicate with another node only if it lies within its transmission range. Every node acts as both source and router in the network. MANETs are one of the most challenging and growing research field because of their demand and challenges in providing services because of its dynamic nature. Load balancing is one of the key problems in MANETs as load balancing in network is essential for better lifetime of network, Qos, congestion control. The proposed approach in the research emphasises on the stability of the paths and distributing the traffic in the network based on the energy of the nodes

AOMDV with Load Balanced as an Improvement to AOMDV Protocol

MANETs are one of the most challenging and growing research field because of their demand and challenges in providing services because of its dynamic nature. Load balancing is one of the key problems in MANETs as load balancing in network is essential for better lifetime of network, Qos, congestion control. The proposed approach in the research emphasises on the stability of the paths and distributing the traffic in the network based on the energy of the nodes. The simulations were performed in NS2. The results shows that the proposed algorithm was able to achieve batter packet delivery ratio and throughput without increasing the overhead in the network, The proposed algorithm also managed to consume a balanced energy from all the nodes in the network

PERFORMANCE EVALUATION OF SINGLE-PATH AND MULTIPATH MANETS ROUTING PROTOCOLS FOR DENSE AND SPARSE TOPOLOGY

Mobile Ad Hoc Network (MANET) is a multi-hop wireless network in which fixed infrastructure is not used. A single-path routing protocol is mainly proposed as a single route from source node to destination node, while a multipath routing protocol uses multiple routes from the source to the destination node. This paper evaluates the performance of single-path routing protocols which are Cluster Based Routing Protocol (CBRP) and Ad hoc On-demand Distance Vector (AODV) along with a multipath routing protocol which is Ad hoc On-demand Multipath Distance Vector routing (AOMDV) in MANET environments with varying node densities (Dense and Sparse). Network Simulator (NS2) was used to evaluate the performance of these routing protocols. Our experimental simulation results show that: AOMDV protocol is better than AODV and CBRP in terms of Delay for both Dense and Sparse topologies with variant traffic sources, whereas AODV is better than CBRP and AOMDV in terms of Packet Delivery Ratio (PDR) with all traffic sources in Sparse topology

Energy and Load Aware Multipath Route Selection for Mobile Ad hoc Networks

Routing protocols are crucial in delivering packets from source to destination in scenarios where destinations are not directly within the sender’s range. Various routing protocols employ different strategies, but their presence is indispensable for seamless data transfer from source to destination. Multipath routing, while offering load balancing, often falls short in efficiently distributing the network’s load, thus adversely impacting the vital communication resource—energy—due to packet loss. This paper introduces an Energy-Efficient Load-Aware Routing (ELAM) scheme to enhance the routing performance of Mobile Ad hoc Networks (MANETs). Our motivation stems from the observation that many multipath routing protocols are designed based on a single criterion, such as the shortest path, often neglecting load balancing or energy conservation. While the Ad Hoc On-Demand Multipath Distance Vector (AOMDV) protocol demonstrates improved performance compared to unipath routing schemes, achieving both load balancing and energy efficiency remains challenging.  The proposed ELAM scheme considers energy conservation, the shortest path, and load balancing to enhance the performance of multipath routing protocols. ELAM considers the shortest path and energy conservation while accommodating more than two paths in a MANET. We introduce an energy factor that contributes to the network’s lifespan, with efficient load balancing enhancing the longevity of nodes and the overall network. The energy factor provides insights into the energy status, and we evaluate the performance of AODV, AOMDV, and the proposed ELAM. The results demonstrate that the proposed scheme outperforms existing protocols and effectively manages unnecessary energy consumption by mobile nodes. Our performance analysis reveals a minimum 5% improvement in throughput and Packet Delivery Ratio (PDR), indicating reduced packet dropping and network delays

Vulnerable Path Determination in mobile ad-hoc networks using Markov Model

Security threats are of major concern in information sensitive ad-hoc networks like emergency military communication networks. We propose a Proactive Information Security Management System (PISMS) framework with vulnerable path determination module (VPDM) for such mobile ad-hoc networks. The chief security officer can use it to identify the most vulnerable paths, so that they can be patched using suitable security technologies before the hackers actually attack and compromise them. Our PISMS computes (i) the probability of transitioning from each node to its adjacent neighbors, using two key indicators (angle and distance); (ii) number of steps required to reach a pre-determined destination from different sources using Markov model. The path that requires minimum number of steps to reach a destination is the most vulnerable path. This mechanism of identifying vulnerable path is incorporated as an integral part of the Information systems acquisition, development and maintenance (ISADM) module of ISMS framework ISO27001

Local heuristic for the refinement of multi-path routing in wireless mesh networks

We consider wireless mesh networks and the problem of routing end-to-end traffic over multiple paths for the same origin-destination pair with minimal interference. We introduce a heuristic for path determination with two distinguishing characteristics. First, it works by refining an extant set of paths, determined previously by a single- or multi-path routing algorithm. Second, it is totally local, in the sense that it can be run by each of the origins on information that is available no farther than the node's immediate neighborhood. We have conducted extensive computational experiments with the new heuristic, using AODV and OLSR, as well as their multi-path variants, as underlying routing methods. For two different CSMA settings (as implemented by 802.11) and one TDMA setting running a path-oriented link scheduling algorithm, we have demonstrated that the new heuristic is capable of improving the average throughput network-wide. When working from the paths generated by the multi-path routing algorithms, the heuristic is also capable to provide a more evenly distributed traffic pattern

Performance Evaluation of Quality of Service in Proposed Routing Protocol

Due to the recent developments in the hand-held devices and communication enhancements in wireless networks like mobile ad-hoc network (MANETs), these networks are targeted for providing real time services like video streaming, video conferencing, VOIP etc. Although, the basic design of MANETs is not fully capable to provide multimedia services, therefore some sort of quality-of-service is required in these networks. In this paper, I have proposed a delay-aware routing protocol that discovers routes for a source-destination pair with the application provided delay constraints. The methodology is focused on using a reactive routing approach, AODV, to discover the delay-aware routes during its route discovery phase. In this way, we are able to provide the QoS to the requesting application in terms of delay metric