首页 > 最新文献

2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)最新文献

英文 中文
Outdoor Experiments on 5G Radio Access Using BS and UE Beamforming in 28-GHz Frequency Band 28 ghz频段BS和UE波束成形5G无线接入室外实验
Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651808
D. Kurita, Daisuke Kitayama, K. Tateishi, A. Harada, Y. Kishiyama, Shoji Itoh, H. Murai, Jong-Kae Fwu, Xiangyang Zhuang, K. Stewart, A. Simonsson, Peter Ökvist
This paper presents outdoor field experimental results in the 28-GHz frequency band of a 5G radio access system where base stations (BSs) are installed on buildings to deploy a 5G trial area in the Tokyo Odaiba waterfront area. This is an early field trial assessment of key 5G features such as BS and mobile station (MS) beam tracking, being deployed in dense urban areas. In the trial area, a variety of key 5G technologies and conditions are evaluated such as BS and MS massive multiple-input multiple-output (MIMO) antennas, beamforming and tracking, use of the high 28-GHz frequency, the wide frequency bandwidth of 400 MHz, intra-baseband unit (BBU) hand over (HO), and a coverage area in a realistic urban deployment with four different trial courses. Experimental results show that throughput exceeding 1 Gbps is achieved in the experiment area, and approximately 200 Mbps is achieved at 500 m away from the BS. We confirm that beam tracking and intra-BBU HO operate effectively while compensating for high path loss in the 28-GHz band to achieve a coverage area of 500 m. On the other hand, line of sight (LoS) and Non-LoS conditions are critical to 5G performance in the 28-GHz band, and we find that 5G connections may drop behind trees, buildings, and/or under a footbridge. The trial results show that the downlink throughput exceeds 50 Mbps in 85%, 50%, 70%, and 33% of the four different trial courses, respectively.
本文介绍了在东京台场滨水区建设5G试验区,在建筑物上安装基站(BSs)的5G无线接入系统28 ghz频段的室外现场实验结果。这是对部署在密集城市地区的BS和移动台(MS)波束跟踪等5G关键功能的早期现场试验评估。在试验区,通过四种不同的试验课程,评估了多种5G关键技术和条件,如BS和MS大规模多输入多输出(MIMO)天线,波束成形和跟踪,28 ghz高频率的使用,400 MHz的宽频率带宽,基带内单元(BBU)移交(HO)以及现实城市部署的覆盖区域。实验结果表明,在实验区域内实现了超过1 Gbps的吞吐量,在距离基站500 m处实现了约200 Mbps的吞吐量。我们证实,波束跟踪和bbu内HO有效运行,同时补偿了28 ghz频段的高路径损耗,实现了500米的覆盖面积。另一方面,视线(LoS)和非LoS条件对28 ghz频段的5G性能至关重要,我们发现5G连接可能会落在树木、建筑物和/或人行天桥下面。试验结果表明,在四种不同的试验过程中,下行链路吞吐量分别在85%、50%、70%和33%中超过50mbps。
{"title":"Outdoor Experiments on 5G Radio Access Using BS and UE Beamforming in 28-GHz Frequency Band","authors":"D. Kurita, Daisuke Kitayama, K. Tateishi, A. Harada, Y. Kishiyama, Shoji Itoh, H. Murai, Jong-Kae Fwu, Xiangyang Zhuang, K. Stewart, A. Simonsson, Peter Ökvist","doi":"10.1109/CCNC.2019.8651808","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651808","url":null,"abstract":"This paper presents outdoor field experimental results in the 28-GHz frequency band of a 5G radio access system where base stations (BSs) are installed on buildings to deploy a 5G trial area in the Tokyo Odaiba waterfront area. This is an early field trial assessment of key 5G features such as BS and mobile station (MS) beam tracking, being deployed in dense urban areas. In the trial area, a variety of key 5G technologies and conditions are evaluated such as BS and MS massive multiple-input multiple-output (MIMO) antennas, beamforming and tracking, use of the high 28-GHz frequency, the wide frequency bandwidth of 400 MHz, intra-baseband unit (BBU) hand over (HO), and a coverage area in a realistic urban deployment with four different trial courses. Experimental results show that throughput exceeding 1 Gbps is achieved in the experiment area, and approximately 200 Mbps is achieved at 500 m away from the BS. We confirm that beam tracking and intra-BBU HO operate effectively while compensating for high path loss in the 28-GHz band to achieve a coverage area of 500 m. On the other hand, line of sight (LoS) and Non-LoS conditions are critical to 5G performance in the 28-GHz band, and we find that 5G connections may drop behind trees, buildings, and/or under a footbridge. The trial results show that the downlink throughput exceeds 50 Mbps in 85%, 50%, 70%, and 33% of the four different trial courses, respectively.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126470193","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}
引用次数: 5
Automated Generation of User-Tailored and Time-Sensitive Music Playlists 自动生成用户定制和时间敏感的音乐播放列表
Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651820
M. Furini, Jessica Martini, M. Montangero
Streaming music platforms have changed the way people listen to music. Today, we can access to millions of songs with a simple internet-connected device. The drawback is that the selection of what to listen is a long, tedious, ant time-consuming process. This is why, nowadays, we choose playlists instead of songs. Unfortunately, since there are thousands of playlists, the selection process can once again be long, tedious, and time-consuming. In this paper, we design a system to facilitate the listening and discovering of new music. The system automatically generates user-tailored and time-sensitive music playlists and proposes a single playlist to play when the user accesses to a music platform. The system understands the user’s listening habits by analyzing the low-level features of songs recently played by the user and by using two different clustering algorithms. A novel designed method uses these data to produce a playlist that expands the user’s musical knowledge keeping in mind that a good playlist must contain a mix of new and known music and artists. An implementation based on the Spotify API proved the effectiveness of the approach and showed that the proposal might provide benefits to both users (no time wasted to select what to play) and to music platforms (playing of music that otherwise would remain unknown to users).
流媒体音乐平台改变了人们听音乐的方式。今天,我们可以通过一个简单的互联网连接设备访问数百万首歌曲。缺点是选择要听的内容是一个漫长、乏味、耗时的过程。这就是为什么现在我们选择播放列表而不是歌曲。不幸的是,由于有成千上万的播放列表,选择过程可能再次变得漫长、乏味和耗时。在本文中,我们设计了一个系统来促进新音乐的聆听和发现。该系统自动生成用户定制的、具有时间敏感性的音乐播放列表,并在用户访问音乐平台时提出单个播放列表。该系统通过分析用户最近播放的歌曲的低级特征和使用两种不同的聚类算法来了解用户的收听习惯。一种新颖的设计方法使用这些数据来生成一个播放列表,扩展用户的音乐知识,记住,一个好的播放列表必须包含新的和已知的音乐和艺术家的混合。基于Spotify API的实现证明了该方法的有效性,并表明该建议可能对用户(没有时间浪费选择播放什么)和音乐平台(播放用户不知道的音乐)都有好处。
{"title":"Automated Generation of User-Tailored and Time-Sensitive Music Playlists","authors":"M. Furini, Jessica Martini, M. Montangero","doi":"10.1109/CCNC.2019.8651820","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651820","url":null,"abstract":"Streaming music platforms have changed the way people listen to music. Today, we can access to millions of songs with a simple internet-connected device. The drawback is that the selection of what to listen is a long, tedious, ant time-consuming process. This is why, nowadays, we choose playlists instead of songs. Unfortunately, since there are thousands of playlists, the selection process can once again be long, tedious, and time-consuming. In this paper, we design a system to facilitate the listening and discovering of new music. The system automatically generates user-tailored and time-sensitive music playlists and proposes a single playlist to play when the user accesses to a music platform. The system understands the user’s listening habits by analyzing the low-level features of songs recently played by the user and by using two different clustering algorithms. A novel designed method uses these data to produce a playlist that expands the user’s musical knowledge keeping in mind that a good playlist must contain a mix of new and known music and artists. An implementation based on the Spotify API proved the effectiveness of the approach and showed that the proposal might provide benefits to both users (no time wasted to select what to play) and to music platforms (playing of music that otherwise would remain unknown to users).","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125988437","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}
引用次数: 7
Optimally Designing Virtualized CDN Maximizing Profit of Content Providers 优化设计虚拟化CDN最大化利润的内容提供商
Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651800
N. Kamiyama, Yutaro Hosokawa
Recently, the virtualized CDN such as Amazon CloudFront has been widely used. In the virtualized CDN, cache servers are provided on virtual machines of cloud datacenters. Using the virtualized CDN, content providers can flexibly select the regions of using cache servers according to the geographical demand pattern of their users, so content providers can expect to reduce the cost of using CDN. However, to maximize the profit of content providers, they need to carefully select the locations of cache servers which affect the quality perceived by users as well as the total cost. In this paper, we propose a method of optimally selecting the geographical regions to use cache servers in the virtualized CDN maximizing the profit of the content providers.
最近,虚拟化的CDN(如Amazon CloudFront)得到了广泛的应用。在虚拟化CDN中,缓存服务器提供在云数据中心的虚拟机上。通过虚拟化的CDN,内容提供商可以根据其用户的地理需求模式灵活选择使用缓存服务器的区域,从而降低内容提供商使用CDN的成本。然而,为了使内容提供商的利润最大化,他们需要仔细选择缓存服务器的位置,这不仅会影响用户感知的质量,还会影响总成本。在本文中,我们提出了一种在虚拟化CDN中使用缓存服务器的最佳地理区域选择方法,使内容提供商的利润最大化。
{"title":"Optimally Designing Virtualized CDN Maximizing Profit of Content Providers","authors":"N. Kamiyama, Yutaro Hosokawa","doi":"10.1109/CCNC.2019.8651800","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651800","url":null,"abstract":"Recently, the virtualized CDN such as Amazon CloudFront has been widely used. In the virtualized CDN, cache servers are provided on virtual machines of cloud datacenters. Using the virtualized CDN, content providers can flexibly select the regions of using cache servers according to the geographical demand pattern of their users, so content providers can expect to reduce the cost of using CDN. However, to maximize the profit of content providers, they need to carefully select the locations of cache servers which affect the quality perceived by users as well as the total cost. In this paper, we propose a method of optimally selecting the geographical regions to use cache servers in the virtualized CDN maximizing the profit of the content providers.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127149842","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}
引用次数: 3
CCNC 2019 Committees
Pub Date : 2019-01-01 DOI: 10.1109/ccnc.2019.8651685
{"title":"CCNC 2019 Committees","authors":"","doi":"10.1109/ccnc.2019.8651685","DOIUrl":"https://doi.org/10.1109/ccnc.2019.8651685","url":null,"abstract":"","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127342539","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}
引用次数: 0
Advanced GTS Scheduling in IEEE 802.15.4 Networks for Industrial Application IEEE 802.15.4工业网络中的高级GTS调度
Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651809
T. Dinh, P. Ha
Beacon-enabled IEEE 802.15.4 standard has been widely applied for industrial applications because it can provide contention-free access by using guaranteed time slots (GTSs) in contention-free period (CFP) of a super frame. In IEEE 802.15.4 networks, sensors can also request GTSs for purpose of reliable communication. In existing GTS scheduling studies, however, a sensor wishing to use GTSs has to send a GTS request to a network coordinator. The sending of the GTS request by using carrier sense multiple access with collision avoidance (CSMA/CA) algorithm in fact creates more traffic in the networks. This results in more collisions and packets blocking probability. In addition, if the transmission of GTS request is failed, bandwidth utilization can be low because all GTSs are not allocated. This paper therefore proposes an advanced GTS scheduling (AGS) algorithm, applied in homogeneous networks, to solve those problems. The proposed algorithm eliminates the sending GTS request and allocates GTSs to sensors based on their time order of discovery and the observation of actual allocated GTS usage. Simulation results show that AGS algorithm improves the performance of IEEE 802.15.4 networks in term of bandwidth utilization, packet blocking probability and number of collision per transmission request. In some scenarios, packet blocking probability is reduced about 30 %.
基于信标的IEEE 802.15.4标准通过在超级帧的无争期(CFP)中使用保证时隙(gts)提供无争接入,在工业应用中得到了广泛的应用。在IEEE 802.15.4网络中,传感器也可以请求gts以实现可靠的通信。然而,在现有的GTS调度研究中,希望使用GTS的传感器必须向网络协调器发送GTS请求。采用避免碰撞的载波感知多址(CSMA/CA)算法发送GTS请求实际上会增加网络的流量。这导致了更多的碰撞和数据包阻塞概率。此外,如果GTS请求传输失败,带宽利用率可能会很低,因为没有分配所有的GTS。因此,本文提出了一种应用于同构网络的先进的GTS调度算法来解决这些问题。该算法消除了发送GTS请求,并根据传感器的发现时间顺序和实际分配的GTS使用情况来分配GTS。仿真结果表明,AGS算法在带宽利用率、分组阻塞概率和每次传输请求的碰撞次数方面提高了IEEE 802.15.4网络的性能。在某些场景下,数据包阻塞概率降低了30%左右。
{"title":"Advanced GTS Scheduling in IEEE 802.15.4 Networks for Industrial Application","authors":"T. Dinh, P. Ha","doi":"10.1109/CCNC.2019.8651809","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651809","url":null,"abstract":"Beacon-enabled IEEE 802.15.4 standard has been widely applied for industrial applications because it can provide contention-free access by using guaranteed time slots (GTSs) in contention-free period (CFP) of a super frame. In IEEE 802.15.4 networks, sensors can also request GTSs for purpose of reliable communication. In existing GTS scheduling studies, however, a sensor wishing to use GTSs has to send a GTS request to a network coordinator. The sending of the GTS request by using carrier sense multiple access with collision avoidance (CSMA/CA) algorithm in fact creates more traffic in the networks. This results in more collisions and packets blocking probability. In addition, if the transmission of GTS request is failed, bandwidth utilization can be low because all GTSs are not allocated. This paper therefore proposes an advanced GTS scheduling (AGS) algorithm, applied in homogeneous networks, to solve those problems. The proposed algorithm eliminates the sending GTS request and allocates GTSs to sensors based on their time order of discovery and the observation of actual allocated GTS usage. Simulation results show that AGS algorithm improves the performance of IEEE 802.15.4 networks in term of bandwidth utilization, packet blocking probability and number of collision per transmission request. In some scenarios, packet blocking probability is reduced about 30 %.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114577389","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}
引用次数: 9
A Lightweight Trust-Based Security Architecture for RPL in Mobile IoT Networks 移动物联网RPL中基于信任的轻量级安全架构
Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651846
P. Thulasiraman, Yizhong Wang
Military communities have come to rely heavily on commercial off the shelf (COTS) standards and technologies for Internet of Things (IoT) operations. One of the major obstacles to military use of COTS IoT devices is the security of data transfer. In this paper, we successfully design and develop a lightweight, trust-based security architecture to support routing in a mobile IoT network. Specifically, we modify the RPL IoT routing algorithm using common security techniques, including a nonce identity value, timestamp, and network whitelist. Our approach allows RPL to select a routing path over a mobile IoT wireless network based on a computed node trust value and average received signal strength indicator (ARSSI) value across network members. We conducted simulations using the Cooja network simulator and Wireshark to validate the algorithm against stipulated threat models. We demonstrate that our algorithm can protect the network against Denial of Service (DoS) and Sybil based identity attacks. We also show that the control overhead required for our algorithm is less than 5% and that the packet delivery rate improves by nearly 10%.
军事社区已经开始严重依赖商用现货(COTS)标准和技术来进行物联网(IoT)操作。军用COTS物联网设备的主要障碍之一是数据传输的安全性。在本文中,我们成功地设计和开发了一个轻量级的、基于信任的安全架构,以支持移动物联网网络中的路由。具体来说,我们使用常见的安全技术修改RPL IoT路由算法,包括nonce身份值、时间戳和网络白名单。我们的方法允许RPL根据计算的节点信任值和网络成员之间的平均接收信号强度指标(ARSSI)值,在移动物联网无线网络上选择路由路径。我们使用Cooja网络模拟器和Wireshark进行了模拟,以验证算法对规定的威胁模型的有效性。我们证明了我们的算法可以保护网络免受拒绝服务(DoS)和基于Sybil的身份攻击。我们还表明,我们的算法所需的控制开销小于5%,数据包传输速率提高了近10%。
{"title":"A Lightweight Trust-Based Security Architecture for RPL in Mobile IoT Networks","authors":"P. Thulasiraman, Yizhong Wang","doi":"10.1109/CCNC.2019.8651846","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651846","url":null,"abstract":"Military communities have come to rely heavily on commercial off the shelf (COTS) standards and technologies for Internet of Things (IoT) operations. One of the major obstacles to military use of COTS IoT devices is the security of data transfer. In this paper, we successfully design and develop a lightweight, trust-based security architecture to support routing in a mobile IoT network. Specifically, we modify the RPL IoT routing algorithm using common security techniques, including a nonce identity value, timestamp, and network whitelist. Our approach allows RPL to select a routing path over a mobile IoT wireless network based on a computed node trust value and average received signal strength indicator (ARSSI) value across network members. We conducted simulations using the Cooja network simulator and Wireshark to validate the algorithm against stipulated threat models. We demonstrate that our algorithm can protect the network against Denial of Service (DoS) and Sybil based identity attacks. We also show that the control overhead required for our algorithm is less than 5% and that the packet delivery rate improves by nearly 10%.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121435578","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}
引用次数: 29
Demonstration of Mobile Edge Cloud for 5G Connected Cars 5G车联网移动边缘云演示
Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651783
Oleksandr Zhdanenko, Jianhui Liu, Roberto Torre Arranz, S. Mudriievskyi, H. Salah, Giang T. Nguyen, F. Fitzek
This demonstration shows both the utility of Mobile Edge Cloud (MEC) for 5G connected cars, as well as the impact of MEC server selection (i.e. migration) strategy on latency. The demonstration simulates cars moving according to a realistic model inside the city of Munich, and implements different MEC server selection strategies. A player can steer an ambulance using a controller, and can also choose one among four server selection strategies while driving. With each strategy, the player will experience a different latency.
该演示展示了移动边缘云(MEC)对5G联网汽车的效用,以及MEC服务器选择(即迁移)策略对延迟的影响。该演示根据现实模型模拟了在慕尼黑市内行驶的汽车,并实现了不同的MEC服务器选择策略。玩家可以使用控制器驾驶救护车,也可以在驾驶时选择四种服务器选择策略中的一种。对于每种策略,玩家将体验到不同的延迟。
{"title":"Demonstration of Mobile Edge Cloud for 5G Connected Cars","authors":"Oleksandr Zhdanenko, Jianhui Liu, Roberto Torre Arranz, S. Mudriievskyi, H. Salah, Giang T. Nguyen, F. Fitzek","doi":"10.1109/CCNC.2019.8651783","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651783","url":null,"abstract":"This demonstration shows both the utility of Mobile Edge Cloud (MEC) for 5G connected cars, as well as the impact of MEC server selection (i.e. migration) strategy on latency. The demonstration simulates cars moving according to a realistic model inside the city of Munich, and implements different MEC server selection strategies. A player can steer an ambulance using a controller, and can also choose one among four server selection strategies while driving. With each strategy, the player will experience a different latency.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122214419","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}
引用次数: 10
A Low-pass Filtered Time-domain Window for DFTs-OFDM to Reduce Out-of-band Emission with Low Complexity 低复杂度dft - ofdm低通滤波时域窗口减少带外发射
Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651816
Yuji Mizutani, K. Mizutani, T. Matsumura, H. Harada
The enhanced universal filtered-DFTs-OFDM (eUF-DFTs-OFDM) has been proposed for reducing the out-of-band emission (OOBE) drastically with low peak-to-average power ratio (PAPR). However, this scheme has high complexity due to the time-domain convolution of LPF. In this paper, we propose a new time-domain windowing function for the universal time-domain windowed-DFTs-OFDM (UTW-DFTs-OFDM) to reduce the OOBE with low PAPR and low implementation complexity by using a time response of the LPF for the eUF-DFTs-OFDM. The performance of the proposed time-domain window function is evaluated by simulation in terms of OOBE, PAPR, block error rate (BLER), and implementation complexity with the LTE uplink parameters. As a result, we achieve almost same performance as the eUF-DFTs-OFDM with the significant reduction of the number of multipliers used for wave-shaping.
提出了一种增强型通用滤波- dft - ofdm (euf - dft - ofdm)技术,该技术具有较低的峰均功率比(PAPR),能大幅度降低带外发射(OOBE)。然而,由于LPF的时域卷积性,该方案具有较高的复杂度。本文提出了一种新的通用时域加窗dft - ofdm (utw - dft - ofdm)的时域加窗函数,利用euf - dft - ofdm的LPF的时间响应来减少低PAPR和低实现复杂度的OOBE。在LTE上行链路参数下,通过仿真对所提时域窗函数的OOBE、PAPR、分组错误率(BLER)和实现复杂度进行了评价。因此,我们实现了与euf - dft - ofdm几乎相同的性能,同时显着减少了用于波形整形的乘法器数量。
{"title":"A Low-pass Filtered Time-domain Window for DFTs-OFDM to Reduce Out-of-band Emission with Low Complexity","authors":"Yuji Mizutani, K. Mizutani, T. Matsumura, H. Harada","doi":"10.1109/CCNC.2019.8651816","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651816","url":null,"abstract":"The enhanced universal filtered-DFTs-OFDM (eUF-DFTs-OFDM) has been proposed for reducing the out-of-band emission (OOBE) drastically with low peak-to-average power ratio (PAPR). However, this scheme has high complexity due to the time-domain convolution of LPF. In this paper, we propose a new time-domain windowing function for the universal time-domain windowed-DFTs-OFDM (UTW-DFTs-OFDM) to reduce the OOBE with low PAPR and low implementation complexity by using a time response of the LPF for the eUF-DFTs-OFDM. The performance of the proposed time-domain window function is evaluated by simulation in terms of OOBE, PAPR, block error rate (BLER), and implementation complexity with the LTE uplink parameters. As a result, we achieve almost same performance as the eUF-DFTs-OFDM with the significant reduction of the number of multipliers used for wave-shaping.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126579746","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}
引用次数: 5
Subcarrier-Index Modulation for Reed Solomon Encoded OFDM-Based Visible Light Communication 基于Reed Solomon编码ofdm的可见光通信子载波索引调制
Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651864
N. Taherkhani, K. Kiasaleh
In this paper, we propose the subcarrier-index modulation with Reed Solomon encoded Optical Orthogonal Frequency Division Multiplexing with index modulation (IM-RS-OFDM) scheme for visible light communication (VLC). In this technique, the data is encoded using an RS codeword and then part of the redundancy introduced by the frame which exceeds the clipping range are punctured and their corresponding subcarriers are set as inactive, where the indices of these inactive subcarriers are used to transmit extra information bits. The puncturing of the redundancy aids in mitigating clipping noise generated due to the dynamic range constraints of the optical transmitter by shortening the number of active subcarriers, while the locations of the punctured subcarriers are exploited to convey more bits in order to compensate for the reduction in spectral efficiency caused by coding redundancy. In the proposed scheme, the bipolar transmitting signal is clipped and biased according to DC bias optical OFDM (DCO-OFDM) system, and a Log-Likelihood ratio (LLR) calculation based detector is used to find the indices of punctured symbols in the codeword. Our simulation results show that the new scheme offers a better bit error rate performance compared to the conventional coded OFDM-based visible light communication.
本文提出了一种基于里德-所罗门编码的光正交频分复用索引调制(IM-RS-OFDM)的可见光通信子载波索引调制方案。在这种技术中,使用RS码字对数据进行编码,然后戳破帧引入的超过裁剪范围的冗余部分,并将其相应的子载波设置为非活动,其中这些非活动子载波的索引用于传输额外的信息位。通过减少有源子载波的数量,对冗余的穿刺有助于减轻由于光发射机动态范围限制而产生的裁剪噪声,同时利用被穿刺的子载波的位置来传输更多的比特,以补偿编码冗余引起的频谱效率的降低。该方案根据直流偏置光OFDM (DCO-OFDM)系统对双极发射信号进行裁剪和偏置,并采用基于对数似然比(LLR)计算的检测器来查找码字中被刺穿符号的指标。仿真结果表明,与传统的编码ofdm可见光通信相比,该方案具有更好的误码率性能。
{"title":"Subcarrier-Index Modulation for Reed Solomon Encoded OFDM-Based Visible Light Communication","authors":"N. Taherkhani, K. Kiasaleh","doi":"10.1109/CCNC.2019.8651864","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651864","url":null,"abstract":"In this paper, we propose the subcarrier-index modulation with Reed Solomon encoded Optical Orthogonal Frequency Division Multiplexing with index modulation (IM-RS-OFDM) scheme for visible light communication (VLC). In this technique, the data is encoded using an RS codeword and then part of the redundancy introduced by the frame which exceeds the clipping range are punctured and their corresponding subcarriers are set as inactive, where the indices of these inactive subcarriers are used to transmit extra information bits. The puncturing of the redundancy aids in mitigating clipping noise generated due to the dynamic range constraints of the optical transmitter by shortening the number of active subcarriers, while the locations of the punctured subcarriers are exploited to convey more bits in order to compensate for the reduction in spectral efficiency caused by coding redundancy. In the proposed scheme, the bipolar transmitting signal is clipped and biased according to DC bias optical OFDM (DCO-OFDM) system, and a Log-Likelihood ratio (LLR) calculation based detector is used to find the indices of punctured symbols in the codeword. Our simulation results show that the new scheme offers a better bit error rate performance compared to the conventional coded OFDM-based visible light communication.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127809688","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}
引用次数: 6
Analyzing Latency and Dropping in Today’s Internet of Multimedia Things 分析当今多媒体物联网中的延迟和下降
Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651876
Maha Alaslani, B. Shihada
Internet of Multimedia Things (IoMT) applications such as real-time multimedia based security and monitoring in smart homes, hospitals, cities, and smart transportation management systems are of the most difficult systems to deploy. These services are highly time sensitive and require Quality of service (QoS) guarantees. QoS requirements are key factors that lead to variations of multimedia traffic quality and the Quality of Experience (QoE) for the end users. IoMT devices transmit measurements to a predefined IoMT application server subject to maximum QoS constraint. The delay and dropping are essential constraints as delayed packets are considered useless for the IoMT applications. Our objective is to obtain an approximate expression of the blocking probability due to either buffer overflow or violating certain end-to-end threshold. For this purpose, we employ M/G/1 framework for our network. We validate the proposed analytical model and demonstrate the blocking probability and end-to-end delay. We anticipate that our results are critical for optimizing IoMT network design and deployment.
多媒体物联网(IoMT)应用,如智能家居、医院、城市和智能交通管理系统中基于实时多媒体的安全和监控,是最难部署的系统。这些业务对时间高度敏感,需要QoS (Quality service)保证。QoS需求是导致多媒体流量质量和终端用户体验质量变化的关键因素。IoMT设备在最大QoS约束下将测量值传输到预定义的IoMT应用服务器。延迟和丢弃是必要的限制,因为延迟的数据包被认为对IoMT应用程序毫无用处。我们的目标是获得由于缓冲区溢出或违反某些端到端阈值而导致的阻塞概率的近似表达式。为此,我们的网络采用M/G/1框架。我们验证了所提出的分析模型,并演示了阻塞概率和端到端延迟。我们预计我们的结果对于优化IoMT网络设计和部署至关重要。
{"title":"Analyzing Latency and Dropping in Today’s Internet of Multimedia Things","authors":"Maha Alaslani, B. Shihada","doi":"10.1109/CCNC.2019.8651876","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651876","url":null,"abstract":"Internet of Multimedia Things (IoMT) applications such as real-time multimedia based security and monitoring in smart homes, hospitals, cities, and smart transportation management systems are of the most difficult systems to deploy. These services are highly time sensitive and require Quality of service (QoS) guarantees. QoS requirements are key factors that lead to variations of multimedia traffic quality and the Quality of Experience (QoE) for the end users. IoMT devices transmit measurements to a predefined IoMT application server subject to maximum QoS constraint. The delay and dropping are essential constraints as delayed packets are considered useless for the IoMT applications. Our objective is to obtain an approximate expression of the blocking probability due to either buffer overflow or violating certain end-to-end threshold. For this purpose, we employ M/G/1 framework for our network. We validate the proposed analytical model and demonstrate the blocking probability and end-to-end delay. We anticipate that our results are critical for optimizing IoMT network design and deployment.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132973525","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}
引用次数: 4
期刊
2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1