scholarly journals Multipath Routing for Balancing the Load in Manet

2019 ◽  
Vol 9 (2) ◽  
pp. 3466-3468
Keyword(s):  
Data Transmission ◽  
Ad Hoc ◽  
Multipath Routing ◽  
Relay Node ◽  
Delivery Ratio ◽  
Routing Strategy ◽  
Routing Performance ◽  
Potential Applications ◽  
Hoc Networks ◽  
Network Overhead

Mobile Ad hoc Networks (MANETs) have attracted quite a concentration owing to their extensive potential applications. Load balancing is vital for enhancing performance in MANETs. Routing overload is the major causes of breaking routing performance in the network. To resolve these challenges, this paper intends a novel routing scheme is called Multipath Routing for Balancing the Load (MRBL) in MANET. In this scheme, the relay node is selected based on the received signal strength. During data transmission, the route node is overload due to heavy data transmission. When utilizing the multipath routing strategy. As a result, decreased network overhead and increased the packet delivery ratio. This work is simulated in NS-2 simulator, and the results show that MRBL scheme performs better than the baseline protocol.

scholarly journals Data Transmission and Management Based on Node Communication in Opportunistic Social Networks

Symmetry ◽  
2020 ◽  
Vol 12 (8) ◽  
pp. 1288 ◽  
Author(s):  
Yutong Xiao ◽  
Jia Wu
Keyword(s):  
Data Transmission ◽  
Opportunistic Networks ◽  
Theoretical Research ◽  
Delivery Ratio ◽  
Connection Strength ◽  
Network Algorithms ◽  
Adaptive Allocation ◽  
Routing Strategy ◽  
Distance Communication ◽  
Network Overhead

Due to the rapid popularization of various short distance communication mobile devices, the use scenarios of opportunistic networks are increasing day by day. However, in opportunistic networks, because of the complexity of community structure, many methods lack of symmetry between application and theoretical research. Thus, the connection strength between nodes is different, and the degree of message diffusion is different. If the above factors cannot be accurately estimated and analyzed, and effective data forwarding and scheduling strategies cannot be formulated, the delivery ratio will be low, the delay will be relatively high, and the network overhead will be large. In light of improving symmetry problems in opportunistic networks, this paper establishes the message duplicate adaptive allocation and spray routing strategy (MDASRS) algorithm model, measures the connection strength between nodes through social pressure, and estimates the diffusion of current messages in the network through the probability of messages leaving the current node successfully, so as to develop the self-adaptive control replication transmission mode and achieve the effect of reducing the network burden and network overhead. This is done through experiments and comparison of social network algorithms, comparing the MDASRS with Epidemic, Spray and Wait, and EIMST algorithms. The experiment results showed that this method improves the cache utilization of nodes, reduces data transmission delay, and improves the network’s overall efficiency.

scholarly journals Survey on Power-Aware Optimization Solutions for MANETs

Electronics ◽  
2020 ◽  
Vol 9 (7) ◽  
pp. 1129
Author(s):  
Dimitris Kanellopoulos ◽  
Varun Kumar Sharma
Keyword(s):  
Ad Hoc ◽  
Delivery Ratio ◽  
Extensive Literature ◽  
Node Mobility ◽  
Research Directions ◽  
Battery Design ◽  
Overall Performance ◽  
Hoc Networks ◽  
Network Overhead ◽  
Path Properties

Mobile ad hoc networks (MANETs) possess numerous and unique characteristics, such as high channel error-rate, severe link-layer contentions, frequent link breakage (due to node mobility), and dissimilar path properties (e.g., bandwidth, delay, and loss rate) that make these networks different from the traditional ones. These characteristics seriously interfere with communication and hence, ultimately degrade the overall performance in terms of end-to-end delay, packet delivery ratio, network throughput, and network overhead. The traditional referenced layered strict architecture is not capable of dealing with MANET characteristics. Along with this, the most important apprehension in the intent of MANETs is the battery-power consumption, which relies on non-renewable sources of energy. Even though improvements in battery design have not yet reached that great a level, the majority of the routing protocols have not emphasized energy consumption at all. Such a challenging aspect has gained remarkable attention from the researchers, which inspired us to accomplish an extensive literature survey on power-aware optimization approaches in MANETs. This survey comprehensively covers power-aware state-of-the-art schemes for each suggested group, major findings, crucial structures, advantages, and design challenges. In this survey, we assess the suggested power-aware policies in the past in every aspect so that, in the future, other researchers can find new potential research directions.

