Pub Date : 1900-01-01DOI: 10.1109/ICOIN.2019.8718105
Sai Wang, Y. Shin
Magnetic induction (MI) communication is a promising technology for underwater sensor networks (UWSNs) due to several benefits such as small transmission delay and multipath fading negligibility. However, the majority deployment strategies of the MI relays focus on 1D and 2D networks. In this paper, a optimal relay deployment algorithm is proposed to deploy the relay nodes in the 3D UWSN. To balance the number of sensor nodes in each clustering space, the K-means algorithm is used to divide the network space. In addition, the locations of the relay nodes are important for saving energy. To solve this issue, we adopt a gradient descent algorithm to find the optimal coordinates of the relay nodes. Numerical analysis shows that the proposed algorithm is a practical deployment strategy.
{"title":"3D- Deployment of Magnetic Induction Relays in Underwater Sensor Networks","authors":"Sai Wang, Y. Shin","doi":"10.1109/ICOIN.2019.8718105","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718105","url":null,"abstract":"Magnetic induction (MI) communication is a promising technology for underwater sensor networks (UWSNs) due to several benefits such as small transmission delay and multipath fading negligibility. However, the majority deployment strategies of the MI relays focus on 1D and 2D networks. In this paper, a optimal relay deployment algorithm is proposed to deploy the relay nodes in the 3D UWSN. To balance the number of sensor nodes in each clustering space, the K-means algorithm is used to divide the network space. In addition, the locations of the relay nodes are important for saving energy. To solve this issue, we adopt a gradient descent algorithm to find the optimal coordinates of the relay nodes. Numerical analysis shows that the proposed algorithm is a practical deployment strategy.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"9 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":"122728579","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.8718187
S. E. Tasçi, Ömer Korçak
Since the first introduction of User Provided Networks (UPNs), considerable effort has been put into designing incentive mechanisms as one of the backing techniques needed to realize them. Concepts especially from game theory can be identified as the core building blocks of contemporary incentive mechanisms proposed in the literature. In this work a collaborative Internet sharing mechanism from a potential game theoretical point of view has been proposed while keeping simplicity, applicability in real world scenarios in mind. The proposed scheme supports multi-node deployments and favors fair bandwidth sharing among players as well as providing effective usage of globally available bandwidth. The proposed scheme converges to a Nash equilibrium in pure strategies, when played in best reply dynamics. In order to evaluate its performance it is compared to another scheme which is supposed to admit players' available bandwidth as its potential function. The second scheme has been investigated by rigorous simulations and shown to converge to a Nash equilibrium in pure strategies, although it still lacks an analytical demonstration to be proven as a potential game. Results show that as well as supporting multi-node deployments, the proposed scheme also fairly distributes the available bandwidth among players and increases the globally available bandwidth being shared.
{"title":"On Fair and Efficient Bandwidth Sharing in User Provided Networks","authors":"S. E. Tasçi, Ömer Korçak","doi":"10.1109/ICOIN.2019.8718187","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718187","url":null,"abstract":"Since the first introduction of User Provided Networks (UPNs), considerable effort has been put into designing incentive mechanisms as one of the backing techniques needed to realize them. Concepts especially from game theory can be identified as the core building blocks of contemporary incentive mechanisms proposed in the literature. In this work a collaborative Internet sharing mechanism from a potential game theoretical point of view has been proposed while keeping simplicity, applicability in real world scenarios in mind. The proposed scheme supports multi-node deployments and favors fair bandwidth sharing among players as well as providing effective usage of globally available bandwidth. The proposed scheme converges to a Nash equilibrium in pure strategies, when played in best reply dynamics. In order to evaluate its performance it is compared to another scheme which is supposed to admit players' available bandwidth as its potential function. The second scheme has been investigated by rigorous simulations and shown to converge to a Nash equilibrium in pure strategies, although it still lacks an analytical demonstration to be proven as a potential game. Results show that as well as supporting multi-node deployments, the proposed scheme also fairly distributes the available bandwidth among players and increases the globally available bandwidth being shared.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"70 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":"125908530","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.8718169
Robert Basomingera, Young-June Choi
For the security of mobile ad-hoc networks (MANETs), a group of wireless mobile nodes needs to cooperate by forwarding packets, to implement an intrusion detection system (IDS). Some of the current IDS implementations in a clustered MANET have designed mobile nodes to wait until the cluster head is elected before scanning the network and thus nodes may be, unfortunately, exposed to several control packet attacks by which nodes identify falsified routes to reach other nodes. In order to detect control packet attacks such as route falsification, we design a route cache sharing mechanism for a non-clustered network where all one-hop routing data are collected by each node for a cooperative host-based detection. The cooperative host-based detection system uses a Support Vector Machine classifier and achieves a detection rate of around 95%. By successfully detecting the route falsification attacks, nodes are given the capability to avoid other attacks such as black-hole and gray-hole, which are in many cases a result of a successful route falsification attack.
{"title":"Route Cache Based SVM Classifier for Intrusion Detection of Control Packet Attacks in Mobile Ad-Hoc Networks","authors":"Robert Basomingera, Young-June Choi","doi":"10.1109/ICOIN.2019.8718169","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718169","url":null,"abstract":"For the security of mobile ad-hoc networks (MANETs), a group of wireless mobile nodes needs to cooperate by forwarding packets, to implement an intrusion detection system (IDS). Some of the current IDS implementations in a clustered MANET have designed mobile nodes to wait until the cluster head is elected before scanning the network and thus nodes may be, unfortunately, exposed to several control packet attacks by which nodes identify falsified routes to reach other nodes. In order to detect control packet attacks such as route falsification, we design a route cache sharing mechanism for a non-clustered network where all one-hop routing data are collected by each node for a cooperative host-based detection. The cooperative host-based detection system uses a Support Vector Machine classifier and achieves a detection rate of around 95%. By successfully detecting the route falsification attacks, nodes are given the capability to avoid other attacks such as black-hole and gray-hole, which are in many cases a result of a successful route falsification attack.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"43 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":"122037490","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.8717981
Preeti Jain, S. Surve
The knowledge on the behavior of an application program towards consumption of shared resources in multicore systems could assist in characterizing and classifying these programs. Further categorizing applications assists in predicting optimal coschedules for multicores, which eventually leads to lower contention and enhance performance. The proposed work characterizes applications on the basis of variations in IPC due to various resource allocations. Further classification is done based on parameters of cache memory and Dram bandwidth utilization obtained using hardware counters. A statistical approach is used for classifying the applications. The variance values obtained for an application's behavior towards different resource allocations is considered to build training and test set and KMeans learning algorithm is applied to classify the workloads. The accuracy obtained with the proposed method is 85.71%.
{"title":"Resource Centric Characterization and Classification of Applications Using KMeans for Multicores","authors":"Preeti Jain, S. Surve","doi":"10.1109/ICOIN.2019.8717981","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8717981","url":null,"abstract":"The knowledge on the behavior of an application program towards consumption of shared resources in multicore systems could assist in characterizing and classifying these programs. Further categorizing applications assists in predicting optimal coschedules for multicores, which eventually leads to lower contention and enhance performance. The proposed work characterizes applications on the basis of variations in IPC due to various resource allocations. Further classification is done based on parameters of cache memory and Dram bandwidth utilization obtained using hardware counters. A statistical approach is used for classifying the applications. The variance values obtained for an application's behavior towards different resource allocations is considered to build training and test set and KMeans learning algorithm is applied to classify the workloads. The accuracy obtained with the proposed method is 85.71%.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"24 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":"129914603","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.8718190
Sang Il Kim, Hwa-sung Kim
Recently, to reflect diverse service requirements increasing with the popularization of various Internet devices, network functions virtualization (NFV) is attracting attention as the core technology of the next-generation network. In keeping with the progress of NFV, service function chaining (SFC) for specific network service appeared, and SFC refers to a technique for the sequential abstraction of service functions. In connection with the existing study's method for dynamic service chaining that dynamically generates a service chain through reinforcement learning, considering a node, at which service functions operate for efficient service chaining in the NFV environment, and the usage of resources such as CPU, memory, and network usage, this paper investigated a method for more stable dynamic service function chaining by flexibly calculating a fixed weight for the $r$ value, which was derived from an experiment, according to the amount of remaining resources at the relevant node.
近年来，随着各种互联网设备的普及，网络功能虚拟化(network functions virtualization, NFV)作为下一代网络的核心技术，日益受到人们的关注。随着NFV的发展，出现了针对特定网络业务的业务功能链(service function chains, SFC)， SFC是一种对业务功能进行顺序抽象的技术。结合已有研究通过强化学习动态生成服务链的动态服务链方法，考虑NFV环境下业务功能运行的节点，以及CPU、内存、网络等资源的使用情况，通过灵活计算r值的固定权值，研究了一种更稳定的动态服务功能链方法。这是由实验得出的，根据相关节点的剩余资源量。
{"title":"Dynamic Service Function Chaining by Resource Usage Learning in SDN/NFV Environment","authors":"Sang Il Kim, Hwa-sung Kim","doi":"10.1109/ICOIN.2019.8718190","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718190","url":null,"abstract":"Recently, to reflect diverse service requirements increasing with the popularization of various Internet devices, network functions virtualization (NFV) is attracting attention as the core technology of the next-generation network. In keeping with the progress of NFV, service function chaining (SFC) for specific network service appeared, and SFC refers to a technique for the sequential abstraction of service functions. In connection with the existing study's method for dynamic service chaining that dynamically generates a service chain through reinforcement learning, considering a node, at which service functions operate for efficient service chaining in the NFV environment, and the usage of resources such as CPU, memory, and network usage, this paper investigated a method for more stable dynamic service function chaining by flexibly calculating a fixed weight for the $r$ value, which was derived from an experiment, according to the amount of remaining resources at the relevant node.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"22 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":"115353183","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.8718158
Youngpin Kim, S. Ahn, Nguyen Canh Thang, DongHo Choi, Minho Park
Recently, the novel networking technology Software-Defined Networking(SDN) and Service Function Chaining(SFC) are rapidly growing, and security issues are also emerging for SDN and SFC. However, the research about security and safety on a novel networking environment is still unsatisfactory, and the vulnerabilities have been revealed continuously. Among these security issues, this paper addresses the ARP Poisoning attack to exploit SFC vulnerability, and proposes a method to defend the attack. The proposed method recognizes the repetitive ARP reply which is a feature of ARP Poisoning attack, and detects ARP Poisoning attack. The proposed method overcomes the limitations of the existing detection methods. The proposed method also detects the presence of an attack more accurately.
{"title":"ARP Poisoning Attack Detection Based on ARP Update State in Software-Defined Networks","authors":"Youngpin Kim, S. Ahn, Nguyen Canh Thang, DongHo Choi, Minho Park","doi":"10.1109/ICOIN.2019.8718158","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718158","url":null,"abstract":"Recently, the novel networking technology Software-Defined Networking(SDN) and Service Function Chaining(SFC) are rapidly growing, and security issues are also emerging for SDN and SFC. However, the research about security and safety on a novel networking environment is still unsatisfactory, and the vulnerabilities have been revealed continuously. Among these security issues, this paper addresses the ARP Poisoning attack to exploit SFC vulnerability, and proposes a method to defend the attack. The proposed method recognizes the repetitive ARP reply which is a feature of ARP Poisoning attack, and detects ARP Poisoning attack. The proposed method overcomes the limitations of the existing detection methods. The proposed method also detects the presence of an attack more accurately.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"42 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":"133709085","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.8718162
M. Ohnishi, Kazuyuki Shudo
We propose an ID/Locator resolution system for super wide area wireless mesh networks constructed using Delaunay overlay networks. Unlike conventional mobile ad-hoc network protocols, the proposed system does not use flooding to spread the locator notification messages of each node. The proposed method sends one-hop locator notifications on skip links such as skip graphs. The proposed system realized scalability by controlling the route, frequency, and storing locations of the locator notification message. Specifically, when the number of nodes increases, the average load on communication links and the message database of each node are approximately O(log n), where n is the total number of nodes. The scalability of the proposed method is confirmed through simulations.
{"title":"Distributed ID/Locator Resolution System for Inter Mesh Networks","authors":"M. Ohnishi, Kazuyuki Shudo","doi":"10.1109/ICOIN.2019.8718162","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718162","url":null,"abstract":"We propose an ID/Locator resolution system for super wide area wireless mesh networks constructed using Delaunay overlay networks. Unlike conventional mobile ad-hoc network protocols, the proposed system does not use flooding to spread the locator notification messages of each node. The proposed method sends one-hop locator notifications on skip links such as skip graphs. The proposed system realized scalability by controlling the route, frequency, and storing locations of the locator notification message. Specifically, when the number of nodes increases, the average load on communication links and the message database of each node are approximately O(log n), where n is the total number of nodes. The scalability of the proposed method is confirmed through simulations.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"360 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":"122779914","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.8718113
Anselme Ndikumana, C. Hong
In the future, self-driving cars are expected to be involved in public transportation. Once passengers are comfortable with them, the self-driving cars will be new spaces for entertainment. However, getting infotainment contents from Data Centers (DCs) can be perturbed by the high end-to-end delay. To address this issue, we propose caching for infotainment contents in close proximity to the self-driving cars and in self-driving cars. In our proposal, Multi-access Edge Computing (MEC) helps self-driving cars by deploying MEC servers to the edge of the network at macro base stations (BSs), WiFi access points (WAPs), and roadside units (RSUs) for caching infotainment contents in close proximity to the self-driving cars. Based on the passenger's features learned via self-driving car deep learning approach proposed in this paper, the self-driving car can download infotainment contents that are appropriate to its passengers from MEC servers and cache them. The simulation results show that our prediction for the infotainment contents need to be cached in close proximity to the self-driving cars can achieve 99.28% accuracy.
{"title":"Self-Driving Car Meets Multi-Access Edge Computing for Deep Learning-Based Caching","authors":"Anselme Ndikumana, C. Hong","doi":"10.1109/ICOIN.2019.8718113","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718113","url":null,"abstract":"In the future, self-driving cars are expected to be involved in public transportation. Once passengers are comfortable with them, the self-driving cars will be new spaces for entertainment. However, getting infotainment contents from Data Centers (DCs) can be perturbed by the high end-to-end delay. To address this issue, we propose caching for infotainment contents in close proximity to the self-driving cars and in self-driving cars. In our proposal, Multi-access Edge Computing (MEC) helps self-driving cars by deploying MEC servers to the edge of the network at macro base stations (BSs), WiFi access points (WAPs), and roadside units (RSUs) for caching infotainment contents in close proximity to the self-driving cars. Based on the passenger's features learned via self-driving car deep learning approach proposed in this paper, the self-driving car can download infotainment contents that are appropriate to its passengers from MEC servers and cache them. The simulation results show that our prediction for the infotainment contents need to be cached in close proximity to the self-driving cars can achieve 99.28% accuracy.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"22 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":"132809913","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.8718165
Samir Kumar Tarai, S. Shailendra
The exponential growth of Internet of Things (IoT) devices and cloud based systems has resulted in an increased demand of new services and applications. In an IoT network like smart city, it is desirable that these services and applications can be provisioned on demand and securely. SDN (Software Defined Networking) has emerged as a new paradigm that facilitates on demand provisioning of the network, services and applications. An efficient and secure controller placement is the key to the efficient deployment of an SDN based network. In this paper, we have addressed the dual problem of optimal and secure controller placement in an SDN based network such that it optimizes the flow setup time for dynamically changing network conditions. Our approach takes care of controller fault tolerance by introducing a well-defined strategy of Master-Equal-Slave (M-E-S) controllers combination. We have built our own Java based simulator and extensive simulations have been carried out to verify the proposed algorithms.
物联网(IoT)设备和基于云的系统的指数级增长导致了对新服务和应用程序的需求增加。在像智慧城市这样的物联网网络中，希望这些服务和应用程序可以按需安全地提供。软件定义网络(SDN, Software Defined Networking)作为一种新的范例已经出现，它促进了网络、服务和应用的按需供应。有效和安全的控制器放置是有效部署基于SDN的网络的关键。在本文中，我们解决了在基于SDN的网络中优化和安全控制器放置的双重问题，从而优化了动态变化的网络条件下的流量设置时间。我们的方法通过引入一个定义良好的主-相等-从(M-E-S)控制器组合策略来处理控制器容错性。我们已经建立了自己的基于Java的模拟器，并进行了大量的仿真来验证所提出的算法。
{"title":"Optimal and Secure Controller Placement in SDN Based Smart City Network","authors":"Samir Kumar Tarai, S. Shailendra","doi":"10.1109/ICOIN.2019.8718165","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718165","url":null,"abstract":"The exponential growth of Internet of Things (IoT) devices and cloud based systems has resulted in an increased demand of new services and applications. In an IoT network like smart city, it is desirable that these services and applications can be provisioned on demand and securely. SDN (Software Defined Networking) has emerged as a new paradigm that facilitates on demand provisioning of the network, services and applications. An efficient and secure controller placement is the key to the efficient deployment of an SDN based network. In this paper, we have addressed the dual problem of optimal and secure controller placement in an SDN based network such that it optimizes the flow setup time for dynamically changing network conditions. Our approach takes care of controller fault tolerance by introducing a well-defined strategy of Master-Equal-Slave (M-E-S) controllers combination. We have built our own Java based simulator and extensive simulations have been carried out to verify the proposed algorithms.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"246 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":"122832575","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.8718183
Kitae Kim, Jared Lynskey, S. Kang, C. Hong
Mobile Edge Cloud Computing has been developed and introduced to provide low-latency service in close proximity to users. In this environment., resource constrained UE (user equipment) incapable to execute complex applications (i.e VR/AR., Deep Learning., Image Processing Applications) can dynamically offload computationally demanding tasks to neighboring MEC nodes. To process tasks even faster with MEC nodes., we can divide one task into several sub-tasks and offload to multiple MEC nodes simultaneously., thereby each sub-task will be processed in parallel. In this paper., we predict the total processing duration of each task on each candidate MEC node using Linear Regression. According to the previously observed state of each MEC node., we offload sub-tasks to their respective edge node. We also developed a monitoring module at core cloud. The results show a decrease in execution duration when we offload an entire application to one edge node compared with local execution.
{"title":"Prediction Based Sub-Task Offloading in Mobile Edge Computing","authors":"Kitae Kim, Jared Lynskey, S. Kang, C. Hong","doi":"10.1109/ICOIN.2019.8718183","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718183","url":null,"abstract":"Mobile Edge Cloud Computing has been developed and introduced to provide low-latency service in close proximity to users. In this environment., resource constrained UE (user equipment) incapable to execute complex applications (i.e VR/AR., Deep Learning., Image Processing Applications) can dynamically offload computationally demanding tasks to neighboring MEC nodes. To process tasks even faster with MEC nodes., we can divide one task into several sub-tasks and offload to multiple MEC nodes simultaneously., thereby each sub-task will be processed in parallel. In this paper., we predict the total processing duration of each task on each candidate MEC node using Linear Regression. According to the previously observed state of each MEC node., we offload sub-tasks to their respective edge node. We also developed a monitoring module at core cloud. The results show a decrease in execution duration when we offload an entire application to one edge node compared with local execution.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"61 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":"122190803","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
扫码关注我们
求助内容：
应助结果提醒方式：