Analysis of Influence of Network Architecture Nonuniformity and Traffic Self-similarity Properties to Load Balancing and Average End-to-End Delay

2020 ◽  
pp. 767-787
Author(s):  
Oleksandr Lemeshko ◽  
Amal Mersni ◽  
Olena Nevzorova
Keyword(s):  
Load Balancing ◽  
Network Architecture ◽  
Self Similarity ◽  
End To End Delay ◽  
End To End

scholarly journals Analisis Kinerja GPSR dan AODV pada VANET dengan Skema Pengimbangan Beban Trafik

2018 ◽  
Vol 6 (2) ◽  
pp. 207
Author(s):  
RENDI DIAN PRASETIA ◽  
DOAN PERDANA ◽  
RIDHA MULDINA NEGARA
Keyword(s):  
Load Balancing ◽  
Routing Protocol ◽  
Mean Value ◽  
Packet Delivery Ratio ◽  
Traffic Load ◽  
Delivery Ratio ◽  
Vehicle Traffic ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End

ABSTRAKSalah satu permasalahan di kota-kota besar adalah kemacetan lalu lintas yang disebabkan karena tidak mencukupinya ruas jalan, volume kendaraan yang begitu besar, persebaran kendaraan yang tidak merata dan lain-lain. Salah satu solusinya adalah para pengendara dapat menggunakan aplikasi peta digital pada smartphone-nya. Oleh karena itu perlu dilakukan pengimbangan beban trafik kendaraan. Pada penelitian ini akan dibahas mengenai kinerja VANET yang menggunakan protokol routing GPSR dan AODV dengan skema pengimbangan beban trafik kendaraan dengan pengaruh kepadatan node. Perancangan sistem simulasi terbagi menjadi dua subsistem yaitu subsistem mobilitas dan jaringan. Kemudian dilakukan pengimbangan beban trafik kendaraan, dan kinerja VANET akan diamati. Performansi dievaluasi dengan average end to end delay, throughput, dan packet delivery ratio. Nilai rata-rata throughput, PDR, delay untuk GPSR adalah 142.21 Kbps, 87.47 %, dan 82.83 ms. Sedangkan AODV adalah 119.81 Kbps, 86.67 %, dan 103.21 ms. Dari hasil penelitian nilai QoS performansi dari routing protocol GPSR lebih baik dari pada AODV pada VANET.Kata kunci: Vanet, Pengimbangan Beban, GPSR, AODV.ABSTRACTOne of the problems in big cities is congestion. The congestion is caused byinsufficient road segment, large volume of vehicles, unbalanced spread ofvehicles and others. One solution is that riders can use digital map applications on their smartphones. Therefore it is necessary to balancing the traffic load of vehicles. In this research will be discussed about VANET performance using GPSR and AODV routing protocol with vehicle traffic load balancing scheme with node density influence. The design of the simulation system is divided into two subsystems namely mobility and network subsystem. Then balancing the vehicle traffic load, and VANET performance will be observed. Performance is evaluated with the average end to end delay, throughput, and packet delivery ratio. The mean value of throughput, PDR, delay for GPSR respectively 142.21 Kbps, 87.47%, and 82.83 ms. While AODV is 119.81 Kbps, 86.67%, and 103.21 ms. From the simulation results can be concluded that the performance of GPSR is better than AODV on VANET. Keywords: Vanet, Load Balancing, GPSR, AODV.

scholarly journals RPL LOAD BALANCING IN INTERNET OF THINGS

2017 ◽  
Vol 18 (2) ◽  
pp. 137-150 ◽  
Author(s):  
Mohammad Reza Parsaei ◽  
Ahmad Reza Parnian ◽  
Samaneh Miri Rostami ◽  
Reza Javidan
Keyword(s):  
Internet Of Things ◽  
Load Balancing ◽  
Low Power ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Lossy Networks ◽  
Smart Objects ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End

