scholarly journals PERFORMANCE COMPARISON WITH ACCESSIBILITY PREDICTION AND LINK BREAKAGE PREDICTION IN MANETS

Author(s):  
TEJAL ARVIND SONAWALE ◽  
SHIKHA NEMA

Ad Hoc Networks face a lot of problems due to issues like mobility, power level, load of the network, bandwidth constraints, dynamic topology which lead to link breaks, node break down and increase in overhead. As nodes are changing their position consistently, routes are rapidly being disturbed, thereby generating route errors and new route discoveries. The need for mobility awareness is widely proclaimed. In our dissertation we present a scheme AOMDV-APLP that makes AOMDV aware of accessibility of neighbor nodes in the network. Nodes acquire the accessibility information of other nodes through routine routing operations and keep in their routing table. Based on this information route discovery is restricted to only “accessible” and “start” nodes. Further route with the strongest signal strength is selected from multiple routes using Link life value predicted by Link Breakage prediction technique. Simulation result shows that using accessibility and link life knowledge in route discovery process MAC overhead, routing overhead and average delay is reduced 3 times, and improve the Packet delivery ratio to a large extent than standard AOMDV which reflects effective use of network resources.

Author(s):  
Priyanka Bharadwaj ◽  
Surjeet Balhara

Background & Objective: There are some challenging issues such as providing Quality of Service (QoS), restricted usage of channels and shared bandwidth pertaining to ad-hoc networks in a dynamic topology. Hence, there is a requirement to support QoS for the application environment and multimedia services in ad-hoc networks with the fast growing and emerging development of information technology. Eventually, bandwidth is one of the key elements to be considered. Methods: Energy aware QoS routing protocol in an ad-hoc network is presented in this article. Results and Conclusion: The simulation results indicate that the improved protocol outperforms Adhoc On-Demand Distance Vector (AODV) routing protocol in terms of QoS metric such as throughput, packet delivery ratio, loss rate and average delay.


Sensors ◽  
2020 ◽  
Vol 20 (23) ◽  
pp. 6743
Author(s):  
Fan Zhang ◽  
Gangqiang Yang

High-speed mobility and heavy-load traffic in mobile Ad hoc networks (MANET) may result in frequent topology changes and packet loss. To guarantee packet delivery, a novel stable backup routing (SBR) scheme is put forward in this paper, which consists of the establishment of backup routes and route maintenance. In SBR, backup routes are set up by overhearing MAC signals, and the bit error rate is considered in path selection for improving stability. To repair broken links effectively and reasonably, qualified backup routes are classified into three categories with different priorities, based on which the relevant nodes decide how to reconstruct the forwarding path. Extensive simulations demonstrate that our proposed method outperforms other comparable backup routing mechanisms in terms of packet delivery ratio, average delay and control overhead.


Author(s):  
Lalit Tripathi ◽  
Kanojia Sindhuben

MANET (Mobile ad hoc networks) is a collection of wireless mobile nodes dynamically forming an infrastructure less network. Several routing protocols are designed for routing of packets in MANET. One of them is AODV (Ad hoc on demand Distance Vector) protocol whose performance is better for higher mobile nodes. It is more vulnerable to black hole attack by the malicious node. Black hole attack is a network layer attack in MANET that tries to hamper the routing process. During route discovery phase it sends false reply to the nodes and dropped data packets. In this paper, first we have implemented black hole attack in AODV and then analyzed the impact of black hole attack under deferent metrics like throughput, packet delivery ratio and packet loss. Simulator NS-2.35 is used for implementation and result analysis.


2019 ◽  
Vol 2019 ◽  
pp. 1-15 ◽  
Author(s):  
Sumet Prabhavat ◽  
Worrawat Narongkhachavana ◽  
Thananop Thongthavorn ◽  
Chanakan Phankaew

Mobile Opportunistic Networks (OppNets) are infrastructure-less networks consisting of wireless mobile nodes and have been a focus of research for years. OppNets can be scaled up to support rapid growth of wireless devices and technologies, especially smartphones and tablets. Mobile Ad Hoc Networks (MANETs), one of OppNets technologies, have a high potential to be used for facilitating an extension for the Internet and a backup communication platform in disaster situation. However, a connection disruption due to node mobility and unreliable wireless links is possible to trigger a flooding operation of route repair process. This results in transmission delay and packet loss. The flooding of routing packets is an expensive operation cost in MANETs which affects network reliability and wastes limited resources such as network bandwidth and node energy. These are obstacles to practical implementation of MANETs in real-world environment. In this paper, we propose Low Overhead Localized Flooding (LOLF), an efficient overhead reduction routing extension based on Query Localization (QL) routing protocol. The purpose of this work is to control the propagation of routing packets in the route discovery and route repair mechanisms while incurring only a small increase in the size of control information in the packet. Simulation results from extensive experiments show that our proposed method can reduce overall routing overhead, energy consumption, and end-to-end delay without sacrificing the packet delivery ratio compared to existing protocols.


Author(s):  
Miss Shweta Mod ◽  
Mr. Jitendra Prithvira

There are several standard protocols for Mobile Ad hoc Networks (MANET) that have been developed for devices with higher computing features. The Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are Ad hoc On-demand Distance Vector (AODV), Improved Ant Colony Optimization (IACO). In this paper we present our observations regarding the performance comparison of the above protocols in mobile ad hoc networks (MANETs). We perform extensive simulations, using NS-2 simulator. The Average end-to-end delay and the Packet Delivery Ratio have been considered as the two performance parameters


