Pub Date : 2021-01-19DOI: 10.24138/JCOMSS.V17I1.945
Abdelaziz Tami, Sofiane Boukli-Hacene, M. A. Cherif
Mobile ad-hoc network is a collection of dynamically organized nodes where each node acts as a host and router. Mobile ad-hoc networks are characterized by the lack of preexisting infrastructures or centralized administration. So, they are vulnerable to several types of attacks, especially the Blackhole attack. This attack is one of the most serious attacks in this kind of mobile networks. In this type of attack, the malicious node sends a false answer indicating that it has the shortest path to the destination node by increasing the sequence number and decreasing the number of hops. This will have a significant negative impact on source nodes which send their data packets through the malicious node to the destination. This malicious node drops received data packets and absorbs all network traffic. In order overcome this problem, securing routing protocols become a very important requirement in mobile ad-hoc networks. Multi-path routing protocols are among the protocols affected by the Blackhole attack. In this paper, we propose an effective and efficient technique that avoids misbehavior of Blackhole nodes and facilitates the discovery for the most reliable paths for the secure transmission of data packets between communicating nodes in the well known Ad hoc On-demand multi-path routing protocol (AOMDV). Our proposed technique is implemented and simulated using the well known ns 2.35 simulator. We also compared the performance of the three routing protocols AOMDV, AOMDV under Blackhole attack (BHAOMDV) and the proposed solution to counter the Blackhole attack (IDSAOMDV). The results show the degradation of performance of AOMDV under attack, it also present similarities between normal AOMDV and the proposed solution by isolating misbehaving node which has resulted in increase the performance metrics to the standard values of the AOMDV protocol.
{"title":"Detection and Prevention of Blackhole Attack in the AOMDV Routing Protocol","authors":"Abdelaziz Tami, Sofiane Boukli-Hacene, M. A. Cherif","doi":"10.24138/JCOMSS.V17I1.945","DOIUrl":"https://doi.org/10.24138/JCOMSS.V17I1.945","url":null,"abstract":"Mobile ad-hoc network is a collection of dynamically organized nodes where each node acts as a host and router. Mobile ad-hoc networks are characterized by the lack of preexisting infrastructures or centralized administration. So, they are vulnerable to several types of attacks, especially the Blackhole attack. This attack is one of the most serious attacks in this kind of mobile networks. In this type of attack, the malicious node sends a false answer indicating that it has the shortest path to the destination node by increasing the sequence number and decreasing the number of hops. This will have a significant negative impact on source nodes which send their data packets through the malicious node to the destination. This malicious node drops received data packets and absorbs all network traffic. In order overcome this problem, securing routing protocols become a very important requirement in mobile ad-hoc networks. Multi-path routing protocols are among the protocols affected by the Blackhole attack. In this paper, we propose an effective and efficient technique that avoids misbehavior of Blackhole nodes and facilitates the discovery for the most reliable paths for the secure transmission of data packets between communicating nodes in the well known Ad hoc On-demand multi-path routing protocol (AOMDV). Our proposed technique is implemented and simulated using the well known ns 2.35 simulator. We also compared the performance of the three routing protocols AOMDV, AOMDV under Blackhole attack (BHAOMDV) and the proposed solution to counter the Blackhole attack (IDSAOMDV). The results show the degradation of performance of AOMDV under attack, it also present similarities between normal AOMDV and the proposed solution by isolating misbehaving node which has resulted in increase the performance metrics to the standard values of the AOMDV protocol.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"17 1","pages":"1-12"},"PeriodicalIF":0.7,"publicationDate":"2021-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41391492","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-01-01DOI: 10.24138/JCOMSS-2021-0071
A. Sciarrone, I. Bisio, Chiara Garibotto, F. Lavagetto, Mehrnaz Hamedani, V. Prada, A. Schenone, Federico Boero, Gianluca Gambari, M. Cereia, Michele Jurilli
The Internet of Things (IoT) framework is moving the research community to provide smart systems and solutions aimed at revolutionizing medical sciences and healthcare. Given the extreme diffusion of Alzheimer’s disease (AD) and Parkinson’s disease (PD), the demand for a solution to early detect neurological symptoms of such diseases strongly arose. According to the medical literature, such early detection can be obtained through the correlation between PD and AD and some external symptoms: the Essential Tremor (ET) and the number of Eye Blinks (EBs). In this paper, which can be considered as an extended version of [1], we present a prototype of wearable smart glasses able to detect the presence of ET of the head and to count the number of EBs at the same time, in a transparent way with respect to the final user. Numerical results demonstrate the reliability of the proposed approach: the proposed algorithms are able to i) correctly recognize the ET with an overall accuracy above 97% and ii) count the number of EBs with an overall error around 9%.
{"title":"Early Detection of External Neurological Symptoms through a Wearable Smart-Glasses Prototype","authors":"A. Sciarrone, I. Bisio, Chiara Garibotto, F. Lavagetto, Mehrnaz Hamedani, V. Prada, A. Schenone, Federico Boero, Gianluca Gambari, M. Cereia, Michele Jurilli","doi":"10.24138/JCOMSS-2021-0071","DOIUrl":"https://doi.org/10.24138/JCOMSS-2021-0071","url":null,"abstract":"The Internet of Things (IoT) framework is moving the research community to provide smart systems and solutions aimed at revolutionizing medical sciences and healthcare. Given the extreme diffusion of Alzheimer’s disease (AD) and Parkinson’s disease (PD), the demand for a solution to early detect neurological symptoms of such diseases strongly arose. According to the medical literature, such early detection can be obtained through the correlation between PD and AD and some external symptoms: the Essential Tremor (ET) and the number of Eye Blinks (EBs). In this paper, which can be considered as an extended version of [1], we present a prototype of wearable smart glasses able to detect the presence of ET of the head and to count the number of EBs at the same time, in a transparent way with respect to the final user. Numerical results demonstrate the reliability of the proposed approach: the proposed algorithms are able to i) correctly recognize the ET with an overall accuracy above 97% and ii) count the number of EBs with an overall error around 9%.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098444","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-01-01DOI: 10.24138/JCOMSS-2020-0008
M. Comisso, F. Vatta, G. Buttazzoni, F. Babich
—This paper proposes a mathematical framework for evaluating the limiting capacity of a millimeter-wave (mmWave) communication involving a mobile user (MU) and a cellular base station. The investigation is realized considering a three-dimensional (3D) space in which the random waypoint mobility model is used to probabilistically identify the location of the MUs. Besides, the analysis is developed accounting for path-loss atten- uation, directional antenna gains, shadowing, and modulation scheme. Closed-form formulas for the received signal power, the Shannon capacity, and the bit error rate (BER) are obtained for both line-of-sight (LoS) and non-LoS scenarios in the presence of a noise-limited operating regime. The conceived theoretical model is firstly checked by Monte Carlo validations, and then employed to explore the influence of the antenna gain and of the cell radius on the capacity and on the BER of a fifth-generation (5G) link in a 3D environment, taking into account both the 28 and 73 GHz mmWave bands.
{"title":"Limiting Performance of Millimeter-Wave Communications in the Presence of a 3D Random Waypoint Mobility Model","authors":"M. Comisso, F. Vatta, G. Buttazzoni, F. Babich","doi":"10.24138/JCOMSS-2020-0008","DOIUrl":"https://doi.org/10.24138/JCOMSS-2020-0008","url":null,"abstract":"—This paper proposes a mathematical framework for evaluating the limiting capacity of a millimeter-wave (mmWave) communication involving a mobile user (MU) and a cellular base station. The investigation is realized considering a three-dimensional (3D) space in which the random waypoint mobility model is used to probabilistically identify the location of the MUs. Besides, the analysis is developed accounting for path-loss atten- uation, directional antenna gains, shadowing, and modulation scheme. Closed-form formulas for the received signal power, the Shannon capacity, and the bit error rate (BER) are obtained for both line-of-sight (LoS) and non-LoS scenarios in the presence of a noise-limited operating regime. The conceived theoretical model is firstly checked by Monte Carlo validations, and then employed to explore the influence of the antenna gain and of the cell radius on the capacity and on the BER of a fifth-generation (5G) link in a 3D environment, taking into account both the 28 and 73 GHz mmWave bands.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"14 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098600","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-01-01DOI: 10.24138/JCOMSS-2020-0011
Peter Szabó, B. Genge
—In 2020 we have witnessed the dawn of machine learning enabled user experience. Now we can predict how users will use an application. Research progressed beyond recommendations, and we are ready to predict user events. Whenever a human interacts with a system, user events are dispatched. They can be as simple as a mouse click on a menu item or more complex, such as buying a product from an eCommerce site. Collaborative filtering (CF) has proven to be an excellent approach to predict events. Because each user can generate many events, this inevitably leads to a vast number of events in a dataset. Unfortunately, the operation time of CF increases exponentially with the increase of data-points. This paper presents a generalized approach to reduce the dataset’s size without compromising prediction accuracy. Our solution transformed a dataset containing over 20 million user events (20,692,840 rows) into a sparse matrix in about 7 minutes (434.08 s). We have used this matrix to train a neural network to accurately predict user events.
{"title":"Efficient Behavior Prediction Based on User Events","authors":"Peter Szabó, B. Genge","doi":"10.24138/JCOMSS-2020-0011","DOIUrl":"https://doi.org/10.24138/JCOMSS-2020-0011","url":null,"abstract":"—In 2020 we have witnessed the dawn of machine learning enabled user experience. Now we can predict how users will use an application. Research progressed beyond recommendations, and we are ready to predict user events. Whenever a human interacts with a system, user events are dispatched. They can be as simple as a mouse click on a menu item or more complex, such as buying a product from an eCommerce site. Collaborative filtering (CF) has proven to be an excellent approach to predict events. Because each user can generate many events, this inevitably leads to a vast number of events in a dataset. Unfortunately, the operation time of CF increases exponentially with the increase of data-points. This paper presents a generalized approach to reduce the dataset’s size without compromising prediction accuracy. Our solution transformed a dataset containing over 20 million user events (20,692,840 rows) into a sparse matrix in about 7 minutes (434.08 s). We have used this matrix to train a neural network to accurately predict user events.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098617","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-01-01DOI: 10.24138/JCOMSS-2021-0008
S. Selmi, Ridha Boullègue
— Although coverage and capacity are the key elements of the 5G user experience, a dominant part of the population living in rural areas still experience inferior connectivity. Several solutions have been proposed to address this issue. They include deploying small cells, increasing the number of sectors per eNodeB, and reusing signal repetition. However, most of them require complex deployment and expensive fees. Accordingly, many efforts have been deployed on coverage extension software. Even so, many critical issues related to public safety, relay capacity, and devices power constraints are still challenging. As a contribution, we propose in this paper a spectral and energy-efficient two-hop device to device (D2D) relay selection algorithm. Our main goal is to extend the connectivity to the out-of-coverage (OOC) devices. Contrarily to previous solutions in which the relay is selected centrally or individually, we propose a distributed two-stage algorithm based on the Stackelberg game to involve all the competing devices. In the first stage, the OOC devices (OCDUs) are matched with the relays maximizing their spectral efficiency, and the required bandwidth for each one is determined. Then, a power control stage is investigated to calculate the optimal transmission power. The numerical and simulation analysis shows that the proposed schema outperforms the former solutions in total system capacity, spectral efficiency (SE), and energy efficiency (EE) while reducing the complexity.
{"title":"Energy Efficient Two-hop D2D Communications Underlay 5G Networks: A Stackelberg Game Approach","authors":"S. Selmi, Ridha Boullègue","doi":"10.24138/JCOMSS-2021-0008","DOIUrl":"https://doi.org/10.24138/JCOMSS-2021-0008","url":null,"abstract":"— Although coverage and capacity are the key elements of the 5G user experience, a dominant part of the population living in rural areas still experience inferior connectivity. Several solutions have been proposed to address this issue. They include deploying small cells, increasing the number of sectors per eNodeB, and reusing signal repetition. However, most of them require complex deployment and expensive fees. Accordingly, many efforts have been deployed on coverage extension software. Even so, many critical issues related to public safety, relay capacity, and devices power constraints are still challenging. As a contribution, we propose in this paper a spectral and energy-efficient two-hop device to device (D2D) relay selection algorithm. Our main goal is to extend the connectivity to the out-of-coverage (OOC) devices. Contrarily to previous solutions in which the relay is selected centrally or individually, we propose a distributed two-stage algorithm based on the Stackelberg game to involve all the competing devices. In the first stage, the OOC devices (OCDUs) are matched with the relays maximizing their spectral efficiency, and the required bandwidth for each one is determined. Then, a power control stage is investigated to calculate the optimal transmission power. The numerical and simulation analysis shows that the proposed schema outperforms the former solutions in total system capacity, spectral efficiency (SE), and energy efficiency (EE) while reducing the complexity.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098742","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-01-01DOI: 10.24138/jcomss-2021-0013
D. Krstić, P. Nikolic, Z. Popovic, Sinisa Minic, M. Stefanovic
—Lately, the investigation of multi-hop relays is increased in both, academia and engineering practice. Multi-hop relay is introduced to enable data transmission between base station and mobile user dividing great distance into two or more segments to improve link quality. This improvement is specially expressed in environments under deep fading and shadow, where coverage is significantly increased using multi-hop relays. Here, wireless three-hop relay environment with line-of-sight was observed. Output signal from such system is defined as a product of three arbitrary, independent, but not necessarily identically distributed Rician random variables (RVs). For such system, some important performance of the first and second order were analyzed and graphically presented. The impact of Rician factor and signal powers on performance quantities was shown. Derived and displayed first order performance are: probability density function (PDF), cumulative distribution function (CDF), outage probability (Pout), moments, amount of fading (AoF) and channel capacity. Then, the following second order characteristics of wireless three-hop relay communication system working in Rician multipath fading environment were covered: level crossing rate (LCR) and average fade duration (AFD). These results have big application in wireless relay communications with a pronounced line-of-sight, where Rician model is used to describe fading.
{"title":"Wireless Three-hop Relay Environment with Line-of-Sight: Investigation and Performance Analysis","authors":"D. Krstić, P. Nikolic, Z. Popovic, Sinisa Minic, M. Stefanovic","doi":"10.24138/jcomss-2021-0013","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0013","url":null,"abstract":"—Lately, the investigation of multi-hop relays is increased in both, academia and engineering practice. Multi-hop relay is introduced to enable data transmission between base station and mobile user dividing great distance into two or more segments to improve link quality. This improvement is specially expressed in environments under deep fading and shadow, where coverage is significantly increased using multi-hop relays. Here, wireless three-hop relay environment with line-of-sight was observed. Output signal from such system is defined as a product of three arbitrary, independent, but not necessarily identically distributed Rician random variables (RVs). For such system, some important performance of the first and second order were analyzed and graphically presented. The impact of Rician factor and signal powers on performance quantities was shown. Derived and displayed first order performance are: probability density function (PDF), cumulative distribution function (CDF), outage probability (Pout), moments, amount of fading (AoF) and channel capacity. Then, the following second order characteristics of wireless three-hop relay communication system working in Rician multipath fading environment were covered: level crossing rate (LCR) and average fade duration (AFD). These results have big application in wireless relay communications with a pronounced line-of-sight, where Rician model is used to describe fading.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098748","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-01-01DOI: 10.24138/jcomss-2021-0049
Moualla Alaa, AlDakkak Oumayma, AlJnidi Mohamad
Unmanned Aerial Vehicle ad hoc networks (UAANETs) are originally designed to work in a cooperative environment. These networks are vulnerable to a wide range of attacks due to the lack of predefined infrastructure and the dynamic topology. Security in ad hoc networks, in general, is handled through authentication and encryption. This can be considered as a heavy way to protect the network due to the lack of resources in the nodes. However, trust can be introduced to address a light weight solution for some security issues. In this paper, we focus on the concept of decentralized trust to design an efficient and trustful routing protocol, and ensure stable routes between nodes in spite of the rapidly changing topology, and to provide a mechanism for detecting malicious incorrect packet forwarding attacks. The proposed light-weight trust-quality routing protocol (TQAODV) provides two main functionalities: monitoring the behavior of the neighboring nodes and computing the trust value based on the historical information in the network. Moreover, the new proposed model reduces routing overhead and route discovery frequency. The simulations we used in NS-2 show that the proposed routing scheme gives better performance against attacks compared to the traditional Ad-hoc On-demand Distance Vector (AODV), and improves the packets delivery ratio with about 15%, routing packets overhead and average delay with about 20%, compared to trust AODV.
{"title":"Towards Trust Model in Unmanned Aerial Vehicle Ad Hoc Networks","authors":"Moualla Alaa, AlDakkak Oumayma, AlJnidi Mohamad","doi":"10.24138/jcomss-2021-0049","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0049","url":null,"abstract":"Unmanned Aerial Vehicle ad hoc networks (UAANETs) are originally designed to work in a cooperative environment. These networks are vulnerable to a wide range of attacks due to the lack of predefined infrastructure and the dynamic topology. Security in ad hoc networks, in general, is handled through authentication and encryption. This can be considered as a heavy way to protect the network due to the lack of resources in the nodes. However, trust can be introduced to address a light weight solution for some security issues. In this paper, we focus on the concept of decentralized trust to design an efficient and trustful routing protocol, and ensure stable routes between nodes in spite of the rapidly changing topology, and to provide a mechanism for detecting malicious incorrect packet forwarding attacks. The proposed light-weight trust-quality routing protocol (TQAODV) provides two main functionalities: monitoring the behavior of the neighboring nodes and computing the trust value based on the historical information in the network. Moreover, the new proposed model reduces routing overhead and route discovery frequency. The simulations we used in NS-2 show that the proposed routing scheme gives better performance against attacks compared to the traditional Ad-hoc On-demand Distance Vector (AODV), and improves the packets delivery ratio with about 15%, routing packets overhead and average delay with about 20%, compared to trust AODV.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098428","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-01-01DOI: 10.24138/JCOMSS-2020-0009
F. Vatta, A. Soranzo, M. Comisso, G. Buttazzoni, F. Babich
—This paper investigates the performance of a class of irregular low-density parity-check (LDPC) codes through a recently published low complexity upper bound on their belief- propagation decoding thresholds. Moreover, their performance analysis is carried out through a recently published algorithmic method, presented in Babich et al. 2017 paper. In particular, the class considered is characterized by variable node degree distributions λ ( x ) of minimum degree i 1 > 2 : being, in this case, λ (cid:48) (0) = λ 2 = 0 , this is useful to design LDPC codes presenting a linear minimum distance growth with the block length with probability 1, as shown in Di et al.’s 2006 paper. These codes unfortunately cannot reach capacity under iterative decoding, since the achievement of capacity requires λ 2 (cid:54) = 0 . However, in this latter case, the block error probability might converge to a constant, as shown in the aforementioned paper.
{"title":"Performance Study of a Class of Irregular Near Capacity Achieving LDPC Codes","authors":"F. Vatta, A. Soranzo, M. Comisso, G. Buttazzoni, F. Babich","doi":"10.24138/JCOMSS-2020-0009","DOIUrl":"https://doi.org/10.24138/JCOMSS-2020-0009","url":null,"abstract":"—This paper investigates the performance of a class of irregular low-density parity-check (LDPC) codes through a recently published low complexity upper bound on their belief- propagation decoding thresholds. Moreover, their performance analysis is carried out through a recently published algorithmic method, presented in Babich et al. 2017 paper. In particular, the class considered is characterized by variable node degree distributions λ ( x ) of minimum degree i 1 > 2 : being, in this case, λ (cid:48) (0) = λ 2 = 0 , this is useful to design LDPC codes presenting a linear minimum distance growth with the block length with probability 1, as shown in Di et al.’s 2006 paper. These codes unfortunately cannot reach capacity under iterative decoding, since the achievement of capacity requires λ 2 (cid:54) = 0 . However, in this latter case, the block error probability might converge to a constant, as shown in the aforementioned paper.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"45 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098606","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-01-01DOI: 10.24138/jcomss-2021-0179
Joel E. Cordeiro Jr, M. Alencar, M. Yashina, A. Tatashev
{"title":"Effect of Epidemic Interference on the Performance of M-ASK, M-PSK and M-QAM Modulation Schemes","authors":"Joel E. Cordeiro Jr, M. Alencar, M. Yashina, A. Tatashev","doi":"10.24138/jcomss-2021-0179","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0179","url":null,"abstract":"","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098899","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-01-01DOI: 10.24138/jcomss-2021-0068
Fatima-Zohra Benhamida, Ouahiba Kaddouri, Tahar Ouhrouche, Mohammed Benaichouche, D. Casado-Mansilla, D. López-de-Ipiña
—With the availability of data and the increasing capabilities of data processing tools, many businesses are leveraging historical sales and demand data to implement smart inventory management systems. Demand forecasting is the process of estimating the consumption of products or services for future time periods. It plays an important role in the field of inventory control and Supply Chain, since it enables production and supply planning and therefore can reduce delivery times and optimize Supply Chain decisions. This paper presents an extensive literature review about demand forecasting methods for time-series data. Based on analysis results and findings, a new demand forecasting tool for inventory control is proposed. First, a forecasting pipeline is designed to allow selecting the most accurate demand forecasting method. The validation of the proposed solution is executed on Stock&Buy case study, a growing online retail platform. For this reason, two new methods are proposed: (1) a hybrid method, Comb-TSB, is proposed for intermittent and lumpy demand patterns. CombTSB automatically selects the most accurate model among a set of methods. (2) a clustering-based approach (ClustAvg) is proposed to forecast demand for new products which have very few or no sales history data. The evaluation process showed that the proposed tool achieves good forecasting accuracy by making the most appropriate choice while defining the forecasting method to apply for each product selection.
{"title":"Demand Forecasting Tool For Inventory Control Smart Systems","authors":"Fatima-Zohra Benhamida, Ouahiba Kaddouri, Tahar Ouhrouche, Mohammed Benaichouche, D. Casado-Mansilla, D. López-de-Ipiña","doi":"10.24138/jcomss-2021-0068","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0068","url":null,"abstract":"—With the availability of data and the increasing capabilities of data processing tools, many businesses are leveraging historical sales and demand data to implement smart inventory management systems. Demand forecasting is the process of estimating the consumption of products or services for future time periods. It plays an important role in the field of inventory control and Supply Chain, since it enables production and supply planning and therefore can reduce delivery times and optimize Supply Chain decisions. This paper presents an extensive literature review about demand forecasting methods for time-series data. Based on analysis results and findings, a new demand forecasting tool for inventory control is proposed. First, a forecasting pipeline is designed to allow selecting the most accurate demand forecasting method. The validation of the proposed solution is executed on Stock&Buy case study, a growing online retail platform. For this reason, two new methods are proposed: (1) a hybrid method, Comb-TSB, is proposed for intermittent and lumpy demand patterns. CombTSB automatically selects the most accurate model among a set of methods. (2) a clustering-based approach (ClustAvg) is proposed to forecast demand for new products which have very few or no sales history data. The evaluation process showed that the proposed tool achieves good forecasting accuracy by making the most appropriate choice while defining the forecasting method to apply for each product selection.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"11 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098436","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
扫码关注我们
求助内容：
应助结果提醒方式：