Pub Date : 1900-01-01DOI: 10.1109/ICOIN.2019.8718140
Melchizedek I. Alipio, Alex Gyran A. Co, M. Hilario, Christian Miguel C. Pama
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.
{"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}
Pub Date : 1900-01-01DOI: 10.1109/ICOIN.2019.8718159
Madyan Alsenwi, Shashi Raj Pandey, Y. Tun, Ki Tae Kim, C. Hong
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.
{"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}
Pub Date : 1900-01-01DOI: 10.1109/ICOIN.2019.8717982
M. Sukmana, K. Torkura, Hendrik Graupner, Feng Cheng, C. Meinel
Cloud Storage Broker (CSB) provides value-added cloud storage service for enterprise usage by leveraging multi-cloud storage architecture. However, it raises several challenges for managing resources and its access control in multiple Cloud Service Providers (CSPs) for authorized CSB stakeholders. In this paper we propose unified cloud access control model that provides the abstraction of CSP's services for centralized and automated cloud resource and access control management in multiple CSPs. Our proposal offers role-based access control for CSB stakeholders to access cloud resources by assigning necessary privileges and access control list for cloud resources and CSB stakeholders, respectively, following privilege separation concept and least privilege principle. We implement our unified model in a CSB system called CloudRAID for Business (CfB) with the evaluation result shows it provides system-and-cloud level security service for cfB and centralized resource and access control management in multiple CSPs.
云存储代理(CSB)通过利用多云存储架构为企业提供增值的云存储服务。然而，它为授权的CSB利益相关者在多个云服务提供商(csp)中管理资源及其访问控制提出了一些挑战。本文提出了统一的云访问控制模型，该模型对云服务提供商的服务进行了抽象，实现了云资源和访问控制在多个云服务提供商中的集中化和自动化管理。我们的方案遵循权限分离概念和最小权限原则，通过为云资源和CSB利益相关者分别分配必要的权限和访问控制列表，为CSB利益相关者访问云资源提供基于角色的访问控制。我们将该统一模型应用于一个名为CloudRAID for Business (CfB)的CSB系统中，评估结果表明它为CfB提供了系统级和云级的安全服务，并在多个csp中进行了集中的资源和访问控制管理。
{"title":"Unified Cloud Access Control Model for Cloud Storage Broker","authors":"M. Sukmana, K. Torkura, Hendrik Graupner, Feng Cheng, C. Meinel","doi":"10.1109/ICOIN.2019.8717982","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8717982","url":null,"abstract":"Cloud Storage Broker (CSB) provides value-added cloud storage service for enterprise usage by leveraging multi-cloud storage architecture. However, it raises several challenges for managing resources and its access control in multiple Cloud Service Providers (CSPs) for authorized CSB stakeholders. In this paper we propose unified cloud access control model that provides the abstraction of CSP's services for centralized and automated cloud resource and access control management in multiple CSPs. Our proposal offers role-based access control for CSB stakeholders to access cloud resources by assigning necessary privileges and access control list for cloud resources and CSB stakeholders, respectively, following privilege separation concept and least privilege principle. We implement our unified model in a CSB system called CloudRAID for Business (CfB) with the evaluation result shows it provides system-and-cloud level security service for cfB and centralized resource and access control management in multiple CSPs.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"13 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":"116783952","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 : 1900-01-01DOI: 10.1109/ICOIN.2019.8718174
Atsuko Yokotani, S. Ohzahata, R. Yamamoto, Toshihiko Kato
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.
{"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}
Pub Date : 1900-01-01DOI: 10.1109/ICOIN.2019.8718132
Aunas Manzoor, S. Kang, C. Hong
In order to meet the ever-increasing data rate demands of future mobile networks, LTE in the unlicensed band (LTE-U) has been proposed in which LTE is operated on the unlicensed spectrum along with the incumbent unlicensed spectrum technologies e.g. Wi-Fi However, enabling LTE-U with the Wi-Fi network in the same unlicensed spectrum results in severe Wi-Fi performance degradations. This paper addressed such coexistence problem of Wi-Fi and LTE-U, by formulating a chance-constrained optimization problem such as to maintain certain Wi-Fi performance. In the first step, unlicensed spectrum is shared among Wi-Fi and LTE-U by adjusting the so-called duty-cycle according to the random Wi-Fi performance. Secondly, the LTE-U user association is performed through knapsack problem to efficiently utilize the available LTE-U duty-cycle. Simulations results show that the proposed algorithm provides fairness to the Wi-Fi system by adjusting the LTE-U duty-cycle.
{"title":"Chance-Constrained Spectrum Allocation for Fair LTE-U/Wi-Fi Coexistence","authors":"Aunas Manzoor, S. Kang, C. Hong","doi":"10.1109/ICOIN.2019.8718132","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718132","url":null,"abstract":"In order to meet the ever-increasing data rate demands of future mobile networks, LTE in the unlicensed band (LTE-U) has been proposed in which LTE is operated on the unlicensed spectrum along with the incumbent unlicensed spectrum technologies e.g. Wi-Fi However, enabling LTE-U with the Wi-Fi network in the same unlicensed spectrum results in severe Wi-Fi performance degradations. This paper addressed such coexistence problem of Wi-Fi and LTE-U, by formulating a chance-constrained optimization problem such as to maintain certain Wi-Fi performance. In the first step, unlicensed spectrum is shared among Wi-Fi and LTE-U by adjusting the so-called duty-cycle according to the random Wi-Fi performance. Secondly, the LTE-U user association is performed through knapsack problem to efficiently utilize the available LTE-U duty-cycle. Simulations results show that the proposed algorithm provides fairness to the Wi-Fi system by adjusting the LTE-U duty-cycle.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"1 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":"131249573","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 : 1900-01-01DOI: 10.1109/ICOIN.2019.8718185
Y. Tun, Shashi Raj Pandey, Madyan Alsenwi, Chit Wutyee Zaw, C. Hong
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.
{"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}
Pub Date : 1900-01-01DOI: 10.1109/ICOIN.2019.8718154
Yoshiki Kuwabara, Y. Matsuno, Kan Akutsu, H. Mukai, T. Yokotani
Recently, the Internet of Things (IoT) has become so widespread that the requirements for networking must be re-evaluated. It is expected that the number of devices connected to the network will increase significantly; therefore, characteristics of conventional data traffic flow must be reconsidered. In this paper, we focus on the data traffic flow characteristics of surveillance cameras, which are a type of IoT device. We have investigated the characteristics of data traffic flow multiplexed on wired and wireless networks. We have analyzed statistical data based on the IPFIX protocol at a gateway, which is an aggregation point for this data traffic. We have also clarified the relationship between real multiplexed data traffic and statistical data. Finally, we have shown that our results are useful for IoT network design.
{"title":"Evaluation of Multiplexing on the Characteristics of Surveillance Camera Data Traffic","authors":"Yoshiki Kuwabara, Y. Matsuno, Kan Akutsu, H. Mukai, T. Yokotani","doi":"10.1109/ICOIN.2019.8718154","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718154","url":null,"abstract":"Recently, the Internet of Things (IoT) has become so widespread that the requirements for networking must be re-evaluated. It is expected that the number of devices connected to the network will increase significantly; therefore, characteristics of conventional data traffic flow must be reconsidered. In this paper, we focus on the data traffic flow characteristics of surveillance cameras, which are a type of IoT device. We have investigated the characteristics of data traffic flow multiplexed on wired and wireless networks. We have analyzed statistical data based on the IPFIX protocol at a gateway, which is an aggregation point for this data traffic. We have also clarified the relationship between real multiplexed data traffic and statistical data. Finally, we have shown that our results are useful for IoT network design.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"546 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":"116389466","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 : 1900-01-01DOI: 10.1109/ICOIN.2019.8718136
A. Talukder, DoHyeon Kim, C. Hong
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.
{"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}
Pub Date : 1900-01-01DOI: 10.1109/ICOIN.2019.8718194
Dohyun Kwon, Joongheon Kim
The unmanned aerial vehicle (UAV) based data transmission is highlighted for next-generation communication system by both academia and industry. The UAV, which is dynamically associated with mobile users, can take a role of base station (BS) as service provider (SP), for various types of scenarios. For this sake, it is important that the UAV-BS should be hovered in the air with obeying optimal trajectory for minimizing delay, which is caused by enormous computation of data transmission, and the trajectory can be controlled by centralized macro base station (MBS). In this paper, we propose deep reinforcement learning approach for computing optimal trajectories of distributed UAV-BS with low-latency overhead to enable efficient UAV communication in next generation wireless system.
{"title":"Optimal Trajectory Learning for UAV-BS Video Provisioning System: A Deep Reinforcement Learning Approach","authors":"Dohyun Kwon, Joongheon Kim","doi":"10.1109/ICOIN.2019.8718194","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718194","url":null,"abstract":"The unmanned aerial vehicle (UAV) based data transmission is highlighted for next-generation communication system by both academia and industry. The UAV, which is dynamically associated with mobile users, can take a role of base station (BS) as service provider (SP), for various types of scenarios. For this sake, it is important that the UAV-BS should be hovered in the air with obeying optimal trajectory for minimizing delay, which is caused by enormous computation of data transmission, and the trajectory can be controlled by centralized macro base station (MBS). In this paper, we propose deep reinforcement learning approach for computing optimal trajectories of distributed UAV-BS with low-latency overhead to enable efficient UAV communication in next generation wireless system.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"104 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":"134205623","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 : 1900-01-01DOI: 10.1109/ICOIN.2019.8718157
Yuan Zhuang, Qiaoyue Pang, Min Wei
More and more industrial devices are expected to connect to the internet seamlessly. IPv6-based industrial wireless network can solve the address resources limitation problem. It is a challenge about how to ensure the wireless node join security after introducing the IPv6. In this paper, we propose a multiple nodes join mechanism, which includes a timeslot allocation method and secure join process for the IPv6 over IEEE 802.15.4e network. The timeslot allocation method is designed in order to configure communication resources in the join process for the new nodes. The test platform is implemented to verify the feasibility of the mechanism. The result shows that the proposed mechanism can reduce the communication cost for multiple nodes join process and improve the efficiency.
{"title":"Secure and Fast Multiple Nodes Join Mechanism for IPv6-Based Industrial Wireless Network","authors":"Yuan Zhuang, Qiaoyue Pang, Min Wei","doi":"10.1109/ICOIN.2019.8718157","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718157","url":null,"abstract":"More and more industrial devices are expected to connect to the internet seamlessly. IPv6-based industrial wireless network can solve the address resources limitation problem. It is a challenge about how to ensure the wireless node join security after introducing the IPv6. In this paper, we propose a multiple nodes join mechanism, which includes a timeslot allocation method and secure join process for the IPv6 over IEEE 802.15.4e network. The timeslot allocation method is designed in order to configure communication resources in the join process for the new nodes. The test platform is implemented to verify the feasibility of the mechanism. The result shows that the proposed mechanism can reduce the communication cost for multiple nodes join process and improve the efficiency.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"35 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":"117034737","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
扫码关注我们
求助内容：
应助结果提醒方式：