Author(s):  
Sanaa A. Alwidian ◽  
Ismail M. Ababneh ◽  
Muneer O. Bani Yassein

Network–wide broadcasting is used extensively in mobile ad hoc networks for route discovery and for disseminating data throughout the network. Flooding is a common approach to performing network-wide broadcasting. Although it is a simple mechanism that can achieve high delivery ratio, flooding consumes much of the communication bandwidth and causes serious packet redundancy, contention and collision. In this paper, the authors propose new broadcast schemes that reduce the overhead associated with flooding. In these schemes, a node selects a subset of its neighbors for forwarding the packet being broadcast to additional nodes. The selection process has for goal reducing the number of neighbors and maximizing the number of nodes that they can reach (i.e., forward the packet to). By applying this novel neighborhood-based broadcasting strategy, the authors have come up with routing protocols that have very low overhead. These protocols were implemented and simulated within the GloMoSim 2.03 network simulator. The simulation experiments show that our routing protocols can reduce the overhead for both low and high mobility substantially, as compared with the well-known and promising AODV routing protocol. In addition, they outperform AODV by increasing the delivery ratio and decreasing the end-to-end delays of data packets.


Author(s):  
Mada’ Abdel Jawad ◽  
Saeed Salah ◽  
Raid Zaghal

<p class="0abstractCxSpFirst">Mobile Ad-Hoc Networks (MANETs) are characterized as decentralized control networks. The mobile nodes route and forward data based on their routing information without the need for routing devices. In this type of networks, nodes move in an unstructured environment where some nodes are still fixed, others are moving in a constant velocity, and others move with diverse velocities; and thus, they need special protocols to keep track of network changes and velocity changes among the nodes. Destination Sequenced Distance-Vector (DSDV) routing protocol is one of the most popular proactive routing protocols for wireless networks. This protocol has a good performance in general, but with high speed nodes and congested networks its performance degrades quickly.</p><p class="0abstractCxSpLast">In this paper we propose an extension to the DSDV (we call it Diverse-Velocity DSDV) to address this problem. The main idea is to modify the protocol to include node speed, determine update intervals and the duration of settling time. To evaluate the performance of the new protocol, we have carried a number of simulation scenarios using the Network Simulator tool (NS-3) and measured relevant parameters such as: packet delivery ratio, throughput, end-to-end delay, and routing overhead. We have compared our results with the original DSDV and some of its new variants. The new protocol has demonstrated a noticeable improvement of performance in all scenarios, and the measured performance metrics outperform the others except the average delay where the performance of the new protocol was modest.</p>


Security is the key factor of consideration in the vehicular ad-hoc network (VANET), which is prone to various security dangers. A VANET package gives information on life’s essentials and provides security from detrimental external agencies. This paper presents an outsider-based security approach which secures VANETs condition by verification process, where marks are produced and conveyed to hubs and checked at the measure of any transmission. In the suggested approach, the rise in mobility decreases the packet delivery ratio and performance of proposed protocol is approximately 4% improved as compared to other techniques. Moreover, the escalation in mobility increases the average delay and in case proposed protocol is compared with the group based authentication then the improvement in its performance is approximately 50%.Thus, the proposed approach is completely focused on security and consequently secures the system.


2015 ◽  
Vol 77 (32) ◽  
Author(s):  
Aznor Hanah Abdul Halim ◽  
Mohamed Elshaikh ◽  
Mohd Nazri Mohd Warip ◽  
R Badlishah Ahmad

Vehicular Ad Hoc Network (VANET) is quite different from other ad hoc networks in term of functionality because of the variable node density, high node mobility, and unpredictable and harsh communication environment. There are two major application VANETs, namely safety applications and non-safety applications. Network optimization is one way to maintain the existing protocols and other network parameter rather than costly efforts for design and implementing new improved protocols. Motivated with the reasons to save effort of time and cost this paper presents the validation of optimized vehicular network for throughput, average delay and packet delivery ratio using Taguchi method. Highway scenario is chosen as the evaluation condition for this paper.  From the performance evaluated the performance of optimized setting gives better results than non-optimized setting for both safety and non-safety applications.  It is proved that Taguchi Method is applicable to optimize vehicular ad hoc network.


Author(s):  
Mohammad Alnabhan ◽  
Mahmoud Alshuqran ◽  
Mustafa Hammad ◽  
Mohammad Al Nawayseh

Mobile Ad hoc Networks (MANETs) are considered as a reunion of wireless mobile devices (nodes) that form a temporary wireless network. In order to facilitate communication in MANET, every node has to participate in the routing process. Finding an optimal route is a fundamental task in MANET, where routes tend to be multi-hoped and susceptible. Several routing protocols exist and can be classified as; topology-based and position-based routing protocols. However, the efficiency of these protocols in highly dynamic and dense environments is a challenging task to be considered for increasing perceived Quality of Service (QoS) in MANET. This paper focuses on the presentation and basic operation of each category. A qualitative evaluation between both categories is conducted to achieve a performance comparison in terms of packet- delivery ratio, End-to End delay and routing overhead. Results show that position-based overcome topology-based routing protocols in high dynamic and sparse environments. Recommendations for designing and implementing efficient position-based protocols are presented.


Sign in / Sign up

Export Citation Format

Share Document