Pub Date : 2021-01-01DOI: 10.24138/jcomss-2021-0003
A. Ramelan, F. Adriyanto, C. Apribowo, M. Ibrahim, M. E. Sulistyo, Kevin S. Arief
—This work presents a design and implementation an information system called LoRa-Building Energy Management System (Lo-BEMS). This research proposes an engaging data transmission (read and write), that combines the HTTP and MQTT protocols using third party broker that has monitor and control features for energy usages. Data retrieving uses single LoRa modulation and delivery to the Application Programming Interface (API) in Laravel Framework will then be stopped by the system and stored in the database. The development of this system uses the Rapid Application Development (RAD) method and the Laravel Frameworks. The black-box, UAT, and performance validation test results showed that the information system was running properly and following the objectives.
{"title":"IoT LoRa-Based Energy Management Information System with RAD Method and Laravel Frameworks","authors":"A. Ramelan, F. Adriyanto, C. Apribowo, M. Ibrahim, M. E. Sulistyo, Kevin S. Arief","doi":"10.24138/jcomss-2021-0003","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0003","url":null,"abstract":"—This work presents a design and implementation an information system called LoRa-Building Energy Management System (Lo-BEMS). This research proposes an engaging data transmission (read and write), that combines the HTTP and MQTT protocols using third party broker that has monitor and control features for energy usages. Data retrieving uses single LoRa modulation and delivery to the Application Programming Interface (API) in Laravel Framework will then be stopped by the system and stored in the database. The development of this system uses the Rapid Application Development (RAD) method and the Laravel Frameworks. The black-box, UAT, and performance validation test results showed that the information system was running properly and following the objectives.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"44 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098688","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-0032
Alim Abdul, M. Vadivel
—Wireless sensor network (WSN) is the fastest growing technology that dominates the future world into wireless communication. It is a collection of a number of self-governing sensor nodes responsible to sense, process and manipulate the nodes. The sensor nodes are regulated by a battery where the network gets failed if the battery is dead. Thus, energy is an important factor to be efficiently used. Furthermore, congestion occurs in WSN when the incoming traffic load exceeds the capacity of the network. The major factors that lead to congestion are buffer overflow, varying rates of transmission, packet collision, and many-to-one data transmission. Due to these, the network suffers from packet loss, queuing delay, end-to-end delay, decrease in network lifetime, and increase in energy consumption. Hence, a clustering-based routing protocol is introduced in this paper to improve the performance of the network and reduce congestion. In the proposed method, Power-Efficient Gathering in Sensor Information Systems (PEGASIS) double cluster head with artificial neural network (ANN) is utilized to analyze the overall network lifetime. The proposed technique is comprised of four phases: clustering the network nodes, cluster head (CH) selection, chain formation, and secondary CH (SCH) selection. The sensor nodes are initially clustered with the firefly algorithm in which the cluster heads of each node are elected via an artificial neural network. Meanwhile, chain formation is processed by PEGASIS double cluster head (PDCH) and the SCH is selected through grey wolf optimizer (GWO) to afford equivalent energy utilization between the sensor nodes. The simulation outcomes proved that the proposed method efficiently increases the lifetime of the network and reduces congestion level in WSN.
{"title":"Pegasis Double Cluster Head Hybrid Congestion Control in Wireless Sensor Networks","authors":"Alim Abdul, M. Vadivel","doi":"10.24138/jcomss-2021-0032","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0032","url":null,"abstract":"—Wireless sensor network (WSN) is the fastest growing technology that dominates the future world into wireless communication. It is a collection of a number of self-governing sensor nodes responsible to sense, process and manipulate the nodes. The sensor nodes are regulated by a battery where the network gets failed if the battery is dead. Thus, energy is an important factor to be efficiently used. Furthermore, congestion occurs in WSN when the incoming traffic load exceeds the capacity of the network. The major factors that lead to congestion are buffer overflow, varying rates of transmission, packet collision, and many-to-one data transmission. Due to these, the network suffers from packet loss, queuing delay, end-to-end delay, decrease in network lifetime, and increase in energy consumption. Hence, a clustering-based routing protocol is introduced in this paper to improve the performance of the network and reduce congestion. In the proposed method, Power-Efficient Gathering in Sensor Information Systems (PEGASIS) double cluster head with artificial neural network (ANN) is utilized to analyze the overall network lifetime. The proposed technique is comprised of four phases: clustering the network nodes, cluster head (CH) selection, chain formation, and secondary CH (SCH) selection. The sensor nodes are initially clustered with the firefly algorithm in which the cluster heads of each node are elected via an artificial neural network. Meanwhile, chain formation is processed by PEGASIS double cluster head (PDCH) and the SCH is selected through grey wolf optimizer (GWO) to afford equivalent energy utilization between the sensor nodes. The simulation outcomes proved that the proposed method efficiently increases the lifetime of the network and reduces congestion level in WSN.","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":"69098801","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-0035
Ivana Marin, S. Gotovac, M. Russo, Dunja Božić-Štulić
In recent years Generative Adversarial Networks (GANs) have achieved remarkable results in the task of realistic image synthesis. Despite their continued success and advances, there still lacks a thorough understanding of how precisely GANs map random latent vectors to realistic-looking images and how the priors set on the latent space affect the learned mapping. In this work, we analyze the effect of the chosen latent dimension on the final quality of synthesized images of human faces and learned data representations. We show that GANs can generate images plausibly even with latent dimensions significantly smaller than the standard dimensions like 100 or 512. Although one might expect that larger latent dimensions encourage the generation of more diverse and enhanced quality images, we show that an increase of latent dimension after some point does not lead to visible improvements in perceptual image quality nor in quantitative estimates of its generalization abilities.
{"title":"The Effect of Latent Space Dimension on the Quality of Synthesized Human Face Images","authors":"Ivana Marin, S. Gotovac, M. Russo, Dunja Božić-Štulić","doi":"10.24138/JCOMSS-2021-0035","DOIUrl":"https://doi.org/10.24138/JCOMSS-2021-0035","url":null,"abstract":"In recent years Generative Adversarial Networks (GANs) have achieved remarkable results in the task of realistic image synthesis. Despite their continued success and advances, there still lacks a thorough understanding of how precisely GANs map random latent vectors to realistic-looking images and how the priors set on the latent space affect the learned mapping. In this work, we analyze the effect of the chosen latent dimension on the final quality of synthesized images of human faces and learned data representations. We show that GANs can generate images plausibly even with latent dimensions significantly smaller than the standard dimensions like 100 or 512. Although one might expect that larger latent dimensions encourage the generation of more diverse and enhanced quality images, we show that an increase of latent dimension after some point does not lead to visible improvements in perceptual image quality nor in quantitative estimates of its generalization abilities.","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":"69098819","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-0019
Kenza Redjimi, M. Boulaiche, M. Redjimi
—Wireless Sensor Networks are a set of sensor nodes that probe their surroundings and send their data over multi-hop routes to a base-station (BS) for processing. Many routing protocols have been developed for WSNs. A great attention has been given to geographic routing protocols, which rely only on local knowledge of nodes to disseminate data towards the BS. In this paper, we propose a new energy efficient geographic routing protocol called Improved Energy-aware and delivery Guarantee Geographic Routing protocol (IEGGR). The proposed protocol exploits the positions of neighboring nodes, which are closest to the BS to forward packets through the shortest path in terms of energy consumption. IEGGR introduces a mechanism in order to forward packets efficiently around voids. IEGGR algorithm considers the WSN as a connected-graph and to route a packet from a source node to the BS, IEGGR tries making the locally optimal choice at each intermediate node with the hope of finding a global optimum path, which aims to minimize energy consumption. To find greedily the optimal path, each forwarding node exploits its neighbor positions that are closest to the BS in order to iteratively building the end-to-end optimal path. Simulation results show that IEGGR is efficient in energy management during packet forwarding.
{"title":"IEGGR: Improved Energy-aware and Delivery Guarantee Geographic Routing","authors":"Kenza Redjimi, M. Boulaiche, M. Redjimi","doi":"10.24138/JCOMSS-2020-0019","DOIUrl":"https://doi.org/10.24138/JCOMSS-2020-0019","url":null,"abstract":"—Wireless Sensor Networks are a set of sensor nodes that probe their surroundings and send their data over multi-hop routes to a base-station (BS) for processing. Many routing protocols have been developed for WSNs. A great attention has been given to geographic routing protocols, which rely only on local knowledge of nodes to disseminate data towards the BS. In this paper, we propose a new energy efficient geographic routing protocol called Improved Energy-aware and delivery Guarantee Geographic Routing protocol (IEGGR). The proposed protocol exploits the positions of neighboring nodes, which are closest to the BS to forward packets through the shortest path in terms of energy consumption. IEGGR introduces a mechanism in order to forward packets efficiently around voids. IEGGR algorithm considers the WSN as a connected-graph and to route a packet from a source node to the BS, IEGGR tries making the locally optimal choice at each intermediate node with the hope of finding a global optimum path, which aims to minimize energy consumption. To find greedily the optimal path, each forwarding node exploits its neighbor positions that are closest to the BS in order to iteratively building the end-to-end optimal path. Simulation results show that IEGGR is efficient in energy management during packet forwarding.","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":"69098677","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-0006
Manel Kammoun, Manel Elleuchi, M. Abid, A. Obeid
—Hash functions are used in the majority of security protocol to guarantee the integrity and the authenticity. Among the most important hash functions is the SHA-2 family, which offers higher security and solved the insecurity problems of other popular algorithms as MD5, SHA-1 and SHA-0. However, theses security algorithms are characterized by a certain amount of complex computations and consume a lot of energy. In order to reduce the power consumption as required in the majority of embedded applications, a solution consists to exploit a critical part on accelerator (hardware). In this paper, we propose a hardware/software exploration for the implementation of SHA256 algorithm. For hardware design, two principal design methods are proceeded: Low level synthesis (LLS) and high level synthesis (HLS). The exploration allows the evaluation of performances in term of area, throughput and power consumption. The synthesis results under Zynq 7000 based-FPGA reflect a significant improvement of about 80% and 15% respectively in FPGA resources and throughput for the LLS hardware design compared to HLS solution. For better efficiency, hardware IPs are deduced and implemented within HW/SW system on chip. The experiments are performed using Xilinx ZC 702-based platform. The HW/SW LLS design records a gain of 10% to 25% in term of execution time and 73% in term of power consumption.
{"title":"HW/SW Architecture Exploration for an Efficient Implementation of the Secure Hash Algorithm SHA-256","authors":"Manel Kammoun, Manel Elleuchi, M. Abid, A. Obeid","doi":"10.24138/JCOMSS-2021-0006","DOIUrl":"https://doi.org/10.24138/JCOMSS-2021-0006","url":null,"abstract":"—Hash functions are used in the majority of security protocol to guarantee the integrity and the authenticity. Among the most important hash functions is the SHA-2 family, which offers higher security and solved the insecurity problems of other popular algorithms as MD5, SHA-1 and SHA-0. However, theses security algorithms are characterized by a certain amount of complex computations and consume a lot of energy. In order to reduce the power consumption as required in the majority of embedded applications, a solution consists to exploit a critical part on accelerator (hardware). In this paper, we propose a hardware/software exploration for the implementation of SHA256 algorithm. For hardware design, two principal design methods are proceeded: Low level synthesis (LLS) and high level synthesis (HLS). The exploration allows the evaluation of performances in term of area, throughput and power consumption. The synthesis results under Zynq 7000 based-FPGA reflect a significant improvement of about 80% and 15% respectively in FPGA resources and throughput for the LLS hardware design compared to HLS solution. For better efficiency, hardware IPs are deduced and implemented within HW/SW system on chip. The experiments are performed using Xilinx ZC 702-based platform. The HW/SW LLS design records a gain of 10% to 25% in term of execution time and 73% in term of power consumption.","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":"69098696","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-0070
Jose Carlos Filho, Fabbio Anderson da Silva Borges, Ricardo de Andrade Lira Rabêlo, Ivan Saraiva Silva, A. O. de Carvalho Filho
Short-Duration Voltage Variations (SDVVs) are the power quality disturbances (PQD) that mainly affect industrial systems, and are originated for various reasons, in particular short circuits over large areas, even those originating in remote points of the electrical system. The location problem aims to indicate the area or region or distance from the substation that is connected to the source causing the voltage sags, and is a fundamental task to ensure good power quality. One of the strategies used to determine the location of sources causing SDVVs and for an implementation of machine learning algorithms in modern distribution networks, called Smart Grids. Monitoring a Smart Grid plays a key role, however mostly it generates a large volume of data (Big Data) and as a result, multiple challenges arise due to the properties of this data such as volume, variety and velocity. This work presents an optimization through genetic algorithm to select meters which already exist in the Smart Grid, using a voltage sag location method in order to reduce the data obtained and analyzed throughout the localization process. Optimization was evaluated through a comparison with a non-optimized localization method, this comparison showed a difference between the hit rates of less than 1%.
{"title":"Optimized Method for Locating the Source of Voltage Sags","authors":"Jose Carlos Filho, Fabbio Anderson da Silva Borges, Ricardo de Andrade Lira Rabêlo, Ivan Saraiva Silva, A. O. de Carvalho Filho","doi":"10.24138/jcomss-2021-0070","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0070","url":null,"abstract":"Short-Duration Voltage Variations (SDVVs) are the power quality disturbances (PQD) that mainly affect industrial systems, and are originated for various reasons, in particular short circuits over large areas, even those originating in remote points of the electrical system. The location problem aims to indicate the area or region or distance from the substation that is connected to the source causing the voltage sags, and is a fundamental task to ensure good power quality. One of the strategies used to determine the location of sources causing SDVVs and for an implementation of machine learning algorithms in modern distribution networks, called Smart Grids. Monitoring a Smart Grid plays a key role, however mostly it generates a large volume of data (Big Data) and as a result, multiple challenges arise due to the properties of this data such as volume, variety and velocity. This work presents an optimization through genetic algorithm to select meters which already exist in the Smart Grid, using a voltage sag location method in order to reduce the data obtained and analyzed throughout the localization process. Optimization was evaluated through a comparison with a non-optimized localization method, this comparison showed a difference between the hit rates of less than 1%.","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":"69098442","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-0038
C. Coste, Darius Bufnea
—Online publishers rely on different techniques to trap web visitors, clickbait being one such technique. Besides being a bad habit, clickbait is also a strong indicator for fake news spreading. Its presence in online media leads to an overall bad browsing experience for the web consumer. Recently, big players on the Internet scene, such as search engines and social networks, have turned their attention towards this negative phenomenon that is increasingly present in our everyday browsing experience. The research community has also joined in this effort, a broad band of detection techniques being developed. These techniques are usually based on intelligent classifiers, for which feature selection is of great importance. The work presented in this paper brings our own contributions to the field of clickbait detection. We present a new language-independent strategy for clickbait detection that takes into consideration only features that are general enough to be independent of any particular language. The methods presented in this paper could be applied to web content written in different languages. In addition, we present the results of a complex experiment that we performed to evaluate our proposed method and we compare our results with the most relevant results previously obtained in the field.
{"title":"Advances in Clickbait and Fake News Detection Using New Language-independent Strategies","authors":"C. Coste, Darius Bufnea","doi":"10.24138/jcomss-2021-0038","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0038","url":null,"abstract":"—Online publishers rely on different techniques to trap web visitors, clickbait being one such technique. Besides being a bad habit, clickbait is also a strong indicator for fake news spreading. Its presence in online media leads to an overall bad browsing experience for the web consumer. Recently, big players on the Internet scene, such as search engines and social networks, have turned their attention towards this negative phenomenon that is increasingly present in our everyday browsing experience. The research community has also joined in this effort, a broad band of detection techniques being developed. These techniques are usually based on intelligent classifiers, for which feature selection is of great importance. The work presented in this paper brings our own contributions to the field of clickbait detection. We present a new language-independent strategy for clickbait detection that takes into consideration only features that are general enough to be independent of any particular language. The methods presented in this paper could be applied to web content written in different languages. In addition, we present the results of a complex experiment that we performed to evaluate our proposed method and we compare our results with the most relevant results previously obtained in the field.","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":"69098868","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-0112
P. Šolić, T. Perković, I. Marasović, D. López-de-Ipiña, L. Patrono
{"title":"Guest Editorial: Smart Systems and Architectures","authors":"P. Šolić, T. Perković, I. Marasović, D. López-de-Ipiña, L. Patrono","doi":"10.24138/jcomss-2021-0112","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0112","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":"69098545","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-12-30DOI: 10.24138/jcomss.v16i4.1035
Aasheesh Shukla
Future communication networks may encounter various issues in order to facilitate heavy heterogeneous data traffic and large number of users, therefore more advanced multiple access (MA) schemes is required to meet the changing requirements. Recently, a promising physical-layer MA technique has been suggested for multi-antenna broadcast channels, namely Rate Splitting Multiple Access (RSMA). This new scheme has the ability to partially decode the interference and partially treat the remaining interference as noise which makes it to cope with wide range of user deployments and network loads. On the other hand, interleave division multiple access (IDMA) has already been recognized as a potential code domain NOMA (non-orthogonal multiple access) scheme, suitable for 5G and beyond communication network. Hence, in this paper, a new approach of multiple access scheme is proposed to get the grip on new challenges in future communication (6G). The proposed framework consists the joint processing of RSMA and IDMA (code domain NOMA), in which the transmitter involves an IDMA as encoder and allows rate splitting to split the message in two parts i.e. common part and private part, before the actual transmission. The mathematical modeling of proposed system is elaborated in the paper and for simulation purpose the downlink communication scenario has been considered where users faced diverse channel conditions. The weighted sum rate (WSR) performance is evaluated for the proposed scheme which validate the quality of service (QoS) of the joint RS-IDMA system.
{"title":"Joint RSMA and IDMA-Based NOMA system for downlink Communication in 5G and Beyond Networks","authors":"Aasheesh Shukla","doi":"10.24138/jcomss.v16i4.1035","DOIUrl":"https://doi.org/10.24138/jcomss.v16i4.1035","url":null,"abstract":"Future communication networks may encounter various issues in order to facilitate heavy heterogeneous data traffic and large number of users, therefore more advanced multiple access (MA) schemes is required to meet the changing requirements. Recently, a promising physical-layer MA technique has been suggested for multi-antenna broadcast channels, namely Rate Splitting Multiple Access (RSMA). This new scheme has the ability to partially decode the interference and partially treat the remaining interference as noise which makes it to cope with wide range of user deployments and network loads. On the other hand, interleave division multiple access (IDMA) has already been recognized as a potential code domain NOMA (non-orthogonal multiple access) scheme, suitable for 5G and beyond communication network. Hence, in this paper, a new approach of multiple access scheme is proposed to get the grip on new challenges in future communication (6G). The proposed framework consists the joint processing of RSMA and IDMA (code domain NOMA), in which the transmitter involves an IDMA as encoder and allows rate splitting to split the message in two parts i.e. common part and private part, before the actual transmission. The mathematical modeling of proposed system is elaborated in the paper and for simulation purpose the downlink communication scenario has been considered where users faced diverse channel conditions. The weighted sum rate (WSR) performance is evaluated for the proposed scheme which validate the quality of service (QoS) of the joint RS-IDMA system.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":" ","pages":""},"PeriodicalIF":0.7,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46192382","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-12-01DOI: 10.24138/jcomss.v16i4.1017
Hamid Garmani, Driss Ait Omar, Mohamed EL Amrani, Mohamed Baslam, M. Jourhmane
With a sponsored content plan on the internet market , a content provider (CP) can pay to the internet service providers ( ISP ) on behalf of the mobile users / subscribers to remove the network subscription fees for introduce an increase in the number of advertisements . As such , CP, ISP and end- users are all actively motivated to participate in the sponsored content plan. In this paper , we investigate the interactions between CPs as a non- cooperative game as a function of two market parameters credibility of content and number of sponsored content. In turn , the subscribers’ demand for the content of a CP depends not only on their strategies but also upon those proposed by all of its competitors . Through rigorous mathematical analysis , we prove the existence and uniqueness of the Nash equilibrium . Based on the analysis of the game properties , we propose an iterative algorithm, which guarantees to converge to the Nash equilibrium point in a distributed manner . Numerical investigation shows the convergence of a proposed algorithm to the Nash equilibrium point and corroborates the fact that sponsoring content may improve the CPs outcome .
{"title":"A Non-cooperative Game-Theoretic Framework for Sponsoring Content in the Internet Market","authors":"Hamid Garmani, Driss Ait Omar, Mohamed EL Amrani, Mohamed Baslam, M. Jourhmane","doi":"10.24138/jcomss.v16i4.1017","DOIUrl":"https://doi.org/10.24138/jcomss.v16i4.1017","url":null,"abstract":"With a sponsored content plan on the internet market , a content provider (CP) can pay to the internet service providers ( ISP ) on behalf of the mobile users / subscribers to remove the network subscription fees for introduce an increase in the number of advertisements . As such , CP, ISP and end- users are all actively motivated to participate in the sponsored content plan. In this paper , we investigate the interactions between CPs as a non- cooperative game as a function of two market parameters credibility of content and number of sponsored content. In turn , the subscribers’ demand for the content of a CP depends not only on their strategies but also upon those proposed by all of its competitors . Through rigorous mathematical analysis , we prove the existence and uniqueness of the Nash equilibrium . Based on the analysis of the game properties , we propose an iterative algorithm, which guarantees to converge to the Nash equilibrium point in a distributed manner . Numerical investigation shows the convergence of a proposed algorithm to the Nash equilibrium point and corroborates the fact that sponsoring content may improve the CPs outcome .","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":" ","pages":""},"PeriodicalIF":0.7,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43865893","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
扫码关注我们
求助内容：
应助结果提醒方式：