ABSTRACT:  The wide address space provided by Internet Protocol version 6 (IPv6) lets any thing to be identified uniquely. consistency of the modified version of IPv6 protocol stack with smart objects, facilitated the Internet interconnection of the networks of smart objects and introduced Internet of things. A smart object is a small micro-electronic device that consists of a communication device, a small microprocessor and a sensor or an actuator. A network made of such devices is called low-power and lossy network. RPL routing protocol that is consistent to IPv6, is designed to be used in these kinds of networks. Load balancing is not considered in the RPL design process. Whenever RPL is used in large scale low-power and lossy networks some nodes will suffer from congestion and this problem severely degrades network performance. In this paper, we consider solutions provided to tackle RPL load balancing problems. Load balancing algorithms and protoclos are evaluated through simulation. We evaluate IETF RPL implementation and LB-RPL method with Contiki OS Java (COOJA) simulator. They are assessed comprehensively through metrics such as Packet delivery Ratio, Average End to End delay, and Gateway Throughput. LB-RPL improves RPL in terms of Packet delivery Ratio and throughput but increases Average End to End delay. Simulations results show that RPL load balancing needs extensive works to be performed yet.

scholarly journals Congestion Aware Multi-Path Routing Protocol with Load Balancing

2017 ◽  
Vol 6 (1) ◽  
pp. 6
Author(s):  
K.Sangeetha Supriya ◽  
M.Gopi Chand ◽  
K.Raja Sekhar
Keyword(s):  
Load Balancing ◽  
Routing Protocol ◽  
Recovery Process ◽  
Correlation Factor ◽  
Control Mechanisms ◽  
End To End Delay ◽  
Multiple Paths ◽  
Additive Increase ◽  
End To End ◽  
Congestion Aware

The multi-path routing protocol is one of the approaches used to have less overhead, better bandwidth cost through the load distribution among a set of paths. However, due to the interference of the paths during the communication, it increases the end to end delay and do not work well under a highly congested network. We have proposed the congestion aware multi-path routing protocol with load balancing. The paper explains the problem associated with the end-to-end delay. It deals with the problem of channel interference during the Multi-path communication. It suggests the congestion control mechanisms to improve the protocol performance. It proposes an additive increase/ multiplicative decrease and fast retransmits and recovery process and also it suggest the algorithm for load balancing scheme. In order to minimize the congestion formation, it selects the node disjoint paths for communication. The correlation factor among the selected multiple paths are calculated. It calculates the congestion formation in the network. It compares the proposed MPR protocol with ordinary DSR through the simulation and the simulation results are discussed.

A Stochastic Network Calculus Approach for the End-to-End Delay Analysis of LTE Networks

2012 ◽  
Vol 35 (1) ◽  
pp. 46-52 ◽  
Author(s):  
Xin CHEN ◽  
Lei ZHANG ◽  
Xu-Dong XIANG ◽  
Jian-Xiong WAN
Keyword(s):  
Delay Analysis ◽  
Network Calculus ◽  
Stochastic Network ◽  
Lte Networks ◽  
End To End Delay ◽  
End To End ◽  
Stochastic Network Calculus

Catechize Global Optimization through Leading Edge Firefly Based Zone Routing Protocol

2020 ◽  
Vol 13 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Neha Sharma ◽  
Sherin Zafar ◽  
Usha Batra
Keyword(s):  
Global Optimization ◽  
Routing Protocol ◽  
Firefly Algorithm ◽  
Leading Edge ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Zone Routing Protocol ◽  
End To End Delay ◽  
End To End

