Enhanced energy and channel aware load balancing AOMDV protocol for efficient packet transmission in MANET

2021 ◽  
Vol 4 (3/4) ◽  
pp. 156
Author(s):  
Abdullah Saleh Alqahtani
Keyword(s):  
Load Balancing ◽  
Packet Transmission

A Routing Protocol for Emergency Communication Based on Load Balancing

2015 ◽  
Vol 719-720 ◽  
pp. 744-749
Author(s):  
Hui Han ◽  
Hong De Zhang ◽  
Yang Wang
Keyword(s):  
Load Balancing ◽  
Communication Networks ◽  
Routing Protocol ◽  
Network Performance ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Packet Transmission ◽  
Emergency Communication ◽  
Network Load

Ad-hoc communications is a mobile communication networks and computer networks combine with no infrastructure support, and network survivability and flexibility is strong, especially suitable for emergency communication. As the existing mobile ad hoc network routing protocols lack of network load balancing capabilities, this paper proposed a routing protocol based on load balancing LBBR (Load Balancing Based Routing). Simulation results shows that, LBBR can improve the success rate of packet transmission, reducing the average end to end delay, thus effectively improving network performance.

A Novel Congestion Avoidance Algorithm for Autonomous Vehicles Assessed by Queue Modeling

2019 ◽  
Vol 11 (2) ◽  
pp. 1-11
Author(s):  
Khashayar Kotobi ◽  
Mina Sartipi
Keyword(s):  
Load Balancing ◽  
Computer Networks ◽  
Road Network ◽  
Numerical Study ◽  
Autonomous Vehicle ◽  
Packet Transmission ◽  
Network Throughput ◽  
Congestion Avoidance ◽  
Limited Resources ◽  
Fleet Management

Autonomous vehicle (AV) fleet management is one of the major aspects of AV development that needs to be standardized before AV deployment. There has been no consensus on whether AV deployment in general will be beneficial or detrimental in terms of road congestion. There are similarities between packet transmission in computer networks and AV transportation in road networks. In this work, the authors argue that congestion avoidance algorithms used in computer networks can be applied for AV fleet management. Authors modify and evaluate a novel adaptation of additive increase and multiplicative decrease (AMID) congestion avoidance algorithm. The authors propose assigning different priorities to transportation tasks in order to facilitate sharing the limited resources in such as usage of the road network. This will be modeled and assessed using a queueing model based on AVs arrival distribution. This will result in a load balancing paradigm that can be used to share and manage limited resources. Then, by using numerical study authors merge congestion avoidance and load balancing to analyze the authors' scheme in term of road network throughput (number of cars in network for a given time) for AV fleet management. Their evaluation demonstrates the improvement in terms of road network throughput.

ACOLBR: ACO Based Load Balancing Routing In MANET

2021 ◽  
Author(s):  
Milan Kumar Dholey ◽  
Ditipriya Sinha
Keyword(s):  
Load Balancing ◽  
Data Transmission ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Optimization Technique ◽  
Packet Transmission ◽  
Ant Colony ◽  
Decision Variable ◽  
Time Data ◽  
Control Overhead

Abstract Real-time data transmission is one of the objectives of MANET (mobile ad-hoc network) to handle emergencies like a forest fire, flood, and earthquake. In this scenario, quick delivery of data is itself a challenging task for MANET and there is a possibility of load imbalance due to packet transmission in between source-destination pairs via the shortest path due to congestion or control overhead. In this paper, a novel routing protocol, called ACOLBR (ACO based load balancing routing), is design to control the congestion and balancing the load among the multiple paths in between source to destination. The similarity between the environment of Ant Colony and the MANET inspires the authors to apply ACO (Ant colony optimization) technique during routing in MANET to control congestion and balance the load in the network. In our proposal, two colonies of ants (red/blue) carry their packets based on the network condition. A decision variable is designed to select red/blue ant for transferring packets based on different network parameters such as bandwidth, energy, mobility, and distance. The selection of red ant means the route where the concentration of red pheromone is maximum and reverse is true for blue ant. This protocol is also concerns about the link failure during packet transmission in a route. Simulation results using OMNET++ show that ACOLBR outperforms ARA, ANTHOCNET, FACO, AODV, DSDV, DSR, CA-ARTT, and MOAODV in terms of load balancing efficiently in the route for data transmission in between source to destination.

