Pub Date : 2018-06-01DOI: 10.1109/ISNCC.2018.8530968
Amr H. El Mougy, Sandra Sameh
In the era of technology, Internet Of Things (IoT) which is a computing concept connecting a growing range of physical devices across the Internet, enriched our lives. IoT emerges with widespread applications and technologies including Wireless Sensor Networks (WSNs). Over the past few years, WSNs become one of the most evolving technologies and are considered as the connection between physical and virtual worlds for the ability to measure, collect and monitor environmental or physical conditions. Due to the large scale of WSNs being deployed to the Internet, security and privacy risks become crucial. The objective of this paper is to find a technique for anonymous communication and implement a security system for WSNs. This is achieved by implementing “Onion Routing” functionality on sensing devices, utilizing cryptography techniques and key distribution algorithms.
{"title":"Preserving Privacy in Wireless Sensor Networks using Onion Routing","authors":"Amr H. El Mougy, Sandra Sameh","doi":"10.1109/ISNCC.2018.8530968","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530968","url":null,"abstract":"In the era of technology, Internet Of Things (IoT) which is a computing concept connecting a growing range of physical devices across the Internet, enriched our lives. IoT emerges with widespread applications and technologies including Wireless Sensor Networks (WSNs). Over the past few years, WSNs become one of the most evolving technologies and are considered as the connection between physical and virtual worlds for the ability to measure, collect and monitor environmental or physical conditions. Due to the large scale of WSNs being deployed to the Internet, security and privacy risks become crucial. The objective of this paper is to find a technique for anonymous communication and implement a security system for WSNs. This is achieved by implementing “Onion Routing” functionality on sensing devices, utilizing cryptography techniques and key distribution algorithms.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122854976","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8531015
G. Orengo
The present contribution reports some of the most effective results achieved during the last few years in the frame of three different experiments (GAME, AMIGA, LIFE) of the Italian Institute of Nuclear Physics (INFN). In particular, four different foundry runs have been done using the ALENIA MESFET technology and more than thirty different circuits were designed and tested. Only few of them are reported, with a short description, in the following.
{"title":"Integrated circuits for data communication receivers","authors":"G. Orengo","doi":"10.1109/ISNCC.2018.8531015","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531015","url":null,"abstract":"The present contribution reports some of the most effective results achieved during the last few years in the frame of three different experiments (GAME, AMIGA, LIFE) of the Italian Institute of Nuclear Physics (INFN). In particular, four different foundry runs have been done using the ALENIA MESFET technology and more than thirty different circuits were designed and tested. Only few of them are reported, with a short description, in the following.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125128767","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530881
Xi Yu, Weilian Xue
To solve the spectrum and power allocation problem of distributed cognitive radio networks for D2D users, we propose a joint spectrum and power allocation algorithm based on potential game. Through all the D2D nodes uploading their own strategy selections, the model enables distributed nodes to make decisions using limited information, and establishes a resource allocation model that maximizes the overall benefit. The utility function takes the throughput as the gain, and the total mutual interference as the cost. Cognitive users detect the channel condition according to the interference criterion of SINR constraint, in order to guarantee that the node can select the strategy which meets the user's requirements and achieves Nash equilibrium quickly. In this paper, the convergence of the algorithm is proved theoretically. Simulation results show that the algorithm achieves the goal of joint allocation of spectrum and power with a fast convergence speed, and demonstrate superior throughput and fair allocation of resources in comparison with other non game-theoretic methods.
{"title":"Joint Spectrum Allocation and Power Control for Cognitive Radio Networks Based on Potential Game","authors":"Xi Yu, Weilian Xue","doi":"10.1109/ISNCC.2018.8530881","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530881","url":null,"abstract":"To solve the spectrum and power allocation problem of distributed cognitive radio networks for D2D users, we propose a joint spectrum and power allocation algorithm based on potential game. Through all the D2D nodes uploading their own strategy selections, the model enables distributed nodes to make decisions using limited information, and establishes a resource allocation model that maximizes the overall benefit. The utility function takes the throughput as the gain, and the total mutual interference as the cost. Cognitive users detect the channel condition according to the interference criterion of SINR constraint, in order to guarantee that the node can select the strategy which meets the user's requirements and achieves Nash equilibrium quickly. In this paper, the convergence of the algorithm is proved theoretically. Simulation results show that the algorithm achieves the goal of joint allocation of spectrum and power with a fast convergence speed, and demonstrate superior throughput and fair allocation of resources in comparison with other non game-theoretic methods.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126163310","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530934
Dilara Acarali, M. Rajarajan, N. Komninos
Botnets are still a pertinent threat to our digital infrastructure and a central topic for study in the cyber-research community. At the start of a botnet's life, the aim of the botmaster is to achieve enough spread to make their botnet functional and as potent as possible. Therefore, propagation dynamics are a vital area to address in order to effectively defend against this type of malware. Over the years, there have been many propagation models based on the principles of disease spread but these often do not take specific network characteristics into account. In this paper, we propose the novel use of a probabilistic adaptation of the SEIR (Susceptible, Exposed, Infected, Recovered) model applied to defence-in-depth networks with heterogeneous contact rates and node impact. We test this approach through numerical simulation and discuss our findings.
{"title":"Modelling Botnet Propagation in Networks with Layered Defences","authors":"Dilara Acarali, M. Rajarajan, N. Komninos","doi":"10.1109/ISNCC.2018.8530934","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530934","url":null,"abstract":"Botnets are still a pertinent threat to our digital infrastructure and a central topic for study in the cyber-research community. At the start of a botnet's life, the aim of the botmaster is to achieve enough spread to make their botnet functional and as potent as possible. Therefore, propagation dynamics are a vital area to address in order to effectively defend against this type of malware. Over the years, there have been many propagation models based on the principles of disease spread but these often do not take specific network characteristics into account. In this paper, we propose the novel use of a probabilistic adaptation of the SEIR (Susceptible, Exposed, Infected, Recovered) model applied to defence-in-depth networks with heterogeneous contact rates and node impact. We test this approach through numerical simulation and discuss our findings.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126417893","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530909
John Paul F. Cajanding, M. A. Mercado, N. Tiglao
Missing information in Wireless Sensor Network nodes can lead to inaccurate forecasts when state estimation is done on any particular system. This poses a serious threat to systems such as power distribution grids as a small miscalculation in the system can lead to disastrous effects. This paper proposes a relatively simple, yet novel, approach to forecasting missing information in a Wireless Sensor Network that collects high-frequency data. Specifically, the voltage measurements of the microPhasor Measurement Units from the Lawrence Berkeley National Lab with sampling frequency of 250Hz is analyzed. We model the problem as a matrix completion problem - similar to how collaborative filtering problems work. The average forecasting root mean square error is computed, estimated through the Frobenius Norm of the difference between the completed and the test matrices, at 0.03% while the standard deviation is around 0.15. We prove that there is a logarithmic increase of error when more data is missing - attributed to when the sensors are down more often, but the increase of error is negligible since it is still around 0.1%. The accurate measurements can be attributed to the high-frequency sampling rate used when collecting information - justifying the need for more high-frequency information collection through wireless sensor networks.
{"title":"High Frequency Dynamic Voltage Forecasting Under Reduced Wireless Sensor Network Observability","authors":"John Paul F. Cajanding, M. A. Mercado, N. Tiglao","doi":"10.1109/ISNCC.2018.8530909","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530909","url":null,"abstract":"Missing information in Wireless Sensor Network nodes can lead to inaccurate forecasts when state estimation is done on any particular system. This poses a serious threat to systems such as power distribution grids as a small miscalculation in the system can lead to disastrous effects. This paper proposes a relatively simple, yet novel, approach to forecasting missing information in a Wireless Sensor Network that collects high-frequency data. Specifically, the voltage measurements of the microPhasor Measurement Units from the Lawrence Berkeley National Lab with sampling frequency of 250Hz is analyzed. We model the problem as a matrix completion problem - similar to how collaborative filtering problems work. The average forecasting root mean square error is computed, estimated through the Frobenius Norm of the difference between the completed and the test matrices, at 0.03% while the standard deviation is around 0.15. We prove that there is a logarithmic increase of error when more data is missing - attributed to when the sensors are down more often, but the increase of error is negligible since it is still around 0.1%. The accurate measurements can be attributed to the high-frequency sampling rate used when collecting information - justifying the need for more high-frequency information collection through wireless sensor networks.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127295574","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530990
Maiass Zaher, S. Molnár
QUIC is a new transport protocol for transferring web traffic proposed by Google employing CUBIC as the default congestion control algorithm with a small but important modification where it uses a smaller congestion window reduction than the one used in the original CUBIC. Motivated by this change, in this paper we address the robustness and sensitivity of the multiplication decrease factor. More specifically, we investigate the page load time of QUIC as an impact of the multiplication decrease factor in different network environments by changing the loss rate, delay, buffer size, web page size, and bandwidth. We have found that the region where the impact of the change of the multiplication decrease factor in QUIC is pronounced when large web pages are downloaded with low round-trip time achieving 22% decrease in the page load time.
{"title":"On the Impact of the Multiplication Decrease Factor of QUIC","authors":"Maiass Zaher, S. Molnár","doi":"10.1109/ISNCC.2018.8530990","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530990","url":null,"abstract":"QUIC is a new transport protocol for transferring web traffic proposed by Google employing CUBIC as the default congestion control algorithm with a small but important modification where it uses a smaller congestion window reduction than the one used in the original CUBIC. Motivated by this change, in this paper we address the robustness and sensitivity of the multiplication decrease factor. More specifically, we investigate the page load time of QUIC as an impact of the multiplication decrease factor in different network environments by changing the loss rate, delay, buffer size, web page size, and bandwidth. We have found that the region where the impact of the change of the multiplication decrease factor in QUIC is pronounced when large web pages are downloaded with low round-trip time achieving 22% decrease in the page load time.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125328729","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530975
Guillaume Garzone, Nawal Guermouche, T. Monteil
The Internet of Things (IoT) continues to expand undeniably fast to reach billions of connected heterogeneous devices. This is changing the way systems are built: new applications integrating software and physical devices are emerging in different domains, such as health, smart building, and smart cities. This brings opportunities to enable new added value services. Nevertheless, building and managing such highly dynamic and heterogeneous infrastructures built upon a multitude of mobile and resource-limited devices is challenging. In this paper, we propose a semantic based autonomic management approach for service oriented IoT systems. The aim is to support building and managing highly dynamic new value added IoT services. The proposed approach relies on a semantic based model to characterize the system properties and then enables semantic reasoning, and graph grammars to enable its management and evolution. A use case is proposed to show the related features of the proposed approach and an evaluation study is presented.
{"title":"Autonomic Management Approach for Dynamic Service Based IoT Systems","authors":"Guillaume Garzone, Nawal Guermouche, T. Monteil","doi":"10.1109/ISNCC.2018.8530975","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530975","url":null,"abstract":"The Internet of Things (IoT) continues to expand undeniably fast to reach billions of connected heterogeneous devices. This is changing the way systems are built: new applications integrating software and physical devices are emerging in different domains, such as health, smart building, and smart cities. This brings opportunities to enable new added value services. Nevertheless, building and managing such highly dynamic and heterogeneous infrastructures built upon a multitude of mobile and resource-limited devices is challenging. In this paper, we propose a semantic based autonomic management approach for service oriented IoT systems. The aim is to support building and managing highly dynamic new value added IoT services. The proposed approach relies on a semantic based model to characterize the system properties and then enables semantic reasoning, and graph grammars to enable its management and evolution. A use case is proposed to show the related features of the proposed approach and an evaluation study is presented.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114870595","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8531049
Amira Bendjeddou, H. Laoufi, S. Boudjit
Minimizing the consumed energy in wireless sensor network has a great importance, especially when sensors are deployed in hostile environment. To fulfill this goal, a lot of methods are proposed in the literature, like clustering. In this paper we make an improvement to LEACH protocol, called LEACH-S for Low Energy Adaptive Clustering Hierarchy for Sensor Network in order to minimize the consumed energy and to reduce the overhead in the network. The main idea of our method is to reduce the cluster-head selection in each round. The simulation results show that our approach improves LEACH protocol. It reduces the consumed energy by each node and minimizes the overhead in the network.
{"title":"LEACH-S: Low Energy Adaptive Clustering Hierarchy for Sensor Network","authors":"Amira Bendjeddou, H. Laoufi, S. Boudjit","doi":"10.1109/ISNCC.2018.8531049","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531049","url":null,"abstract":"Minimizing the consumed energy in wireless sensor network has a great importance, especially when sensors are deployed in hostile environment. To fulfill this goal, a lot of methods are proposed in the literature, like clustering. In this paper we make an improvement to LEACH protocol, called LEACH-S for Low Energy Adaptive Clustering Hierarchy for Sensor Network in order to minimize the consumed energy and to reduce the overhead in the network. The main idea of our method is to reduce the cluster-head selection in each round. The simulation results show that our approach improves LEACH protocol. It reduces the consumed energy by each node and minimizes the overhead in the network.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121986285","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8531023
Christopher S. Baidal, David S. Salazar, V. S. Padilla, Rebeca L. Estrada, Nestor X. Arreaga
In Latin America, the number of car accidents are alarming figures every year. Ecuador is one of the countries that leads the statistics. This paper presents an engineering design proposal to detect a car accident on roads or highways with the aim to reduce deaths caused by these events and to improve the response time of the corresponding emergency entities. This work analyzes a particular scenario and does not pretend to compare the performance of our proposal with prior related works. Our solution consists of several components: a wireless sensor network with elements based on open source tools (such as Arduino nano microcontroller), distance sensors (HC-SR04) and accelerometer sensor (MMA7361), a Raspberry PI 3 model B embedded system and the deployment of a Zigbee network. The system is connected by means of a wireless local area network (WLAN) to a database server and a web application. Sensors response (accelerometer and proximity) in a frontal vehicle collision was proven by implementing a prototype, in order to be tested in a real scenario. The numerical results demonstrate that the response time between the vehicle and the concentrator affects (either increasing or reducing) the total communication time between the vehicle and the web server.
{"title":"Design of a Wireless Sensor Network to Detect Car Accidents on Highways","authors":"Christopher S. Baidal, David S. Salazar, V. S. Padilla, Rebeca L. Estrada, Nestor X. Arreaga","doi":"10.1109/ISNCC.2018.8531023","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531023","url":null,"abstract":"In Latin America, the number of car accidents are alarming figures every year. Ecuador is one of the countries that leads the statistics. This paper presents an engineering design proposal to detect a car accident on roads or highways with the aim to reduce deaths caused by these events and to improve the response time of the corresponding emergency entities. This work analyzes a particular scenario and does not pretend to compare the performance of our proposal with prior related works. Our solution consists of several components: a wireless sensor network with elements based on open source tools (such as Arduino nano microcontroller), distance sensors (HC-SR04) and accelerometer sensor (MMA7361), a Raspberry PI 3 model B embedded system and the deployment of a Zigbee network. The system is connected by means of a wireless local area network (WLAN) to a database server and a web application. Sensors response (accelerometer and proximity) in a frontal vehicle collision was proven by implementing a prototype, in order to be tested in a real scenario. The numerical results demonstrate that the response time between the vehicle and the concentrator affects (either increasing or reducing) the total communication time between the vehicle and the web server.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129880738","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530961
A. S. Tan, E. Zeydan
The exponential increase of mobile data traffic pushes mobile operators to seek more efficient heterogeneous communication techniques. In this study, multi-user extension methods for multiple attribute decision making algorithms for network-assisted data offloading in heterogeneous wireless networks are developed and performance evaluations are performed in the presence of Device-to-Device (D2D) connections. Evaluations are carried out using simulations to point out the metrics and factors influencing data offloading in heterogeneous networks. The simulation results indicate the superiority of incorporating network-based information besides user-based information in offloading decisions. Additionally, up to 67% increase in user satisfaction can be achieved when D2D density is kept 68% under a heavy load scenario. The simulation results also indicate the existence of optimal D2D densities in heterogeneous networks depending on the total number of users and available network capacity.
{"title":"The Impact of D2D Connections on Network-Assisted Mobile Data Offloading","authors":"A. S. Tan, E. Zeydan","doi":"10.1109/ISNCC.2018.8530961","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530961","url":null,"abstract":"The exponential increase of mobile data traffic pushes mobile operators to seek more efficient heterogeneous communication techniques. In this study, multi-user extension methods for multiple attribute decision making algorithms for network-assisted data offloading in heterogeneous wireless networks are developed and performance evaluations are performed in the presence of Device-to-Device (D2D) connections. Evaluations are carried out using simulations to point out the metrics and factors influencing data offloading in heterogeneous networks. The simulation results indicate the superiority of incorporating network-based information besides user-based information in offloading decisions. Additionally, up to 67% increase in user satisfaction can be achieved when D2D density is kept 68% under a heavy load scenario. The simulation results also indicate the existence of optimal D2D densities in heterogeneous networks depending on the total number of users and available network capacity.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128183162","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
扫码关注我们
求助内容：
应助结果提醒方式：