Pub Date : 2020-11-03DOI: 10.24138/jcomss.v16i4.994
Said Lakhal, Z. Guennoun
In a cognitive radio network (CRN), the primary users (PUs) do not operate their spectra, full time. Thus, they can sell them to the secondary users (SUs), for a second use, during the free time slots. In this article, we assume that the market is perfect, monopolized by a single PU, and all players are rational. After formulating the PU’s profit, we established a necessary and sufficient condition that guarantees the introduction of the PU into the market. In addition, the expressions of the SUs’ profits, showed us that in non-cooperative form, some ones got zero profit, even after maximizing their profits. Therefore, we have considered to study the effect of cooperation on the profits of this category of SUs. By following this step, we established a cooperation strategy, to avoid zero profits for all SUs. In order to analyze the impact of this cooperation on the PU, we have expressed the profits of the PU in the cooperative and non-cooperative forms; as result, we found that the cooperation between SUs brought better than the non-cooperative form.
{"title":"Monopoly-Market-based Cooperation in Cognitive Radio Networks","authors":"Said Lakhal, Z. Guennoun","doi":"10.24138/jcomss.v16i4.994","DOIUrl":"https://doi.org/10.24138/jcomss.v16i4.994","url":null,"abstract":"In a cognitive radio network (CRN), the primary users (PUs) do not operate their spectra, full time. Thus, they can sell them to the secondary users (SUs), for a second use, during the free time slots. In this article, we assume that the market is perfect, monopolized by a single PU, and all players are rational. After formulating the PU’s profit, we established a necessary and sufficient condition that guarantees the introduction of the PU into the market. In addition, the expressions of the SUs’ profits, showed us that in non-cooperative form, some ones got zero profit, even after maximizing their profits. Therefore, we have considered to study the effect of cooperation on the profits of this category of SUs. By following this step, we established a cooperation strategy, to avoid zero profits for all SUs. In order to analyze the impact of this cooperation on the PU, we have expressed the profits of the PU in the cooperative and non-cooperative forms; as result, we found that the cooperation between SUs brought better than the non-cooperative form.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41986819","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 : 2020-10-23DOI: 10.24138/jcomss.v16i4.935
F. Z. Ennaji, A. E. Fazziki, H. E. A. E. Abdallaoui, H. E. Kabtane
As social networking has spread, people started sharing their personal opinions and thoughts widely via these online platforms. The resulting vast valuable data represent a rich source for companies to deduct their products’ reputation from both social media and crowds’ judgments. To exploit this wealth of data, a framework was proposed to collect opinions and rating scores respectively from social media and crowdsourcing platform to perform sentiment analysis, provide insights about a product and give consumers’ tendencies. During the analysis process, a consumer category (strict) is excluded from the process of reaching a majority consensus. To overcome this, a fuzzy clustering is used to compute consumers’ credibility. The key novelty of our approach is the new layer of validity check using a crowdsourcing component that ensures that the results obtained from social media are supported by opinions extracted directly from real-life consumers. Finally, experiments are carried out to validate this model (Twitter and Facebook were used as data sources). The obtained results show that this approach is more efficient and accurate than existing solutions thanks to our two-layer validity check design.
{"title":"A Crowdsourcing Based Framework for Sentiment Analysis","authors":"F. Z. Ennaji, A. E. Fazziki, H. E. A. E. Abdallaoui, H. E. Kabtane","doi":"10.24138/jcomss.v16i4.935","DOIUrl":"https://doi.org/10.24138/jcomss.v16i4.935","url":null,"abstract":"As social networking has spread, people started sharing their personal opinions and thoughts widely via these online platforms. The resulting vast valuable data represent a rich source for companies to deduct their products’ reputation from both social media and crowds’ judgments. To exploit this wealth of data, a framework was proposed to collect opinions and rating scores respectively from social media and crowdsourcing platform to perform sentiment analysis, provide insights about a product and give consumers’ tendencies. During the analysis process, a consumer category (strict) is excluded from the process of reaching a majority consensus. To overcome this, a fuzzy clustering is used to compute consumers’ credibility. The key novelty of our approach is the new layer of validity check using a crowdsourcing component that ensures that the results obtained from social media are supported by opinions extracted directly from real-life consumers. Finally, experiments are carried out to validate this model (Twitter and Facebook were used as data sources). The obtained results show that this approach is more efficient and accurate than existing solutions thanks to our two-layer validity check design.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"16 1","pages":"285-295"},"PeriodicalIF":0.7,"publicationDate":"2020-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46174222","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 : 2020-10-08DOI: 10.24138/jcomss.v16i4.1097
Anas Mahmoud Almanofi, A. Malki, Ali Kazem
In this paper, we estimate Doppler frequency of a maneuvering target being tracked by passive radar using two types of particle filter, the first is “Maximum Likelihood Particle Filter” (MLPF) and the second is “Minimum Variance Particle filter” (MVPF). By simulating the passive radar system that has the bistatic geometry “Digital Video Broadcasting-Terrestrial (DVB-T) transmitter / receiver” with these two types, we can estimate the Doppler frequency of the maneuvering target and compare the simulation results for deciding which type gives better performance.
{"title":"Doppler Frequency Estimation for a Maneuvering Target Being Tracked by Passive Radar Using Particle Filter","authors":"Anas Mahmoud Almanofi, A. Malki, Ali Kazem","doi":"10.24138/jcomss.v16i4.1097","DOIUrl":"https://doi.org/10.24138/jcomss.v16i4.1097","url":null,"abstract":"In this paper, we estimate Doppler frequency of a maneuvering target being tracked by passive radar using two types of particle filter, the first is “Maximum Likelihood Particle Filter” (MLPF) and the second is “Minimum Variance Particle filter” (MVPF). By simulating the passive radar system that has the bistatic geometry “Digital Video Broadcasting-Terrestrial (DVB-T) transmitter / receiver” with these two types, we can estimate the Doppler frequency of the maneuvering target and compare the simulation results for deciding which type gives better performance.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"16 1","pages":"279-284"},"PeriodicalIF":0.7,"publicationDate":"2020-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48395548","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 : 2020-10-08DOI: 10.24138/jcomss.v16i4.1041
Roman Novak
In telecommunication channel modelling the wavelength is small compared to the physical features of interest, therefore deterministic ray tracing techniques provide solutions that are more efficient, faster and still within time constraints than current numerical full-wave techniques. Solving fundamental Maxwell's equations is at the core of computational electrodynamics and best suited for modelling electrical field interactions with physical objects where characteristic dimensions of a computing domain is on the order of a few wavelengths in size. However, extreme communication speeds, wireless access points closer to the user and smaller pico and femto cells will require increased accuracy in predicting and planning wireless signals, testing the accuracy limits of the ray tracing methods. The increased computing capabilities and the demand for better characterization of communication channels that span smaller geographical areas make numerical full-wave techniques attractive alternative even for larger problems. The paper surveys ways of overcoming excessive time requirements of numerical full-wave techniques while providing acceptable channel modelling accuracy for the smallest radio cells and possibly wider. We identify several research paths that could lead to improved channel modelling, including numerical algorithm adaptations for large-scale problems, alternative finite-difference approaches, such as meshless methods, and dedicated parallel hardware, possibly as a realization of a dataflow machine.
{"title":"Viability of Numerical Full-Wave Techniques in Telecommunication Channel Modelling","authors":"Roman Novak","doi":"10.24138/jcomss.v16i4.1041","DOIUrl":"https://doi.org/10.24138/jcomss.v16i4.1041","url":null,"abstract":"In telecommunication channel modelling the wavelength is small compared to the physical features of interest, therefore deterministic ray tracing techniques provide solutions that are more efficient, faster and still within time constraints than current numerical full-wave techniques. Solving fundamental Maxwell's equations is at the core of computational electrodynamics and best suited for modelling electrical field interactions with physical objects where characteristic dimensions of a computing domain is on the order of a few wavelengths in size. However, extreme communication speeds, wireless access points closer to the user and smaller pico and femto cells will require increased accuracy in predicting and planning wireless signals, testing the accuracy limits of the ray tracing methods. The increased computing capabilities and the demand for better characterization of communication channels that span smaller geographical areas make numerical full-wave techniques attractive alternative even for larger problems. The paper surveys ways of overcoming excessive time requirements of numerical full-wave techniques while providing acceptable channel modelling accuracy for the smallest radio cells and possibly wider. We identify several research paths that could lead to improved channel modelling, including numerical algorithm adaptations for large-scale problems, alternative finite-difference approaches, such as meshless methods, and dedicated parallel hardware, possibly as a realization of a dataflow machine.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"16 1","pages":"269-278"},"PeriodicalIF":0.7,"publicationDate":"2020-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42455579","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 : 2020-09-08DOI: 10.24138/jcomss.v16i3.1031
Shahad A. Sultan, M. F. Ghanim
A biometric authentication system provides an automatic person authentication based on some characteristic features possessed by the individual. Among all other biometrics, human retina is a secure and reliable source of person recognition as it is unique, universal, lies at the back of the eyeball and hence it is unforgeable. The process of authentication mainly includes pre-processing, feature extraction and then features matching and classification. Also authentication systems are mainly appointed in verification and identification mode according to the specific application. In this paper, preprocessing and image enhancement stages involve several steps to highlight interesting features in retinal images. The feature extraction stage is accomplished using a bank of Gabor filter with number of orientations and scales. Generalized Discriminant Analysis (GDA) technique has been used to reduce the size of feature vectors and enhance the performance of proposed algorithm. Finally, classification is accomplished using k-nearest neighbor (KNN) classifier to determine the identity of the genuine user or reject the forged one as the proposed method operates in identification mode. The main contribution in this paper is using Generalized Discriminant Analysis (GDA) technique to address ‘curse of dimensionality’ problem. GDA is a novel method used in the area of retina recognition.
{"title":"Human Retina Based Identification System Using Gabor Filters and GDA Technique","authors":"Shahad A. Sultan, M. F. Ghanim","doi":"10.24138/jcomss.v16i3.1031","DOIUrl":"https://doi.org/10.24138/jcomss.v16i3.1031","url":null,"abstract":"A biometric authentication system provides an\u0000automatic person authentication based on some characteristic\u0000features possessed by the individual. Among all other biometrics,\u0000human retina is a secure and reliable source of person\u0000recognition as it is unique, universal, lies at the back of the eyeball and hence it is unforgeable. The process of authentication\u0000mainly includes pre-processing, feature extraction and then\u0000features matching and classification. Also authentication systems\u0000are mainly appointed in verification and identification mode\u0000according to the specific application. In this paper, preprocessing and image enhancement stages involve several steps to\u0000highlight interesting features in retinal images. The feature\u0000extraction stage is accomplished using a bank of Gabor filter with\u0000number of orientations and scales. Generalized Discriminant\u0000Analysis (GDA) technique has been used to reduce the size of\u0000feature vectors and enhance the performance of proposed\u0000algorithm. Finally, classification is accomplished using k-nearest\u0000neighbor (KNN) classifier to determine the identity of the genuine\u0000user or reject the forged one as the proposed method operates in\u0000identification mode. The main contribution in this paper is using\u0000Generalized Discriminant Analysis (GDA) technique to address\u0000‘curse of dimensionality’ problem. GDA is a novel method used\u0000in the area of retina recognition.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":" ","pages":""},"PeriodicalIF":0.7,"publicationDate":"2020-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48350226","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 : 2020-07-28DOI: 10.24138/jcomss.v16i3.1039
E. Zanaj, Deivis Disha, S. Spinsante, E. Gambi
The fall problem affects approximately one third of people aged over 65 years. Falls and fall-related injuries are one of the major causes of morbidity and mortality in the elderly population. Since many years, research activities have been targeted towards the development of technological solutions for the automatic detection and notification of falls. Among them, wearable based systems offer the advantage of being available ideally everywhere and cost-effective in terms of economy and computational burden. However, their use poses different challenges, from acceptability to battery usage. The choice of the communication technology, in particular, plays a fundamental role in the realization of a suitable solution, able to meet the target users’ needs. In this paper, we present a fall detection system, based on a pair of instrumented shoes. They communicate the alarming events to a supervising system through the LoRa LPWAN technology, without the need of a portable gateway. Experimental results demonstrate the effectiveness of the chosen communication technology and fall detection reliability.
{"title":"A Wearable Fall Detection System based on LoRa LPWAN Technology","authors":"E. Zanaj, Deivis Disha, S. Spinsante, E. Gambi","doi":"10.24138/jcomss.v16i3.1039","DOIUrl":"https://doi.org/10.24138/jcomss.v16i3.1039","url":null,"abstract":"The fall problem affects approximately one third of people aged over 65 years. Falls and fall-related injuries are one of the major causes of morbidity and mortality in the elderly population. Since many years, research activities have been targeted towards the development of technological solutions for the automatic detection and notification of falls. Among them, wearable based systems offer the advantage of being available ideally everywhere and cost-effective in terms of economy and computational burden. However, their use poses different challenges, from acceptability to battery usage. The choice of the communication technology, in particular, plays a fundamental role in the realization of a suitable solution, able to meet the target users’ needs. In this paper, we present a fall detection system, based on a pair of instrumented shoes. They communicate the alarming events to a supervising system through the LoRa LPWAN technology, without the need of a portable gateway. Experimental results demonstrate the effectiveness of the chosen communication technology and fall detection reliability.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"16 1","pages":"232-242"},"PeriodicalIF":0.7,"publicationDate":"2020-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42877777","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 : 2020-07-22DOI: 10.24138/jcomss.v16i3.975
Y. R. Hamdy, A. I. Alghannam
ZigBee is widely used in wireless network in Internet of Things (IoT) applications to remotely sensing and automation due to its unique characteristics compared to other wireless networks. According to ZigBee classification of IEEE 802.15.4 standard, the network consists of four layers. The ZigBee topology is represented in second layer. Furthermore, the ZigBee topology consists of three topologies, star, tree and mesh. Also there are many transmission bands allowed in physical layer, such as 2.4 GHz, 915 MHz, 868 MHz. The aim of this paper is to evaluate the effect of ZigBee topologies on End to End delay and throughput for different transmission bands. Riverbed Modeler is used to simulate multiple ZigBee proposed scenarios and collect the results. The results of the study recommend which topology should be used at each transmission band to provide lowest End to End delay or obtain maximum throughput, which is case sensitive in some IoT applications that required for example minimum delay time or sending high amount of data.
{"title":"Evaluation of ZigBee Topology Effect on Throughput and End to End Delay Due to Different Transmission Bands for IoT Applications","authors":"Y. R. Hamdy, A. I. Alghannam","doi":"10.24138/jcomss.v16i3.975","DOIUrl":"https://doi.org/10.24138/jcomss.v16i3.975","url":null,"abstract":"ZigBee is widely used in wireless network in\u0000Internet of Things (IoT) applications to remotely sensing and\u0000automation due to its unique characteristics compared to other\u0000wireless networks. According to ZigBee classification of IEEE\u0000802.15.4 standard, the network consists of four layers. The\u0000ZigBee topology is represented in second layer. Furthermore, the\u0000ZigBee topology consists of three topologies, star, tree and mesh.\u0000Also there are many transmission bands allowed in physical\u0000layer, such as 2.4 GHz, 915 MHz, 868 MHz. The aim of this paper\u0000is to evaluate the effect of ZigBee topologies on End to End delay\u0000and throughput for different transmission bands. Riverbed\u0000Modeler is used to simulate multiple ZigBee proposed scenarios\u0000and collect the results. The results of the study recommend which\u0000topology should be used at each transmission band to provide\u0000lowest End to End delay or obtain maximum throughput, which\u0000is case sensitive in some IoT applications that required for\u0000example minimum delay time or sending high amount of data.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":" ","pages":""},"PeriodicalIF":0.7,"publicationDate":"2020-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47127014","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 : 2020-07-20DOI: 10.24138/jcomss.v16i3.964
S. Chhabra, Ashutosh Kumar Singh
Securing the data in distributed cloud system is considered one of the major concern for the cloud customers who faces security risks. The data leakage or data tampering are widely used by attackers to extract the private information of other users who shares the confidential data through virtualization. This paper presents Secure Secret Sharing (SSS) technique which is being recognized as one of the leading method to secure the sensitive data. It shares encrypted data over cloud and generated secret key is split into different parts distributed to qualified participants (Qn) only which is analyzed by malicious checkers. It verifies the clients based on their previous performances, whether these users proved to be authorized participant or not. The key computation is evaluated by the Key handler (KH) called trusted party which manages authorized control list, encryption/decryption and reconstruction of key shares. The Lagrange’s interpolation method is used to reconstruct the secret from shares. The experimental results shows that the proposed secure data sharing algorithm not only provides excellent security and performance, but also achieves better key management and data confidentiality than previous countermeasures. It improves the security by using secure VM placement and evaluated based on time consumption and probability computation to prove the efficacy of our algorithm. Experiments are performed on cloudsim based on following parameters i.e. time computation of key generation; response time and encryption/decryption. The experimental results demonstrate that this method can effectively reduce the risks and improves the security and time consumption upto 27.81% and 43.61% over existing algorithms.
{"title":"Security Enhancement in Cloud Environment using Secure Secret Key Sharing","authors":"S. Chhabra, Ashutosh Kumar Singh","doi":"10.24138/jcomss.v16i3.964","DOIUrl":"https://doi.org/10.24138/jcomss.v16i3.964","url":null,"abstract":"Securing the data in distributed cloud system is considered one of the major concern for the cloud customers who faces security risks. The data leakage or data tampering are widely used by attackers to extract the private information of other users who shares the confidential data through virtualization. This paper presents Secure Secret Sharing (SSS) technique which is being recognized as one of the leading method to secure the sensitive data. It shares encrypted data over cloud and generated secret key is split into different parts distributed to qualified participants (Qn) only which is analyzed by malicious checkers. It verifies the clients based on their previous performances, whether these users proved to be authorized participant or not. The key computation is evaluated by the Key handler (KH) called trusted party which manages authorized control list, encryption/decryption and reconstruction of key shares. The Lagrange’s interpolation method is used to reconstruct the secret from shares. The experimental results shows that the proposed secure data sharing algorithm not only provides excellent security and performance, but also achieves better key management and data confidentiality than previous countermeasures. It improves the security by using secure VM placement and evaluated based on time consumption and probability computation to prove the efficacy of our algorithm. Experiments are performed on cloudsim based on following parameters i.e. time computation of key generation; response time and encryption/decryption. The experimental results demonstrate that this method can effectively reduce the risks and improves the security and time consumption upto 27.81% and 43.61% over existing algorithms.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":" ","pages":""},"PeriodicalIF":0.7,"publicationDate":"2020-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48085004","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 : 2020-07-17DOI: 10.24138/jcomss.v16i3.999
Saruti Gupta, A. Goel
Partial transmit sequence (PTS) is a well-known PAPR reduction scheme for the OFDM system. One of the major challenge of this scheme is to find an optimal phase vector using exhaustive search over all the allowed phase factor combinations. This leads to increased search complexity which grows exponentially as the number of sub-blocks is increased. In this paper, chicken swarm optimization (CSO) based PTS system is designed that aims to find an optimal solution in less number of average iterations and therefore results in reduced computational complexity of the system. We have proposed two categories of the algorithm: (i) CSO-PTS system without threshold limit on PAPR (ii) CSO-PTS system with threshold limit on PAPR. Both the schemes offer effective trade-offs between the computational complexity and the PAPR reduction capability of the system. Simulation results confirm that our proposed schemes perform well in terms of low computational complexity, lesser number of average iterations and improved PAPR reduction capability of the OFDM signal without any loss in BER performance of the system.
{"title":"Chicken Swarm Optimization for PTS based PAPR Reduction in OFDM Systems","authors":"Saruti Gupta, A. Goel","doi":"10.24138/jcomss.v16i3.999","DOIUrl":"https://doi.org/10.24138/jcomss.v16i3.999","url":null,"abstract":"Partial transmit sequence (PTS) is a well-known PAPR reduction scheme for the OFDM system. One of the major challenge of this scheme is to find an optimal phase vector using exhaustive search over all the allowed phase factor combinations. This leads to increased search complexity which grows exponentially as the number of sub-blocks is increased. In this paper, chicken swarm optimization (CSO) based PTS system is designed that aims to find an optimal solution in less number of average iterations and therefore results in reduced computational complexity of the system. We have proposed two categories of the algorithm: (i) CSO-PTS system without threshold limit on PAPR (ii) CSO-PTS system with threshold limit on PAPR. Both the schemes offer effective trade-offs between the computational complexity and the PAPR reduction capability of the system. Simulation results confirm that our proposed schemes perform well in terms of low computational complexity, lesser number of average iterations and improved PAPR reduction capability of the OFDM signal without any loss in BER performance of the system.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"16 1","pages":"224-231"},"PeriodicalIF":0.7,"publicationDate":"2020-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42044933","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 : 2020-07-09DOI: 10.24138/jcomss.v16i3.1012
H. Megnafi
Cellular networks are constantly evolving to ensure a better Quality of Service (QoS) and quality of coverage ever more important. The radio cellular systems are based on frequency allocation. In this context, frequency allocation principle consists in choosing an optimal frequency plan to meet traffic demand constraints and communication quality while minimizing the radio interferences. This paper proposes an optimal frequency allocation approach based on genetic algorithms to minimize co-channel and adjacent channel interference. The validation of this new approach is confirmed by the results of the work we have done in the GSM network. In fact, we used the file obtained by the OMC-R, which defines the adjacent cells of each cell and the frequencies allocated to the considered area. The results obtained clearly show the effectiveness and robustness of the approach used.
{"title":"Frequency Plan Optimization Based on Genetic Algorithms for Cellular Networks","authors":"H. Megnafi","doi":"10.24138/jcomss.v16i3.1012","DOIUrl":"https://doi.org/10.24138/jcomss.v16i3.1012","url":null,"abstract":"Cellular networks are constantly evolving to ensure a better Quality of Service (QoS) and quality of coverage ever more important. The radio cellular systems are based on frequency allocation. In this context, frequency allocation principle consists in choosing an optimal frequency plan to meet traffic demand constraints and communication quality while minimizing the radio interferences. This paper proposes an optimal frequency allocation approach based on genetic algorithms to minimize co-channel and adjacent channel interference. The validation of this new approach is confirmed by the results of the work we have done in the GSM network. In fact, we used the file obtained by the OMC-R, which defines the adjacent cells of each cell and the frequencies allocated to the considered area. The results obtained clearly show the effectiveness and robustness of the approach used.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":" ","pages":""},"PeriodicalIF":0.7,"publicationDate":"2020-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44884381","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
扫码关注我们
求助内容：
应助结果提醒方式：