{"title":"Bit error probability analysis for majority logic decoding of CSOC codes over fading channels","authors":"Souad Labghough, F. Ayoub, M. Belkasmi","doi":"10.1109/COMMNET.2018.8360256","DOIUrl":"https://doi.org/10.1109/COMMNET.2018.8360256","url":null,"abstract":"In this paper, we evaluate a closed-form expression for the bit error probability for Majority Logic Decoding (MLGD) of Convolutional Self Orthogonal Codes (CSOC) over fading channels. We derive at first a pairwise error probability (PEP) expression which will be used in conjunction with the probability generating function of CSOC codes to evaluate then the bit error probability of MLGD decoding, when used over Nakagami-m fading channels. The accuracy of the analytical results obtained is verified by Monte-Carlo simulation method (MC).","PeriodicalId":103830,"journal":{"name":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133757718","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}
{"title":"Green opportunistic access for cognitive radio networks: A regret matching based approach","authors":"Safae Lhazmir, Mouna Elmachkour, A. Kobbane","doi":"10.1109/COMMNET.2018.8360261","DOIUrl":"https://doi.org/10.1109/COMMNET.2018.8360261","url":null,"abstract":"In cognitive radio networks, the spectrum sensing is extremely important. Although this is simple with a very short detection time, the competitive behavior of secondary users can lead to additional expenses in terms of energy. Indeed, the contention on data channel unoccupied by licensed user leads to a single winner, but also involves a loss of energy of all nodes. In this paper, we investigate the problem of energy efficient spectrum sensing, by applying an approach based on regret-matching learning, to improves secondary users battery life and the performance of the network. We will demonstrate by simulations, that the regret matching learning can achieve good results.","PeriodicalId":103830,"journal":{"name":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116111888","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}
Ahmed El-Yahyaoui, Mohamed Dâfir Ech-Cherif El Kettani
{"title":"Evaluating AND gates over encrypted data in cloud computing","authors":"Ahmed El-Yahyaoui, Mohamed Dâfir Ech-Cherif El Kettani","doi":"10.1109/COMMNET.2018.8360255","DOIUrl":"https://doi.org/10.1109/COMMNET.2018.8360255","url":null,"abstract":"Encrypting data before storing it in a remote cloud server is highly recommended, but when using traditional symmetric algorithms as AES, 3DES… we lose the ability of manipulating freely our data in the cloud. For example, if we request the cloud computing to do a huge treatment over our encrypted big data it should decrypt it at first, which means revealing the private encryption key to an untrusted part and that constitute a security problem. Processing encrypted data in cloud computing is an efficient solution. Homomorphic encryption schemes are powerful tools that allow performing computations over ciphertexts without any prior decryption. We propose a new efficient homomorphic encryption scheme based on Lucas theorem. Our cryptosystem allows performing several AND gates over encrypted cloud data. The cost of one AND of two ciphertexts is equivalent to the cost of addition on numbers. The proposed scheme uses the {0,1} as cleartext space and one key for encryption and decryption, i.e it is a symmetric encryption scheme.","PeriodicalId":103830,"journal":{"name":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125126675","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}
{"title":"Semantic discovery architecture for dynamic environments of Web of Things","authors":"Ismail Nadim, Yassine El Ghayam, A. Sadiq","doi":"10.1109/COMMNET.2018.8360269","DOIUrl":"https://doi.org/10.1109/COMMNET.2018.8360269","url":null,"abstract":"The huge number of Web of Things (WoT) services make their discovery a real challenge. One strategy to deal with this challenge is to reduce, as much as possible, the number of the discovered services using different mechanisms such as semantic Web-based clustering. However, most existing approaches are better suitable for static context and don't consider the dynamicity of services and gateways. Moreover, most of them are centralized approaches. In this paper we propose a distributed WoT services semantic discovery architecture. Our architecture leverages three services filtering mechanisms: clustering, indexing and ranking, which are semantic annotation-based. Also, this architecture takes into account both the dynamicity of WoT services through an incremental clustering algorithm, and the mobility of IoT gateways, through WoT gateways.","PeriodicalId":103830,"journal":{"name":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129279913","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}
Bassant Selim, S. Muhaidat, P. Sofotasios, B. Sharif, T. Stouraitis, G. Karagiannidis, N. Al-Dhahir
{"title":"Outage probability of multi-carrier NOMA systems under joint I/Q imbalance","authors":"Bassant Selim, S. Muhaidat, P. Sofotasios, B. Sharif, T. Stouraitis, G. Karagiannidis, N. Al-Dhahir","doi":"10.1109/COMMNET.2018.8360283","DOIUrl":"https://doi.org/10.1109/COMMNET.2018.8360283","url":null,"abstract":"Non-orthogonal multiple access (NOMA) has been recently proposed as a viable technology that can potentially improve the spectral efficiency of fifth generation (5G) wireless networks and beyond. However, in practical communication scenarios, transceiver architectures inevitably suffer from radio-frequency (RF) front-end related impairments that can lead to degradation of the overall system performance, with in-phase/quadrature-phase imbalance (IQI) constituting a major impairment in direct-conversion transceivers. In the present work, we quantify the effects of joint transmitter/receiver IQI on the performance of NOMA based multi-carrier (MC) systems under multipath fading conditions. Furthermore, we derive the asymptotic diversity order of the considered MC NOMA set up. Capitalizing on these results, we demonstrate that the effects of IQI differ considerably among NOMA users and depend on the underlying system parameters. For example, it is shown that the first sorted user appears more robust to IQI, which indicates that higher order users are more sensitive to the considered non-negligible impairment.","PeriodicalId":103830,"journal":{"name":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127987883","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}
{"title":"Tifinagh handwritten character recognition using genetic algorithms","authors":"Lahcen Niharmine, Benaceur Outtaj, Ahmed Azouaoui","doi":"10.1109/COMMNET.2018.8360267","DOIUrl":"https://doi.org/10.1109/COMMNET.2018.8360267","url":null,"abstract":"Handwritten character recognition system involves many different process including character images preprocessing, database preparation (features extraction), generation of best features and classification. Building best features is the complex phase during the implementation of a character recognition system. In this paper we have performed feature extraction using gradient direction technique. The novelty of our approach is to generate new features and achieve better accuracy using Genetic Algorithm which outputs new vectors based on the fitness parameter. The classification phase is performed using a feedforward neural network. The experimental results show that the performance of the Optical Character Recognition system is around 89.5%.","PeriodicalId":103830,"journal":{"name":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126763129","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}
{"title":"Construction and decoding of OSMLD codes derived from unital and oval designs","authors":"Otmane El Mouaatamid, M. Lahmer, M. Belkasmi","doi":"10.1109/COMMNET.2018.8360280","DOIUrl":"https://doi.org/10.1109/COMMNET.2018.8360280","url":null,"abstract":"A construction of One-Step Majority-Logic Decodable (OSMLD) codes based on the incidence matrices of Balanced Incomplete Block Designs (BIBD) is given. In this paper, we focus on unital and oval designs which are constructed from a Projective Geometry (PG). Thus, we derive from the unital and oval designs new systematic and non-systematic OSMLD codes with rates and lengths not available with existing OSMLD codes. Simulation results show that the derived codes converge well under Iterative Threshold Decoding with an efficient trade-off between complexity and performances.","PeriodicalId":103830,"journal":{"name":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130250260","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}
{"title":"Investigating the impact of real-time path planning on reducing vehicles traveling time","authors":"Younes Regragui, N. Moussa","doi":"10.1109/COMMNET.2018.8360277","DOIUrl":"https://doi.org/10.1109/COMMNET.2018.8360277","url":null,"abstract":"There has been an increasing interest in the issue of real-time path planning based on the exchange of information about traffic conditions in vehicular ad hoc networks (VANETs). Because of the development in hardware, software, and communication technologies. However, real-time applications are facing several challenges for providing reliable communications (V2V and V2I) due to many effective factors which increase the rate of topology change, including high-speed mobility and sparse vehicle density. In this paper, we first establish a real-time path planning strategy which utilizes real-time information about traffic conditions for providing the shortest paths with minimum travel time. This strategy utilizes vehicular ad hoc networks (VANETs) to enable real-time communications among vehicles, roadside units (RSUs), and a central server. Each vehicle can request a shortest-path by sending a simple request packet to the server and waiting for a reply containing a new route as sequence of turning movements. Finally, our path planning strategy is implemented and simulated based on a real map by using Veins framework (with IEEE 802.11 p/WAVE standard). Veins is capable of running OMNET++ and SUMO in parallel. Simulation results confirm that our proposed path planning approach improves significantly the travel time.","PeriodicalId":103830,"journal":{"name":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116143993","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}
{"title":"Towards QoS-enabled SDN networks","authors":"Farah Chahlaoui, H. Dahmouni","doi":"10.1109/COMMNET.2018.8360251","DOIUrl":"https://doi.org/10.1109/COMMNET.2018.8360251","url":null,"abstract":"SDN networks have become increasingly popular, especially for real time systems. Optimizing the self-defined network cost and performance is thereby primordial. This requires the network to meet real-time requirements and provide guarantees related to bandwidth and packet loss, and associated with the end-to-end delay and jitter which are essential indicators of QoS. This paper is an effort towards QoS-enabled SDN networks that allows establishing the formulation for both delay and jitter. Furthermore, we evaluate the effect of end-to-end delay and jitter in SDN networks as QoS metrics to finally establish their respective behavior.","PeriodicalId":103830,"journal":{"name":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116852379","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}
{"title":"Suppression of calculi growth based on the mathematical model of the pathogenesis of urolithiasis","authors":"H. Kagami","doi":"10.1109/COMMNET.2018.8360265","DOIUrl":"https://doi.org/10.1109/COMMNET.2018.8360265","url":null,"abstract":"So far various studies for the cause of the onset of urolithiasis has been made and the factors influencing the pathogenesis has been almost clear. On the other hand, though the understanding of individual factor influencing the pathogenesis has progressed biologically and clinically, theoretical study of the integrated dynamics leading to the calculus of urolithiasis through the crystal growth and aggregation from the crystal nucleation using a mathematical model has not been made yet. Then I derived the mathematical model of the process leading to the onset of urolithiasis so as to clarify how a variety of factors affecting urolithiasis influence the pathogenesis quantitatively. In the mathematical model, the process leading to the onset of urolithiasis is divided into the following three processes. (1) formation of crystal nuclei. (2) formation of calculi by growth of crystal nuclei. (3) bonding of calculi to urinary tract cells and growth of calculi. In addition, the parameters of the volume of the urinary tract, the flow rate of urine etc. are introduced to represent the characteristics of the urinary tract. As a result, for instance, in case of calcium oxalate calculi, the conditions that the calculus does not grow were shown analytically and numerically. And the dependence of the growth of the calculus on the volume of the urinary tract or the flow rate of urine was also clarified analytically and numerically. Then, based on the analysis of this mathematical model, we propose specific solutions in clinical.","PeriodicalId":103830,"journal":{"name":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121157096","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}