Pub Date : 2019-06-01DOI: 10.1109/IWCMC.2019.8766588
Fairouz Fakhfakh
Nowadays, mobile devices (e.g., tablet and smartphone) have become an important part of human life as they provide effective communication tools not limited by place and time. Nevertheless, they are facing many problems in terms of resource storage capabilities and communications. So, Mobile Cloud Computing (MCC) has emerged as a new paradigm to overcome these limitations by integrating Cloud Computing into the mobile environment. Adopting this paradigm raises several challenges, particularly with regard to the performance and the correctness. On the one hand, attaining the optimal performance in MCC is not a trivial task due to the variety of often conflicting objectives. On the other hand, because of the complexity of the studied applications, their modeling is more prone to errors on the part of the designers. In this paper, we present a background on MCC including definition, advantages and applications. We also provide a survey of the proposed approaches in the literature focusing on the performance and the verification in MCC systems. Then, we show a comparative study of the existing solutions based on some criteria. Finally, we identify the main research issues and we suggest some directions for future research.
{"title":"Performance and Correctness of Mobile Cloud Computing Systems: Taxonomy and Open Challenges","authors":"Fairouz Fakhfakh","doi":"10.1109/IWCMC.2019.8766588","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766588","url":null,"abstract":"Nowadays, mobile devices (e.g., tablet and smartphone) have become an important part of human life as they provide effective communication tools not limited by place and time. Nevertheless, they are facing many problems in terms of resource storage capabilities and communications. So, Mobile Cloud Computing (MCC) has emerged as a new paradigm to overcome these limitations by integrating Cloud Computing into the mobile environment. Adopting this paradigm raises several challenges, particularly with regard to the performance and the correctness. On the one hand, attaining the optimal performance in MCC is not a trivial task due to the variety of often conflicting objectives. On the other hand, because of the complexity of the studied applications, their modeling is more prone to errors on the part of the designers. In this paper, we present a background on MCC including definition, advantages and applications. We also provide a survey of the proposed approaches in the literature focusing on the performance and the verification in MCC systems. Then, we show a comparative study of the existing solutions based on some criteria. Finally, we identify the main research issues and we suggest some directions for future research.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115696080","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 : 2019-06-01DOI: 10.1109/IWCMC.2019.8766513
Yousef Ali, U. Baroudi
The technological advances in smartphones have brought promising potentials to tracking systems. GPS and WLAN are widely used technologies in recent smartphones for positioning and communication, respectively. However, both GPS and WLAN have serious energy consumption problem. For large scale tracking systems, where tracked people are supposed to move in groups, the continuous usage of the individual smartphones GPS and WiFi is not an energy efficient solution. In this work, we propose a cooperative approach that exploits the coexistence of of multiple communication interfaces (WiFi and Bluetooth) in recent smartphones where nearby smartphones are cooperatively grouped to form a cluster. A cluster is a network of one dynamically selected cluster head and regular members that communicate locally via Bluetooth. The cluster head is responsible of positioning and sharing positioning information with the rest of cluster members. It, also, acts as a gateway between its regular members and the server. We present a clustering approach according to the available energy and the energy cost. Our approach doesnt require any modifications in the recent smartphones equipment. We have formulated the clustering construction problem as a mixed integer program using GAMS. The proposed clustering approach has been evaluated via extensive simulation experiments and the obtained results have been compared with the optimal solution which show very close performance.
{"title":"CEET: Cooperative Energy Efficient Tracking System using Smartphones","authors":"Yousef Ali, U. Baroudi","doi":"10.1109/IWCMC.2019.8766513","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766513","url":null,"abstract":"The technological advances in smartphones have brought promising potentials to tracking systems. GPS and WLAN are widely used technologies in recent smartphones for positioning and communication, respectively. However, both GPS and WLAN have serious energy consumption problem. For large scale tracking systems, where tracked people are supposed to move in groups, the continuous usage of the individual smartphones GPS and WiFi is not an energy efficient solution. In this work, we propose a cooperative approach that exploits the coexistence of of multiple communication interfaces (WiFi and Bluetooth) in recent smartphones where nearby smartphones are cooperatively grouped to form a cluster. A cluster is a network of one dynamically selected cluster head and regular members that communicate locally via Bluetooth. The cluster head is responsible of positioning and sharing positioning information with the rest of cluster members. It, also, acts as a gateway between its regular members and the server. We present a clustering approach according to the available energy and the energy cost. Our approach doesnt require any modifications in the recent smartphones equipment. We have formulated the clustering construction problem as a mixed integer program using GAMS. The proposed clustering approach has been evaluated via extensive simulation experiments and the obtained results have been compared with the optimal solution which show very close performance.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115702555","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 : 2019-06-01DOI: 10.1109/IWCMC.2019.8766693
A. Elazreg, A. Kharaz
Distributed space time block coding in wireless cooperative relay networks have attracted significant interest due to its bandwidth efficiency and high reliability. To achieve full diversity and full data transmission rate, most researchers assumed perfect timing synchronization within the network. However, synchronisation in wireless cooperative relay networks is difficult in real environment due to the distributed nature of cooperative relay nodes. This paper first, deals with designing an efficient distributed space time block coding system to obtain double the full diversity and full data transmission rate for asynchronous cooperative relay networks. The second part deal with developing a low-level computational complexity sub-optimum detection scheme to overcome the imperfect synchronisation issues arising among the relay nodes. The computational complexity level depends only upon the constellation size. Analytical analysis and simulation results show that the double the full diversity with full data transmission rate are achieved. The proposed sub-optimum detection scheme can also effectively eliminate the intersymbol interference induced by the lack of synchronisation between the relay nodes at the destination node.
{"title":"Sub-Optimum Detection Scheme with Double the Full Diversity for Asynchronous Cooperative Relay Network","authors":"A. Elazreg, A. Kharaz","doi":"10.1109/IWCMC.2019.8766693","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766693","url":null,"abstract":"Distributed space time block coding in wireless cooperative relay networks have attracted significant interest due to its bandwidth efficiency and high reliability. To achieve full diversity and full data transmission rate, most researchers assumed perfect timing synchronization within the network. However, synchronisation in wireless cooperative relay networks is difficult in real environment due to the distributed nature of cooperative relay nodes. This paper first, deals with designing an efficient distributed space time block coding system to obtain double the full diversity and full data transmission rate for asynchronous cooperative relay networks. The second part deal with developing a low-level computational complexity sub-optimum detection scheme to overcome the imperfect synchronisation issues arising among the relay nodes. The computational complexity level depends only upon the constellation size. Analytical analysis and simulation results show that the double the full diversity with full data transmission rate are achieved. The proposed sub-optimum detection scheme can also effectively eliminate the intersymbol interference induced by the lack of synchronisation between the relay nodes at the destination node.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114672001","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 : 2019-06-01DOI: 10.1109/IWCMC.2019.8766352
Walid Mallat, W. H. Alouane, H. Boujemaa, F. Touati
This paper studies the problem of secure dual-hop AF network in the presence of eavesdropper. We study the secrecy performance of partial relay selection with outdated channel state information (CSI). We propose a system secrecy where two sources and destination simultaneously transmit the legitimate and the jamming signal respectively. The selected relay forwards the combined signal to the legitimate receiver and the eavesdropper. We derive a closed-form expression for lower bound on the ergodic secrecy capacity (ESC) under different assumptions of the eavesdropper channel gains. We verify that the system performance is degraded as the correlation coefficient decreases. Simulation results are considered to verify the exactness of the proposed mathematical analysis.
{"title":"Impact of outdated CSI on the secrecy performance of dual-hop networks using cooperative jamming","authors":"Walid Mallat, W. H. Alouane, H. Boujemaa, F. Touati","doi":"10.1109/IWCMC.2019.8766352","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766352","url":null,"abstract":"This paper studies the problem of secure dual-hop AF network in the presence of eavesdropper. We study the secrecy performance of partial relay selection with outdated channel state information (CSI). We propose a system secrecy where two sources and destination simultaneously transmit the legitimate and the jamming signal respectively. The selected relay forwards the combined signal to the legitimate receiver and the eavesdropper. We derive a closed-form expression for lower bound on the ergodic secrecy capacity (ESC) under different assumptions of the eavesdropper channel gains. We verify that the system performance is degraded as the correlation coefficient decreases. Simulation results are considered to verify the exactness of the proposed mathematical analysis.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116634544","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 : 2019-06-01DOI: 10.1109/IWCMC.2019.8766563
W. Dai, Hewu Li, Qian Wu, Xiaomo Wang
The integration of satellite and terrestrial network(ISTN) is an ongoing trend in prospect. Recently many commercial companies such as SpaceX, OneWeb plan to launch tens of thousands satellites which promotes the scale of satellite networks rapidly. While the scale of the satellite network is still small relatively compared with the terrestrial network. IP-routing ability in satellite network is becoming more and more important for ISTN. Suffering from high topology dynamics, long propagation delay, and onboard processing limitations on satellite networks, routing in ISTN faces many challenges worth analyzing in-depth.This paper builds an IP-based routing usability theoretical analytical model with calculable formula, which formulates different types of networks under a unified framework that accommodates various configurations and characteristics of multiple networks. Moreover, massive experiments based on real satellite motion data are designed and conducted to analyze the routing performance and challenges in ISTN deeply, combining various ground stations, satellite processing ability, number of satellites per orbit, etc. At last, with the analysis of routing usability for ISTN, some instructive conclusions are drawn. Although the number of routing nodes in satellite networks is relatively small compared with terrestrial networks, but the influence is big. With the network scale extending, high topology dynamics makes the IP-based routing performance of ISTN decrease dramatically. Routing usable time in one day period decreases from 23.36h to 2.99h when the number of satellites grows from 60 to 960. To keep routing usability, the number of satellites in space is not the more the better in ISTN. The scale of network and the onboard processing ability should do trade off.
{"title":"Small Number but Big Influence: Analysis of Routing Usability in ISTN","authors":"W. Dai, Hewu Li, Qian Wu, Xiaomo Wang","doi":"10.1109/IWCMC.2019.8766563","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766563","url":null,"abstract":"The integration of satellite and terrestrial network(ISTN) is an ongoing trend in prospect. Recently many commercial companies such as SpaceX, OneWeb plan to launch tens of thousands satellites which promotes the scale of satellite networks rapidly. While the scale of the satellite network is still small relatively compared with the terrestrial network. IP-routing ability in satellite network is becoming more and more important for ISTN. Suffering from high topology dynamics, long propagation delay, and onboard processing limitations on satellite networks, routing in ISTN faces many challenges worth analyzing in-depth.This paper builds an IP-based routing usability theoretical analytical model with calculable formula, which formulates different types of networks under a unified framework that accommodates various configurations and characteristics of multiple networks. Moreover, massive experiments based on real satellite motion data are designed and conducted to analyze the routing performance and challenges in ISTN deeply, combining various ground stations, satellite processing ability, number of satellites per orbit, etc. At last, with the analysis of routing usability for ISTN, some instructive conclusions are drawn. Although the number of routing nodes in satellite networks is relatively small compared with terrestrial networks, but the influence is big. With the network scale extending, high topology dynamics makes the IP-based routing performance of ISTN decrease dramatically. Routing usable time in one day period decreases from 23.36h to 2.99h when the number of satellites grows from 60 to 960. To keep routing usability, the number of satellites in space is not the more the better in ISTN. The scale of network and the onboard processing ability should do trade off.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121086030","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 : 2019-06-01DOI: 10.1109/IWCMC.2019.8766580
Mohammed Laroui, Aicha Dridi, H. Afifi, Hassine Moungla, M. Marot, M. A. Cherif
We propose a solution for Electric Vehicles (EVs) energy management in smart cities, where a deep learning approach is used to enhance the energy consumption of electric vehicles by trajectory and delay predictions. Two Recurrent Neural Networks are adapted and trained on 60 days of urban traffic. The trained networks show precise prediction of trajectory and delay, even for long prediction intervals. An algorithm is designed and applied on well known energy models for traction and air conditioning. We show how it can prevent from a battery exhaustion. Experimental results combining both RNN and energy models demonstrate the efficiency of the proposed solution in terms of route trajectory and delay prediction, enhancing the energy management.
{"title":"Energy Management For Electric Vehicles in Smart Cities: A Deep Learning Approach","authors":"Mohammed Laroui, Aicha Dridi, H. Afifi, Hassine Moungla, M. Marot, M. A. Cherif","doi":"10.1109/IWCMC.2019.8766580","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766580","url":null,"abstract":"We propose a solution for Electric Vehicles (EVs) energy management in smart cities, where a deep learning approach is used to enhance the energy consumption of electric vehicles by trajectory and delay predictions. Two Recurrent Neural Networks are adapted and trained on 60 days of urban traffic. The trained networks show precise prediction of trajectory and delay, even for long prediction intervals. An algorithm is designed and applied on well known energy models for traction and air conditioning. We show how it can prevent from a battery exhaustion. Experimental results combining both RNN and energy models demonstrate the efficiency of the proposed solution in terms of route trajectory and delay prediction, enhancing the energy management.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123295181","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 : 2019-06-01DOI: 10.1109/IWCMC.2019.8766498
Salwa Othmen, S. Asklany, A. Belghith
Nowadays, the wide spread of devices like the tablets, mobile phones and personal computer have driven the wireless networks growth. As the routing procedure is the core of communication in this network, then, its improvement will influence the whole network performance. Due to the limited energy of the mobile devices, balancing the consumption of energy and the load between the different nodes of the networks becomes an important issue.In this paper, we propose a routing protocol for multi-hop cellular networks. This protocol selects an optimal route based on two parameters: the gain time and the energy to improve the lifetime of the whole network. To handle the imprecision of the routing decisions, we propose a fuzzy logic system. The conducted simulations show that our proposed fuzzy logic based routing protocol outperforms the Ad Hoc On-demand Distance Vector protocol (AODV) in terms of end-to-end delay and packet delivery ration.
{"title":"A Fuzzy-based Delay and Energy-Aware Routing Protocol for Multi-hop Cellular Networks","authors":"Salwa Othmen, S. Asklany, A. Belghith","doi":"10.1109/IWCMC.2019.8766498","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766498","url":null,"abstract":"Nowadays, the wide spread of devices like the tablets, mobile phones and personal computer have driven the wireless networks growth. As the routing procedure is the core of communication in this network, then, its improvement will influence the whole network performance. Due to the limited energy of the mobile devices, balancing the consumption of energy and the load between the different nodes of the networks becomes an important issue.In this paper, we propose a routing protocol for multi-hop cellular networks. This protocol selects an optimal route based on two parameters: the gain time and the energy to improve the lifetime of the whole network. To handle the imprecision of the routing decisions, we propose a fuzzy logic system. The conducted simulations show that our proposed fuzzy logic based routing protocol outperforms the Ad Hoc On-demand Distance Vector protocol (AODV) in terms of end-to-end delay and packet delivery ration.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123520711","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 : 2019-06-01DOI: 10.1109/IWCMC.2019.8766666
Syed Navid Raza, H. A. U. Rehman, Suk-Gyu Lee, G. Choi
Camera calibration technique plays a vital role in three dimensional computer vision systems. The aim of this technique is to calibrate the camera in order to collect more precise three dimensional data from the images to utilize for robot navigation, three dimensional reconstruction, biomedical, virtual reality and visual surveillance. In camera calibration one of the major issue is to search out the set of image parameters describing the mapping between three dimensional images reference coordinates and two-dimensional images reference coordinates. Currently, MATLAB toolbox and OpenCv are the most popular tools used by the researchers for camera calibration. We utilize the concept of deep learning to recognize the chessboard corners. Our presented technique is a convolutional neural network (CNN) trained on a huge number of chessboard images. The network is trained on different datasets: noisy and with high lens malformation images. The proposed scheme is more accurate than the conventional MATLAB algorithm technique. The presented technique is more accurate against the different sort of ruination present in the training set. Results reaffirmed the correctness and effectiveness of our proposed CNN technique.
{"title":"Artificial Intelligence based Camera Calibration","authors":"Syed Navid Raza, H. A. U. Rehman, Suk-Gyu Lee, G. Choi","doi":"10.1109/IWCMC.2019.8766666","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766666","url":null,"abstract":"Camera calibration technique plays a vital role in three dimensional computer vision systems. The aim of this technique is to calibrate the camera in order to collect more precise three dimensional data from the images to utilize for robot navigation, three dimensional reconstruction, biomedical, virtual reality and visual surveillance. In camera calibration one of the major issue is to search out the set of image parameters describing the mapping between three dimensional images reference coordinates and two-dimensional images reference coordinates. Currently, MATLAB toolbox and OpenCv are the most popular tools used by the researchers for camera calibration. We utilize the concept of deep learning to recognize the chessboard corners. Our presented technique is a convolutional neural network (CNN) trained on a huge number of chessboard images. The network is trained on different datasets: noisy and with high lens malformation images. The proposed scheme is more accurate than the conventional MATLAB algorithm technique. The presented technique is more accurate against the different sort of ruination present in the training set. Results reaffirmed the correctness and effectiveness of our proposed CNN technique.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123665088","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 : 2019-06-01DOI: 10.1109/IWCMC.2019.8766464
Zied El May, Hella Kaffel Ben Ayed, Dorra Machfar
Mobile applications have access to users data and may leak it to third parties without users consent. Googles Android platforms include a permission model that restricts applications access to users personal information. However, Android users have a big decision to make before they install an app from the Google Play Store. Will they accept the full list of permissions and have faith that it will not overstep its boundaries, or refuse to install it at all? Users are not aware of how their personal data would be used once applications are installed and permissions granted. This raises a significant privacy risk for Android users. This paper presents an overview and discusses the implications of the findings in current research focusing on their approaches towards users awareness of the privacy risk involved with granting permissions to Android applications.
{"title":"State of the art on Privacy Risk Estimation Related to Android Applications","authors":"Zied El May, Hella Kaffel Ben Ayed, Dorra Machfar","doi":"10.1109/IWCMC.2019.8766464","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766464","url":null,"abstract":"Mobile applications have access to users data and may leak it to third parties without users consent. Googles Android platforms include a permission model that restricts applications access to users personal information. However, Android users have a big decision to make before they install an app from the Google Play Store. Will they accept the full list of permissions and have faith that it will not overstep its boundaries, or refuse to install it at all? Users are not aware of how their personal data would be used once applications are installed and permissions granted. This raises a significant privacy risk for Android users. This paper presents an overview and discusses the implications of the findings in current research focusing on their approaches towards users awareness of the privacy risk involved with granting permissions to Android applications.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126874845","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 : 2019-06-01DOI: 10.1109/IWCMC.2019.8766730
Khouloud Bouaziz, S. Chtourou, M. Abid, Z. Marrakchi, A. Obeid
Computer-Aided Design (CAD) tools represent a major factor to enhance the quality of Field Programmable Gate Arrays (FPGAs) and use their architectural resources to their full potential. Since they can be developed to satisfy application constraints like surface, speed and energy while responding to Time-to-market requirements. In this paper, we explore the impact of T-VPack and First Choice (FC) clustering algorithms on the performance of Multilevel Switch Boxes (MS) FPGA with Long Wires (LWs). Indeed, the performance of an FPGA is highly sensitive to the mapping of Logic Blocks (LBs) on FPGA architecture. This work shows that FC ameliorates power consumption, area, critical path delay and energy compared to T-VPack.
{"title":"Impact of Clustering Algorithms on the performance of Multilevel Switch Boxes FPGA with Long Wires","authors":"Khouloud Bouaziz, S. Chtourou, M. Abid, Z. Marrakchi, A. Obeid","doi":"10.1109/IWCMC.2019.8766730","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766730","url":null,"abstract":"Computer-Aided Design (CAD) tools represent a major factor to enhance the quality of Field Programmable Gate Arrays (FPGAs) and use their architectural resources to their full potential. Since they can be developed to satisfy application constraints like surface, speed and energy while responding to Time-to-market requirements. In this paper, we explore the impact of T-VPack and First Choice (FC) clustering algorithms on the performance of Multilevel Switch Boxes (MS) FPGA with Long Wires (LWs). Indeed, the performance of an FPGA is highly sensitive to the mapping of Logic Blocks (LBs) on FPGA architecture. This work shows that FC ameliorates power consumption, area, critical path delay and energy compared to T-VPack.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126965371","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
扫码关注我们
求助内容：
应助结果提醒方式：