Optimized Routing for Efficient Data Dissemination in MANET to Meet the Fast-Changing Technology

2018 ◽  
Vol 26 (3) ◽  
pp. 25-36
Author(s):  
Deo Prakash ◽  
Neeraj Kumar ◽  
M.L. Garg
Keyword(s):  
Ad Hoc ◽  
Data Dissemination ◽  
Dynamic Network ◽  
Mobile Node ◽  
Delivery Ratio ◽  
Communication Link ◽  
Centralized Control ◽  
Mobile Adhoc Network ◽  
Link Stability ◽  
Efficient Data

Mobile Adhoc Network (MANET) is a dynamic network without any centralized control. Due to frequent topological change, routing has been always a challenging task in these networks. This article presents optimized routing for efficient data dissemination in MANETs to meet the fast-changing technology of today's world. A novel metric for such optimized routing in MANET is proposed. The main parameters considered to evaluate this metric are the energy consumed during the communication, link stability, Packet Delivery Ratio (PDR) and traffic. The concept is based on a scenario in which a mobile node (source) sends data packets to another mobile node (destination) through its dynamically connected neighboring nodes. The path which consumes the lowest energy and also shows highest link stability is selected for consideration. In case the paths consume the same amount of energy, the highest stable path is chosen. In this manner, the most optimized path is selected. The authors' routing approach shows more efficiency than earlier in dissemination of data and information over the Mobile Ad-Hoc Networks.

An advanced forwarding routing protocol for urban scenarios in VANETs

2017 ◽  
Vol 13 (4) ◽  
pp. 334-344 ◽  
Author(s):  
Sushil Kumar ◽  
Anil Kumar Verma
Keyword(s):  
Ad Hoc ◽  
Data Dissemination ◽  
Local Maximum ◽  
Movement Pattern ◽  
Delivery Ratio ◽  
Content Type ◽  
Greedy Forwarding ◽  
Suppression Technique ◽  
Efficient Data ◽  
Network Overhead

Purpose The purpose of this paper is to give an insight in to the routing protocols in Vehicular ad hoc Network (VANET). In this direction, for the efficient data dissemination in VANETs, a street-based forwarding protocol (SBFP) has been proposed. Design/methodology/approach The interferences among different street segments are considered and a unique street-based forwarding concept is introduced to reduce the local maximum problem. In this protocol, the greedy forwarding concept along with the broadcasting mechanism and suppression technique is implemented to minimize the overhead created in the regular beacons forwarding processes. QualNet simulator is used to implement and simulate SBFP. SUMO and MOVE tools are used to create the vehicle’s movement pattern and network topology. Findings The simulated results demonstrated improved packet delivery ratio (PDR) with a minimum average number of broadcast by each individual vehicle in the proposed SBFP than in its peer protocols. Originality/value This paper will be discussing a unique street-based forwarding technique exploring the advantages of global positioning system to obtain the location of vehicles and streets. This technique results in higher PDR and reduced network overhead.

An Efficient Cluster-Based Flooding Using Fuzzy Logic Scheme (CBF2S) In Mobile Adhoc Networks

2020 ◽  
Vol 14 ◽  
Author(s):  
S. Mahima ◽  
N. Rajendran
Keyword(s):  
Fuzzy Logic ◽  
Ad Hoc ◽  
Link Quality ◽  
Traffic Load ◽  
Node Degree ◽  
Communication Overhead ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Centralized Control ◽  
Hop Count

: Mobile ad hoc networks (MANET) hold a set of numerous mobile computing devices useful for communication with one another with no centralized control. Due to the inherent features of MANET such as dynamic topology, constrained on bandwidth, energy and computing resources, there is a need to design the routing protocols efficiently. Flooding is a directive for managing traffic since it makes use of only chosen nodes for transmitting data from one node to another. This paper intends to develop a new Cluster-Based Flooding using Fuzzy Logic Scheme (CBF2S). To construct clusters and choose proper cluster heads (CHs), thefuzzy logic approach is applied with the use of three parameters namely link quality, node mobility and node degree. The presented model considerably minimizes the number of retransmissions in the network. The presented model instructs the cluster members (CM) floods the packets inside a cluster called intra-cluster flooding and CHs floods the packets among the clusters called inter-cluster flooding. In addition, the gateway sends a packet to another gateway for minimizing unwanted data retransmissions when it comes under different CH. The presented CBF2S is simulated using NS2 tool under the presence of varying hop count. The CBF2S model exhibits maximum results over the other methods interms of overhead, communication overhead, traffic load, packet delivery ratio and the end to end delay.