Background: Zone Routing Protocol is evolving as an efficient hybrid routing protocol with an extremely high potentiality owing to the integration of two radically different schemes, proactive and reactive in such a way that a balance between control overhead and latency is achieved. Its performance is impacted by various network conditions such as zone radius, network size, mobility, etc. Objective: The research work described in this paper focuses on improving the performance of zone routing protocol by reducing the amount of reactive traffic which is primarily responsible for degraded network performance in case of large networks. The usage of route aggregation approach helps in reducing the routing overhead and also help achieve performance optimization. Methods: The performance of proposed protocol is assessed under varying node size and mobility. Further applied is the firefly algorithm which aims to achieve global optimization that is quite difficult to achieve due to non-linearity of functions and multimodality of algorithms. For performance evaluation a set of benchmark functions are being adopted like, packet delivery ratio and end-to-end delay to validate the proposed approach. Results: Simulation results depict better performance of leading edge firefly algorithm when compared to zone routing protocol and route aggregation based zone routing protocol. The proposed leading edge FRA-ZRP approach shows major improvement between ZRP and FRA-ZRP in Packet Delivery Ratio. FRA-ZRP outperforms traditional ZRP and RA-ZRP even in terms of End to End Delay by reducing the delay and gaining a substantial QOS improvement. Conclusion: The achievement of proposed approach can be credited to the formation on zone head and attainment of route from the head hence reduced queuing of data packets due to control packets, by adopting FRA-ZRP approach. The routing optimized zone routing protocol using Route aggregation approach and FRA augments the QoS, which is the most crucial parameter for routing performance enhancement of MANET.

Security based on Received Signal Strength in Localization for Underwater Sensor Networks

2016 ◽  
Vol 1 (2) ◽  
pp. 1-7
Author(s):  
Karamjeet Kaur ◽  
Gianetan Singh Sekhon
Keyword(s):  
Sensor Networks ◽  
Threshold Value ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Underwater Sensor Networks ◽  
Research Subjects ◽  
Malicious Nodes ◽  
Intermediate Node ◽  
End To End Delay ◽  
End To End

Underwater sensor networks are envisioned to enable a broad category of underwater applications such as pollution tracking, offshore exploration, and oil spilling. Such applications require precise location information as otherwise the sensed data might be meaningless. On the other hand, security critical issue as underwater sensor networks are typically deployed in harsh environments. Localization is one of the latest research subjects in UWSNs since many useful applying UWSNs, e.g., event detecting. Now day’s large number of localization methods arrived for UWSNs. However, few of them take place stability or security criteria. In purposed work taking up localization in underwater such that various wireless sensor nodes get localize to each other. RSS based localization technique used remove malicious nodes from the communication intermediate node list based on RSS threshold value. Purposed algorithm improves more throughput and less end to end delay without degrading energy dissipation at each node. The simulation is conducted in MATLAB and it suggests optimal result as comparison of end to end delay with and without malicious node.

scholarly journals RCVC: RSU-Aided Cluster-Based Vehicular Clouds Architecture for Urban Areas

Electronics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 193
Author(s):  
Mohamed Ben bezziane ◽  
Ahmed Korichi ◽  
Chaker Abdelaziz Kerrache ◽  
Mohamed el Amine Fekair
Keyword(s):  
Urban Areas ◽  
High Speed ◽  
Service Discovery ◽  
Cluster Head ◽  
Experimental Comparison ◽  
The Road ◽  
Road Side Unit ◽  
End To End Delay ◽  
End To End ◽  
On The Road

As a promising topic of research, Vehicular Cloud (VC) incorporates cloud computing and ad-hoc vehicular network (VANET). In VC, supplier vehicles provide their services to consumer vehicles in real-time. These services have a significant impact on the applications of internet access, storage and data. Due to the high-speed mobility of vehicles, users in consumer vehicles need a mechanism to discover services in their vicinity. Besides this, quality of service varies from one supplier vehicle to another; thus, consumer vehicles attempt to pick out the most appropriate services. In this paper, we propose a novel protocol named RSU-aided Cluster-based Vehicular Clouds protocol (RCVC), which constructs the VC using the Road Side Unit (RSU) directory and Cluster Head (CH) directory to make the resources of supplier vehicles more visible. While clusters of vehicles that move on the same road form a mobile cloud, the remaining vehicles form a different cloud on the road side unit. Furthermore, the consumption operation is achieved via the service selection method, which is managed by the CHs and RSUs based on a mathematical model to select the best services. Simulation results prove the effectiveness of our protocol in terms of service discovery and end-to-end delay, where we achieved service discovery and end-to-end delay of 3 × 10−3 s and 13 × 10−2 s, respectively. Moreover, we carried out an experimental comparison, revealing that the proposed method outperformed several states of the art protocols.

Sign in / Sign up

Export Citation Format

Share Document