scholarly journals W-GPCR Routing Method for Vehicular Ad Hoc Networks

Sensors ◽  
2020 ◽  
Vol 20 (12) ◽  
pp. 3406 ◽  
Author(s):  
Min Li ◽  
Zhiru Gu ◽  
Yonghong Long ◽  
Xiaohua Shu ◽  
Qing Rong ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Rapid Change ◽  
Relay Node ◽  
Geographic Routing ◽  
Delivery Ratio ◽  
Local Optimum ◽  
Hoc Networks

The high-speed dynamics of nodes and rapid change of network topology in vehicular ad hoc networks (VANETs) pose significant challenges for the design of routing protocols. Because of the unpredictability of VANETs, selecting the appropriate next-hop relay node, which is related to the performance of the routing protocol, is a difficult task. As an effective solution for VANETs, geographic routing has received extensive attention in recent years. The Greedy Perimeter Coordinator Routing (GPCR) protocol is a widely adopted position-based routing protocol. In this paper, to improve the performance in sparse networks, the local optimum, and the routing loop in the GPCR protocol, the Weighted-GPCR (W-GPCR) protocol is proposed. Firstly, the relationship between vehicle node routing and other parameters, such as the Euclidean distance between node pairs, driving direction, and density, is analyzed. Secondly, the composite parameter weighted model is established and the calculation method is designed for the existing routing problems; the weighted parameter ratio is selected adaptively in different scenarios, so as to obtain the optimal next-hop relay node. In order to verify the performance of the W-GPCR method, the proposed method is compared with existing methods, such as the traditional Geographic Perimeter Stateless Routing (GPSR) protocol and GPCR. Results show that this method is superior in terms of the package delivery ratio, end-to-end delay, and average hop count.

scholarly journals Spectrum-Aware Geographic Routing in Cognitive Vehicular Ad Hoc Network Using a Kalman Filter

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Huma Ghafoor ◽  
Insoo Koo
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Relay Node ◽  
Primary User ◽  
Geographic Routing ◽  
Delivery Ratio ◽  
Vehicle Communication ◽  
Moving Vehicles ◽  
Hoc Networks ◽  
The One

We propose a position-based routing protocol for cognitive radio vehicular ad hoc networks (CR-VANETs) using aKalmanfilter algorithm. The protocol first selects an idle channel from among all the channels available to a vehicle while moving on a straight road and then finds the best relay node to deliver the packet to the destination. The selection of a relay node is done by dividing the vehicular transmission range into five regions, and then the source/relay node selects the one that is in the region having a higher preference than other regions. Communication between two vehicles occurs only when both the vehicles are on the same channel. Delay may increase while sensing the channel and selecting the relay node. To reduce the delay, we use aKalmanfilter to predict the future positions of all moving vehicles in the network. We consider vehicle-to-vehicle communication and compare our protocol for different probabilities of primary user being idle. Our proposed protocol shows improvement in both packet delivery ratio and end-to-end delay.

scholarly journals Intelligent Route Discovery Towards Rushing Attacks in Ad Hoc Wireless Networks

