Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651821
Anan Sawabe, Takanori Iwai, K. Satoda
The requirements of smartphone users have shifted from the quality of service (i.e., throughput) to the quality of experience. Also, the amount of encrypted traffic has increased to protect personal information. Therefore, to provide a quality mobile network experience for smartphone users, network operators need to identify applications from the encrypted traffic and control their traffic. In this paper, we propose a method of identifying applications running on a specific smartphone by analyzing only the time series patterns in IP traffic without inspecting the encrypted traffic. The proposed method estimates application flow with a two-level probabilistic state transition model and identifies applications on the basis of the statistics per estimated flow. Through experiments identifying applications running on a smartphone, we evaluated the estimation accuracy of proposed method.
{"title":"Identification of Smartphone Applications by Encrypted Traffic Analysis","authors":"Anan Sawabe, Takanori Iwai, K. Satoda","doi":"10.1109/CCNC.2019.8651821","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651821","url":null,"abstract":"The requirements of smartphone users have shifted from the quality of service (i.e., throughput) to the quality of experience. Also, the amount of encrypted traffic has increased to protect personal information. Therefore, to provide a quality mobile network experience for smartphone users, network operators need to identify applications from the encrypted traffic and control their traffic. In this paper, we propose a method of identifying applications running on a specific smartphone by analyzing only the time series patterns in IP traffic without inspecting the encrypted traffic. The proposed method estimates application flow with a two-level probabilistic state transition model and identifies applications on the basis of the statistics per estimated flow. Through experiments identifying applications running on a smartphone, we evaluated the estimation accuracy of proposed method.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123693429","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651690
Lalit Pathak, T. Vrind, Diwakar Sharma, D. Das
MultiSIM feature offers convenience to a user by providing connection to multiple operators for accessing different services through different SIMs with a User Equipment (UE). Generally, MultiSIM is deployed as a Dual Subscriber-Identity-Module (SIM) Dual Standby (DSDS) feature; sharing transceiver with secondary SIM (SIM-2), while primary SIM (SIM-I) is on an active data session with Operator-1. The sharing of transceiver (called tune away), causes inactivity on the Radio Link (RL) between UE and eNodeB (eNB) leading the Physical Channel Resource (PCR) wastage for Operator −1. Multi SIM Multi Standby (MSMS) feature is an enhancement over DSDS to scale up the usage with three or more SIMs with single transceiver. With MSMS deployment, PCR wastage will scale up as compared to DSDS, as it additionally introduces more challenges, like (a) increased number of tune away events due to more than two SIMs, (b) increase in tune away duration due to a cascading effect of simultaneous and back-to-back high priority procedures on secondary SIMs. MSMS will thus affect by increasing the backhaul retransmissions and buffering at Operator −1. To overcome the above challenges and to ensure MSMS is a reality soon, to the best of our knowledge for the first time, this paper proposes a new signaling via Non Access Stratum (NAS) layer, from UE to Evolved Packet Core (EPC) to indicate tune away when the duration of tune away spans several seconds. We propose to apply NAS signaling in a scenario specific manner to address tune away events. Through extensive simulation derived from mathematical modeling and measurements obtained from test bed with commercial UEs, the results reveal that for three SIMs in cascaded scenarios, with the proposed solution, the PCR wastage is reduced to only 7.9 % against 48.5% and eNB buffering reduced by 95% in comparison to the available literature for a practical deployment.
{"title":"Efficient Protocol for Performance Enhancement of B4G and 5G Networks for MultiSIM Deployment","authors":"Lalit Pathak, T. Vrind, Diwakar Sharma, D. Das","doi":"10.1109/CCNC.2019.8651690","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651690","url":null,"abstract":"MultiSIM feature offers convenience to a user by providing connection to multiple operators for accessing different services through different SIMs with a User Equipment (UE). Generally, MultiSIM is deployed as a Dual Subscriber-Identity-Module (SIM) Dual Standby (DSDS) feature; sharing transceiver with secondary SIM (SIM-2), while primary SIM (SIM-I) is on an active data session with Operator-1. The sharing of transceiver (called tune away), causes inactivity on the Radio Link (RL) between UE and eNodeB (eNB) leading the Physical Channel Resource (PCR) wastage for Operator −1. Multi SIM Multi Standby (MSMS) feature is an enhancement over DSDS to scale up the usage with three or more SIMs with single transceiver. With MSMS deployment, PCR wastage will scale up as compared to DSDS, as it additionally introduces more challenges, like (a) increased number of tune away events due to more than two SIMs, (b) increase in tune away duration due to a cascading effect of simultaneous and back-to-back high priority procedures on secondary SIMs. MSMS will thus affect by increasing the backhaul retransmissions and buffering at Operator −1. To overcome the above challenges and to ensure MSMS is a reality soon, to the best of our knowledge for the first time, this paper proposes a new signaling via Non Access Stratum (NAS) layer, from UE to Evolved Packet Core (EPC) to indicate tune away when the duration of tune away spans several seconds. We propose to apply NAS signaling in a scenario specific manner to address tune away events. Through extensive simulation derived from mathematical modeling and measurements obtained from test bed with commercial UEs, the results reveal that for three SIMs in cascaded scenarios, with the proposed solution, the PCR wastage is reduced to only 7.9 % against 48.5% and eNB buffering reduced by 95% in comparison to the available literature for a practical deployment.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128459557","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651738
Oluwatobi Akanbi, Amer Aljaedi, Xiaobo Zhou
Balancing the workload among distributed SDN controllers plays a critical role for both the network performance and the control plane scalability. Several distributed SDN controller architectures have been proposed to mitigate the risk of controller overload and failures. However, many of these architectures fall short for maintaining the same level of complexity in the control plane. A core implication of complex control plane can translate to a limitation in functional improvements of existing implementation. To address this issue, we propose a novel Proactive Load Shift (PLS) technique that augments the traditional SDN architecture with a shim layer to diminish the complexities in existing distributed SDN controller architectures. While our primary focus is on efficient workload distribution among SDN controllers in a distributed architecture, our shim layer also serves as a programmable abstraction for supporting new network functionalities in the SDN control plane and the data plane without infringing the SDN principles. To achieve optimal network performance in our proposed technique, we eliminate the need for inter-controller synchronization by delegating the synchronization sequence to the shim layer at a per-need based only. Our experimental results show that the PLS technique provides efficient responses to load balancing triggers with less overhead on the control plane.
{"title":"Proactive Load Shifting for Distributed SDN Control Plane Architecture","authors":"Oluwatobi Akanbi, Amer Aljaedi, Xiaobo Zhou","doi":"10.1109/CCNC.2019.8651738","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651738","url":null,"abstract":"Balancing the workload among distributed SDN controllers plays a critical role for both the network performance and the control plane scalability. Several distributed SDN controller architectures have been proposed to mitigate the risk of controller overload and failures. However, many of these architectures fall short for maintaining the same level of complexity in the control plane. A core implication of complex control plane can translate to a limitation in functional improvements of existing implementation. To address this issue, we propose a novel Proactive Load Shift (PLS) technique that augments the traditional SDN architecture with a shim layer to diminish the complexities in existing distributed SDN controller architectures. While our primary focus is on efficient workload distribution among SDN controllers in a distributed architecture, our shim layer also serves as a programmable abstraction for supporting new network functionalities in the SDN control plane and the data plane without infringing the SDN principles. To achieve optimal network performance in our proposed technique, we eliminate the need for inter-controller synchronization by delegating the synchronization sequence to the shim layer at a per-need based only. Our experimental results show that the PLS technique provides efficient responses to load balancing triggers with less overhead on the control plane.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128976854","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651813
M. Furini
Many educational institutes are making lecture recordings widely available to improve the students’ learning experience, but the viewing experience is quite poor (e.g., fixed camera pointed to the classroom and/or slideshow). This can jeopardize the benefits of the learning process based on video lectures. In this paper, we propose Virtual Director, a system designed to improve the viewing experience through an automated direction of video lectures. Virtual Director captures the classroom scenario, understands the semantic content of the lecture and produces a video with a layout that changes according to the semantic content and according to movie theory rules. A prototype, developed with off-the-shelf technologies, shows the feasibility of the approach and a preliminary evaluation confirmed that Virtual Director might improve the viewing experience of video lectures.
{"title":"ViDi: Virtual Director of Video Lectures","authors":"M. Furini","doi":"10.1109/CCNC.2019.8651813","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651813","url":null,"abstract":"Many educational institutes are making lecture recordings widely available to improve the students’ learning experience, but the viewing experience is quite poor (e.g., fixed camera pointed to the classroom and/or slideshow). This can jeopardize the benefits of the learning process based on video lectures. In this paper, we propose Virtual Director, a system designed to improve the viewing experience through an automated direction of video lectures. Virtual Director captures the classroom scenario, understands the semantic content of the lecture and produces a video with a layout that changes according to the semantic content and according to movie theory rules. A prototype, developed with off-the-shelf technologies, shows the feasibility of the approach and a preliminary evaluation confirmed that Virtual Director might improve the viewing experience of video lectures.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128825595","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651731
Quang-Bao Huynh, Ruslan Dautov, G. Tsouri
Social networking services, websites and mobile apps have become increasingly popular over the past years. As these services and applications become more sophisticated and encompassing, they are constantly looking for new methods of inferring social connections between peers. Some methods currently being used rely on identifying simultaneous geographical location of peers by means of the Global Positioning System and Internet Protocol addresses. These methods have limited accuracy and in most cases require actions by the peers. In this work, we consider utilizing estimations of the time-varying path loss of wireless transmissions from peers to infer their social interactions. Using a set of experiments, we demonstrate that the proposed method can be used to detect periods of social interactions by a monitoring receiver that is not coordinated with the peers.
{"title":"Tracking Social Interaction via Time Varying Path Loss Estimation from Wireless Transmissions","authors":"Quang-Bao Huynh, Ruslan Dautov, G. Tsouri","doi":"10.1109/CCNC.2019.8651731","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651731","url":null,"abstract":"Social networking services, websites and mobile apps have become increasingly popular over the past years. As these services and applications become more sophisticated and encompassing, they are constantly looking for new methods of inferring social connections between peers. Some methods currently being used rely on identifying simultaneous geographical location of peers by means of the Global Positioning System and Internet Protocol addresses. These methods have limited accuracy and in most cases require actions by the peers. In this work, we consider utilizing estimations of the time-varying path loss of wireless transmissions from peers to infer their social interactions. Using a set of experiments, we demonstrate that the proposed method can be used to detect periods of social interactions by a monitoring receiver that is not coordinated with the peers.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126732713","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651839
Florian Beye, Y. Shinohara, H. Shimonishi
Automatizing the process of designing communication services in network function virtualization (NFV) is important because it may reduce provisioning time and lead to more efficient designs. The design process involves solving performance constraints imposed by service level agreements (SLAs), which in turn requires accurate and fast performance prediction. However, effects such as resource contention make performance prediction in virtualized environments challenging when large numbers of possible combinations of software and hardware are considered. The key to scalability lies in finding a componentized approach that reduces the number of model degrees of freedom while still allowing high accuracy. In this work, we propose a componentized approach based on feed-forward networks that are composited from software and hardware models. Model parameter data is obtained from a machine learning technique which is fed using data generated from automatized offline performance measurements. An evaluation showed that our technology achieves a prediction accuracy close to 95% and prediction evaluation times of a few milliseconds.
{"title":"Towards Accurate and Scalable Performance Prediction for Automated Service Design in NFV","authors":"Florian Beye, Y. Shinohara, H. Shimonishi","doi":"10.1109/CCNC.2019.8651839","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651839","url":null,"abstract":"Automatizing the process of designing communication services in network function virtualization (NFV) is important because it may reduce provisioning time and lead to more efficient designs. The design process involves solving performance constraints imposed by service level agreements (SLAs), which in turn requires accurate and fast performance prediction. However, effects such as resource contention make performance prediction in virtualized environments challenging when large numbers of possible combinations of software and hardware are considered. The key to scalability lies in finding a componentized approach that reduces the number of model degrees of freedom while still allowing high accuracy. In this work, we propose a componentized approach based on feed-forward networks that are composited from software and hardware models. Model parameter data is obtained from a machine learning technique which is fed using data generated from automatized offline performance measurements. An evaluation showed that our technology achieves a prediction accuracy close to 95% and prediction evaluation times of a few milliseconds.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121568589","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651667
Yusuke Ito, H. Koga
Edge computing, which locates edge servers with limited computing and storage resources at the edge of networks, is expected as a novel architecture for low-latency applications. In edge computing, users offload a task to edge servers due to poor computing resources and batteries of mobile devices so that the edge servers execute the offloaded task and return the result of it to users. Users can thus enjoy various applications without depending on the limitations of mobile devices. However, when the edge server’s load is too heavy, a large number of tasks will be offloaded to distant cloud servers. The long distance between users and cloud servers significantly degrades the quality of mobile applications. To prevent this problem, we propose flow splitting and aggregation schemes to improve offload delay to cloud servers in edge computing. This scheme splits TCP connections between users and cloud servers at the edge server, and then aggregates TCP connections between the edge server and cloud servers. We show the effectiveness of our scheme through simulation evaluations.
{"title":"Improving Offload Delay using Flow Splitting and Aggregation in Edge Computing","authors":"Yusuke Ito, H. Koga","doi":"10.1109/CCNC.2019.8651667","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651667","url":null,"abstract":"Edge computing, which locates edge servers with limited computing and storage resources at the edge of networks, is expected as a novel architecture for low-latency applications. In edge computing, users offload a task to edge servers due to poor computing resources and batteries of mobile devices so that the edge servers execute the offloaded task and return the result of it to users. Users can thus enjoy various applications without depending on the limitations of mobile devices. However, when the edge server’s load is too heavy, a large number of tasks will be offloaded to distant cloud servers. The long distance between users and cloud servers significantly degrades the quality of mobile applications. To prevent this problem, we propose flow splitting and aggregation schemes to improve offload delay to cloud servers in edge computing. This scheme splits TCP connections between users and cloud servers at the edge server, and then aggregates TCP connections between the edge server and cloud servers. We show the effectiveness of our scheme through simulation evaluations.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121142794","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651862
Armir Bujari, C. Palazzi, D. Polonio, Marco Zanella
The increase in the amount of traffic with heterogeneous QoS requirements poses several challenges to end-to-end service provisioning. Network resource management and service differentiation are two crucial functionalities employed by service providers, proven essential in order to meet the end user requirements. In particular, application-driven networking has emerged as a viable alternative embodying the potential of enabling specific flow optimizations meeting application-specific requirements. In this context, Service Function Chaining (SFC) is seen as an enabling technology for the flexible management of specific service/application traffic. In this paradigm the network functions are seen as an ordered chain of interconnected functions handling traffic delivery (data plane), control and management. In this article we present a work in progress of a virtualized, container-based testbed with orchestration and management capabilities supporting service chains.
{"title":"Service Function Chaining: a lightweight container-based management and orchestration plane","authors":"Armir Bujari, C. Palazzi, D. Polonio, Marco Zanella","doi":"10.1109/CCNC.2019.8651862","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651862","url":null,"abstract":"The increase in the amount of traffic with heterogeneous QoS requirements poses several challenges to end-to-end service provisioning. Network resource management and service differentiation are two crucial functionalities employed by service providers, proven essential in order to meet the end user requirements. In particular, application-driven networking has emerged as a viable alternative embodying the potential of enabling specific flow optimizations meeting application-specific requirements. In this context, Service Function Chaining (SFC) is seen as an enabling technology for the flexible management of specific service/application traffic. In this paradigm the network functions are seen as an ordered chain of interconnected functions handling traffic delivery (data plane), control and management. In this article we present a work in progress of a virtualized, container-based testbed with orchestration and management capabilities supporting service chains.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116679090","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651710
Ruslan Dautov, G. Tsouri
We propose and evaluate a low-complexity random medium access control protocol for dense IoT applications. The protocol finds its origin in the HiperLAN standard and is based on Elimination Yield Non-Preemptive Multiple Access (EYNPMA). Collisions are resolved during a dedicated contention period at the beginning of the frame without coordination between nodes. We evaluate performance using analytical approach validated by computer simulations. Results show significant throughput increase in the context of IEEE 802.11 standard when the proposed protocol is used as a back off mechanism.
{"title":"Elimination Yield Based Collision Resolution Protocol for Dense IoT Networks","authors":"Ruslan Dautov, G. Tsouri","doi":"10.1109/CCNC.2019.8651710","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651710","url":null,"abstract":"We propose and evaluate a low-complexity random medium access control protocol for dense IoT applications. The protocol finds its origin in the HiperLAN standard and is based on Elimination Yield Non-Preemptive Multiple Access (EYNPMA). Collisions are resolved during a dedicated contention period at the beginning of the frame without coordination between nodes. We evaluate performance using analytical approach validated by computer simulations. Results show significant throughput increase in the context of IEEE 802.11 standard when the proposed protocol is used as a back off mechanism.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113979266","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651834
Georg von Zengen, Yannic Schröder, L. Wolf
Cyber-Physical Systems (CPSs) are used in various important application areas. Networking of several CPSs, the internal networking of CPSs components as well as the interconnection with other systems, is of major importance with respect to scientific, engineering and technical considerations; yet, it is also very challenging. In this paper we describe an architecture and methods which can be used for various networked CPSs. To base the system design and approaches on realistic requirements and devise suitable methods, we use tightly cooperating, mobile robots as application area. This is an example of challenging CPSs which put high demands on the networking methods. Nevertheless, the considerations are applicable to other CPSs as well. In order to enable networked mobile robots to perform individual and cooperative tasks, real-time support and network operations such as merge, split, and synchronize among clusters of such robots are needed. Further, management functions have to be provided which enable independent, but concurrent clusters to allocate and share scarce network resources. In the context of this paper, network resources are considered in a broad sense (e.g., time slots, frequency channels, codes) and assigned by a novel scheduling algorithm. Thus, a schedule means not only a sequence of time slots, but it takes all mentioned dimensions into account.
{"title":"A Communication Architecture for Cooperative Networked Cyber-Physical Systems","authors":"Georg von Zengen, Yannic Schröder, L. Wolf","doi":"10.1109/CCNC.2019.8651834","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651834","url":null,"abstract":"Cyber-Physical Systems (CPSs) are used in various important application areas. Networking of several CPSs, the internal networking of CPSs components as well as the interconnection with other systems, is of major importance with respect to scientific, engineering and technical considerations; yet, it is also very challenging. In this paper we describe an architecture and methods which can be used for various networked CPSs. To base the system design and approaches on realistic requirements and devise suitable methods, we use tightly cooperating, mobile robots as application area. This is an example of challenging CPSs which put high demands on the networking methods. Nevertheless, the considerations are applicable to other CPSs as well. In order to enable networked mobile robots to perform individual and cooperative tasks, real-time support and network operations such as merge, split, and synchronize among clusters of such robots are needed. Further, management functions have to be provided which enable independent, but concurrent clusters to allocate and share scarce network resources. In the context of this paper, network resources are considered in a broad sense (e.g., time slots, frequency channels, codes) and assigned by a novel scheduling algorithm. Thus, a schedule means not only a sequence of time slots, but it takes all mentioned dimensions into account.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134312646","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
扫码关注我们
求助内容：
应助结果提醒方式：