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
{"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}
{"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}
{"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}
{"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}
{"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}
Oleksandr Zhdanenko, Jianhui Liu, Roberto Torre Arranz, S. Mudriievskyi, H. Salah, Giang T. Nguyen, F. Fitzek
{"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}
Yuji Mizutani, K. Mizutani, T. Matsumura, H. Harada
{"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}
{"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}
{"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}