Biljana Risteska-Stojkoska, Hristijan Gjorshevski, Elizabeta Mitreva
The aim of this paper is to develop a Web application where scholars of the Faculty of Computer Science and Engineering (FINKI) at the University of Ss. Cyril and Methodius can display and share their projects and publications. Visitors can view, search through, and filter the authors, projects and publications that can be added and edited by the administrators via the administrator panel. In this paper, we first explain the type of system we are building and go through similar existing systems explaining how they work and what they offer. Then, we go through the programming languages and technologies we decided to use to develop this Web application. After that, the development phase follows, where we describe each of the features we implemented. In The Final Product section we finally show images where you can see how the Web application works and what it looks like. We finish the paper with a conclusion, briefly summarizing what we have achieved.
{"title":"FINKI scholar, a publications database for Faculty of Computer Science and Engineering scholars","authors":"Biljana Risteska-Stojkoska, Hristijan Gjorshevski, Elizabeta Mitreva","doi":"10.5937/telfor2101047r","DOIUrl":"https://doi.org/10.5937/telfor2101047r","url":null,"abstract":"The aim of this paper is to develop a Web application where scholars of the Faculty of Computer Science and Engineering (FINKI) at the University of Ss. Cyril and Methodius can display and share their projects and publications. Visitors can view, search through, and filter the authors, projects and publications that can be added and edited by the administrators via the administrator panel. In this paper, we first explain the type of system we are building and go through similar existing systems explaining how they work and what they offer. Then, we go through the programming languages and technologies we decided to use to develop this Web application. After that, the development phase follows, where we describe each of the features we implemented. In The Final Product section we finally show images where you can see how the Web application works and what it looks like. We finish the paper with a conclusion, briefly summarizing what we have achieved.","PeriodicalId":37719,"journal":{"name":"Telfor Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71140149","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}
In this paper various complex signal constellations are considered in the context of Automatic Modulation Classification (AMC) based on a higher-order normalized cumulants value. Most of the constellations have been addressed so far with fourth-order cumulants as AMC features only. The goal of this paper is to provide comparable values of sixth-order cumulants' statistics for complex signal constellations as well, while resolving ambiguity in constellation shapes addressed at the same time and directing towards the criterion for estimation of expected classification performance.
{"title":"Complex signal constellations in cumulantsbased AMC: Statistics and performance","authors":"Marko Pajić, M. Veinovic, V. Orlic","doi":"10.5937/telfor2102063p","DOIUrl":"https://doi.org/10.5937/telfor2102063p","url":null,"abstract":"In this paper various complex signal constellations are considered in the context of Automatic Modulation Classification (AMC) based on a higher-order normalized cumulants value. Most of the constellations have been addressed so far with fourth-order cumulants as AMC features only. The goal of this paper is to provide comparable values of sixth-order cumulants' statistics for complex signal constellations as well, while resolving ambiguity in constellation shapes addressed at the same time and directing towards the criterion for estimation of expected classification performance.","PeriodicalId":37719,"journal":{"name":"Telfor Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71140541","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}
The article addresses the influence of two aspects on speech emotion recognition utilization for an emergency call center: a frequency of a caller experiencing certain emotional state and classification methods used for speech emotion recognition. In situations when more simultaneous calls in an emergency call center are received, the aim is to detect more urgent callers, e.g. in a life threating situation, and give them priority in a callers' queue. Three different emotion distributions based on the corpora from real-world emergency call centers are considered. The influence of those emotion distributions on the proposed call redistribution and subsequent time savings are reported and discussed. Regarding speech emotion classification, two approaches are presented, namely the linear Bayes classifier and a multilayer perceptron-based neural network. Their recognition results on the corpus of acted emotional Serbian speech are presented and potential application in an emergency call center is discussed.
{"title":"Influence of emotion distribution and classification on a call processing for an emergency call center","authors":"M. Bojanic, V. Delić, Alexey Karpov","doi":"10.5937/telfor2102075b","DOIUrl":"https://doi.org/10.5937/telfor2102075b","url":null,"abstract":"The article addresses the influence of two aspects on speech emotion recognition utilization for an emergency call center: a frequency of a caller experiencing certain emotional state and classification methods used for speech emotion recognition. In situations when more simultaneous calls in an emergency call center are received, the aim is to detect more urgent callers, e.g. in a life threating situation, and give them priority in a callers' queue. Three different emotion distributions based on the corpora from real-world emergency call centers are considered. The influence of those emotion distributions on the proposed call redistribution and subsequent time savings are reported and discussed. Regarding speech emotion classification, two approaches are presented, namely the linear Bayes classifier and a multilayer perceptron-based neural network. Their recognition results on the corpus of acted emotional Serbian speech are presented and potential application in an emergency call center is discussed.","PeriodicalId":37719,"journal":{"name":"Telfor Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71140378","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}
Moch Suryana Ainur, Achmad Wibowo Teguh, Andik Izuddin, Amin Muslihul Faris, Gumelar Bimo Agustinus, M. Y. S. Teguh
This research develops an application based on android that uses four interconnected nodes in a network with the Practical Byzantine fault tolerance (PBFT) blockchain method to value object geospatial retrieval. First, this application uses two types of users, general users and surveyors. Second, a surveyor location is validated within a radius of fifty meters from the central point of assets location using midpoint circle validation. Third, PBFT is used to access and validate and guarantee consistency by data using JSON-DIFF algorithm.
{"title":"Cryptospatial blockchain sharia hotel based on practical Byzantine fault tolerance","authors":"Moch Suryana Ainur, Achmad Wibowo Teguh, Andik Izuddin, Amin Muslihul Faris, Gumelar Bimo Agustinus, M. Y. S. Teguh","doi":"10.5937/telfor2101053s","DOIUrl":"https://doi.org/10.5937/telfor2101053s","url":null,"abstract":"This research develops an application based on android that uses four interconnected nodes in a network with the Practical Byzantine fault tolerance (PBFT) blockchain method to value object geospatial retrieval. First, this application uses two types of users, general users and surveyors. Second, a surveyor location is validated within a radius of fifty meters from the central point of assets location using midpoint circle validation. Third, PBFT is used to access and validate and guarantee consistency by data using JSON-DIFF algorithm.","PeriodicalId":37719,"journal":{"name":"Telfor Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71140259","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}
Data movement between the Convolutional Neural Network (CNN) accelerators and off-chip memory is critical concerning the overall power consumption. Minimizing power consumption is particularly important for low power embedded applications. Specific CNN computes patterns offer a possibility of significant data reuse, leading to the idea of using specialized on-chip cache memories which enable a significant improvement in power consumption. However, due to the unique caching pattern present within CNNs, standard cache memories would not be efficient. In this paper, a novel on-chip cache memory architecture, based on the idea of input feature map striping, is proposed, which requires significantly less on-chip memory resources compared to previously proposed solutions. Experiment results show that the proposed cache architecture can reduce on-chip memory size by a factor of 16 or more, while increasing power consumption no more than 15%, compared to some of the previously proposed solutions.
{"title":"Striping input feature map cache for reducing off-chip memory traffic in CNN accelerators","authors":"R. Struharik, Vuk Vranjkovic","doi":"10.5937/TELFOR2002116S","DOIUrl":"https://doi.org/10.5937/TELFOR2002116S","url":null,"abstract":"Data movement between the Convolutional Neural Network (CNN) accelerators and off-chip memory is critical concerning the overall power consumption. Minimizing power consumption is particularly important for low power embedded applications. Specific CNN computes patterns offer a possibility of significant data reuse, leading to the idea of using specialized on-chip cache memories which enable a significant improvement in power consumption. However, due to the unique caching pattern present within CNNs, standard cache memories would not be efficient. In this paper, a novel on-chip cache memory architecture, based on the idea of input feature map striping, is proposed, which requires significantly less on-chip memory resources compared to previously proposed solutions. Experiment results show that the proposed cache architecture can reduce on-chip memory size by a factor of 16 or more, while increasing power consumption no more than 15%, compared to some of the previously proposed solutions.","PeriodicalId":37719,"journal":{"name":"Telfor Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71140056","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}
Omayma Belkadi, Alexandru Vulpe, Yassin Laaziz, S. Halunga
Software-Defined Networking (SDN) and Cloud Computing are now two of the most adopted technologies, on which many organizations are working to enhance every day. For instance, SDN is particularly emerging to solve networking complexity in cloud data centers, so we see many attempts to integrate Network and Cloud Managers. In this paper, we address an integration of these two technologies, particularly a yet undiscussed combination of two popular frameworks: OpenNebula and OpenDaylight. These open source solutions are widely used for cloud management and network management, yet there are no developed modules for communication between the two. Therefore, we propose a simple way for OpenDaylight to manage OpenNebula's compute nodes, using a common component they both support: OpenvSwitch. We compared OpenNebula with the popular OpenStack cloud manager, as it is attracting more attention in both academia and industry, by evaluating some relevant time metrics and discussing the differences of the proposed technologies. Then, we deployed a test topology to conduct some traffic management techniques in this integration. Our results show that OpenNebula's deployment time as well as clean-up time is significantly lower than OpenStack, but OpenStack takes less time to the running state, besides proving the simplicity of traffic management in OpenNebula using OpenDaylight.
{"title":"OpenDaylight and OpenNebula integration: Testing traffic management","authors":"Omayma Belkadi, Alexandru Vulpe, Yassin Laaziz, S. Halunga","doi":"10.5937/TELFOR2002074B","DOIUrl":"https://doi.org/10.5937/TELFOR2002074B","url":null,"abstract":"Software-Defined Networking (SDN) and Cloud Computing are now two of the most adopted technologies, on which many organizations are working to enhance every day. For instance, SDN is particularly emerging to solve networking complexity in cloud data centers, so we see many attempts to integrate Network and Cloud Managers. In this paper, we address an integration of these two technologies, particularly a yet undiscussed combination of two popular frameworks: OpenNebula and OpenDaylight. These open source solutions are widely used for cloud management and network management, yet there are no developed modules for communication between the two. Therefore, we propose a simple way for OpenDaylight to manage OpenNebula's compute nodes, using a common component they both support: OpenvSwitch. We compared OpenNebula with the popular OpenStack cloud manager, as it is attracting more attention in both academia and industry, by evaluating some relevant time metrics and discussing the differences of the proposed technologies. Then, we deployed a test topology to conduct some traffic management techniques in this integration. Our results show that OpenNebula's deployment time as well as clean-up time is significantly lower than OpenStack, but OpenStack takes less time to the running state, besides proving the simplicity of traffic management in OpenNebula using OpenDaylight.","PeriodicalId":37719,"journal":{"name":"Telfor Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71140274","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}
In the December 2019 issue of the Telfor Journal, there is a technical error in the paper "System for Measuring Finger Force Profiles for Dexterity Assessment" by Milica M. Badža, Marija M. Novičić, Milica Đurić-Jovičić, Milica M. Janković, and Mirjana B. Popović [1]. Fig 7 [1], showing the sensitivity of the strain gage force sensor to the pressure point, is not presented as it should be. The correct versions of Fig. 7 is as follows: Fig. 7. The sensitivity of the strain gage force sensor to the pressure point. Finger position on the sensor is presented along the x-axis. We apologize for any confusion this may have caused.
在2019年12月的《Telfor杂志》上，Milica M. Badža、Marija M. novi iki、Milica Đurić-Jovičić、Milica M. jankoviki和Mirjana B. popoviki[1]发表的论文“测量手指力量曲线用于灵巧性评估的系统”中存在技术错误。图7[1]显示应变计力传感器对压力点的灵敏度，但没有按照应有的方式呈现。图7的正确版本如下:应变计力传感器对压力点的灵敏度。手指在传感器上的位置沿x轴显示。对于由此造成的任何混乱，我们深表歉意。
{"title":"Errata: System for measuring finger force profiles for dexterity assessment (2019, vol. 11, no. 2, pp. 108-113)","authors":"U. Uredništvo","doi":"10.5937/telfor2001073u","DOIUrl":"https://doi.org/10.5937/telfor2001073u","url":null,"abstract":"In the December 2019 issue of the Telfor Journal, there is a technical error in the paper \"System for Measuring Finger Force Profiles for Dexterity Assessment\" by Milica M. Badža, Marija M. Novičić, Milica Đurić-Jovičić, Milica M. Janković, and Mirjana B. Popović [1]. Fig 7 [1], showing the sensitivity of the strain gage force sensor to the pressure point, is not presented as it should be. The correct versions of Fig. 7 is as follows: Fig. 7. The sensitivity of the strain gage force sensor to the pressure point. Finger position on the sensor is presented along the x-axis. We apologize for any confusion this may have caused.","PeriodicalId":37719,"journal":{"name":"Telfor Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71140223","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}
In this paper an approach is presented, enabling to solve the problem of local navigation of mobile robotic platforms (MRP), based on utilization of wireless networks with mesh topology. Establishment of wireless networks was ensured, based on the set of radio modules, mounted on unmanned aerial vehicles (UAV), comprising a swarm. This paper presents a developed algorithm for establishment of such wireless networks, aided by LoRa-technology, as well as an algorithm for MRP localization, based on analysis of signal level, where the incoming signals are fed from MRP group radio modules to radio modules of wireless data transfer network. An algorithmic model is given for task distribution among UAV and to implement navigational capabilities of MRP swarm. In some experiments descending dependencies of absolute error value, pertinent to MRP, from the number of UAV in action were revealed, as well as of averaged deflection value of MRP positions in motion along their paths from the number of UAV in action. Thereby the averaged value of MRP localization error, depending on the number of UAV in action, was from 8.14 to 17.13 m, and the averaged value of MRP position deflection - from 16.38 to 57.12 m, respectively.
本文提出了一种利用网状拓扑的无线网络解决移动机器人平台局部导航问题的方法。无线网络的建立是基于一组无线电模块，安装在无人驾驶飞行器(UAV)上，由一个群组成。本文提出了一种基于lora技术的建立无线网络的算法，以及一种基于信号电平分析的MRP定位算法，该算法将进入的信号从MRP组无线电模块馈送到无线数据传输网的无线电模块。给出了无人机间任务分配和MRP群导航能力实现的算法模型。在一些实验中，揭示了与MRP相关的绝对误差值与在行动的无人机数量的递减关系，以及MRP位置沿其路径运动的平均偏转值与在行动的无人机数量的递减关系。由此得到MRP定位误差随无人机数量的平均值分别为8.14 ~ 17.13 m, MRP位置偏转平均值分别为16.38 ~ 57.12 m。
{"title":"Approach to implementation of local navigation of mobile robotic systems in agriculture with the aid of radio modules","authors":"R. Iakovlev, A. Saveliev","doi":"10.5937/TELFOR2002092I","DOIUrl":"https://doi.org/10.5937/TELFOR2002092I","url":null,"abstract":"In this paper an approach is presented, enabling to solve the problem of local navigation of mobile robotic platforms (MRP), based on utilization of wireless networks with mesh topology. Establishment of wireless networks was ensured, based on the set of radio modules, mounted on unmanned aerial vehicles (UAV), comprising a swarm. This paper presents a developed algorithm for establishment of such wireless networks, aided by LoRa-technology, as well as an algorithm for MRP localization, based on analysis of signal level, where the incoming signals are fed from MRP group radio modules to radio modules of wireless data transfer network. An algorithmic model is given for task distribution among UAV and to implement navigational capabilities of MRP swarm. In some experiments descending dependencies of absolute error value, pertinent to MRP, from the number of UAV in action were revealed, as well as of averaged deflection value of MRP positions in motion along their paths from the number of UAV in action. Thereby the averaged value of MRP localization error, depending on the number of UAV in action, was from 8.14 to 17.13 m, and the averaged value of MRP position deflection - from 16.38 to 57.12 m, respectively.","PeriodicalId":37719,"journal":{"name":"Telfor Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71140297","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}
In automatic speech recognition systems, the training data used for system development and the data actually obtained from the users of the system sometimes significantly differ in practice. However, other, more similar data may be available. Transfer learning can help to exploit such similar data for training in order to boost the automatic speech recognizer's performance for a certain domain. This paper presents a few applications of transfer learning in the context of speech recognition, specifically for the Serbian language. Several methods are proposed, with the goal of optimizing system performance on a specific part of the existing speech database for Serbian, or in a noisy environment. The experimental results evaluated on a test set from the desired domain show significant improvement in both word error rate and character error rate.
{"title":"Transfer learning for domain and environment adaptation in Serbian ASR","authors":"B. Popović, E. Pakoci, D. Pekar","doi":"10.5937/TELFOR2002110P","DOIUrl":"https://doi.org/10.5937/TELFOR2002110P","url":null,"abstract":"In automatic speech recognition systems, the training data used for system development and the data actually obtained from the users of the system sometimes significantly differ in practice. However, other, more similar data may be available. Transfer learning can help to exploit such similar data for training in order to boost the automatic speech recognizer's performance for a certain domain. This paper presents a few applications of transfer learning in the context of speech recognition, specifically for the Serbian language. Several methods are proposed, with the goal of optimizing system performance on a specific part of the existing speech database for Serbian, or in a noisy environment. The experimental results evaluated on a test set from the desired domain show significant improvement in both word error rate and character error rate.","PeriodicalId":37719,"journal":{"name":"Telfor Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71140506","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}
S. E. Benatia, O. Smail, Meftah Boudjelal, M. Rebbah, B. Cousin
Ad Hoc wireless mobile networks are characterized by a lack of central administration and the fact that any element of the network, being very mobile, is susceptible to disappear. In an Ad Hoc network, all the elements must cooperate in order to establish a temporary network to communicate. This communication is affected by the links stability mainly in a restricted environment such as a city and the depletion of the batteries energy of the nodes. These factors degrade the ad hoc networks performance. We propose in this paper a stable routing protocol with weak energy consumption for urban areas in order to improve these performances. The proposed solution is a multipath protocol named ESMRua (Efficient energy aware and Link Stable Multipath Routing Protocol in urban areas). ESMRua uses a path selection scheme based on energy constraint, signal quality and link stability. For the link stability, three calculation variants are used. ESMRua will be designed for realistic mobility, contrary to the main existing protocols which are designed to the random mobility models; these models have unrealistic behaviors such as a brusque acceleration and a sudden stop. Simulation results show that our multipath protocol enhances the performance of the ad hoc networks, mainly in terms of routing overhead, energy consumption and network reliability.
自组织无线移动网络的特点是缺乏中央管理，而且网络的任何元素都是非常移动的，很容易消失。在Ad Hoc网络中，为了建立一个临时网络进行通信，所有元素必须相互合作。这种通信主要受城市等受限环境下链路稳定性和节点电池电量耗尽的影响。这些因素降低了ad hoc网络的性能。为了提高这些性能，本文提出了一种稳定的、低能耗的城市路由协议。提出的解决方案是一种名为ESMRua (Efficient energy aware and Link Stable multipath Routing protocol in urban area)的多路径协议。ESMRua采用基于能量约束、信号质量和链路稳定性的选路方案。对于链路稳定性，使用了三种计算变量。与现有的主要协议不同，ESMRua将设计为实际的机动性，而不是设计为随机机动性模型;这些模型具有不现实的行为，例如突然加速和突然停止。仿真结果表明，多路径协议提高了ad hoc网络的性能，主要体现在路由开销、能耗和网络可靠性方面。
{"title":"An efficient energy aware link stable multipath routing protocol for mobile ad hoc networks in urban areas","authors":"S. E. Benatia, O. Smail, Meftah Boudjelal, M. Rebbah, B. Cousin","doi":"10.5937/telfor2001002e","DOIUrl":"https://doi.org/10.5937/telfor2001002e","url":null,"abstract":"Ad Hoc wireless mobile networks are characterized by a lack of central administration and the fact that any element of the network, being very mobile, is susceptible to disappear. In an Ad Hoc network, all the elements must cooperate in order to establish a temporary network to communicate. This communication is affected by the links stability mainly in a restricted environment such as a city and the depletion of the batteries energy of the nodes. These factors degrade the ad hoc networks performance. We propose in this paper a stable routing protocol with weak energy consumption for urban areas in order to improve these performances. The proposed solution is a multipath protocol named ESMRua (Efficient energy aware and Link Stable Multipath Routing Protocol in urban areas). ESMRua uses a path selection scheme based on energy constraint, signal quality and link stability. For the link stability, three calculation variants are used. ESMRua will be designed for realistic mobility, contrary to the main existing protocols which are designed to the random mobility models; these models have unrealistic behaviors such as a brusque acceleration and a sudden stop. Simulation results show that our multipath protocol enhances the performance of the ad hoc networks, mainly in terms of routing overhead, energy consumption and network reliability.","PeriodicalId":37719,"journal":{"name":"Telfor Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71140203","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：