P. Paul, Naman Mehta, Aman Kumar Das, Sourav Agarwal, Sujoy Saha, S. Nandi
Dissemination of information after a large-scale disaster is always a difficult task and hinders the possibilities of proper decision making. Relief work and rescuing survivors take a major hit without a proper map showcasing the current scenario of the disaster-hit terrain. All due to the lack of traditional communication channels after a disaster. However, we want to change this with the proposition of Android-based mobile application SURAKSHIT that prepares 'localized' crisis map through 'offline' crowdsourcing of circumstantial data and distribution of the same in a smooth manner using a delay-tolerant network. The information gap between the first responders and local survivors can thus be greatly reduced with proper knowledge about the affected area collected by the volunteers. Multimedia data accumulated with the application can further assist the rescue forces in planning rescue-relief operations better.
{"title":"SURAKSHIT: a smartphone-based application for 'localized' GIS data aggregation in absence of internet","authors":"P. Paul, Naman Mehta, Aman Kumar Das, Sourav Agarwal, Sujoy Saha, S. Nandi","doi":"10.1145/3288599.3295588","DOIUrl":"https://doi.org/10.1145/3288599.3295588","url":null,"abstract":"Dissemination of information after a large-scale disaster is always a difficult task and hinders the possibilities of proper decision making. Relief work and rescuing survivors take a major hit without a proper map showcasing the current scenario of the disaster-hit terrain. All due to the lack of traditional communication channels after a disaster. However, we want to change this with the proposition of Android-based mobile application SURAKSHIT that prepares 'localized' crisis map through 'offline' crowdsourcing of circumstantial data and distribution of the same in a smooth manner using a delay-tolerant network. The information gap between the first responders and local survivors can thus be greatly reduced with proper knowledge about the affected area collected by the volunteers. Multimedia data accumulated with the application can further assist the rescue forces in planning rescue-relief operations better.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"252 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":"121240556","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}
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}
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}
Patrícia R. Sousa, André Cirne, João S. Resende, Rolando Martins, L. Antunes
The number of devices connected to the Internet has been increasing exponentially. There is a substantial amount of data being exchanged among numerous connected devices. The added convenience brought by these devices spans across multiple facets of everyday life, such as drivers reporting an accident through dash cams, patients monitoring their own health, and companies controlling the safety of their facilities. However, it is critical to increase safety and privacy across the data generated and propagated by these devices. Previous works have focused mainly on device management and relied on centralized solutions namely Public Key Infrastructure (PKI). This paper describes a novel mechanism that ensures secure autonomous communication between Internet of Things (IoT) devices, while using a completely decentralized solution that mitigates the classical single points-of-failure problem. This is accomplished by a new peer-to-peer protocol using Short Authentication Strings (SAS), in which verification is made through a Limited-Location Channel (LLC).
{"title":"pTASC: trustable autonomous secure communications","authors":"Patrícia R. Sousa, André Cirne, João S. Resende, Rolando Martins, L. Antunes","doi":"10.1145/3288599.3288623","DOIUrl":"https://doi.org/10.1145/3288599.3288623","url":null,"abstract":"The number of devices connected to the Internet has been increasing exponentially. There is a substantial amount of data being exchanged among numerous connected devices. The added convenience brought by these devices spans across multiple facets of everyday life, such as drivers reporting an accident through dash cams, patients monitoring their own health, and companies controlling the safety of their facilities. However, it is critical to increase safety and privacy across the data generated and propagated by these devices. Previous works have focused mainly on device management and relied on centralized solutions namely Public Key Infrastructure (PKI). This paper describes a novel mechanism that ensures secure autonomous communication between Internet of Things (IoT) devices, while using a completely decentralized solution that mitigates the classical single points-of-failure problem. This is accomplished by a new peer-to-peer protocol using Short Authentication Strings (SAS), in which verification is made through a Limited-Location Channel (LLC).","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"78 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":"122452022","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}
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}
We consider the distributed setting of K = (k + 1) × (k + 1) autonomous mobile robots operating on a grid graph of N = (n + 1) × (n + 1) nodes with n = k · d, d ≥ 2, k ≥ 2, following Look-Compute-Move cycles and communicating with other robots using colored lights under the robots with lights model. We consider the uniform scattering problem of repositioning the robots on the nodes of the grid graph so that each robot reach to a static configuration in which they cover uniformly the grid. In this paper, we provide the first O(n) time algorithm for this problem for robots with lights in the fully synchronous setting, given that the robots have the common orientation, the knowledge of parameters n and k, and the visibility range of distance 2d. The best previously known algorithm solves this problem in O(N/d) (i.e., O(n2/d)) time under the classic oblivious robots model (with no lights) with the same capabilities in the asynchronous setting. Our algorithm is asymptotically time-optimal, since for any solution to this uniform scattering problem in both the classic and lights models, Ω(n) time is necessary. Moreover, the proposed algorithm is collision-free.
{"title":"Time-optimal uniform scattering in a grid","authors":"Pavan Poudel, Gokarna Sharma","doi":"10.1145/3288599.3288622","DOIUrl":"https://doi.org/10.1145/3288599.3288622","url":null,"abstract":"We consider the distributed setting of K = (k + 1) × (k + 1) autonomous mobile robots operating on a grid graph of N = (n + 1) × (n + 1) nodes with n = k · d, d ≥ 2, k ≥ 2, following Look-Compute-Move cycles and communicating with other robots using colored lights under the robots with lights model. We consider the uniform scattering problem of repositioning the robots on the nodes of the grid graph so that each robot reach to a static configuration in which they cover uniformly the grid. In this paper, we provide the first O(n) time algorithm for this problem for robots with lights in the fully synchronous setting, given that the robots have the common orientation, the knowledge of parameters n and k, and the visibility range of distance 2d. The best previously known algorithm solves this problem in O(N/d) (i.e., O(n2/d)) time under the classic oblivious robots model (with no lights) with the same capabilities in the asynchronous setting. Our algorithm is asymptotically time-optimal, since for any solution to this uniform scattering problem in both the classic and lights models, Ω(n) time is necessary. Moreover, the proposed algorithm is collision-free.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"11 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":"128124044","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}
Smart cities are a manifestation of the Internet of Things (IoT). The push for smart cities has led to the proliferation of video cameras in public spaces [1]. London is expected to deploy 642,000 cameras by 2020. These cameras will be used primarily for surveillance of the city for urban safety. At the same time, such smart city deployments have also seen edge and fog computing paradigms gain preference over the cloud-only computing model [2]. This is due to the network proximity of the edge and fog devices to the data sources, offering lower latency access to data and lower bandwidth requirements to push high volume data, such as video streams, to the cloud.
{"title":"A scalable and composable analytics platform for distributed wide-area tracking","authors":"Aakash Khochare, Yogesh L. Simmhan","doi":"10.1145/3288599.3299753","DOIUrl":"https://doi.org/10.1145/3288599.3299753","url":null,"abstract":"Smart cities are a manifestation of the Internet of Things (IoT). The push for smart cities has led to the proliferation of video cameras in public spaces [1]. London is expected to deploy 642,000 cameras by 2020. These cameras will be used primarily for surveillance of the city for urban safety. At the same time, such smart city deployments have also seen edge and fog computing paradigms gain preference over the cloud-only computing model [2]. This is due to the network proximity of the edge and fog devices to the data sources, offering lower latency access to data and lower bandwidth requirements to push high volume data, such as video streams, to the cloud.","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":"129020258","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
扫码关注我们
求助内容：
应助结果提醒方式：