OMNeT++ Framework for Simulation of Centralized and Distributed Algorithms in Multi-Hop Networks

2022 ◽  
pp. 1-33
Author(s):  
Sercan Demirci ◽  
Serhat Celil Ileri ◽  
Sadat Duraki
Keyword(s):  
Open Source ◽  
Distributed Algorithms ◽  
Shortest Path ◽  
Spanning Tree ◽  
Cost Effective ◽  
Network Simulator ◽  
Network Algorithms ◽  
Tree Algorithm ◽  
Simulation Tools ◽  
Commercial Market

Theoretical applications and practical network algorithms are not very cost-effective, and most of the algorithms in the commercial market are implemented in the cutting-edge devices. Open-source network simulators have gained importance in recent years due to the necessity to implement network algorithms in more realistic scenarios with reasonable costs, especially for educational purposes and scientific researches. Although there have been various simulation tools, NS2 and NS3, OMNeT++ is more suitable to demonstrate network algorithms because it is convenient for the model establishment, modularization, expandability, etc. OMNeT++ network simulator is selected as a testbed in order to verify the correctness of the network algorithms. The study focuses on the algorithms based on centralized and distributed approaches for multi-hop networks in OMNeT++. Two network algorithms, the shortest path algorithm and flooding-based asynchronous spanning tree algorithm, were examined in OMNeT++. The implementation, analysis, and visualization of these algorithms have also been addressed.

scholarly journals Simulation tools for mobile ad hoc networks: a survey

2018 ◽  
Vol 16 (5) ◽  
Author(s):  
Irin Dorathy ◽  
M. Chandrasekaran
Keyword(s):  
Open Source ◽  
Ad Hoc ◽  
Network Simulator ◽  
Modular Network ◽  
Simulation Tools ◽  
Network Simulators ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
New Algorithms ◽  
Simulation Time

Simulation tools are essential for validating any research idea before it is being implemented. This is very essential for all the researchers irrespective of the field of research. Simulators provide a way for analysing the design.There are many simulation tools available for the network researchers. Network Simulators are used to test the performance of existing or new algorithms and protocols.Some of the simulation tools in networking include OPNET (OPtimized Network Engineering Tool), NS-2 (Network Simulator version 2), OMNET++ (Objective Modular NETwork Testbed in C++), GloMoSim (Global Mobile Information System Simulator), QualNet, NetSim (Network Simulator), JiST/SWANS (Java in Simulation Time/ Scalable Wireless Network Simulator), J-Sim (Java-based simulation) and NS-3 (Network Simulator Version 3). Simulation tools may be open source or commercial. In this paper, both the open source and commercial simulators are discussed. This survey reveals that for simulating large networks, simulators like OPNET, GloMoSim, QualNet, NetSim, JiST/SWANs and NS-3 can be used. For small network simulation NS-2 and J-Sim can be preferred. Open source simulators are poor in documentation. Commercial simulators have good documentation. Based on the requirements of the research, a proper simulation tool can be selected.

scholarly journals A Comprehensive Open-Source Simulation Framework for LiFi Communication

Sensors ◽  
2021 ◽  
Vol 21 (7) ◽  
pp. 2485
Author(s):  
Shakir Ullah ◽  
Saeed Ur Rehman ◽  
Peter Han Joo Chong
Keyword(s):  
Open Source ◽  
Hybrid System ◽  
Resource Sharing ◽  
Optical Gain ◽  
Packet Delay ◽  
Mobility Model ◽  
Network Simulator ◽  
Simulation Framework ◽  
Light Spectrum ◽  
Seamless Integration

Light Fidelity (LiFi) is a new candidate for wireless networking that utilizes the visible light spectrum and exploits the existing lighting infrastructure in the form of light-emitting diodes (LEDs). It provides point-to-point and point-to-multipoint communication on a bidirectional channel at very high data rates. However, the LiFi has small coverage, and its optical gain is closely related to the receiver’s directionality vis-à-vis the transmitter, therefore it can experience frequent service outages. To provide reliable coverage, the LiFi is integrated with other networking technologies such as wireless fidelity (WiFi) thus forming a hybrid system. The hybrid LiFi/WiFi system faces many challenges including but not limited to seamless integration with the WiFi, support for mobility, handover management, resource sharing, and load balancing. The existing literature has addressed one or the other aspect of the issues facing LiFi systems. There are limited free source tools available to holistically address these challenges in a scalable manner. To this end, we have developed an open-source simulation framework based on the network simulator 3 (ns-3), which realizes critical aspects of the LiFi wireless network. Our developed ns-3 LiFi framework provides a fully functional AP equipped with the physical layer and medium access control (MAC), a mobility model for the user device, and integration between LiFi and WiFi with a handover facility. Simulation results are produced to demonstrate the mobility and handover capabilities, and the performance gains from the LiFi-WiFi hybrid system in terms of packet delay, throughput, packet drop ratio (PDR), and fairness between users. The source code of the framework is made available for the use of the research community.

