Pub Date : 2017-12-01DOI: 10.1109/PDCAT.2017.00086
H. Qavami, S. Jamali, M. Akbari, B. Javadi
Cloud computing provides more reliable and flexible access to IT resources, on-demand and self-service service request are some key advantages of it. Managing up-layer cloud services efficiently, while promising those advantages and SLA, motivates the challenge of provisioning and allocating resource on-demand in infrastructure layer, in response to dynamic workloads. Studies mostly have been focused on managing these demands in the physical layer and few in the application layer. This paper focuses on resource allocation method in application level that allocates an appropriate number of virtual machines to an application which requires a dynamic amount of resources. A Learning Automata based approach has been chosen to implement the method. Experimental results demonstrate that the proposed technique offers more cost effective resource provisioning approach while provisions enough resource for applications.
{"title":"A Learning Automata Based Dynamic Resource Provisioning in Cloud Computing Environments","authors":"H. Qavami, S. Jamali, M. Akbari, B. Javadi","doi":"10.1109/PDCAT.2017.00086","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00086","url":null,"abstract":"Cloud computing provides more reliable and flexible access to IT resources, on-demand and self-service service request are some key advantages of it. Managing up-layer cloud services efficiently, while promising those advantages and SLA, motivates the challenge of provisioning and allocating resource on-demand in infrastructure layer, in response to dynamic workloads. Studies mostly have been focused on managing these demands in the physical layer and few in the application layer. This paper focuses on resource allocation method in application level that allocates an appropriate number of virtual machines to an application which requires a dynamic amount of resources. A Learning Automata based approach has been chosen to implement the method. Experimental results demonstrate that the proposed technique offers more cost effective resource provisioning approach while provisions enough resource for applications.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"689 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123829090","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00081
Yung-Feng Lu, Chin-Fu Kuo, Shih-Chun Chou, Jhong-Syuan Li, Yan-Wei Lai
Object-based storage is a storage architecture that manages data as objects, as opposed to other storage architectures like file systems which manage data as a file hierarchy and block storage which manages data as blocks within sectors and tracks. In general, each object typically includes the data itself, a variable amount of metadata, and a globally unique identifier. Object storage seeks to enable capabilities not addressed by other storage architectures such as data replication and data distribution at object-level granularity. A distributed data store is a computer network where information is stored on more than one node, often in a replicated fashion. Recently, there are many excellent researches target on energy aware, performance-aware, and trade-of on cloud storage. However, less on the scheduling on the cost-efficient designs. This paper, aims to evaluate the data storage performance with hybrid storage. We try to provide a cost-aware scheme for tier-based hybrid storage. Our scheme can provide a proper placement for data. Thus, users and venders can use lower cost to get the performance that they need.
{"title":"Cost-Aware Software-Defined Hybrid Object-Based Storage System","authors":"Yung-Feng Lu, Chin-Fu Kuo, Shih-Chun Chou, Jhong-Syuan Li, Yan-Wei Lai","doi":"10.1109/PDCAT.2017.00081","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00081","url":null,"abstract":"Object-based storage is a storage architecture that manages data as objects, as opposed to other storage architectures like file systems which manage data as a file hierarchy and block storage which manages data as blocks within sectors and tracks. In general, each object typically includes the data itself, a variable amount of metadata, and a globally unique identifier. Object storage seeks to enable capabilities not addressed by other storage architectures such as data replication and data distribution at object-level granularity. A distributed data store is a computer network where information is stored on more than one node, often in a replicated fashion. Recently, there are many excellent researches target on energy aware, performance-aware, and trade-of on cloud storage. However, less on the scheduling on the cost-efficient designs. This paper, aims to evaluate the data storage performance with hybrid storage. We try to provide a cost-aware scheme for tier-based hybrid storage. Our scheme can provide a proper placement for data. Thus, users and venders can use lower cost to get the performance that they need.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132922403","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00073
R. Duncan
We describe an approach to deploying only those bytecodes that can be executed by the current operating system and hardware resources in an environment that combines parallelism, processor heterogeneity and software-defined networking capabilities (SDN). Packet processing’s escalating speed requirements necessitate parallel processing and, typically, heterogeneous processing via specialized processors acting as accelerators. We use bytecodes for an abstract machine to drive the dissimilar processors with interpreters running in parallel. However, processors and SDN are evolving; thus, bytecodes must evolve as well. We must execute reliable programs for packet processing, so we need to deploy only bytecodes that the interpreters and system resources can support. Our solution combines: (a) correlating supported features, interpreter versions and hardware variants in a manifest file, (b) instrumenting a compiler to recognize key feature use, (c) carrying detected feature data in an object module section and (d) running a checking tool at pre-linking stages to prevent linking or deploying a bytecode that cannot be correctly executed. The scheme has handled deprecating features and adding a broad variety of new features. It has been stress-tested by significant changes in hardware variants.
{"title":"Managing Bytecode and ISA Compatibility with an Enhanced Toolchain","authors":"R. Duncan","doi":"10.1109/PDCAT.2017.00073","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00073","url":null,"abstract":"We describe an approach to deploying only those bytecodes that can be executed by the current operating system and hardware resources in an environment that combines parallelism, processor heterogeneity and software-defined networking capabilities (SDN). Packet processing’s escalating speed requirements necessitate parallel processing and, typically, heterogeneous processing via specialized processors acting as accelerators. We use bytecodes for an abstract machine to drive the dissimilar processors with interpreters running in parallel. However, processors and SDN are evolving; thus, bytecodes must evolve as well. We must execute reliable programs for packet processing, so we need to deploy only bytecodes that the interpreters and system resources can support. Our solution combines: (a) correlating supported features, interpreter versions and hardware variants in a manifest file, (b) instrumenting a compiler to recognize key feature use, (c) carrying detected feature data in an object module section and (d) running a checking tool at pre-linking stages to prevent linking or deploying a bytecode that cannot be correctly executed. The scheme has handled deprecating features and adding a broad variety of new features. It has been stress-tested by significant changes in hardware variants.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"49 52","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113957673","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00042
Xiaofan Zhao, Xin Li, Hong Shen
In this paper, we study the problem of online bin packing with advice. Assume that there is an oracle with infinite computation power which can provide specific information with regard to each incoming item of the online bin packing problem. With this information, we want to pack the list L of items, one at a time, into a minimum number of bins. The bin capacity is 1 and all items have size no larger than 1. The total size of packed items in each bin cannot exceed the bin capacity. Inspired by the work of Boyar et al. of competitive ratio 4/3 with two advice bits per item, we show that if the oracle provides three bits of advice per item, applying a different item classification scheme from Boyar et als, we can obtain an online algorithm with competitive ratio 5/4 to pack list L. Furthermore, we show that our algorithm can retain the same competitive ratio 5/4 with only two advice bits per item, hence improving the known result.
{"title":"Improved Online Algorithms for One-Dimensional BinPacking with Advice","authors":"Xiaofan Zhao, Xin Li, Hong Shen","doi":"10.1109/PDCAT.2017.00042","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00042","url":null,"abstract":"In this paper, we study the problem of online bin packing with advice. Assume that there is an oracle with infinite computation power which can provide specific information with regard to each incoming item of the online bin packing problem. With this information, we want to pack the list L of items, one at a time, into a minimum number of bins. The bin capacity is 1 and all items have size no larger than 1. The total size of packed items in each bin cannot exceed the bin capacity. Inspired by the work of Boyar et al. of competitive ratio 4/3 with two advice bits per item, we show that if the oracle provides three bits of advice per item, applying a different item classification scheme from Boyar et als, we can obtain an online algorithm with competitive ratio 5/4 to pack list L. Furthermore, we show that our algorithm can retain the same competitive ratio 5/4 with only two advice bits per item, hence improving the known result.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"228 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113988931","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00077
Fouzia Kahloun, Sonia Ayachi Ghannouchi
Business process modeling is essential for improving and automating business processes and for comparing them. Furthermore, evaluating their quality must be based on a set of measures. In this context, our contribution in this paper consists in proposing a prototype for Process model assessment and applying it on a real business process model in the higher education. Our prototype is based on four main steps (modeling, measurement, evaluation and improvement). It takes as input a BPMN model for which some measures are applied to define its level of quality. After that, we compare the obtained measures with the threshold values presented in literature with the purpose of evaluating the considered BPMN model level of quality. Finally, based on guidelines applied to each exceeding measure, we help the designer to improve his/her model.
{"title":"A Case Study in Higher Education Domain Based on a Prototype for Business Process Models Improvement: BPMoQualAssess","authors":"Fouzia Kahloun, Sonia Ayachi Ghannouchi","doi":"10.1109/PDCAT.2017.00077","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00077","url":null,"abstract":"Business process modeling is essential for improving and automating business processes and for comparing them. Furthermore, evaluating their quality must be based on a set of measures. In this context, our contribution in this paper consists in proposing a prototype for Process model assessment and applying it on a real business process model in the higher education. Our prototype is based on four main steps (modeling, measurement, evaluation and improvement). It takes as input a BPMN model for which some measures are applied to define its level of quality. After that, we compare the obtained measures with the threshold values presented in literature with the purpose of evaluating the considered BPMN model level of quality. Finally, based on guidelines applied to each exceeding measure, we help the designer to improve his/her model.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114330685","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00013
Carlos Luevanos, John Elizarraras, K. Hirschi, Jyh-haw Yeh
Cybersecurity has become one of the largest growing fields in computer science and the technology industry. Faulty security has cost the global economy immense losses. Oftentimes, the pitfall in such financial loss is due to the security of passwords. Companies and regular people alike do not do enough to enforce strict password guidelines like the NIST (National Institute of Standard Technology) recommends. When big security breaches happen, thousands to millions of passwords can be exposed and stored into files, meaning people are susceptible to dictionary and rainbow table attacks. Those are only two examples of attacks that are used to crack passwords. In this paper, we will be going over three open-source password managers, each chosen for their own uniqueness. Our results will conclude on the overall security of each password manager using a list of established attacks and development of new potential attacks on such software. Additionally, we will compare our research with the limited research already conducted on password managers. Finally, we will provide some general guidelines of how to develop a better and more secure password manager.
{"title":"Analysis on the Security and Use of Password Managers","authors":"Carlos Luevanos, John Elizarraras, K. Hirschi, Jyh-haw Yeh","doi":"10.1109/PDCAT.2017.00013","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00013","url":null,"abstract":"Cybersecurity has become one of the largest growing fields in computer science and the technology industry. Faulty security has cost the global economy immense losses. Oftentimes, the pitfall in such financial loss is due to the security of passwords. Companies and regular people alike do not do enough to enforce strict password guidelines like the NIST (National Institute of Standard Technology) recommends. When big security breaches happen, thousands to millions of passwords can be exposed and stored into files, meaning people are susceptible to dictionary and rainbow table attacks. Those are only two examples of attacks that are used to crack passwords. In this paper, we will be going over three open-source password managers, each chosen for their own uniqueness. Our results will conclude on the overall security of each password manager using a list of established attacks and development of new potential attacks on such software. Additionally, we will compare our research with the limited research already conducted on password managers. Finally, we will provide some general guidelines of how to develop a better and more secure password manager.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132576216","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00022
Hongtao Liu
In this paper, we study one variant of the multiobjective knapsack problem, i.e., the biobjective 0-1 linear knapsack problem with a single continuous variable (BKPC). An exact algorithm, the biobjective branch and bound method (BOBB), is presented to find all nondominated points of the BKPC. We analyze the nondominated frontier of the BKPC and design a new branching strategy to improve the algorithm. Finally an illustrative example shows how the algorithm solves a practical problem.
{"title":"An Exact Algorithm for the Biobjective 0-1 Linear Knapsack Problem with a Single Continuous Variable","authors":"Hongtao Liu","doi":"10.1109/PDCAT.2017.00022","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00022","url":null,"abstract":"In this paper, we study one variant of the multiobjective knapsack problem, i.e., the biobjective 0-1 linear knapsack problem with a single continuous variable (BKPC). An exact algorithm, the biobjective branch and bound method (BOBB), is presented to find all nondominated points of the BKPC. We analyze the nondominated frontier of the BKPC and design a new branching strategy to improve the algorithm. Finally an illustrative example shows how the algorithm solves a practical problem.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125852652","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00084
Yusuf Sutanto, Siti Hayati Efi Friantin, S. Wulandari
This research develops binary integer programming model for optimization of garbage transportation by arranging the type of vehicle used to transport garbage at each garbage disposal based on the distance travel by each vehicle, the maximum carrying capacity of the vehicle, and the maximum capacity of the landfill. This model is applied to the market garbage transportation in Surakarta City. The result shows that the fleet used only 6 trucks from 10 trucks, and from 6 trucks only 3 trucks that do the ritual, so it is expected to minimize the operational cost of the garbage transportation market.
{"title":"Integer Programming Model to Optimize Waste Management System (Case Study: Surakarta City Indonesia)","authors":"Yusuf Sutanto, Siti Hayati Efi Friantin, S. Wulandari","doi":"10.1109/PDCAT.2017.00084","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00084","url":null,"abstract":"This research develops binary integer programming model for optimization of garbage transportation by arranging the type of vehicle used to transport garbage at each garbage disposal based on the distance travel by each vehicle, the maximum carrying capacity of the vehicle, and the maximum capacity of the landfill. This model is applied to the market garbage transportation in Surakarta City. The result shows that the fleet used only 6 trucks from 10 trucks, and from 6 trucks only 3 trucks that do the ritual, so it is expected to minimize the operational cost of the garbage transportation market.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126021314","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00088
Neziha Jaouedi, Noureddine Boujnah, M. Bouhlel
In the framework of human machine interaction systems enhancement, we focus throw this paper on human behavior analysis and action recognition. Human behavior is characterized by actions and reactions duality (movements, psychological modification, verbal and emotional expression. Its worth noting that many information are hidden behind gesture, sudden motion points trajectories and speeds, many research works reconstructed an information retrieval issues. In our work we will focus on motion extraction, tracking and action recognition using wavelet network approaches. Our contribution uses an analysis of human subtraction by Gaussian Mixture Model (GMM) and body movement through trajectory models of motion constructed from kalman filter. These models allow to remove the noise using the extraction of the main motion features and constitute a stable base to identify the evolutions of human activity .Each modality is used to recognize a human action using wavelets of derived beta distributions approach. The proposed approach has been validated successfully on a subset of KTH and UCF sport database
{"title":"Human Action Recognition Using Wavelets of Derived Beta Distributions","authors":"Neziha Jaouedi, Noureddine Boujnah, M. Bouhlel","doi":"10.1109/PDCAT.2017.00088","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00088","url":null,"abstract":"In the framework of human machine interaction systems enhancement, we focus throw this paper on human behavior analysis and action recognition. Human behavior is characterized by actions and reactions duality (movements, psychological modification, verbal and emotional expression. Its worth noting that many information are hidden behind gesture, sudden motion points trajectories and speeds, many research works reconstructed an information retrieval issues. In our work we will focus on motion extraction, tracking and action recognition using wavelet network approaches. Our contribution uses an analysis of human subtraction by Gaussian Mixture Model (GMM) and body movement through trajectory models of motion constructed from kalman filter. These models allow to remove the noise using the extraction of the main motion features and constitute a stable base to identify the evolutions of human activity .Each modality is used to recognize a human action using wavelets of derived beta distributions approach. The proposed approach has been validated successfully on a subset of KTH and UCF sport database","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122582827","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 : 2017-12-01DOI: 10.1109/PDCAT.2017.00064
Yosra Benchaabene, Noureddine Boujnah, F. Zarai
The evolving fifth generation (5G) cellular wireless networks are envisioned to provide higher data rates, enhance end-user quality-of-experience (QoE), reduce end-to-end latency, and lower energy consumption. This article presents several emerging technologies which could enable and define future 5G mobile communication standards and cellular networks. This article discusses novel design techniques including dense hetergeounes networks and stochastic geometry as an approach that will be used to design 5G cellular networks and new features are discussed such as the new mm-wave , Massive Multiple Input Multiple Out (Massive MIMO)and new access technique (Filter Bank multi Carrier). FBMC, cloud Radio Acess Network C-RAN and virtualization of wireless resources . Finally, the study presents new 5G applications, namely Machine type communication and IoT .
{"title":"5G Cellular: Survey on Some Challenging Techniques","authors":"Yosra Benchaabene, Noureddine Boujnah, F. Zarai","doi":"10.1109/PDCAT.2017.00064","DOIUrl":"https://doi.org/10.1109/PDCAT.2017.00064","url":null,"abstract":"The evolving fifth generation (5G) cellular wireless networks are envisioned to provide higher data rates, enhance end-user quality-of-experience (QoE), reduce end-to-end latency, and lower energy consumption. This article presents several emerging technologies which could enable and define future 5G mobile communication standards and cellular networks. This article discusses novel design techniques including dense hetergeounes networks and stochastic geometry as an approach that will be used to design 5G cellular networks and new features are discussed such as the new mm-wave , Massive Multiple Input Multiple Out (Massive MIMO)and new access technique (Filter Bank multi Carrier). FBMC, cloud Radio Acess Network C-RAN and virtualization of wireless resources . Finally, the study presents new 5G applications, namely Machine type communication and IoT .","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126616720","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
扫码关注我们
求助内容：
应助结果提醒方式：