scholarly journals Flow-based Routing Model with Load Balancing on the Traffic Engineering Principles Taking into Account the Information Security Risks

2020 ◽  
pp. 32-42
Author(s):  
Maryna Yevdokymenko ◽  
Maryna Shapoval ◽  
Alla Krepko
Keyword(s):  
Network Security ◽  
Information Security ◽  
Load Balancing ◽  
Traffic Engineering ◽  
Telecommunication Network ◽  
Packet Transmission ◽  
Secure Routing ◽  
Security Requirements ◽  
Security Risks ◽  
Link Utilization

A practical approach to load balancing in a telecommunication network (TCN) is implementing Traffic Engineering (TE) technology principles to reduce link utilization and improve QoS level. In order to adapt TE solutions with network security requirements, this paper proposes a mathematical model for secure routing, which belongs to the class of flow-based optimization solutions. The model is based on the conditions of multi-flow routing implementation, flow conservation, and TCN link overload prevention. Due to this, the problem of secure routing is formulated in an optimization form. The model’s novelty is the modified conditions of load balancing in TCN. Along with the indicators of link capacity with the help of weighting coefficients, the network security (NS) indicators of TCN elements are also taken into account. The network security (NS) indicators in the TCN modeling process include information security risks of routers and communication links, losses from breach of confidentiality and integrity of information, probability of existing vulnerabilities exploitation, etc. The study confirmed the effectiveness of the proposed solution. On the test TCN topology, it is demonstrated that the use of a secure routing model allows to calculate the routes and provide such an order of load balancing, which compromises meeting the requirements of both QoS and NS. In the routing process, information security risk reduction in packet transmission by about 11.3% was accompanied by an increase (on average by 26%) in the upper bound of the network link utilization

Issues in Routing Mechanism for Packets Forwarding: A Survey

2016 ◽  
Vol 6 (1) ◽  
pp. 421 ◽  
Author(s):  
Rohit Nilkanth Devikar ◽  
Dipak V. Patil ◽  
V. Chandraprakash
Keyword(s):  
Load Balancing ◽  
Network Connectivity ◽  
Routing Algorithms ◽  
Network Control ◽  
Packet Transmission ◽  
Convergence Time ◽  
Packet Forwarding ◽  
Routing Mechanism ◽  
The Impact ◽  
Control Management

Nowadays internet has become more popular to each and every one. It is very sensitive to nodes or links failure due to many known or unknown issues in the network connectivity. Routing is the important concept in wired and wireless network for packet transmission. During the packet transmission many times some of the problems occur, due to this packets are being lost or nodes not able to transmit the packets to the specific destination. This paper discusses various issues and approaches related to the routing mechanism. In this paper, we present a review and comparison of different routing algorithms and protocols proposed recently in order to address various issues. The main purpose of this study is to address issues for packet forwarding like network control management, load balancing, congestion control, convergence time and instability. We also focus on the impact of these issues on packet forwarding.

scholarly journals Issues in Routing Mechanism for Packets Forwarding: A Survey

2016 ◽  
Vol 6 (1) ◽  
pp. 421
Author(s):  
Rohit Nilkanth Devikar ◽  
Dipak V. Patil ◽  
V. Chandraprakash
Keyword(s):  
Load Balancing ◽  
Network Connectivity ◽  
Routing Algorithms ◽  
Network Control ◽  
Packet Transmission ◽  
Convergence Time ◽  
Packet Forwarding ◽  
Routing Mechanism ◽  
The Impact ◽  
Control Management

Nowadays internet has become more popular to each and every one. It is very sensitive to nodes or links failure due to many known or unknown issues in the network connectivity. Routing is the important concept in wired and wireless network for packet transmission. During the packet transmission many times some of the problems occur, due to this packets are being lost or nodes not able to transmit the packets to the specific destination. This paper discusses various issues and approaches related to the routing mechanism. In this paper, we present a review and comparison of different routing algorithms and protocols proposed recently in order to address various issues. The main purpose of this study is to address issues for packet forwarding like network control management, load balancing, congestion control, convergence time and instability. We also focus on the impact of these issues on packet forwarding.

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

Sign in / Sign up

Export Citation Format

Share Document