Proceedings of the 21st International Conference on Distributed Computing and Networking最新文献

{"title":"A Novel High rate LDPC code","authors":"A. Pramanik, A. Das","doi":"10.1145/3369740.3372777","DOIUrl":"https://doi.org/10.1145/3369740.3372777","url":null,"abstract":"In IoT applications with remote monitoring, the data is transferred through a wireless channel. To ensure data reliability, error control coding is essential. For the high error correcting ability, the Low density parity check (LDPC) codes are used as the most popular code for error-control in many domains like telecommunication, magnetic-recording, radio application, etc. Thus the data transmitted in IoT system may be encoded by LDPC codes. This paper presents a small length LDPC code of six-by-seven. The shifted identity matrix and a lower staircase matrix are used to construct the LDPC code. These codes have very low encoding complexity. Belief-propagation is used to decode the code. In the simulation result of the code, improved performance in bit error rate is shown. The simulation result of these codes shows a good performance in the bit-error-rate.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130631589","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}

{"title":"A Brief Survey on Various Prediction Models for Detection of ADHD from Brain-MRI Images","authors":"Shristi Das Biswas, Rivu Chakraborty, A. Pramanik","doi":"10.1145/3369740.3372775","DOIUrl":"https://doi.org/10.1145/3369740.3372775","url":null,"abstract":"In recent years, we have experienced an exponentially rising attentiveness towards the application of various machine-learning models to delve into image-diagnosis and prediction of lesion changes in the neuro-radiology domain. There have been over 1000 publications in the last six years on subject classification focussing on various neuro-disorders, several of them based on Attention deficit hyperactivity disorder (ADHD). Elaborate reports on such studies, such as the machine learning models, specimen quantity, input feature category, and recorded accuracy, are abridged. The survey encapsulates evidence, standing constraints, and the study employing machine learning to diagnose neuro-disorders using MRI data. The major gridlock for this domain continues to be the sparse specimen pool. This challenge could be plausibly overcome by various latest data-sharing models.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133825182","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}

{"title":"Application of Image Data Analytics for Immediate Disaster Response","authors":"Neha Chaudhuri, I. Bose","doi":"10.1145/3369740.3372729","DOIUrl":"https://doi.org/10.1145/3369740.3372729","url":null,"abstract":"This study identifies a novel source of data, i.e. images from smart urban infrastructures, that would be helpful in effective disaster management decision-making. For this purpose, we collected images from disaster-hit environments of Central Mexico (2017 earthquake). Also, this study utilizes deep learning convolutional neural network to analyze this novel dataset and evaluates the model effectiveness and technical viability during crisis scenarios. TensorFlow was utilized for the image classification task. The findings have important significance for effective disaster response.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"96 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133071612","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}

{"title":"PARMA-CC: Parallel Multiphase Approximate Cluster Combining","authors":"Amir Keramatian, Vincenzo Gulisano, M. Papatriantafilou, P. Tsigas","doi":"10.1145/3369740.3369785","DOIUrl":"https://doi.org/10.1145/3369740.3369785","url":null,"abstract":"Clustering is a common component in data analysis applications. Despite the extensive literature, the continuously increasing volumes of data produced by sensors (e.g. rates of several MB/s by 3D scanners such as LIDAR sensors), and the time-sensitivity of the applications leveraging the clustering outcomes (e.g. detecting critical situations, that are known to be accuracy-dependent), demand for novel approaches that respond faster while coping with large data sets. The latter is the challenge we address in this paper. We propose an algorithm, PARMA-CC, that complements existing density-based and distance-based clustering methods. PARMA-CC, is based on approximate, data parallel cluster combining, where parallel threads can compute summaries of clusters of data (sub)sets and, through combining, together construct a comprehensive summary of the sets of clusters. By approximating clusters with their respective geometrical summaries, our technique scales well with increased data volumes, and, by computing and efficiently combining the summaries in parallel, it enables latency improvements. PARMA-CC combines the summaries using special data structures that enable parallelism through in-place data processing. As we show in our analysis and evaluation, PARMA-CC can complement and outperform well-established methods, with significantly better scalability, while still providing highly accurate results in a variety of data sets, even with skewed data distributions, which cause the traditional approaches to exhibit their worst-case behaviour. In the paper we also describe how PARMA-CC can facilitate time-critical applications through appropriate use of the summaries.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122303551","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}

{"title":"GraphTM","authors":"Pavan Poudel, Gokarna Sharma","doi":"10.1145/3369740.3369774","DOIUrl":"https://doi.org/10.1145/3369740.3369774","url":null,"abstract":"In this paper, we present GraphTM, an efficient and scalable framework for processing transactions in a distributed environment. The distributed environment is modeled as a graph where each node of the graph is a processing node that issues transactions. The objects that transactions use to execute are also on the graph nodes (the initial placement may be arbitrary). The transactions execute on the nodes which issue them after collecting all the objects that they need following the data-flow model of computation. This collection is done by issuing the requests for the objects as soon as transaction starts and wait until all required objects for the transaction come to the requesting node. The challenge is on how to schedule the transactions so that two crucial performance metrics, namely (i) total execution time to commit all the transactions, and (ii) total communication cost involved in moving the objects to the requesting nodes, are minimized. We implemented GraphTM in Java and assessed its performance through 3 micro-benchmarks and 5 complex benchmarks from STAMP benchmark suite on 5 different network topologies, namely, clique, line, grid, cluster, and star, that make an underlying communication network for a representative set of distributed systems commonly used in practice. The results show the efficiency and scalability of our approach.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123239103","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}

{"title":"Opportunistic Priority Alternation Scheme for Faster Formation of 6TiSCH Network","authors":"Alakesh Kalita, M. Khatua","doi":"10.1145/3369740.3369779","DOIUrl":"https://doi.org/10.1145/3369740.3369779","url":null,"abstract":"The 6TiSCH protocol layer in Industrial Internet of Things (IIoT) fills the gap between the IETF low-power IPv6 communication stack and TSCH. Along with reliability, timed data delivery, and interoperability in IIoT network, 6TiSCH also deals with network bootstrapping. In this paper, the formation method of 6TiSCH network is assessed. It is observed that because of highest priority of beacon frames and unawareness of the requirement of routing information by a new node, performance of 6TiSCH network formation degrades. Therefore, we propose an opportunistic priority alternation scheme for urgent requirement of other control packets to form the 6TiSCH network quickly. We also opportunistically increase the transmission rate of packets carrying routing information. The proposed scheme is implemented on Cooja simulator and compare the simulation results with the benchmark protocol - Minimal Configuration Standard. Simulation results show that the proposed scheme converges faster than the benchmark protocol in network formation.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121935215","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}

{"title":"Distributed MST: A Smoothed Analysis","authors":"Soumyottam Chatterjee, Gopal Pandurangan, N. Pham","doi":"10.1145/3369740.3369778","DOIUrl":"https://doi.org/10.1145/3369740.3369778","url":null,"abstract":"We study smoothed analysis of distributed graph algorithms, focusing on the fundamental minimum spanning tree (MST) problem. With the goal of studying the time complexity of distributed MST as a function of the \"perturbation\" of the input graph, we posit a smoothing model that is parameterized by a smoothing parameter 0 ≤ ϵ(n) ≤ 1 which controls the amount of random edges that can be added to an input graph G per round. Informally, ϵ(n) is the probability (typically a small function of n, e.g., n--¼) that a random edge can be added to a node per round. The added random edges, once they are added, can be used (only) for communication. We show upper and lower bounds on the time complexity of distributed MST in the above smoothing model. We present a distributed algorithm that, with high probability, 1 computes an MST and runs in Õ(min{1/√ϵ(n)2O(√log n), D+ √n}) rounds2 where ϵ is the smoothing parameter, D is the network diameter and n is the network size. To complement our upper bound, we also show a lower bound of Ω(min{1/√ϵ(n), D + √n}). We note that the upper and lower bounds essentially match except for a multiplicative 2O(√log n) polylog(n) factor. Our work can be considered as a first step in understanding the smoothed complexity of distributed graph algorithms.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131828499","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}

{"title":"Optimal Patrolling of High Priority Segments while Visiting the Unit Interval with a Set of Mobile Robots","authors":"Oscar Morales-Ponce","doi":"10.1145/3369740.3369773","DOIUrl":"https://doi.org/10.1145/3369740.3369773","url":null,"abstract":"Consider a region that requires to be protected from unauthorized penetrations. The border of the region, modeled as a unit line segment, consists of high priority segments that require the highest level of protection separated by low priority segments that require to be visited infinitely often. We study the problem of patrolling the border with a set of k robots. The goal is to obtain a strategy that minimizes the maximum idle time (the time that a point is left unattended) of the high priority points while visiting the low priority points infinitely often. We use the concept of single lid cover (segments of fixed length) where each high priority point is covered with at least one lid, and then we extend it to strong double-lid cover where each high priority point is covered with at least two lids, and the unit line segment is fully covered. Let λk-1 be the minimum lid length that accepts a single λk-1-lid cover with k - 1 lids and Λ2k be the minimum lid length that accepts a strong double Λ2k-lid cover with 2k lids. We show that 2min(Λ2k, λk-1) is the lower bound of the idle time when the max speed of the robots is one. To compute Λ2k and λk-1, we present an algorithm with time complexity O(max(k, n) logn) where n is the number of high priority sections. Our algorithm improves by a factor of min(n, k) the previous O(knlogn) running time algorithm. For the upper bound, first we present a strategy with idle time λk-1 where one robot covers the unit line, and the remaining robots cover the lids of a single λk-1-lid cover with k - 1 lids. Then, we present a simple strategy with idle time 3Λ2k that splits the unit line into not-disjoint k segments of equal length that robots synchronously cover, i.e., reaching the leftmost and rightmost point simultaneously. Then, we present a complex strategy that split the unit line into k non-disjoint segments that robots asynchronously cover. We show that combining strategies one and two attain an approximation of 1.5 the optimal idle time and combining strategy one and third attain optimal idle time.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117169725","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}

{"title":"Dispersion of Mobile Robots in the Global Communication Model","authors":"A. Kshemkalyani, A. R. Molla, Gokarna Sharma","doi":"10.1145/3369740.3369775","DOIUrl":"https://doi.org/10.1145/3369740.3369775","url":null,"abstract":"The dispersion problem on graphs asks k ≤ n robots placed initially arbitrarily on the nodes of an n-node anonymous graph to reposition autonomously to reach a configuration in which each robot is on a distinct node of the graph. This problem is of significant interest due to its relationship to other fundamental robot coordination problems, such as exploration, scattering, load balancing, and relocation of self-driven electric cars (robots) to recharge stations (nodes). In this paper, we consider dispersion in the global communication model where a robot can communicate with any other robot in the graph (but the graph is unknown to robots). We provide three novel deterministic algorithms, two for arbitrary graphs and one for arbitrary trees, in a synchronous setting where all robots perform their actions in every time step. For arbitrary graphs, our first algorithm is based on a DFS traversal and guarantees O(min(m, kΔ)) steps runtime using Θ(log(max(k, Δ))) bits at each robot, where m is the number of edges and Δ is the maximum degree of the graph. The second algorithm for arbitrary graphs is based on a BFS traversal and guarantees O(max(D, k)Δ(D + Δ)) steps runtime using O(max(D, Δ log k)) bits at each robot, where D is the diameter of the graph. The algorithm for arbitrary trees is also based on a BFS travesal and guarantees O(D max(D, k)) steps runtime using O(max(D, Δ log k)) bits at each robot. Our results are significant improvements compared to the existing results established in the local communication model where a robot can communication only with other robots present at the same node.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131796060","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}

{"title":"A Generic Efficient Biased Optimizer for Consensus Protocols","authors":"Yehonatan Buchnik, R. Friedman","doi":"10.1145/3369740.3369783","DOIUrl":"https://doi.org/10.1145/3369740.3369783","url":null,"abstract":"Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on its exact variant and other environmental assumptions, solving consensus requires multiple communication rounds. Yet, there are known optimistic protocols that guarantee termination in a single communication round under favorable conditions. In this paper we present a generic optimizer that can turn any consensus protocol into an optimized protocol that terminates in a single communication round whenever all nodes start with the same predetermined value and no Byzantine failures occur (although node crashes are allowed). This is regardless of the network timing assumptions and additional oracle capabilities assumed by the base consensus protocol being optimized. In the case of benign failures, our optimizer works whenever the number of faulty nodes f < n/2. For Byzantine behavior, our optimizer's resiliency depends on the validity variant sought. In the case of classical validity, it can accommodate f < n/4 Byzantine failures. With the more recent external validity function assumption, it works whenever f < n/3. Either way, our optimizer only relies on oral messages, thereby imposing very lightweight crypto requirements.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129177825","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}