2019 International Conference on Information Networking (ICOIN)最新文献_第9页

SDN-Enabled Value-Based Traffic Management Mechanism in Resource-Constrained Sensor Devices 资源受限传感器设备中基于sdn的价值流量管理机制

2019 International Conference on Information Networking (ICOIN) Pub Date : 1900-01-01 DOI: 10.1109/ICOIN.2019.8718140

Melchizedek I. Alipio, Alex Gyran A. Co, M. Hilario, Christian Miguel C. Pama

{"title":"SDN-Enabled Value-Based Traffic Management Mechanism in Resource-Constrained Sensor Devices","authors":"Melchizedek I. Alipio, Alex Gyran A. Co, M. Hilario, Christian Miguel C. Pama","doi":"10.1109/ICOIN.2019.8718140","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718140","url":null,"abstract":"Transmission of data among constrained wireless sensor devices is critical due to its limited resources such as power, bandwidth, memory, and processing. These data, generated from sensing different physical events with diverse traffic types, have to reach their destinations with a specific Quality of Service (QoS) requirement. With the increasing usage of sensors in the various Internet of Things applications, there is a need to address the resource allocation for handling these critical data while satisfying their respective QoS requirements. In this work, we implemented a Value-based Utility traffic management mechanism using Software Defined Networking (SDN) to cope with QoS requirement in constrained sensor devices. The SDN-enabled mechanism ensures that the demands of sensor data are satisfied by managing traffic while allocating queue resources among flows through a centralized controller, which utilizes network packet statistics. We evaluated the performance of the proposed mechanism in a simple and low-cost OpenFlow testbed with various sensor devices having different QoS requirements. Results show that each wireless sensor device achieved the level of satisfaction based on their required resource network utility.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130158823","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}

引用次数: 2

A Chance Constrained Based Formulation for Dynamic Multiplexing of eMBB-URLLC Traffics in 5G New Radio 基于机会约束的5G新无线电中eMBB-URLLC业务动态复用公式

2019 International Conference on Information Networking (ICOIN) Pub Date : 1900-01-01 DOI: 10.1109/ICOIN.2019.8718159

Madyan Alsenwi, Shashi Raj Pandey, Y. Tun, Ki Tae Kim, C. Hong

{"title":"A Chance Constrained Based Formulation for Dynamic Multiplexing of eMBB-URLLC Traffics in 5G New Radio","authors":"Madyan Alsenwi, Shashi Raj Pandey, Y. Tun, Ki Tae Kim, C. Hong","doi":"10.1109/ICOIN.2019.8718159","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718159","url":null,"abstract":"5G New Radio (NR) is envisioned to provide three major services: enhanced Mobile Broadband (eMBB), Ultra Reliable Low Latency Communications (URLLC), and massive Machine Type Communication (mMTC). URLLC services (i.e., autonomous vehicles, industrial Internet of Things (IoT),…) require strict latency, on-way latency of 1 ms, with 99.999% reliability. eMBB applications aims extreme data rate while mMTC is designed to serve a large number of IoT devices that send a small data sporadically. In this paper, we address the resource scheduling problem of URLLC and eMBB traffics. First, the Resource Blocks (RBs) are allocated to eMBB users at the beginning of each time slot based on the channel state of each eMBB user and his previous average data rate up to current time slot. The RBs allocation problem modeled as as a 2-Dimensions Hopfield Neural Networks (2D-HNN) and the energy function of 2D-HNN is investigated to solve the RBs allocation problem. Then, the resource scheduling problem of URLLC and eMBB is formulated as an optimization problem with chance constraint. The chance constraint based problem aims to maximize the eMBB data rate while satisfying the URLLC critical constraints. The cumulative Distribution Function (CDF) of the stochastic URLLC traffic is investigated to relax the chance constraint into a linear constraint. The simulation results show efficiency of the proposed dynamic scheduling approach.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124374139","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}

引用次数: 34

Unified Cloud Access Control Model for Cloud Storage Broker 云存储代理统一云访问控制模型

2019 International Conference on Information Networking (ICOIN) Pub Date : 1900-01-01 DOI: 10.1109/ICOIN.2019.8717982

M. Sukmana, K. Torkura, Hendrik Graupner, Feng Cheng, C. Meinel

引用次数: 7

A Dynamic Cache Size Assignment Method with Bandwidth Reservation for CCN 带带宽预留的CCN动态缓存大小分配方法

2019 International Conference on Information Networking (ICOIN) Pub Date : 1900-01-01 DOI: 10.1109/ICOIN.2019.8718174

Atsuko Yokotani, S. Ohzahata, R. Yamamoto, Toshihiko Kato

{"title":"A Dynamic Cache Size Assignment Method with Bandwidth Reservation for CCN","authors":"Atsuko Yokotani, S. Ohzahata, R. Yamamoto, Toshihiko Kato","doi":"10.1109/ICOIN.2019.8718174","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718174","url":null,"abstract":"Currently, the Internet has been widely deployed for communication services and communication is provided a connection between hosts. Therefore, a location of host has to be specified even when an aim of communication is to deliver content, and then a content is not always efficiently delivered under architecture of the Internet. In order to solve this problem, Content Centric Network (CCN) has been proposed as new network architecture. CCN delivers content with a content identifier and does not require a location identification of each host in the communication. The content identifier enables to provide content cache as a router function, and the content caches in CCN routers enable to reduce redundant traffic in case that many uses request the same content via the same route. In our previous works, we have proposed a bandwidth reservation method of CCN for stable content delivery. However, the previous work does not consider cache assignment control for contents with bandwidth reservation. In this paper, we propose a dynamic cache space control method for contents with bandwidth reservation in order to cache them in the CCN router nearby the users. The proposed method enables to prepare cache spaces for content with bandwidth reservation effectively. In evaluations, we implement the proposed method in CCNx and evaluate communication quality with effect of dynamic cache size assignment for content with bandwidth reservation.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133824342","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}

引用次数: 1

Chance-Constrained Spectrum Allocation for Fair LTE-U/Wi-Fi Coexistence LTE-U/Wi-Fi公平共存的机会约束频谱分配

2019 International Conference on Information Networking (ICOIN) Pub Date : 1900-01-01 DOI: 10.1109/ICOIN.2019.8718132

Aunas Manzoor, S. Kang, C. Hong

引用次数: 3

Weighted Proportional Allocation Based Power Allocation in Wireless Network Virtualization for Future Wireless Networks 未来无线网络虚拟化中基于加权比例分配的功率分配

2019 International Conference on Information Networking (ICOIN) Pub Date : 1900-01-01 DOI: 10.1109/ICOIN.2019.8718185

Y. Tun, Shashi Raj Pandey, Madyan Alsenwi, Chit Wutyee Zaw, C. Hong

{"title":"Weighted Proportional Allocation Based Power Allocation in Wireless Network Virtualization for Future Wireless Networks","authors":"Y. Tun, Shashi Raj Pandey, Madyan Alsenwi, Chit Wutyee Zaw, C. Hong","doi":"10.1109/ICOIN.2019.8718185","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718185","url":null,"abstract":"Wireless network virtualization has been considered as a promising technique that will avail the network operators to address the tremendous demand of mobile data services for 5G cellular networks by improving overall network utilization. With this approach, the cellular networks can be logically decoupled into infrastructure providers (InPs) and mobile virtual network operators (MVNOs). In such scenario, an InP owns wireless resources of base stations (e.g., bandwidth, transmit power, antenna, storage capacity, computation capacity) which is shared with multiple MVNOs. Then, each MVNO will allocate the obtained network slices to their mobile users. So, the resource allocation to the users of MVNOs is really challenging. In this paper, we address the power allocation problem in the network virtualization with the objective of maintaining the beneficiary network utilization in an efficient manner, and intra-slice, inter-slice isolation. To address the proposed power allocation problem we adopt the weighted proportional allocation mechanism. Under this mechanism, MVNOs are modeled as bidders who will bid for power for their mobile users and InP is modeled as an auctioneer (i.e., a seller). Finally, numerical results present our proposed algorithm outperforms equal resource sharing in virtualized wireless networks.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133120826","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}

引用次数: 8

Evaluation of Multiplexing on the Characteristics of Surveillance Camera Data Traffic 多路复用对监控摄像机数据流量特性的评价

2019 International Conference on Information Networking (ICOIN) Pub Date : 1900-01-01 DOI: 10.1109/ICOIN.2019.8718154

Yoshiki Kuwabara, Y. Matsuno, Kan Akutsu, H. Mukai, T. Yokotani

引用次数: 1

A Heuristic Mixed Model for Viral Marketing Cost Minimization in Social Networks 社交网络中病毒式营销成本最小化的启发式混合模型

2019 International Conference on Information Networking (ICOIN) Pub Date : 1900-01-01 DOI: 10.1109/ICOIN.2019.8718136

A. Talukder, DoHyeon Kim, C. Hong

{"title":"A Heuristic Mixed Model for Viral Marketing Cost Minimization in Social Networks","authors":"A. Talukder, DoHyeon Kim, C. Hong","doi":"10.1109/ICOIN.2019.8718136","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718136","url":null,"abstract":"The Influence maximization (IM) aims at estimating a small number of influential users that maximize the viral marketing profit whereas, the Reverse Influence Maximization (RIM) deals with the minimization of Viral Marketing (VM) cost in social networks. Here, the VM cost is measured by the minimum number of nodes that are required to activate seed nodes and the profit is defined by the maximum number of nodes influenced by seed users when they are initially activated. However, most of the existing works focus on the profit maximization without considering the VM cost. Thus, in this research, we introduce a Viral Marketing Cost (VMC) Minimization problem and propose a Heuristic Mixed (HM) approach under mixed Reverse Independent Cascade (RIC) and Reverse Linear Threshold (RLT) diffusion models. The proposed HM model employs the greedy technique along with a heuristic approach to optimize the VM cost. Moreover, our model resolves the challenging issues of the RIM problem more efficiently. Finally, we simulate our model using data-sets of two real social networks, and the result shows that our model outperforms the baseline and existing models.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114660644","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

Optimal Trajectory Learning for UAV-BS Video Provisioning System: A Deep Reinforcement Learning Approach 无人机- bs视频供应系统的最优轨迹学习:一种深度强化学习方法

2019 International Conference on Information Networking (ICOIN) Pub Date : 1900-01-01 DOI: 10.1109/ICOIN.2019.8718194

Dohyun Kwon, Joongheon Kim

引用次数: 9

Secure and Fast Multiple Nodes Join Mechanism for IPv6-Based Industrial Wireless Network 基于ipv6的工业无线网络安全快速多节点连接机制

2019 International Conference on Information Networking (ICOIN) Pub Date : 1900-01-01 DOI: 10.1109/ICOIN.2019.8718157

Yuan Zhuang, Qiaoyue Pang, Min Wei

引用次数: 0