Mayank K. Aditia, Fahiem Altaf, Moirangthem R. Singh, M. S. Burra, Chanchal Maurya, S. S. Sahoo, Soumyadev Maity
Resource constrained devices such as sensors and RFIDs are utilized in many application areas to sense, store and transmit the sensitive data. This data must be encrypted to achieve confidentiality. The implementation of traditional public key encryption (PKE) techniques by these devices is always challenging as they possess very limited computational resources. Various encryption schemes based on identity-based encryption (IBE) and certificate-less public key encryption (CL-PKE) have been proposed to overcome limitations of PKI. However, many of these schemes involve the computationally expensive exponentiation and bilinear pairing operations on elliptic curve group to encrypt the messages. In this context, we propose a lightweight optimized CL-PKE scheme in which exponentiation and pairing operations are completely eliminated during encryption and only involves computation of cheaper addition and multiplication operations on elliptic curve. Implementation of the proposed scheme confirms its lightweight nature as compared to original CL-PKE scheme.
{"title":"Optimized CL-PKE with lightweight encryption for resource constrained devices","authors":"Mayank K. Aditia, Fahiem Altaf, Moirangthem R. Singh, M. S. Burra, Chanchal Maurya, S. S. Sahoo, Soumyadev Maity","doi":"10.1145/3288599.3296014","DOIUrl":"https://doi.org/10.1145/3288599.3296014","url":null,"abstract":"Resource constrained devices such as sensors and RFIDs are utilized in many application areas to sense, store and transmit the sensitive data. This data must be encrypted to achieve confidentiality. The implementation of traditional public key encryption (PKE) techniques by these devices is always challenging as they possess very limited computational resources. Various encryption schemes based on identity-based encryption (IBE) and certificate-less public key encryption (CL-PKE) have been proposed to overcome limitations of PKI. However, many of these schemes involve the computationally expensive exponentiation and bilinear pairing operations on elliptic curve group to encrypt the messages. In this context, we propose a lightweight optimized CL-PKE scheme in which exponentiation and pairing operations are completely eliminated during encryption and only involves computation of cheaper addition and multiplication operations on elliptic curve. Implementation of the proposed scheme confirms its lightweight nature as compared to original CL-PKE scheme.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125319911","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}
S. Bhattacharyya, Priyadarshini Dey, J. Basak, Siuli Roy, S. Bandyopadhyay
Natural disasters like cyclones are a common phenomenon in India, especially in coastal regions. During disaster, victims of a village/ locality normally take shelters in groups in some nearby safe areas (for example, Multi Purpose Cyclone Shelters). Despite of having access to physical infrastructure with basic facilities, disaster victims at cyclone shelters often find it difficult to communicate their exact situational information (like, resource needs and damage information) directly to the local/central authorities. Due to lack of coordination among relief workers and the remote central office, conflicting demands are often generated, causing mismanagement and delay in relief operation. This paper proposes innovative usage of social technology to build resilient community, a mandatory prerequisite to enhance disaster preparedness and coping up mechanisms among collectives inhabited in vulnerable areas. This paper presents an architecture of a Knowledge Informatics Hubs using social technologies at local multipurpose cyclone shelters (MPCS) in coastal areas that will empower the local community members to interact and collaborate with each other, establish communication with various supporting agencies during disaster, establish links with experts and participate in local governance. The aim of creating such a hub would be to create digitally empowered resilient communities who are not only prepared to prevent or minimize the risk of damage to life, property, and the environment due to disaster, but also have the ability to quickly reinstate their normal life and livelihood after a crisis, reopen businesses, and restore other essential services needed for the full economic recovery.
{"title":"Building resilient community using social technologies: a precursory measure for effective disaster management","authors":"S. Bhattacharyya, Priyadarshini Dey, J. Basak, Siuli Roy, S. Bandyopadhyay","doi":"10.1145/3288599.3295591","DOIUrl":"https://doi.org/10.1145/3288599.3295591","url":null,"abstract":"Natural disasters like cyclones are a common phenomenon in India, especially in coastal regions. During disaster, victims of a village/ locality normally take shelters in groups in some nearby safe areas (for example, Multi Purpose Cyclone Shelters). Despite of having access to physical infrastructure with basic facilities, disaster victims at cyclone shelters often find it difficult to communicate their exact situational information (like, resource needs and damage information) directly to the local/central authorities. Due to lack of coordination among relief workers and the remote central office, conflicting demands are often generated, causing mismanagement and delay in relief operation. This paper proposes innovative usage of social technology to build resilient community, a mandatory prerequisite to enhance disaster preparedness and coping up mechanisms among collectives inhabited in vulnerable areas. This paper presents an architecture of a Knowledge Informatics Hubs using social technologies at local multipurpose cyclone shelters (MPCS) in coastal areas that will empower the local community members to interact and collaborate with each other, establish communication with various supporting agencies during disaster, establish links with experts and participate in local governance. The aim of creating such a hub would be to create digitally empowered resilient communities who are not only prepared to prevent or minimize the risk of damage to life, property, and the environment due to disaster, but also have the ability to quickly reinstate their normal life and livelihood after a crisis, reopen businesses, and restore other essential services needed for the full economic recovery.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124461739","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}
The dynamic spectrum access (DSA) algorithms aim to maximize network throughput by ensuring orthogonal channel allocation among secondary users (SUs) in cognitive radio network. Most of the existing DSA algorithms need prior knowledge of the number of active SUs and thus may not be suitable for battery operated resource constrained SU terminals in the infrastructure-less cognitive radio terminals. Another drawback of these algorithms is that they assume the static network with a fixed number of SUs in the network throughout the horizon and their extension for dynamic network in which SUs may enter or exit the network anytime is challenging. Thus, our goal is to design the DSA algorithms for the dynamic networks of unknown size.
{"title":"Channel selection in dynamic networks of unknown size","authors":"Rohit Kumar, S. Darak","doi":"10.1145/3288599.3299727","DOIUrl":"https://doi.org/10.1145/3288599.3299727","url":null,"abstract":"The dynamic spectrum access (DSA) algorithms aim to maximize network throughput by ensuring orthogonal channel allocation among secondary users (SUs) in cognitive radio network. Most of the existing DSA algorithms need prior knowledge of the number of active SUs and thus may not be suitable for battery operated resource constrained SU terminals in the infrastructure-less cognitive radio terminals. Another drawback of these algorithms is that they assume the static network with a fixed number of SUs in the network throughout the horizon and their extension for dynamic network in which SUs may enter or exit the network anytime is challenging. Thus, our goal is to design the DSA algorithms for the dynamic networks of unknown size.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124520451","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}
Ankur Pandey, Piyush Tiwary, Sudhir Kumar, Sajal K. Das
In this paper, we propose a novel climate-smart Agriculture Cyber-Physical System (ACPS) for precision farming. The primary motive of the ACPS is to perform real-time fault location tracking in the agricultural field using multivariate sensor data. The computing model in the ACPS uses a novel hybrid classification approach which combines two classifiers for the location estimation of the sensor node. The novelty of the proposed method lies in predicting the locations that need more irrigation, soil nutrients or immediate human intervention using the sensor data. We also derive the computational complexity of the proposed method. The location accuracy improves reasonably as compared to the current-state-of-the-art methods.
{"title":"A hybrid classifier approach to multivariate sensor data for climate smart agriculture cyber-physical systems","authors":"Ankur Pandey, Piyush Tiwary, Sudhir Kumar, Sajal K. Das","doi":"10.1145/3288599.3288621","DOIUrl":"https://doi.org/10.1145/3288599.3288621","url":null,"abstract":"In this paper, we propose a novel climate-smart Agriculture Cyber-Physical System (ACPS) for precision farming. The primary motive of the ACPS is to perform real-time fault location tracking in the agricultural field using multivariate sensor data. The computing model in the ACPS uses a novel hybrid classification approach which combines two classifiers for the location estimation of the sensor node. The novelty of the proposed method lies in predicting the locations that need more irrigation, soil nutrients or immediate human intervention using the sensor data. We also derive the computational complexity of the proposed method. The location accuracy improves reasonably as compared to the current-state-of-the-art methods.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125476294","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}
Research in neuro-biological memory encoding suggests that it takes place through various biophysical and biochemical mechanisms during synaptic transmission of information between neurons. However, there are no mathematical models to explain how these processes result in real-time memory encoding which is compressed and distributed in different neuronal pathways across different brain regions. Biologically inspired artificial neural networks that accomplish learning by updating its synaptic weights, lack a theoretical justification. In this work, we propose a novel biologically inspired network architecture of neural memory encoding, preserving its various attributes including compression, non-linearity, distributed processing and dynamical nature. We demonstrate that our model is capable of universal computation and satisfies the approximation theorem.
{"title":"A novel compression based neuronal architecture for memory encoding","authors":"Aditi Kathpalia, N. Nagaraj","doi":"10.1145/3288599.3295575","DOIUrl":"https://doi.org/10.1145/3288599.3295575","url":null,"abstract":"Research in neuro-biological memory encoding suggests that it takes place through various biophysical and biochemical mechanisms during synaptic transmission of information between neurons. However, there are no mathematical models to explain how these processes result in real-time memory encoding which is compressed and distributed in different neuronal pathways across different brain regions. Biologically inspired artificial neural networks that accomplish learning by updating its synaptic weights, lack a theoretical justification. In this work, we propose a novel biologically inspired network architecture of neural memory encoding, preserving its various attributes including compression, non-linearity, distributed processing and dynamical nature. We demonstrate that our model is capable of universal computation and satisfies the approximation theorem.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125476799","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}
Execution of any recovery procedure in compromised nodes of a Cloud should aim at covering as many nodes as possible in a given time. The authors propose an innovative approach using the concept of percolation centrality to spread the execution of a recovery procedure across adjacent nodes in a P2PCloud. Compromised networks can be large since botnets and malware infections use the advantage of the internet to spread rapidly. Using percolation centrality to choose a node from where to begin, the recovery procedure runs in parallel in different nodes which can be reached from a chosen node and spreads fast.
{"title":"A percolation-based recovery mechanism for bot infected P2P cloud","authors":"Sanghamitra De, M. S. Barik, I. Banerjee","doi":"10.1145/3288599.3295597","DOIUrl":"https://doi.org/10.1145/3288599.3295597","url":null,"abstract":"Execution of any recovery procedure in compromised nodes of a Cloud should aim at covering as many nodes as possible in a given time. The authors propose an innovative approach using the concept of percolation centrality to spread the execution of a recovery procedure across adjacent nodes in a P2PCloud. Compromised networks can be large since botnets and malware infections use the advantage of the internet to spread rapidly. Using percolation centrality to choose a node from where to begin, the recovery procedure runs in parallel in different nodes which can be reached from a chosen node and spreads fast.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130407264","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}
The rapid expansion of mobile technology and real time applications partake strictly to support quality of service (QoS) such as throughput, delay, energy consumption, jitter etc. Mobile technology like MANET experiences frequent and randomly changing network topology. A major challenge is to design QoS based congestion free routing algorithm in MANET. The paper presents a novel, hybrid routing protocol driven by the principles of Newtonian Mechanics. We select the shortest paths and nodes based on the residual energy state of the nodes enabling the protocol mitigate the problem of congestion. Path selection and congestion control are handled by the values calculated by using a physics based concept namely the Coefficient of Restitution. The simulation results show that the protocol provides reasonably good benchmarks of Quality of Service (QoS) in terms of end to end delay, packet delivery ratio and throughput.
{"title":"COR-HR: an efficient hybrid routing approach using coefficient of restitution in MANET","authors":"Sumana Sinha, Snehanshu Saha, Sudeepta Mishra","doi":"10.1145/3288599.3295579","DOIUrl":"https://doi.org/10.1145/3288599.3295579","url":null,"abstract":"The rapid expansion of mobile technology and real time applications partake strictly to support quality of service (QoS) such as throughput, delay, energy consumption, jitter etc. Mobile technology like MANET experiences frequent and randomly changing network topology. A major challenge is to design QoS based congestion free routing algorithm in MANET. The paper presents a novel, hybrid routing protocol driven by the principles of Newtonian Mechanics. We select the shortest paths and nodes based on the residual energy state of the nodes enabling the protocol mitigate the problem of congestion. Path selection and congestion control are handled by the values calculated by using a physics based concept namely the Coefficient of Restitution. The simulation results show that the protocol provides reasonably good benchmarks of Quality of Service (QoS) in terms of end to end delay, packet delivery ratio and throughput.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131862583","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}
Mobile sinks are generally used in wireless sensor networks for energy-efficient data collection. Scheduling of mobile sink in a large scale network is a challenging problem. Tracing of some nodes in the network as landmark-nodes, via clustering can lead to efficient mobile sink scheduling. In this paper, a novel method for landmark-node tracing based on multi-agent random walks on network graphs is proposed. This method ensures low complexity while maintaining the clustering efficiency, especially over large WSN. Additionally, it is energy-efficient and improves the lifetime of a network. Low complexity of the proposed method is illustrated by analysing the cover time and hitting time of multi-agent random walks. Extensive experimental results obtained on Intel Berkeley Research Lab data indicate large improvements in energy-efficiency and computational complexity when the proposed method is used for landmark-node tracing.
{"title":"Low complexity landmark-node tracing in WSNs using multi-agent random walks","authors":"Surender Redhu, R. Hegde","doi":"10.1145/3288599.3288628","DOIUrl":"https://doi.org/10.1145/3288599.3288628","url":null,"abstract":"Mobile sinks are generally used in wireless sensor networks for energy-efficient data collection. Scheduling of mobile sink in a large scale network is a challenging problem. Tracing of some nodes in the network as landmark-nodes, via clustering can lead to efficient mobile sink scheduling. In this paper, a novel method for landmark-node tracing based on multi-agent random walks on network graphs is proposed. This method ensures low complexity while maintaining the clustering efficiency, especially over large WSN. Additionally, it is energy-efficient and improves the lifetime of a network. Low complexity of the proposed method is illustrated by analysing the cover time and hitting time of multi-agent random walks. Extensive experimental results obtained on Intel Berkeley Research Lab data indicate large improvements in energy-efficiency and computational complexity when the proposed method is used for landmark-node tracing.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129543209","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}
I. M. A. Jawarneh, P. Bellavista, L. Foschini, Giuseppe Martuscelli, R. Montanari, Amedeo Palopoli, F. Bosi
Current cloud deployments heavily depend on hypervisor-based virtualizations. The overarching characteristics of Docker and containerization have given them a momentum in their widespread adoption recently as alternatives for their counterparts. However, little research has been done for comparing the QoS of both technologies, thus leaving the domain without widely accepted performance metrics. Aiming at informing the decision of the best fit in a specific cloud deployment, we have designed performance metrics that compare the performance of both designs in an in-house cluster deployed by using OpenStack. We focus on well-established representatives as baselines, including KVM from the hypervisor-based side, LXD from the container-based side in addition to Docker. Our results show that containerization is not a predominant fit-all solution that can always replace hypervisors for all cluster deployment and application scenarios. It can instead be thought of as a complementary solution to use for specific application scenarios that are constrained with conditions that are solved by containerization merits.
{"title":"QoS and performance metrics for container-based virtualization in cloud environments","authors":"I. M. A. Jawarneh, P. Bellavista, L. Foschini, Giuseppe Martuscelli, R. Montanari, Amedeo Palopoli, F. Bosi","doi":"10.1145/3288599.3288631","DOIUrl":"https://doi.org/10.1145/3288599.3288631","url":null,"abstract":"Current cloud deployments heavily depend on hypervisor-based virtualizations. The overarching characteristics of Docker and containerization have given them a momentum in their widespread adoption recently as alternatives for their counterparts. However, little research has been done for comparing the QoS of both technologies, thus leaving the domain without widely accepted performance metrics. Aiming at informing the decision of the best fit in a specific cloud deployment, we have designed performance metrics that compare the performance of both designs in an in-house cluster deployed by using OpenStack. We focus on well-established representatives as baselines, including KVM from the hypervisor-based side, LXD from the container-based side in addition to Docker. Our results show that containerization is not a predominant fit-all solution that can always replace hypervisors for all cluster deployment and application scenarios. It can instead be thought of as a complementary solution to use for specific application scenarios that are constrained with conditions that are solved by containerization merits.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116170482","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}
Shaheen Sultana, Fahiem Altaf, Mayank K. Aditia, M. S. Burra, Chanchal Maurya, Soumyadev Maity
For many Intelligent Transportation System (ITS) applications, periodic transmission of beacon messages by a source vehicle is paramount for providing the unhindered service and to maintain its accuracy. A malicious source vehicle could deny beacon messages of a target ITS application and intelligently cover-up this denial with signal loss faced due to wireless channel error and surrounding environment obstacles. In this context, we propose a lightweight technique to detect a beacon denial attacker using Auto-Correlation Function (ACF). This technique possesses higher detection accuracy in comparison to fixed threshold scheme which depends upon the number of beacon messages denied by the source vehicle. Furthermore, we propose a random vehicle inspection scheme for inspecting randomly chosen set of vehicles for beacon denial attack. In addition to reducing computational overhead, the advantage of this scheme is that an attacker with knowledge about detection algorithm cannot decide the time and place of inspection. Simulation results confirm the accurate and lightweight nature of the proposed technique.
{"title":"Detection of beacon transmission denial attack in ITS using temporal auto-correlation and random inspections","authors":"Shaheen Sultana, Fahiem Altaf, Mayank K. Aditia, M. S. Burra, Chanchal Maurya, Soumyadev Maity","doi":"10.1145/3288599.3288616","DOIUrl":"https://doi.org/10.1145/3288599.3288616","url":null,"abstract":"For many Intelligent Transportation System (ITS) applications, periodic transmission of beacon messages by a source vehicle is paramount for providing the unhindered service and to maintain its accuracy. A malicious source vehicle could deny beacon messages of a target ITS application and intelligently cover-up this denial with signal loss faced due to wireless channel error and surrounding environment obstacles. In this context, we propose a lightweight technique to detect a beacon denial attacker using Auto-Correlation Function (ACF). This technique possesses higher detection accuracy in comparison to fixed threshold scheme which depends upon the number of beacon messages denied by the source vehicle. Furthermore, we propose a random vehicle inspection scheme for inspecting randomly chosen set of vehicles for beacon denial attack. In addition to reducing computational overhead, the advantage of this scheme is that an attacker with knowledge about detection algorithm cannot decide the time and place of inspection. Simulation results confirm the accurate and lightweight nature of the proposed technique.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129450553","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
扫码关注我们
求助内容：
应助结果提醒方式：