Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497610
G. Zverkina
Obviously, in a reliability system consisting of two restorable elements, the distributions of work and repair times are exponential. And obviously, the switching between operating mode and repair mode and vice versa is instantaneous. In this paper, we consider the case when the behaviour (intensity of wear-out or repair) of both elements depends on each other, and the switching can be delayed. The time of such switching can be random, yet we suppose that it is limited. The random time of work and repair of elements is determined using intensities. The work and repair intensities depend on the full state of the system, i.e. on the status (element work or no) of each element and on its elapsed times in their statuses. If the distribution of work or repair time of at least one element is non-exponential, the random process describing the behaviour of such a system is not regenerative. Sufficient conditions for the ergodicity of such a process are formulated. Also, sufficient conditions for the possibility of calculating the upper polynomial bound for the rate of convergence of the numerical characteristics of the system under consideration are proposed.
{"title":"On Polynomial Convergence Rate for Extended Reliability Standby System","authors":"G. Zverkina","doi":"10.1109/IDT52577.2021.9497610","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497610","url":null,"abstract":"Obviously, in a reliability system consisting of two restorable elements, the distributions of work and repair times are exponential. And obviously, the switching between operating mode and repair mode and vice versa is instantaneous. In this paper, we consider the case when the behaviour (intensity of wear-out or repair) of both elements depends on each other, and the switching can be delayed. The time of such switching can be random, yet we suppose that it is limited. The random time of work and repair of elements is determined using intensities. The work and repair intensities depend on the full state of the system, i.e. on the status (element work or no) of each element and on its elapsed times in their statuses. If the distribution of work or repair time of at least one element is non-exponential, the random process describing the behaviour of such a system is not regenerative. Sufficient conditions for the ergodicity of such a process are formulated. Also, sufficient conditions for the possibility of calculating the upper polynomial bound for the rate of convergence of the numerical characteristics of the system under consideration are proposed.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128252013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497588
Tomaz Amon
The virtual reality worlds on the web obviously present in many parameters a better tool for education as classical paper learning software. In its extreme, the electronic paper textbook can be included as a pdf file. The interactivity and ease to transport, copy and adapt such material make it very practical. In addition it is more durable than paper because it can be easily reproduced. We produced a software package “Cell-Tissue-Body” teaching biology in the secondary and primary schools in Slovenia. The Ministry of education supported this project and it is free to obtain. We discuss here first the advantages and disadvantages of the electronical textbooks, then the difficulties when implementing them in our schools and finally our thoughts how to overcome the possible difficulties in future updates of this and other projects.
{"title":"Experience with the usage of virtual reality worlds about natural history in Slovenia","authors":"Tomaz Amon","doi":"10.1109/IDT52577.2021.9497588","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497588","url":null,"abstract":"The virtual reality worlds on the web obviously present in many parameters a better tool for education as classical paper learning software. In its extreme, the electronic paper textbook can be included as a pdf file. The interactivity and ease to transport, copy and adapt such material make it very practical. In addition it is more durable than paper because it can be easily reproduced. We produced a software package “Cell-Tissue-Body” teaching biology in the secondary and primary schools in Slovenia. The Ministry of education supported this project and it is free to obtain. We discuss here first the advantages and disadvantages of the electronical textbooks, then the difficulties when implementing them in our schools and finally our thoughts how to overcome the possible difficulties in future updates of this and other projects.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122853566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497617
Gaël Hequet, N. Brînzei, J. Pétin
This paper focuses on a way to represent complex systems by using a modification in the Stochastic Hybrid Automata (SHA) first designed by the CRAN by expending finite-state automaton. SHA are used to represent continuous physical phenomenon (aging for example) that can induce discrete event (failures). With this tool, it is possible to represent the lifecycle of a component, its aging, and failures. To have a more precise model, a new addition to the SHA can be done. A system can have many usage profiles and each of these profiles can change the aging and probability of failures of the system. This work aims to add this view to the SHA by creating a virtual racing car. The driver of this racing car can drive in different ways. Depending on his driving profile, the components of the car (body, engine, tyres, electronics, clutch, transmission, brakes, and gearbox) can suffer from different types of degradations. The level of degradation of a component has an impact on its probability of failure. In addition to this impact given by the degradation, another impact is considered, the profile of driving itself. Depending on the driving profile, the failure rate can vary. In this idea, different failure rates are linked to each driving profile. The impacts of these profile variation will be shown in this paper.
{"title":"Usage profile in physical systems modelized with stochastic hybrid automata","authors":"Gaël Hequet, N. Brînzei, J. Pétin","doi":"10.1109/IDT52577.2021.9497617","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497617","url":null,"abstract":"This paper focuses on a way to represent complex systems by using a modification in the Stochastic Hybrid Automata (SHA) first designed by the CRAN by expending finite-state automaton. SHA are used to represent continuous physical phenomenon (aging for example) that can induce discrete event (failures). With this tool, it is possible to represent the lifecycle of a component, its aging, and failures. To have a more precise model, a new addition to the SHA can be done. A system can have many usage profiles and each of these profiles can change the aging and probability of failures of the system. This work aims to add this view to the SHA by creating a virtual racing car. The driver of this racing car can drive in different ways. Depending on his driving profile, the components of the car (body, engine, tyres, electronics, clutch, transmission, brakes, and gearbox) can suffer from different types of degradations. The level of degradation of a component has an impact on its probability of failure. In addition to this impact given by the degradation, another impact is considered, the profile of driving itself. Depending on the driving profile, the failure rate can vary. In this idea, different failure rates are linked to each driving profile. The impacts of these profile variation will be shown in this paper.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128108554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497592
Rajesh Venkatachalapathy, M. Zwick, A. Słowik, Kaitlin Brooks, Mikhail Mayers, Roman Minko, Tyler Hull, Bliss Brass, M. Perkowski
Paper presents a concept that is new to robotics education and social robotics. It is based on theatrical games, in which students create “biological”, “characteristic” and natural motions for social robots and animatronic robots. Presented here motion model is based on Drift Differential Model from biology and Fokker-Planck equations. This model is used in various areas of science to describe many types of motion. The model was successfully verified on various simulated mobile robots and a motion game of three robots called “Mouse and Cheese”.
{"title":"Universal Biological Motions for Educational Robot Theatre and Games","authors":"Rajesh Venkatachalapathy, M. Zwick, A. Słowik, Kaitlin Brooks, Mikhail Mayers, Roman Minko, Tyler Hull, Bliss Brass, M. Perkowski","doi":"10.1109/IDT52577.2021.9497592","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497592","url":null,"abstract":"Paper presents a concept that is new to robotics education and social robotics. It is based on theatrical games, in which students create “biological”, “characteristic” and natural motions for social robots and animatronic robots. Presented here motion model is based on Drift Differential Model from biology and Fokker-Planck equations. This model is used in various areas of science to describe many types of motion. The model was successfully verified on various simulated mobile robots and a motion game of three robots called “Mouse and Cheese”.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114690190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497602
J. Janáček, Marek Kvet
The weighted p-median problem solving techniques represent basic tools for designing large emergency service systems, which have to provide public of a serviced region with service from a given number of service centers. A specific form of the set of all feasible solutions of the p-median problem enables to employ efficient incrementing heuristics to obtain a near-to-optimal solution. The incrementing heuristics proved their efficiency in combination with preliminary inspection of the set of all feasible solutions performed by a uniformly deployed set of p-median problem solutions. As obtaining uniformly deployed set for a specific p-median problem is very time consuming, an idea of a universal kit of uniformly deployed set has arisen. The idea consists in building up a standard family of uniformly deployed sets for given ranges of the number p of located centers and the number m of possible service center locations. If an emergency system has to be designed and its sizes p and m do not correspond with any standard uniformly deployed set, then a suitable standard set of the kit is adjusted to the sizes of the solved problem. This approach works excellently if the neighborhood search incrementing heuristics are applied, but it fails in case of path-relinking method based incrementing algorithms. This defect is caused by the fact that the solutions contained in the adjusted uniformly deployed set do not cover all possible service center locations of the solved problem. In this paper, we suggest an extending adjusted method overcoming the above-mentioned drawback and we study the impact of this improvement on efficiency of incrementing approaches based on the path-relinking inspection.
{"title":"Customization of Uniformly Deployed Set Kit for Path-relinking Method","authors":"J. Janáček, Marek Kvet","doi":"10.1109/IDT52577.2021.9497602","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497602","url":null,"abstract":"The weighted p-median problem solving techniques represent basic tools for designing large emergency service systems, which have to provide public of a serviced region with service from a given number of service centers. A specific form of the set of all feasible solutions of the p-median problem enables to employ efficient incrementing heuristics to obtain a near-to-optimal solution. The incrementing heuristics proved their efficiency in combination with preliminary inspection of the set of all feasible solutions performed by a uniformly deployed set of p-median problem solutions. As obtaining uniformly deployed set for a specific p-median problem is very time consuming, an idea of a universal kit of uniformly deployed set has arisen. The idea consists in building up a standard family of uniformly deployed sets for given ranges of the number p of located centers and the number m of possible service center locations. If an emergency system has to be designed and its sizes p and m do not correspond with any standard uniformly deployed set, then a suitable standard set of the kit is adjusted to the sizes of the solved problem. This approach works excellently if the neighborhood search incrementing heuristics are applied, but it fails in case of path-relinking method based incrementing algorithms. This defect is caused by the fact that the solutions contained in the adjusted uniformly deployed set do not cover all possible service center locations of the solved problem. In this paper, we suggest an extending adjusted method overcoming the above-mentioned drawback and we study the impact of this improvement on efficiency of incrementing approaches based on the path-relinking inspection.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126126112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497567
Á. Tóth, J. Sztrik, Á. Pintér, Z. Bács
In this paper, we have developed a simulation program to investigate M/M/1//N and M/G/1//N retrial queuing systems with collisions and impatient customers in the orbit. In our model, for lack of waiting queues, the service of an arriving customer begins immediately. Otherwise, it has the ability to bring about a collision in which both the arrived and request under service are forwarded to the orbit where spending some exponentially distributed random time they try to get their service demand to be executed. All requests possess an impatience property resulting in an earlier departure from the system through the orbit if they spend too much time waiting for being served properly. The phenomenon of blocking is applied not allowing the customers into the system while the service unit resides in a faulty condition. The server is supposed to break down according to several distributions and this work concentrates on examining the effect of these distributions on several performance measures like the distribution of the number of collisions and failures of customers. The results are graphically illustrated to experience the difference among the used parameter settings of the various distributions.
{"title":"Reliability Analysis of Finite-Source Retrial Queuing System with Collisions and Impatient Customers in the Orbit Using Simulation","authors":"Á. Tóth, J. Sztrik, Á. Pintér, Z. Bács","doi":"10.1109/IDT52577.2021.9497567","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497567","url":null,"abstract":"In this paper, we have developed a simulation program to investigate M/M/1//N and M/G/1//N retrial queuing systems with collisions and impatient customers in the orbit. In our model, for lack of waiting queues, the service of an arriving customer begins immediately. Otherwise, it has the ability to bring about a collision in which both the arrived and request under service are forwarded to the orbit where spending some exponentially distributed random time they try to get their service demand to be executed. All requests possess an impatience property resulting in an earlier departure from the system through the orbit if they spend too much time waiting for being served properly. The phenomenon of blocking is applied not allowing the customers into the system while the service unit resides in a faulty condition. The server is supposed to break down according to several distributions and this work concentrates on examining the effect of these distributions on several performance measures like the distribution of the number of collisions and failures of customers. The results are graphically illustrated to experience the difference among the used parameter settings of the various distributions.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122760641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497573
Nika Kvaššayová, Marek Mansell, Martin Cápay, Magdaléna Bellayová
Physical computing allows students to develop concrete, tangible products of the real world. This can motivate them to fully open their imagination and provide them access to the different topic areas, not only computer science. The aim of this paper is to describe a project that spread the idea of physical computing among teachers and students in Slovakia. We think that the BBC micro:bit has a great potential to become a way to transform education, so our attention is devoted to this physical computing device. This paper also describes a grant for schools, the creation of supporting material for teachers, how webinars ran in a special virtual environment and analyzes the first contact questionnaire that gives us the basic information about the situation in primary and secondary schools.
{"title":"The BBC micro:bit in Slovakia","authors":"Nika Kvaššayová, Marek Mansell, Martin Cápay, Magdaléna Bellayová","doi":"10.1109/IDT52577.2021.9497573","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497573","url":null,"abstract":"Physical computing allows students to develop concrete, tangible products of the real world. This can motivate them to fully open their imagination and provide them access to the different topic areas, not only computer science. The aim of this paper is to describe a project that spread the idea of physical computing among teachers and students in Slovakia. We think that the BBC micro:bit has a great potential to become a way to transform education, so our attention is devoted to this physical computing device. This paper also describes a grant for schools, the creation of supporting material for teachers, how webinars ran in a special virtual environment and analyzes the first contact questionnaire that gives us the basic information about the situation in primary and secondary schools.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125461401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497627
Katerina Prihodová, J. Jech
Gender recognition is one of the issues that computer vision deals with. It is useful for analysing human behaviour, intelligent tracking, or human-robot interaction. The aim of this paper is to recognise the gender of people in outdoor areas, where it is very difficult or impossible to guard all access roads to the place, even in poor lighting conditions or in the dark. In this paper, a model will be designed and tested using a controlled UAV flight, during which images of people were obtained. The sensor is a thermal camera located on the UAV, which is not dependent on ambient lighting, and deep learning methods are used for subsequent image processing and classification. These are convolutional neural networks (AlexNet, GoogLeNet), which will be used to solve binary classification. Optimized networks achieve classification accuracy of 81.6 %% (GoogLeNet) and 82.3% (AlexNet). A freely available database [21] was used to learn CNNs, and a self-created database (images obtained with a thermal camera attached to a UAV) was used to test the networks.
{"title":"Gender recognition using thermal images from UAV","authors":"Katerina Prihodová, J. Jech","doi":"10.1109/IDT52577.2021.9497627","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497627","url":null,"abstract":"Gender recognition is one of the issues that computer vision deals with. It is useful for analysing human behaviour, intelligent tracking, or human-robot interaction. The aim of this paper is to recognise the gender of people in outdoor areas, where it is very difficult or impossible to guard all access roads to the place, even in poor lighting conditions or in the dark. In this paper, a model will be designed and tested using a controlled UAV flight, during which images of people were obtained. The sensor is a thermal camera located on the UAV, which is not dependent on ambient lighting, and deep learning methods are used for subsequent image processing and classification. These are convolutional neural networks (AlexNet, GoogLeNet), which will be used to solve binary classification. Optimized networks achieve classification accuracy of 81.6 %% (GoogLeNet) and 82.3% (AlexNet). A freely available database [21] was used to learn CNNs, and a self-created database (images obtained with a thermal camera attached to a UAV) was used to test the networks.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132097575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497531
Terézia Sliacka, Michal Varga, N. Adamko
Modelling the movement of workers in detailed railway yard simulation models can be accomplished by adaptation of universal pedestrian simulation models. While the modelling of walking behaviour remains almost identical, specific approach to pathfinding is desirable — mostly due to rules of movement in the environment and its dynamic changes. The paper presents modification of typical * pathfinding algorithm, which enables safe navigation of railyard worker agents in specific environment of railway yards. Proposed algorithm utilizes the concept of walkability and takes into account areas with different level of hazard. Such approach can be expanded to consider dynamic moving obstacles typical for railway yards (i.e. moving trains) as well. We present the construction of navigation structures and the algorithm of routing of railyard worker agents utilizing such structure. Proposed solution has been successfully tested in simulation model of marshalling yard.
{"title":"Application of the A* Algorithm for Navigation of Workers in Simulation Models of Railway Yards","authors":"Terézia Sliacka, Michal Varga, N. Adamko","doi":"10.1109/IDT52577.2021.9497531","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497531","url":null,"abstract":"Modelling the movement of workers in detailed railway yard simulation models can be accomplished by adaptation of universal pedestrian simulation models. While the modelling of walking behaviour remains almost identical, specific approach to pathfinding is desirable — mostly due to rules of movement in the environment and its dynamic changes. The paper presents modification of typical * pathfinding algorithm, which enables safe navigation of railyard worker agents in specific environment of railway yards. Proposed algorithm utilizes the concept of walkability and takes into account areas with different level of hazard. Such approach can be expanded to consider dynamic moving obstacles typical for railway yards (i.e. moving trains) as well. We present the construction of navigation structures and the algorithm of routing of railyard worker agents utilizing such structure. Proposed solution has been successfully tested in simulation model of marshalling yard.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"283 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133350978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497568
I. Alameri, Š. Hubálovský, Jitka Komárková
A Mobile ad-hoc Network (MANET) protocol must be configured correctly to ensure efficient data transfer. To achieve this aim a suitable routing protocol must be selected. Therefore, selecting the correct routing protocol is a critical condition, and it presents a classic problem in MANET. Also, using the proper values of the parameter in routing protocols plays a crucial role in MANET. MANET comprises several node devices run by battery as a power source. The primary function of MANET nodes is transmitting data based on routing protocols; thus, routing protocols play an essential role in MANET. Simultaneously, all routing protocols serve the same function in the network, but they differ in their performance. The current paper investigates four routing protocols performance by using the network simulator (NS-2) with various nodes speed, time simulations, network load, and network size. The current project evaluated the protocol performance based on metrics parameters such as throughput, end-to-end delay and packet delivery ratio. The simulation results showed that the ad-hoc On-demand Distance Vector (AODV) protocol was the best in all previous metrics parameters. In contrast, Zone Routing Protocol (ZRP) has the lowest performance. More details of the parameters have been presented in the current paper.
{"title":"Evaluation of impact of mobility, network size and time on performance of adaptive routing protocols","authors":"I. Alameri, Š. Hubálovský, Jitka Komárková","doi":"10.1109/IDT52577.2021.9497568","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497568","url":null,"abstract":"A Mobile ad-hoc Network (MANET) protocol must be configured correctly to ensure efficient data transfer. To achieve this aim a suitable routing protocol must be selected. Therefore, selecting the correct routing protocol is a critical condition, and it presents a classic problem in MANET. Also, using the proper values of the parameter in routing protocols plays a crucial role in MANET. MANET comprises several node devices run by battery as a power source. The primary function of MANET nodes is transmitting data based on routing protocols; thus, routing protocols play an essential role in MANET. Simultaneously, all routing protocols serve the same function in the network, but they differ in their performance. The current paper investigates four routing protocols performance by using the network simulator (NS-2) with various nodes speed, time simulations, network load, and network size. The current project evaluated the protocol performance based on metrics parameters such as throughput, end-to-end delay and packet delivery ratio. The simulation results showed that the ad-hoc On-demand Distance Vector (AODV) protocol was the best in all previous metrics parameters. In contrast, Zone Routing Protocol (ZRP) has the lowest performance. More details of the parameters have been presented in the current paper.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129167676","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}