Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651851
Nir Drucker, S. Gueron
ZUC-256 is a Pseudo Random Number Generator (PRNG) that is proposed as a successor of ZUC-128. Similarly to ZUC-128 that is incorporated in the 128-EEA3 and 128-EIA3 encryption and integrity algorithms, ZUC-256 is designed to offer 256-bit security and to be incorporated in the upcoming encryption and authentication algorithm in 5G technologies. In this context software optimizations of ZUC-256 are desired. This paper proposes several ZUC-256 optimizations for x86 processors, especially, modern processors that have efficient AVX vectorization. Surprisingly, we also show that AES-NI can also be used for ZUC-256 and help creating constant-time implementations. Our results show speedup of up to 4.5 x(per key stream) when computational tasks are parallelized efficiently.
{"title":"Fast constant time implementations of ZUC-256 on x86 CPUs","authors":"Nir Drucker, S. Gueron","doi":"10.1109/CCNC.2019.8651851","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651851","url":null,"abstract":"ZUC-256 is a Pseudo Random Number Generator (PRNG) that is proposed as a successor of ZUC-128. Similarly to ZUC-128 that is incorporated in the 128-EEA3 and 128-EIA3 encryption and integrity algorithms, ZUC-256 is designed to offer 256-bit security and to be incorporated in the upcoming encryption and authentication algorithm in 5G technologies. In this context software optimizations of ZUC-256 are desired. This paper proposes several ZUC-256 optimizations for x86 processors, especially, modern processors that have efficient AVX vectorization. Surprisingly, we also show that AES-NI can also be used for ZUC-256 and help creating constant-time implementations. Our results show speedup of up to 4.5 x(per key stream) when computational tasks are parallelized efficiently.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129077384","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-01-01DOI: 10.1109/CCNC.2019.8651803
Muhammad Ajmal Khan, Heath J. LeBlanc, F. Hassan
In this paper, signal space diversity (SSD) is introduced in an underlay cognitive two-way relay network where two secondary source terminals communicate with each other directly and via an intermediate secondary relay in the presence of a primary user. SSD is applied at all transmitting nodes in the secondary network to rotate and interleave the signal components before transmission that enables both source terminals and intermediate relay to transmit different symbols. Therefore, SSD enhances the mutual information of the SSD-based underlay cognitive two-way relay network compared to the conventional one. Thus, performance analysis and results of the proposed system are different than that of the conventional system. It is shown that the proposed system improves the outage performance and spectral efficiency of the underlay cognitive two-way relay network. Moreover, the closed-form expression for exact outage probability of the proposed system is derived over Rayleigh fading channels. Monte Carlo simulations are carried out to validate the analytical work. In all analysis, interference power constraints and correlation among signal-to-noise ratios are taken into consideration to provide accurate results. Furthermore, the impact of channel estimation error on the outage probability of the system is investigated and the closed-form expression of the outage probability is derived.
{"title":"Signal Space Diversity based Cognitive Two-Way Relay Network with Underlay Spectrum Sharing","authors":"Muhammad Ajmal Khan, Heath J. LeBlanc, F. Hassan","doi":"10.1109/CCNC.2019.8651803","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651803","url":null,"abstract":"In this paper, signal space diversity (SSD) is introduced in an underlay cognitive two-way relay network where two secondary source terminals communicate with each other directly and via an intermediate secondary relay in the presence of a primary user. SSD is applied at all transmitting nodes in the secondary network to rotate and interleave the signal components before transmission that enables both source terminals and intermediate relay to transmit different symbols. Therefore, SSD enhances the mutual information of the SSD-based underlay cognitive two-way relay network compared to the conventional one. Thus, performance analysis and results of the proposed system are different than that of the conventional system. It is shown that the proposed system improves the outage performance and spectral efficiency of the underlay cognitive two-way relay network. Moreover, the closed-form expression for exact outage probability of the proposed system is derived over Rayleigh fading channels. Monte Carlo simulations are carried out to validate the analytical work. In all analysis, interference power constraints and correlation among signal-to-noise ratios are taken into consideration to provide accurate results. Furthermore, the impact of channel estimation error on the outage probability of the system is investigated and the closed-form expression of the outage probability is derived.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130209224","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-01-01DOI: 10.1109/CCNC.2019.8651822
Ahmad S. Almadhor
This paper proposes a generation driven control strategy for handling the operations of a smart micro grid. This control strategy is proposed for a PV and battery based microgrid and tested using technical virtual power plant (TVPP) realization. Mesh network infrastructure is used to connect the generation and load elements. The projected strategy is simulated in MATLAB and tested on IEEE RTS96 73 bus system using Simulink. The advantages of VPP approach in operating and maintaining micro grids are discussed, and concluded that a TVPP realization helped in optimizing the operation of the grid in the all four quarters of the year. Hence; five load nodes were completely shut down during peak periods in Jan-Mar quarter and 6 nodes were operating at 75% of the required demand in that quarter
{"title":"Intelligent Control Mechanism in Smart Micro grid with Mesh Networks and Virtual Power Plant Model","authors":"Ahmad S. Almadhor","doi":"10.1109/CCNC.2019.8651822","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651822","url":null,"abstract":"This paper proposes a generation driven control strategy for handling the operations of a smart micro grid. This control strategy is proposed for a PV and battery based microgrid and tested using technical virtual power plant (TVPP) realization. Mesh network infrastructure is used to connect the generation and load elements. The projected strategy is simulated in MATLAB and tested on IEEE RTS96 73 bus system using Simulink. The advantages of VPP approach in operating and maintaining micro grids are discussed, and concluded that a TVPP realization helped in optimizing the operation of the grid in the all four quarters of the year. Hence; five load nodes were completely shut down during peak periods in Jan-Mar quarter and 6 nodes were operating at 75% of the required demand in that quarter","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121421050","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-01-01DOI: 10.1109/CCNC.2019.8651794
Haitham Afifi, H. Karl
As wireless sensor networks evolve towards comprising more powerful devices, they offer opportunities for distributing applications into the network and processing data in-network. Examples for such applications often come from the signal processing or data analysis domain. We describe such applications by overlay graphs, consisting of functional blocks with predefined interconnections that may even have feedback loops. We treat these functional blocks as virtual functions that can be easily moved (reprogrammed) among the network nodes. This property allows us to use the concept of virtual network embedding (VNE) for placement and routing. VNE has only partially been considered for wireless environments; specifically, the interaction between embedding and the wireless multicast advantage has not been fully explored. We cast our problem as mixed integer linear programming (MILP) formulation for uniform transmit power and mixed integer quadratic constraint programming (MIQCP) for power allocation and compare between both methods.
{"title":"Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding","authors":"Haitham Afifi, H. Karl","doi":"10.1109/CCNC.2019.8651794","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651794","url":null,"abstract":"As wireless sensor networks evolve towards comprising more powerful devices, they offer opportunities for distributing applications into the network and processing data in-network. Examples for such applications often come from the signal processing or data analysis domain. We describe such applications by overlay graphs, consisting of functional blocks with predefined interconnections that may even have feedback loops. We treat these functional blocks as virtual functions that can be easily moved (reprogrammed) among the network nodes. This property allows us to use the concept of virtual network embedding (VNE) for placement and routing. VNE has only partially been considered for wireless environments; specifically, the interaction between embedding and the wireless multicast advantage has not been fully explored. We cast our problem as mixed integer linear programming (MILP) formulation for uniform transmit power and mixed integer quadratic constraint programming (MIQCP) for power allocation and compare between both methods.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126336446","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-01-01DOI: 10.1109/CCNC.2019.8651835
Bruno Donassolo, Ilhem Fajjari, Arnaud Legrand, P. Mertikopoulos
To this day, the Internet of Things (IoT) continues its explosive growth. Nevertheless, with the exceptional evolution of traffic demand, existing infrastructures are struggling to resist. In this context, Fog computing is shaping the future of IoT applications. It offers nearby computational, networking and storage resources to respond to the stringent requirements of these applications. However, despite its several advantages, Fog computing raises new challenges which slow its adoption down. Hence, there is a lack of practical solutions to enable the exploitation of this novel concept. To deal with this shortcoming, we propose FITOR, an orchestration system for IoT applications in the Fog environment. This solution builds a realistic Fog environment while offering efficient orchestration mechanisms. In order to optimize the provisioning of Fog-Enabled IoT applications, FITOR relies on O-FSP, an optimized fog service provisioning strategy which aims to minimize the provisioning cost of IoT applications, while meeting their requirements. Based on extensive experiments, the results obtained show that O-FSP optimizes the placement of IoT applications and outperforms the related strategies in terms of i) provisioning cost ii) resource usage and iii) acceptance rate.
{"title":"Fog Based Framework for IoT Service Provisioning","authors":"Bruno Donassolo, Ilhem Fajjari, Arnaud Legrand, P. Mertikopoulos","doi":"10.1109/CCNC.2019.8651835","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651835","url":null,"abstract":"To this day, the Internet of Things (IoT) continues its explosive growth. Nevertheless, with the exceptional evolution of traffic demand, existing infrastructures are struggling to resist. In this context, Fog computing is shaping the future of IoT applications. It offers nearby computational, networking and storage resources to respond to the stringent requirements of these applications. However, despite its several advantages, Fog computing raises new challenges which slow its adoption down. Hence, there is a lack of practical solutions to enable the exploitation of this novel concept. To deal with this shortcoming, we propose FITOR, an orchestration system for IoT applications in the Fog environment. This solution builds a realistic Fog environment while offering efficient orchestration mechanisms. In order to optimize the provisioning of Fog-Enabled IoT applications, FITOR relies on O-FSP, an optimized fog service provisioning strategy which aims to minimize the provisioning cost of IoT applications, while meeting their requirements. Based on extensive experiments, the results obtained show that O-FSP optimizes the placement of IoT applications and outperforms the related strategies in terms of i) provisioning cost ii) resource usage and iii) acceptance rate.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126131346","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-01-01DOI: 10.1109/CCNC.2019.8651818
Motoki Iwata, Koji Yamamoto, Bo Yin, T. Nishio, M. Morikura, H. Abeysekera
In this study, we conducted an analysis of the system performance of a wireless local area network in which access points (APs) dynamically adjust the carrier sense threshold (CST) based on the individual average received power to determine the optimal CST. Adjustment of the CST is a promising approach to improve spatial reuse and proposed for IEEE 802.11ax standard. Here, assuming to adopt the inversely proportional setting of the CST and transmission power, we can make the carrier sensing relationship symmetric, restraining throughput starvation. This paper analytically derives the density of successful transmissions (DST) on the basis of stochastic geometry. The DST is a system performance metric which expresses the number of APs whose transmission is successful based on signal-to-interference-plus-noise power ratio. We show that both results of the analytically derived DST and Monte Carlo simulation have the same trend. From the perspective of the derived DST, the optimal parameter setting is also discussed.
{"title":"Analysis of Inversely Proportional Carrier Sense Threshold and Transmission Power Setting Based on Received Power for IEEE 802.11ax","authors":"Motoki Iwata, Koji Yamamoto, Bo Yin, T. Nishio, M. Morikura, H. Abeysekera","doi":"10.1109/CCNC.2019.8651818","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651818","url":null,"abstract":"In this study, we conducted an analysis of the system performance of a wireless local area network in which access points (APs) dynamically adjust the carrier sense threshold (CST) based on the individual average received power to determine the optimal CST. Adjustment of the CST is a promising approach to improve spatial reuse and proposed for IEEE 802.11ax standard. Here, assuming to adopt the inversely proportional setting of the CST and transmission power, we can make the carrier sensing relationship symmetric, restraining throughput starvation. This paper analytically derives the density of successful transmissions (DST) on the basis of stochastic geometry. The DST is a system performance metric which expresses the number of APs whose transmission is successful based on signal-to-interference-plus-noise power ratio. We show that both results of the analytically derived DST and Monte Carlo simulation have the same trend. From the perspective of the derived DST, the optimal parameter setting is also discussed.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126203731","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-01-01DOI: 10.1109/CCNC.2019.8651722
Johannes Techel, Xiaobo Zhao, Prasad Talasila, Qi Zhang, D. Lucani
The massive increase and assimilation of Internet of Things (IoT) devices and services imposes new challenges in sensing, communication, and reliable storage of data generated by the IoT. We focus on scenarios where the IoT devices may lose connectivity for long periods of time and can only rely on other IoT devices to store data reliably. This constitutes a problem of distributed storage where lost devices cannot be replaced by others in the network due to the fact that there are no additional devices arriving to the system and that each device has a limited storage capability. Thus, state-of-the-art approaches for distributed storage in data centers are not applicable. We show that optimal policies for data repair, in terms of bandwidth and storage usage, for this novel scenario can be implemented efficiently in real-devices using network coding. We provide a translation from the theoretical results in [1] into an implementation using Raspberry Pi devices.
{"title":"Demonstration of Reliable IoT Distributed Storage using Network Codes","authors":"Johannes Techel, Xiaobo Zhao, Prasad Talasila, Qi Zhang, D. Lucani","doi":"10.1109/CCNC.2019.8651722","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651722","url":null,"abstract":"The massive increase and assimilation of Internet of Things (IoT) devices and services imposes new challenges in sensing, communication, and reliable storage of data generated by the IoT. We focus on scenarios where the IoT devices may lose connectivity for long periods of time and can only rely on other IoT devices to store data reliably. This constitutes a problem of distributed storage where lost devices cannot be replaced by others in the network due to the fact that there are no additional devices arriving to the system and that each device has a limited storage capability. Thus, state-of-the-art approaches for distributed storage in data centers are not applicable. We show that optimal policies for data repair, in terms of bandwidth and storage usage, for this novel scenario can be implemented efficiently in real-devices using network coding. We provide a translation from the theoretical results in [1] into an implementation using Raspberry Pi devices.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126074706","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-01-01DOI: 10.1109/CCNC.2019.8651867
Feixiang Zhang, Xiangwei Zhou, Mingxuan Sun
To enable heterogeneous channel valuations in spatial spectrum reuse, user characteristics involving the supply and demand relationship need to be considered. In this paper, we design a channel transaction mechanism for non-symmetric networks and maximize the social welfare in consideration of multi-level channel valuations of the secondary users (SUs). Specifically, we group the SUs into allowable user crowds (AUCs) through a modified Bron-Kerbosch algorithm. We introduce a Vickrey-Clarke-Groves (VCG) auction, in which the participants are limited to the AUCs. To facilitate the bid formation, we transform the constrained VCG auction to a step-by-step decision process. In each step, the truthful bidding of an AUC is to reveal the accumulated channel valuation of the coalition. Meanwhile, the SUs in a coalition play a coalitional game with transferable utilities. We use the Shapley value to realize fair payoff distribution among the SUs in a coalition. Furthermore, we approach the optimal channel allocation via a greedy algorithm and batch allocation. In our simulation, we compare the low-complexity algorithms and demonstrate the efficiency of the channel transaction mechanism.
{"title":"Multi-Level Channel Valuations and Coalitional Subgames in Spatial Spectrum Reuse","authors":"Feixiang Zhang, Xiangwei Zhou, Mingxuan Sun","doi":"10.1109/CCNC.2019.8651867","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651867","url":null,"abstract":"To enable heterogeneous channel valuations in spatial spectrum reuse, user characteristics involving the supply and demand relationship need to be considered. In this paper, we design a channel transaction mechanism for non-symmetric networks and maximize the social welfare in consideration of multi-level channel valuations of the secondary users (SUs). Specifically, we group the SUs into allowable user crowds (AUCs) through a modified Bron-Kerbosch algorithm. We introduce a Vickrey-Clarke-Groves (VCG) auction, in which the participants are limited to the AUCs. To facilitate the bid formation, we transform the constrained VCG auction to a step-by-step decision process. In each step, the truthful bidding of an AUC is to reveal the accumulated channel valuation of the coalition. Meanwhile, the SUs in a coalition play a coalitional game with transferable utilities. We use the Shapley value to realize fair payoff distribution among the SUs in a coalition. Furthermore, we approach the optimal channel allocation via a greedy algorithm and batch allocation. In our simulation, we compare the low-complexity algorithms and demonstrate the efficiency of the channel transaction mechanism.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122361427","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-01-01DOI: 10.1109/CCNC.2019.8651746
Chitradeep Majumdar, M. López-Benítez, A. Patel, S. Merchant
In this paper, we propose a framework to optimize the packet length and modulation level to determine the optimal packet size (OPS) for topology aware cognitive radio sensor networks (CRSNs) using a variable rate modulation scheme. A generalized network topology with specific node density of the Primary Users (PUs) is accounted to estimate the OPS. Based on stochastic geometry and non-linear optimization techniques, a joint multivariate optimization problem is formulated to determine the OPS for the topology dependent CRSNs.
{"title":"Packet Size Optimization for Topology Aware Cognitive Radio Sensor Networks","authors":"Chitradeep Majumdar, M. López-Benítez, A. Patel, S. Merchant","doi":"10.1109/CCNC.2019.8651746","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651746","url":null,"abstract":"In this paper, we propose a framework to optimize the packet length and modulation level to determine the optimal packet size (OPS) for topology aware cognitive radio sensor networks (CRSNs) using a variable rate modulation scheme. A generalized network topology with specific node density of the Primary Users (PUs) is accounted to estimate the OPS. Based on stochastic geometry and non-linear optimization techniques, a joint multivariate optimization problem is formulated to determine the OPS for the topology dependent CRSNs.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128454507","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-01-01DOI: 10.1109/CCNC.2019.8651772
Ming-Hung Chen, Kai-Wen Hu, I. Chung, Cheng-Fu Chou
Virtual reality (VR) and augmented reality (AR) are expected to change people’s daily life in the future, but it still faces many challenges. New advanced coding techniques like depth image based rendering (DIBR) mitigate the need to complete content by synthesizing the scene with nearby views. However, due to the limitation of wireless spectrum, delivering VR/AR content to many people doing some activities (e.g., watching sport in a stadium or seeing an exhibition in a museum) in mobile hotspot areas is still very challenging in terms of available bandwidth. In this work, we analyze how to multicast multi-view VR/AR 3D multimedia streams over multiple wireless access points (APs) to multiple users, and then propose a multi-view allocation (MVA) algorithm to improve the delivered content quality. The simulation results show that our MVA algorithm can achieve about 90% performance of the optimal solution and outperform non-DIBR and SSA model, by 48% and 25%, respectively.
{"title":"Towards VR/AR Multimedia Content Multicast over Wireless LAN","authors":"Ming-Hung Chen, Kai-Wen Hu, I. Chung, Cheng-Fu Chou","doi":"10.1109/CCNC.2019.8651772","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651772","url":null,"abstract":"Virtual reality (VR) and augmented reality (AR) are expected to change people’s daily life in the future, but it still faces many challenges. New advanced coding techniques like depth image based rendering (DIBR) mitigate the need to complete content by synthesizing the scene with nearby views. However, due to the limitation of wireless spectrum, delivering VR/AR content to many people doing some activities (e.g., watching sport in a stadium or seeing an exhibition in a museum) in mobile hotspot areas is still very challenging in terms of available bandwidth. In this work, we analyze how to multicast multi-view VR/AR 3D multimedia streams over multiple wireless access points (APs) to multiple users, and then propose a multi-view allocation (MVA) algorithm to improve the delivered content quality. The simulation results show that our MVA algorithm can achieve about 90% performance of the optimal solution and outperform non-DIBR and SSA model, by 48% and 25%, respectively.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132099152","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
扫码关注我们
求助内容：
应助结果提醒方式：