Pub Date : 2018-08-01DOI: 10.1109/ISWCS.2018.8491053
Shaobo Liu, Biling Zhang, Jung-Lang Yu, Zhu Han
In order to fully exploit the potentials of the heterogeneous cloud radio access networks (H-CRANs), how to associate the user equipments (UEs) with the appropriate low power nodes (LPNs) is a very essential problem. However, when the fronthaul constraint is limited, the UEs are sensitive to delay, and the LPNs are concerned about the traffic balancing, such a problem has not gained enough attention. In this paper, the aforementioned user association problem is investigated and formulated as a bidirectional matching game, where the UEs are seeking to access the most preferred LPN while the LPNs are seeking to accept the most preferred UEs. To find the solution to the proposed game, an iteration algorithm is proposed, and its computational complexity and convergence are proved as well. Simulation results show that our proposed user association scheme is effective and outperforms the existing schemes-in terms of achieved data rates, delay, traffic balancing and overall utility.
{"title":"A Delay and Traffic Balancing Sensitive Scheme for User Association in Limited Fronthaul H-CRAN s","authors":"Shaobo Liu, Biling Zhang, Jung-Lang Yu, Zhu Han","doi":"10.1109/ISWCS.2018.8491053","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491053","url":null,"abstract":"In order to fully exploit the potentials of the heterogeneous cloud radio access networks (H-CRANs), how to associate the user equipments (UEs) with the appropriate low power nodes (LPNs) is a very essential problem. However, when the fronthaul constraint is limited, the UEs are sensitive to delay, and the LPNs are concerned about the traffic balancing, such a problem has not gained enough attention. In this paper, the aforementioned user association problem is investigated and formulated as a bidirectional matching game, where the UEs are seeking to access the most preferred LPN while the LPNs are seeking to accept the most preferred UEs. To find the solution to the proposed game, an iteration algorithm is proposed, and its computational complexity and convergence are proved as well. Simulation results show that our proposed user association scheme is effective and outperforms the existing schemes-in terms of achieved data rates, delay, traffic balancing and overall utility.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133165978","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 : 2018-08-01DOI: 10.1109/ISWCS.2018.8491252
B. Zebbane, M. Chenait
In Wireless Sensor Networks, sensor nodes dissipate energy while sensing, processing, transmitting or receiving data to fulfil the mission required by the application. Measurements have shown that among of these major activities, a sensor node expends maximum energy in data communication. Since the sensor lifetime depends largely on the energy amount of its battery, consumption must be well controlled in order to maximize its lifetime after deployment. Topology control and energy efficient routing are among the most important energy conserving techniques in WSNs. However, research on the relation between topology control based sleep-scheduling and routing is very limited. In this paper, we propose a framework which integrates sleep scheduling-based topology control with multi path routing in order to exploit, more efficiently, the topology resulting after running any topology control protocol. A load balancing mechanism is adopted using a new metric that defines a priority for each path. Simulation results show the effectiveness of the proposed framework in terms of Network lifetime, Energy consumption and Throughput.
{"title":"Integrate Topology Control with Multi Path Routing to Enhance the Sensor Network Lifetime","authors":"B. Zebbane, M. Chenait","doi":"10.1109/ISWCS.2018.8491252","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491252","url":null,"abstract":"In Wireless Sensor Networks, sensor nodes dissipate energy while sensing, processing, transmitting or receiving data to fulfil the mission required by the application. Measurements have shown that among of these major activities, a sensor node expends maximum energy in data communication. Since the sensor lifetime depends largely on the energy amount of its battery, consumption must be well controlled in order to maximize its lifetime after deployment. Topology control and energy efficient routing are among the most important energy conserving techniques in WSNs. However, research on the relation between topology control based sleep-scheduling and routing is very limited. In this paper, we propose a framework which integrates sleep scheduling-based topology control with multi path routing in order to exploit, more efficiently, the topology resulting after running any topology control protocol. A load balancing mechanism is adopted using a new metric that defines a priority for each path. Simulation results show the effectiveness of the proposed framework in terms of Network lifetime, Energy consumption and Throughput.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132131184","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 : 2018-08-01DOI: 10.1109/ISWCS.2018.8491233
M. Nasimi, Mohammad Asif Habibi, B. Han, H. Schotten
In order to cope with explosive growth of data traffic which is associated with a wide plethora of emerging application and services that are expected to be used by both ordinary users and vertical industries, congestion control mechanism is considered to be vital. In this paper, we proposed a congestion control mechanism that could function within the framework of Multi-Access Edge Computing (MEC). The proposed mechanism is aiming to make real time decision for selectively buffering traffic, while taking network condition and Quality of Service (QoS) into consideration. In order to support a MEC-assisted scheme, the MEC server is expected to locally store delay-tolerant data traffics until the delay conditions expire. This enables network to have better control over the radio resource provisioning of higher priority data. To achieve this, we introduced a dedicated function known as Congestion Control Engine (CCE), which can capture Radio Access Network (RAN) condition through Radio Network Information Service (RNIS) function, and use this knowledge to make real time decision for selectively offloading traffic so that it can perform more intelligently. Analytical evaluation results of our proposed mechanism confirms that it can alleviate network congestion more efficiently.
{"title":"Edge-Assisted Congestion Control Mechanism for 5G Network Using Software-Defined Networking","authors":"M. Nasimi, Mohammad Asif Habibi, B. Han, H. Schotten","doi":"10.1109/ISWCS.2018.8491233","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491233","url":null,"abstract":"In order to cope with explosive growth of data traffic which is associated with a wide plethora of emerging application and services that are expected to be used by both ordinary users and vertical industries, congestion control mechanism is considered to be vital. In this paper, we proposed a congestion control mechanism that could function within the framework of Multi-Access Edge Computing (MEC). The proposed mechanism is aiming to make real time decision for selectively buffering traffic, while taking network condition and Quality of Service (QoS) into consideration. In order to support a MEC-assisted scheme, the MEC server is expected to locally store delay-tolerant data traffics until the delay conditions expire. This enables network to have better control over the radio resource provisioning of higher priority data. To achieve this, we introduced a dedicated function known as Congestion Control Engine (CCE), which can capture Radio Access Network (RAN) condition through Radio Network Information Service (RNIS) function, and use this knowledge to make real time decision for selectively offloading traffic so that it can perform more intelligently. Analytical evaluation results of our proposed mechanism confirms that it can alleviate network congestion more efficiently.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117316113","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 : 2018-08-01DOI: 10.1109/ISWCS.2018.8491090
Mingyang Cui, Wei-chen Zou
Hybrid precoding has been proposed as a promising technology for millimeter wave (mmWave) systems recently. However, the complexity of hybrid precoding for mm Wave multiple-input multiple-output systems is still high. In this paper, we propose a low-complexity joint hybrid precoding algorithm. By introducing the concept of equivalent channel, the hybrid precoding problem can be formulated as the problem of maximizing the gain of the equivalent channel. To solve this problem, we jointly design the radio-frequency precoder and combiner by selecting the appropriate codewords in an orthogonal codebook. Then, we complete the baseband precoder and combiner jointly through the singular value decomposition of the equivalent channel. The simulation results show that comparing with classical orthogonal matching pursuit algorithm, the proposed algorithm could achieve similar performance with much lower complexity. Furthermore, the proposed algorithm will be more efficient with the increase of antennas.
{"title":"Joint Hybrid Precoding Based on Orthogonal Codebook in Millimeter Wave Systems","authors":"Mingyang Cui, Wei-chen Zou","doi":"10.1109/ISWCS.2018.8491090","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491090","url":null,"abstract":"Hybrid precoding has been proposed as a promising technology for millimeter wave (mmWave) systems recently. However, the complexity of hybrid precoding for mm Wave multiple-input multiple-output systems is still high. In this paper, we propose a low-complexity joint hybrid precoding algorithm. By introducing the concept of equivalent channel, the hybrid precoding problem can be formulated as the problem of maximizing the gain of the equivalent channel. To solve this problem, we jointly design the radio-frequency precoder and combiner by selecting the appropriate codewords in an orthogonal codebook. Then, we complete the baseband precoder and combiner jointly through the singular value decomposition of the equivalent channel. The simulation results show that comparing with classical orthogonal matching pursuit algorithm, the proposed algorithm could achieve similar performance with much lower complexity. Furthermore, the proposed algorithm will be more efficient with the increase of antennas.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"6 48","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114044437","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 : 2018-08-01DOI: 10.1109/ISWCS.2018.8491249
Lanfranco Zanzi, Vincenzo Sciancalepore
The upcoming 5th generation (5G) of mobile networks is being designed to significantly improve the performance of the current network deployments by introducing more flexibility and scalability while, at the same time, optimizing the spectrum utilization and energy efficiency of radio communications. Among such novelties, Network Slicing is emerging as the key-concept in the 5G landscape, able to provide the means for the concurrent deployment of heterogeneous services over a common physical network. In this paper, we investigate current technologies, open issues and possible solutions while addressing the most critical requirement envisioned with the advent of advanced services, i.e., the provisioning of stringent end-to-end delay guarantees as a pillar of the novel Ultra Reliable and Low Latency Communication (URLLC) service type.
{"title":"On Guaranteeing End-to-End Network Slice Latency Constraints in 5G Networks","authors":"Lanfranco Zanzi, Vincenzo Sciancalepore","doi":"10.1109/ISWCS.2018.8491249","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491249","url":null,"abstract":"The upcoming 5th generation (5G) of mobile networks is being designed to significantly improve the performance of the current network deployments by introducing more flexibility and scalability while, at the same time, optimizing the spectrum utilization and energy efficiency of radio communications. Among such novelties, Network Slicing is emerging as the key-concept in the 5G landscape, able to provide the means for the concurrent deployment of heterogeneous services over a common physical network. In this paper, we investigate current technologies, open issues and possible solutions while addressing the most critical requirement envisioned with the advent of advanced services, i.e., the provisioning of stringent end-to-end delay guarantees as a pillar of the novel Ultra Reliable and Low Latency Communication (URLLC) service type.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123798383","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 : 2018-08-01DOI: 10.1109/ISWCS.2018.8491061
Elena Peralta, Toni Levanen, T. Ihalainen, Sari Nielsen, M. Ng, M. Renfors, M. Valkama
In this paper, we address and analyze the receiver reference sensitivity requirements for the 5G New Radio (NR) wireless communications systems, which relate to the SNR requirements at the base station to reach 95 % of the maximum throughput defined for fixed reference channels. Based on the latest 3GPP specifications and evaluation assumptions agreed for Release 15, a wide set of different transmission bandwidths and radio interface numerologies are investigated, at sub-6GHz and millimeter-wave frequency ranges, covering both AWGN and fading channel scenarios as well as varying mobility conditions. The performance results in terms of the relative throughput and block error rate using LDPC coding scheme are presented and analyzed, while for comparison purposes also LTE turbo code based results are provided. The results show that in frequency-selective channels, the reference sensitivity and UL radio link performance are systematically better with LDPC code compared to turbo code. The results also indicate that the purely front-loaded demodulation reference signal (DM-RS) based system can outperform the corresponding two DM-RS based system even at higher velocities and high center frequencies, allowing low decoding latency and efficient pipelined receiver processing.
{"title":"5G New Radio Base-Station Sensitivity and Performance","authors":"Elena Peralta, Toni Levanen, T. Ihalainen, Sari Nielsen, M. Ng, M. Renfors, M. Valkama","doi":"10.1109/ISWCS.2018.8491061","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491061","url":null,"abstract":"In this paper, we address and analyze the receiver reference sensitivity requirements for the 5G New Radio (NR) wireless communications systems, which relate to the SNR requirements at the base station to reach 95 % of the maximum throughput defined for fixed reference channels. Based on the latest 3GPP specifications and evaluation assumptions agreed for Release 15, a wide set of different transmission bandwidths and radio interface numerologies are investigated, at sub-6GHz and millimeter-wave frequency ranges, covering both AWGN and fading channel scenarios as well as varying mobility conditions. The performance results in terms of the relative throughput and block error rate using LDPC coding scheme are presented and analyzed, while for comparison purposes also LTE turbo code based results are provided. The results show that in frequency-selective channels, the reference sensitivity and UL radio link performance are systematically better with LDPC code compared to turbo code. The results also indicate that the purely front-loaded demodulation reference signal (DM-RS) based system can outperform the corresponding two DM-RS based system even at higher velocities and high center frequencies, allowing low decoding latency and efficient pipelined receiver processing.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125083696","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 : 2018-08-01DOI: 10.1109/ISWCS.2018.8491228
Pedro M. Gameiro, R. Rocha
A cubesat is a very small, low cost, artificial satellite designed for space research purposes, very popular in the academic community. The ISTsat-1 is the first cubesat being developed in Instituto Superior Tecnico (IST)[1], with a IU size (103cm cube). In space, communication links are typically unstable, with high delays and low throughputs and where disruptions can be frequent. This motivated the creation of Delay/Disruptive Tolerant Network (DTN) protocols, a concept designed to deal with the characteristic problems of disruptive environments. However, even with DTN, the transmission of big data files can be difficult. This is specially true in the case of cubesats, working typically in Low Earth Orbits (LEO), which suffer from very long disruptions periods with the Ground Stations (GS) on Earth. In this project we intend to create an enhanced solution, a distributed DTN protocol capable of performing normal DTN tasks, but in a manner where a single transmission can be distributed over different GS, thus increasing the number of links, reducing the disruption time periods and increasing the much needed performance of space transmissions.
{"title":"Distributed Delay Tolerant Protocol","authors":"Pedro M. Gameiro, R. Rocha","doi":"10.1109/ISWCS.2018.8491228","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491228","url":null,"abstract":"A cubesat is a very small, low cost, artificial satellite designed for space research purposes, very popular in the academic community. The ISTsat-1 is the first cubesat being developed in Instituto Superior Tecnico (IST)[1], with a IU size (103cm cube). In space, communication links are typically unstable, with high delays and low throughputs and where disruptions can be frequent. This motivated the creation of Delay/Disruptive Tolerant Network (DTN) protocols, a concept designed to deal with the characteristic problems of disruptive environments. However, even with DTN, the transmission of big data files can be difficult. This is specially true in the case of cubesats, working typically in Low Earth Orbits (LEO), which suffer from very long disruptions periods with the Ground Stations (GS) on Earth. In this project we intend to create an enhanced solution, a distributed DTN protocol capable of performing normal DTN tasks, but in a manner where a single transmission can be distributed over different GS, thus increasing the number of links, reducing the disruption time periods and increasing the much needed performance of space transmissions.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115735669","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 : 2018-08-01DOI: 10.1109/ISWCS.2018.8491089
Tianyu Yang, Yulin Hu, M. C. Gursoy, A. Schmeink, R. Mathar
In this paper, we investigate strategies for the allocation of computational resources using deep reinforcement learning in mobile edge computing networks that operate with finite blocklength codes to support low latency communications. The end-to-end (E2E) reliability of the service is addressed, while both the delay violation probability and the decoding error probability are taken into account. By employing a deep reinforcement learning method, namely deep Q-learning, we design an intelligent agent at the edge computing node to develop a real-time adaptive policy for computational resource allocation for offloaded tasks of multiple users in order to improve the average E2E reliability. Via simulations, we show that under different task arrival rates, the realized policy serves to increase the task number that decreases the delay violation rate while guaranteeing an acceptable level of decoding error probability. Moreover, we show that the proposed deep reinforcement learning approach outperforms the random and equal scheduling benchmarks.
{"title":"Deep Reinforcement Learning based Resource Allocation in Low Latency Edge Computing Networks","authors":"Tianyu Yang, Yulin Hu, M. C. Gursoy, A. Schmeink, R. Mathar","doi":"10.1109/ISWCS.2018.8491089","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491089","url":null,"abstract":"In this paper, we investigate strategies for the allocation of computational resources using deep reinforcement learning in mobile edge computing networks that operate with finite blocklength codes to support low latency communications. The end-to-end (E2E) reliability of the service is addressed, while both the delay violation probability and the decoding error probability are taken into account. By employing a deep reinforcement learning method, namely deep Q-learning, we design an intelligent agent at the edge computing node to develop a real-time adaptive policy for computational resource allocation for offloaded tasks of multiple users in order to improve the average E2E reliability. Via simulations, we show that under different task arrival rates, the realized policy serves to increase the task number that decreases the delay violation rate while guaranteeing an acceptable level of decoding error probability. Moreover, we show that the proposed deep reinforcement learning approach outperforms the random and equal scheduling benchmarks.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114526421","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 : 2018-08-01DOI: 10.1109/ISWCS.2018.8491215
Andreia Pereira, Pedro Bento, M. Gomes, R. Dinis, V. Silva
This paper considers multiple-input multiple-output (MIMO) schemes employing the recently proposed time-interleaved block windowed burst-OFDM (TIBWB-OFDM) modulation combined with frequency-domain receivers based on the iterative block decision feedback equalization (IB-DFE) principle, concerning an uplink transmission. It is shown that TIBWB-OFDM technique is easily combined with MIMO systems, allowing efficient spectral usage with low out-of-band (OOB) emissions as well as gains in terms of power efficiency. In addition, its additional diversity associated with the capabilities of the powerful IB-DFE equalizer, that although requiring matrix inversions, it can provide excellent results, makes this combination of techniques interesting for scenarios with moderate number of antenna-elements, where the complexity can be manageable.
{"title":"MIMO Time-Interleaved Block Windowed Burst OFDM with Iterative Frequency Domain Equalization","authors":"Andreia Pereira, Pedro Bento, M. Gomes, R. Dinis, V. Silva","doi":"10.1109/ISWCS.2018.8491215","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491215","url":null,"abstract":"This paper considers multiple-input multiple-output (MIMO) schemes employing the recently proposed time-interleaved block windowed burst-OFDM (TIBWB-OFDM) modulation combined with frequency-domain receivers based on the iterative block decision feedback equalization (IB-DFE) principle, concerning an uplink transmission. It is shown that TIBWB-OFDM technique is easily combined with MIMO systems, allowing efficient spectral usage with low out-of-band (OOB) emissions as well as gains in terms of power efficiency. In addition, its additional diversity associated with the capabilities of the powerful IB-DFE equalizer, that although requiring matrix inversions, it can provide excellent results, makes this combination of techniques interesting for scenarios with moderate number of antenna-elements, where the complexity can be manageable.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128387012","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 : 2018-08-01DOI: 10.1109/ISWCS.2018.8491204
Roy Karasik, O. Simeone, S. Shamai
In a Fog-Radio Access Network (F-RAN), edge caching and fronthaul connectivity to a cloud processor are utilized for the purpose of content delivery. Additional Device-to-Device (D2D) communication capabilities can support the operation of an F - RAN by alleviating fronthaul and cloud processing load, and reducing the delivery time. In this work, basic limits on the normalized delivery time (NDT) metric, which captures the high signal-to-noise ratio worst-case latency for delivering any requested content to the users, are derived. Assuming proactive offline caching, out-of-band D2D communication, and an F-RAN with two edge nodes and two users, an information-theoretically optimal caching and delivery strategy is presented. Unlike prior work, the NDT performance is studied under pipelined transmission, whereby the edge nodes transmit on the wireless channel while simultaneously receiving messages over the fronthaul links, and the users transmit messages over the D2D links while at the same time receiving on the wireless channel. Insights are provided on the regimes in which D2D communication is beneficial, and the maximum improvement to the latency is characterized.
{"title":"Information- Theoretic Analysis of D2D-Aided Pipelined Content Delivery in Fog-RAN","authors":"Roy Karasik, O. Simeone, S. Shamai","doi":"10.1109/ISWCS.2018.8491204","DOIUrl":"https://doi.org/10.1109/ISWCS.2018.8491204","url":null,"abstract":"In a Fog-Radio Access Network (F-RAN), edge caching and fronthaul connectivity to a cloud processor are utilized for the purpose of content delivery. Additional Device-to-Device (D2D) communication capabilities can support the operation of an F - RAN by alleviating fronthaul and cloud processing load, and reducing the delivery time. In this work, basic limits on the normalized delivery time (NDT) metric, which captures the high signal-to-noise ratio worst-case latency for delivering any requested content to the users, are derived. Assuming proactive offline caching, out-of-band D2D communication, and an F-RAN with two edge nodes and two users, an information-theoretically optimal caching and delivery strategy is presented. Unlike prior work, the NDT performance is studied under pipelined transmission, whereby the edge nodes transmit on the wireless channel while simultaneously receiving messages over the fronthaul links, and the users transmit messages over the D2D links while at the same time receiving on the wireless channel. Insights are provided on the regimes in which D2D communication is beneficial, and the maximum improvement to the latency is characterized.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128561198","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
扫码关注我们
求助内容：
应助结果提醒方式：