scholarly journals Comparative study of energy efficient MAC protocol with channel aware packet Scheduling in MANET

2018 ◽  
Vol 7 (1.9) ◽  
pp. 16
Author(s):  
T Dheepak ◽  
S Neduncheliyan
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Packet Scheduling ◽  
Mac Protocol ◽  
Mobile Node ◽  
Delivery Ratio ◽  
Link Failure ◽  
Failure State ◽  
Utility Factor ◽  
Mobile Ad Hoc

Mobile Ad Hoc Network is the centralized communication system which is used for transferring information through a secured mode from one end to another end. However, there is an energy loss that has been noticed in MANET. In this work, an efficient energy based Link Failure State Neighbor Detection Effective Efficient Protocol (LFSNDEEP) is to enhance the energy efficiency of the mobile node, and optimal transmission ratio computes Data, Audio, and Video packets. The proposed research on LFSNDEEP protocol is compared to Effective Efficient Neighbor Detection Protocol (EENDP) and which assigns the channel utilization. In this technique, the hello packet exchanges transmit based height and wavelength of the transmitter with particular distance. The computation of channel utility factor is the best method at link failure without data loss. The vitality utilization mathematical model is illustrated to show the nodes of least consumption by the broad recreation of utilization. The results observed from the proposed scheme shows that the energy level is minimized regarding the packet that loss is improved efficiently. In further, there are two results which can be gained in comparing with EENDP; firstly, packet delivery ratio and throughput get increased. And secondly, the end to end delay is decreased.

scholarly journals Feature Extraction of Real-World Traces Using K Means Clustering In OppNet

2021 ◽  
Author(s):  
Rahul Johari ◽  
Tanvi Gautam
Keyword(s):  
Network Topology ◽  
Real World ◽  
Network Performance ◽  
Performance Metrics ◽  
Learning Algorithm ◽  
Dynamic Network ◽  
Delivery Ratio ◽  
Communication Link ◽  
Alternative Measure ◽  
Intermittent Connectivity

Abstract Natural calamities leave people helpless by arising several situations such as network breakdown, zero communication, intermittent connectivity, dynamic network topology. In such situation an application of dynamic and intermittent routing scheme is essential to make further communication possible during likewise scenarios. An application of TCP/IP becomes futile in mentioned circumstances as it best works for static nodes and pre-defined network topology wherein source and destination nodes are first establishing the communication link with each other. An alternative measure of such hitches is to encounter an application of DTN protocol which possess all characteristics to withstand in such scenarios such as; dynamic network topology, intermittent connectivity, frequent path breaks, store – carry – forward fashion. In this paper we did thorough investigation of forest fire dataset (Uttarakhand) after exploring its implementation in ONE with Epidemic, Prophet, Spray and Wait, HBPR, GAER respectively. An extensive and thorough investigation for real world traces implementation has been done with OppNet routing protocols against mobility models namely; Shortest path map – based, Random Direction, Random Walk, Random Waypoint, Cluster Movement respectively for network performance metrics namely packet delivery ratio, packet overhead ratio and average latency ratio respectively with the application of K means clustering machine learning algorithm. With the help of this analysis, we explore the real-world traces characteristics and study the areas on which network performance can be improved.

Moving From Topology-Dependent to Opportunistic Routing Protocols in Dynamic Wireless Ad Hoc Networks

2019 ◽  
pp. 1-23 ◽  
Author(s):  
Varun G. Menon ◽  
Joe Prathap P. M.
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Dynamic Networks ◽  
Underground Mines ◽  
Future Research ◽  
Centralized Control ◽  
Wireless Devices ◽  
Efficient Data ◽  
Hoc Networks