2021 ◽  
Author(s):  
Udayakumar Allimuthu ◽  
K Mahalakshmi
Keyword(s):  
Wireless Networks ◽  
Ad Hoc Networks ◽  
Data Transmission ◽  
Ad Hoc ◽  
Vital Role ◽  
Communication Overhead ◽  
Delivery Ratio ◽  
Security Measures ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Abstract MANET (Mobile Ad-hoc Networks) are distributed or delegated away from a central server, authoritative location of wireless networks that communicate without pre-existing structure. Ad-hoc networks are compromising the many types of attacks and routing. In MANET, the routing plays a vital role in terms of packets interaction and data transmission. Due to decentralized control, the MANET data transmission becomes insecure because of dispersed routing on the mobile ad-hoc nodes. Since the efficient route on MANET only controls the packets and does not simplify the route between the source to the destination, the maintenance of route interaction becomes a crucial process. Maintain effective data transactions over the MANET network, and it is essential to improve the route and locate the attacker. Nevertheless, MANET allows for route interaction against security threads. In this research article, four processing schemes are suggested to preserve the security measures against routing protocols. Especially in node communication, the rushing attacker has a significant impact on packet-based data transmission in MANET. Also, for this research, an Attacker detection automation of the Bees Colony Optimization (ADABCP) method is used, as a result of which the desired result is brought about in the effective attacker detection on the routing process. Moreover, the proposed Hybrid Random Late Detection (HRLD) routing protocol manages the MANET routing and overcomes the MANET congestion communication. The Swift Implicit Response Round Trip Time (SIRT) mechanism is generated by the Route Finding Manipulation (RFM) to enhance the performance. This RFM scheme helps to find the optimal routing in a secured manner. The proposed (SIRT-ADABCP-HRLD) approach was compared to the existing ESCT, ZRDM-LFPM, and ENM-LAC approaches, found to have improved by routing and data transmission. Compared to the conventional method, the method mentioned above achieves a better ratio for the end-to-end delay, communication overhead, packet delivery ratio, network lifetime, and energy consumption.

scholarly journals 802.11p Profile Adaptive MAC Protocol for Non-Safety Messages on Vehicular Ad Hoc Networks

2018 ◽  
Vol 12 (1) ◽  
pp. 208
Author(s):  
Shamsul J Elias ◽  
M. Elshaikh ◽  
M. Yusof Darus ◽  
Jamaluddin Jasmis ◽  
Angela Amphawan
Keyword(s):  
Ad Hoc Networks ◽  
Congestion Control ◽  
Data Transmission ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Mac Protocol ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Hoc Networks

<p>Vehicular Ad hoc Networks (VANET) play a vital Vehicle to Infrastructure (V2I) correspondence frameworks where vehicle are convey by communicating and conveying data transmitted among each other. Because of both high versatility and high unique network topology, congestion control should be executed distributedly. Optimizing the congestion control in term of delay rate, packet delivery ratio (PDR) and throughput could limit the activity of data packet transmissions. These have not been examined altogether so far – but rather this characteristic will be fundamental for VANET system execution and network system performance. This paper exhibits a novel strategy for congestion control and data transmission through Service Control Channel (SCH) in VANET. The Taguchi strategy has been connected in getting the optimize value of parameter for congstion control in highway environment. This idea lessens the pointless activity of data transmission and decreases the likelihood of congested in traffic in view of execution for measuring the delay rate, packet delivery ratio (PDR) and throughput. The proposed execution performance is estimated with the typical VANET environment in V2I topology in highway driving conditions and the simulation results demonstrate and enhance network execution performance with effective data transmission capacity.</p>

scholarly journals A Novel Routing Protocol for Realistic Traffic Network Scenarios in VANET

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Gagan Deep Singh ◽  
Sunil Kumar ◽  
Hammam Alshazly ◽  
Sahar Ahmed Idris ◽  
Madhushi Verma ◽  
...  
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Delivery Ratio ◽  
Traffic Network ◽  
Evolutionary Trajectory ◽  
Simulation Tools ◽  
Routing Performance ◽  
Simulation Scenario ◽  
Hoc Networks