scholarly journals Optimal feeder reconfiguration in distributed generation environment under time-varying loading condition

2021 ◽  
Vol 3 (6) ◽  
Author(s):  
Yanrenthung Odyuo ◽  
Dipu Sarkar ◽  
Lilika Sumi
Keyword(s):  
Graph Theory ◽  
Distributed Generation ◽  
Spanning Tree ◽  
Voltage Stability ◽  
Electrical Network ◽  
List Type ◽  
Network Reconfiguration ◽  
Time Varying ◽  
Electrical Networks ◽  
Tree Algorithm

Abstract The development and planning of optimal network reconfiguration strategies for electrical networks is greatly improved with proper application of graph theory techniques. This paper investigates the application of Kruskal's maximal spanning tree algorithm in finding the optimal radial networks for different loading scenarios from an interconnected meshed electrical network integrated with distributed generation (DG). The work is done with an objective to assess the prowess of Kruskal's algorithm to compute, obtain or derive an optimal radial network (optimal maximal spanning tree) that gives improved voltage stability and highest loss minimization from among all the possible radial networks obtainable from the DG-integrated mesh network for different time-varying loading scenarios. The proposed technique has been demonstrated on a multiple test systems considering time-varying load levels to investigate the performance and effectiveness of the suggested method. For interconnected electrical networks with the presence of distributed generation, it was found that application of Kruskal's algorithm quickly computes optimal radial configurations that gives the least amount of power losses and better voltage stability even under varying load conditions. Article Highlights Investigated network reconfiguration strategies for electrical networks with the presence of Distributed Generation for time-varying loading conditions. Investigated the application of graph theory techniques in electrical networks for developing and planning reconfiguration strategies. Applied Kruskal’s maximal spanning tree algorithm to obtain the optimal radial electrical networks for different loading scenarios from DG-integrated meshed electrical network.

scholarly journals A Constant-Factor Approximation for the Generalized Cable-Trench Problem

2019 ◽  
Author(s):  
Marcelo Benedito ◽  
Lehilton Pedrosa ◽  
Hugo Rosado
Keyword(s):  
Shortest Path ◽  
Steiner Tree ◽  
Spanning Tree ◽  
Optimization Problem ◽  
Minimum Spanning Tree ◽  
Weighted Graph ◽  
Constant Factor ◽  
Steiner Tree Problem ◽  
Negative Factor ◽  
Path Lengths

In the Cable-Trench Problem (CTP), the objective is to find a rooted spanning tree of a weighted graph that minimizes the length of the tree, scaled by a non-negative factor , plus the sum of all shortest-path lengths from the root, scaled by another non-negative factor. This is an intermediate optimization problem between the Single-Destination Shortest Path Problem and the Minimum Spanning Tree Problem. In this extended abstract, we consider the Generalized CTP (GCTP), in which some vertices need not be connected to the root, but may serve as cost-saving merging points; this variant also generalizes the Steiner Tree Problem. We present an 8.599-approximation algorithm for GCTP. Before this paper, no constant approximation for the standard CTP was known.

scholarly journals Efficient 3D stereo vision stabilization for multi-camera viewpoints

2019 ◽  
Vol 8 (3) ◽  
pp. 882-889
Author(s):  
Sharif Shah Newaj Bhuiyan ◽  
Othman O. Khalifa
Keyword(s):  
Stereo Vision ◽  
Linear Order ◽  
Spanning Tree ◽  
Detection Method ◽  
Corner Detection ◽  
Geometric Transformation ◽  
Image Stabilization ◽  
Tree Algorithm ◽  
Stabilization Process ◽  
Key Points

In this paper, an algorithm is developed in 3D Stereo vision to improve image stabilization process for multi-camera viewpoints. Finding accurate unique matching key-points using Harris Laplace corner detection method for different photometric changes and geometric transformation in images. Then improved the connectivity of correct matching pairs by minimizing the global error using spanning tree algorithm. Tree algorithm helps to stabilize randomly positioned camera viewpoints in linear order. The unique matching key-points will be calculated only once with our method. Then calculated planar transformation will be applied for real time video rendering. The proposed algorithm can process more than 200 camera viewpoints within two seconds.

Sign in / Sign up

Export Citation Format

Share Document