Mobile ad hoc networks (MANETs) are a collection of wireless devices like mobile phones and laptops that can spontaneously form self-sustained temporary networks without the assistance of any pre-existing infrastructure or centralized control. These unique features have enabled MANETs to be used for communication in challenging environments like earthquake-affected areas, underground mines, etc. Mobility and speed of devices in MANETs have become highly unpredictable and is increasing day by day. Major challenge in these highly dynamic networks is to efficiently deliver data packets from source to destination. Over these years a number of protocols have been proposed for this purpose. This chapter examines the working of popular protocols proposed for efficient data delivery in MANETs: starting from the traditional topology-based protocols to the latest opportunistic protocols. The performances of these protocols are analyzed using simulations in ns-2. Finally, challenges and future research directions in this area are presented.

scholarly journals Physarum-Inspired Autonomous Optimized Routing Protocol for Coal Mine MANET

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Haifeng Jiang ◽  
Xiaoxiao Liu ◽  
Shuo Xiao ◽  
Chaogang Tang ◽  
Wei Chen
Keyword(s):  
Coal Mine ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Dynamic Network ◽  
Delivery Ratio ◽  
Network Load ◽  
The Status ◽  
Mobile Ad Hoc ◽  
Better Than

Mobile Ad Hoc Network (MANET) is suitable for complex environment communication in coal mine. The processes of nutrient flux transfer and path choice in Physarum networks are similar to data transmission and routing decision in MANET. In this paper, we use a Physarum optimization model to design Physarum-inspired autonomous optimized routing (PIAOR) protocol to adapt to the dynamic network topology in underground mine. PIAOR introduces the status of MANET into the Poisson equation in the Physarum model, selects reasonable parameters to represent the transmission performance of the network, and uses the differential evolution equation of the Physarum model to evolve the parameters. PIAOR has achieved the distributed routing decision by automatically reconstructing the optimal routing path, which has reduced the algorithm complexity. Based on NS2, simulation experiments are performed to evaluate the performance of PIAOR, and the results are compared with GPSR, PIMAR, and P-IRP routing algorithms. The experimental results show that the routing path selected by PIAOR is better than that selected by the other three protocols in the performance of average end-to-end delay, delivery ratio, and throughput. The balance of energy consumption and network load is reached, and the network lifetime is effectively prolonged when using the PIAOR protocol.

scholarly journals Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
HyungJune Lee
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobile Node ◽  
Network Services ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Packet Delivery ◽  
Hoc Networks ◽  
Ad Hoc Sensor Networks

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

scholarly journals Secured Routing in Mobile Ad hoc Networks (MANETs)

2019 ◽  
pp. 277-289
Author(s):  
S. Maharaja ◽  
R. Jeyalakshmi ◽  
A.V. Sabarish Kanna ◽  
M. Deva Priya
Keyword(s):  
Packet Loss ◽  
Ad Hoc ◽  
Vital Role ◽  
Delivery Ratio ◽  
Loss Ratio ◽  
Packet Delivery ◽  
Mobile Adhoc Network ◽  
Adhoc Network ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A Mobile Adhoc Network (MANET) is prone to attacks. Adversaries take hold of the network, thus degrading their performance. Various attacks are prevalent in MANET, out of which Byzantine attack plays a vital role. A node or group of nodes present in the routing path between the source and the destination may be compromised due to Byzantine attack. In this paper, Cohen Kappa Reliability Coefficient based Mitigation (CKRCM) mechanism is proposed to deal with these attacks. The intermediate nodes are monitored by their neighbors for a timestamp. If the monitoring node does not receive an acknowledgment, then the nodes are perceived to be attacked. The trustworthiness of the nodes is built by computing the trusts and reliabilities of the nodes. It is seen that the proposed scheme outperforms the existing scheme in terms of Throughput, Packet Delivery Ratio (PDR) and Packet Loss Ratio (PLR).

scholarly journals Prediction Algorithm for Mobile Ad Hoc Network Connection Breaks

2020 ◽  
Vol 12 (6) ◽  
pp. 49-63
Author(s):  
Yasir Mohammed ◽  
Maha Abdelhaq ◽  
Raed Alsaqour
Keyword(s):  
Ad Hoc Network ◽  
Link Prediction ◽  
Network Performance ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobile Node ◽  
Prediction Algorithm ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Ad Hoc

A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.

Sign in / Sign up

Export Citation Format

Share Document