The vehicular ad hoc network (VANET) has traditional routing protocols that evolved from mobile ad hoc networks (MANET). The standard routing protocols of VANET are geocast, topology, broadcast, geographic, and cluster-based routing protocols. They have their limitations and are not suitable for all types of VANET traffic scenarios. Hence, metaheuristics algorithms like evolutionary, trajectory, nature-inspired, and ancient-inspired algorithms can be integrated with standard routing algorithms of VANET to achieve optimized routing performance results in desired VANET traffic scenarios. This paper proposes integrating genetic algorithm (GA) in ant colony optimization (ACO) technique (GAACO) for an optimized routing algorithm in three different realistic VANET network traffic scenarios. The paper compares the traditional VANET routing algorithm along with the metaheuristics approaches and also discusses the VANET simulation scenario for experimental purposes. The implementation of the proposed approach is tested on the open-source network and traffic simulation tools to verify the results. The three different traffic scenarios were deployed on Simulation of Urban Mobility (SUMO) and tested using NS3.2. After comparing them, the results were satisfactory and it is found that the GAACO algorithm has performed better in all three different traffic scenarios. The realistic traffic network scenarios are taken from Dehradun City with four performance metric parameters including the average throughput, packet delivery ratio, end-to-end delay, and packet loss in a network. The experimental results conclude that the proposed GAACO algorithm outperforms particle swarm intelligence (PSO), ACO, and Ad-hoc on Demand Distance Vector Routing (AODV) routing protocols with an average significant value of 1.55%, 1.45%, and 1.23% in three different VANET network scenarios.

scholarly journals Q-LBR: Q-Learning Based Load Balancing Routing for UAV-Assisted VANET

Sensors ◽  
2020 ◽  
Vol 20 (19) ◽  
pp. 5685
Author(s):  
Bong-Soo Roh ◽  
Myoung-Hun Han ◽  
Jae-Hyun Ham ◽  
Ki-Il Kim
Keyword(s):  
Load Balancing ◽  
Traffic Congestion ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Control Function ◽  
Dynamic Network ◽  
Relay Node ◽  
Delivery Ratio ◽  
Q Learning ◽  
Hoc Networks

Although various unmanned aerial vehicle (UAV)-assisted routing protocols have been proposed for vehicular ad hoc networks, few studies have investigated load balancing algorithms to accommodate future traffic growth and deal with complex dynamic network environments simultaneously. In particular, owing to the extended coverage and clear line-of-sight relay link on a UAV relay node (URN), the possibility of a bottleneck link is high. To prevent problems caused by traffic congestion, we propose Q-learning based load balancing routing (Q-LBR) through a combination of three key techniques, namely, a low-overhead technique for estimating the network load through the queue status obtained from each ground vehicular node by the URN, a load balancing scheme based on Q-learning and a reward control function for rapid convergence of Q-learning. Through diverse simulations, we demonstrate that Q-LBR improves the packet delivery ratio, network utilization and latency by more than 8, 28 and 30%, respectively, compared to the existing protocol.

scholarly journals Multipath Strategies and Link Based Resource Optimized Routing in Manet

2020 ◽  
Vol 8 (5) ◽  
pp. 2125-2131
Keyword(s):  
Data Transmission ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Packet Delivery Ratio ◽  
Energy Utilization ◽  
Delivery Ratio ◽  
Transmission Method ◽  
Packet Delivery ◽  
Routing Performance ◽  
Mobile Ad Hoc

A MANETs (Mobile Ad Hoc Network) is a prearranged form of cellular nodes besides any infrastructure. The finest route determination in MANETs is a difficult task to progress the routing performance. A multipath strategies and link based resource optimized routing (MSR-OR) method is proposed to choose the best route for proficient data packet communication in MANETs. The MSR-OR Technique is used Selective Retransmission method to minimize high channel contention causing redundant a RREQ through combining both neighbor coverage and selective methods. The Selective Re-transmission method reduces the number of retransmissions and therefore optimizes resource utilization for data transmission, which in resulting improved packet delivery ratio with lower energy utilization. The functioning of MSR-OR Technique is deliberate as far as energy utilization, end to end delay (E-E-D), packet delivery ratio, and network lifetime (NLT). The simulation result shows that the MSR-OR Technique is improves the packet delivery ratio with minimum NLT for data transmission.

Sign in / Sign up

Export Citation Format

Share Document