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

筛选
英文 中文
GP-GPU Computing for Analysis of Large Scale networks 用于大规模网络分析的GP-GPU计算
A. Ghoshal, Nabanita Das
{"title":"GP-GPU Computing for Analysis of Large Scale networks","authors":"A. Ghoshal, Nabanita Das","doi":"10.1145/3369740.3373801","DOIUrl":"https://doi.org/10.1145/3369740.3373801","url":null,"abstract":"Over last few years the interest in large scale network processing has gained momentum due to the increased importance of efficient processing of such networks for the analysis and problem solving in Social networks, Internet of Things(IoT), Data mining, Biological networks etc.. The steep increase in volume of data being produced, necessitates the development of parallel and distributed graph processing algorithms that demand extensive computation. Now a days, because of high-computing-power of GP-GPUs (General Purpose Graphic Processor Unit) and its cost-effectiveness, GP-GPUs are being widely used in almost all areas of computing. In this paper, we address the problem of designing efficient parallel graph processing algorithms for GP-GPU platform which is the upcoming trend in high end machines. Presently, the problem of community detection and its influence on misinformation containment in online social networks have been investigated thoroughly, and parallel CUDA algorithms have been proposed. Simulation studies show a significant speed-up compared to the existing sequential/parallel techniques.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"115 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":"124701428","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}
引用次数: 0
Design of a Forensic Enabled Secure Cloud Logging 一种支持取证的安全云日志的设计
Sagar Rane, S. Wagh, A. Dixit
{"title":"Design of a Forensic Enabled Secure Cloud Logging","authors":"Sagar Rane, S. Wagh, A. Dixit","doi":"10.1145/3369740.3373803","DOIUrl":"https://doi.org/10.1145/3369740.3373803","url":null,"abstract":"Adoption of cloud computing services greatly reduce the cost of managing businesses and increase the productivity. But, due to complex network configurations of cloud, it is a vector for various malicious attacks. Logs are the most valuable element which can be helpful in revealing the insights of any activity happened in cloud. Experienced attackers and malicious users always targets to destroy logging service first, after their attacks to remain untraceable. The existing logging techniques, which consider logger as a trusted stakeholder cannot be applied in cloud as there is possibility of collusion in between logger of cloud i.e. cloud service provider and fraud cloud service consumer or cloud forensic investigators to falsify the logs.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"50 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":"128821714","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}
引用次数: 1
DroidLight
Sakil Barbhuiya, Peter Kilpatrick, Dimitrios S. Nikolopoulos
{"title":"DroidLight","authors":"Sakil Barbhuiya, Peter Kilpatrick, Dimitrios S. Nikolopoulos","doi":"10.1145/3369740.3369796","DOIUrl":"https://doi.org/10.1145/3369740.3369796","url":null,"abstract":"Smartphone malware attacks are increasing alongside the growth of smartphone applications in the market. Researchers have proposed techniques to detect malware attacks using various approaches, which broadly include signature and anomaly-based intrusion detection systems (IDSs). Anomaly-based IDSs usually require training machine learning models with datasets collected from running both benign and malware applications. This may result in low detection accuracy when detecting zero-day malwares, i.e. those not previously seen or recorded. In this paper, we propose DroidLight, a lightweight IDS which can detect zero-day malware efficiently and effectively. We designed an algorithm for DroidLight that is based on one class classification and probability distribution analysis. For each smartphone application, the classification model learns its normal CPU utilisation and network traffic pattern. The model flags an intrusion alert if there is any significant deviation from the normal pattern. By deploying three self-developed malwares we performed realistic evaluation of DroidLight, i.e. the evaluation was performed on a real device while a real user was interacting with it. Evaluation results demonstrate that DroidLight can detect smartphone malwares with accuracy ranging from 93.3% to 100% while imposing only 1.5% total overhead on device resources.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"100 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":"123186880","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}
引用次数: 8
Privacy Preserving Opinion Publishing System for Opinion Poll 保护隐私的民意调查意见发布系统
Dhaneshwar Mardi, S. Sarkar, Jaydeep Howlader
{"title":"Privacy Preserving Opinion Publishing System for Opinion Poll","authors":"Dhaneshwar Mardi, S. Sarkar, Jaydeep Howlader","doi":"10.1145/3369740.3372764","DOIUrl":"https://doi.org/10.1145/3369740.3372764","url":null,"abstract":"Public opinion is the belief or thought of a group of people regarding a particular topic, especially on politics, religion, social issues, demographic diversity, etc. The opinion of the individual may be sensitive since it reflects the perception, understanding, belief, conflict, and desire of that individual. The traditional mechanisms of collecting public opinions (e.g., survey, questionnaire, interviewer, mailing) are often compromising individual's privacy. Those mechanisms do not anonymize the individual's identity. Therefore people are often abstained from expressing their rational opinions. The electronic opinion collection systems are designed with a central server that keeps all the user's profiles, which may be linked the opinions, thereby compromises the privacy. In this paper, we present a multiparty opinion collecting and publishing protocol that preserves the user's identity. The protocol does not rely on any trusted third party (e.g. central server). It rather forms quorums to execute the process. Party independently cannot learn the individual's opinions. Moreover, the protocol publishes the opinions anonymously, thereby preserves the privacy of the individuals.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"69 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":"122745108","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}
引用次数: 0
Exploiting Redundancy and Mobility in Energy-Efficient Communication for WBANs 利用冗余和移动性实现无线局域网的节能通信
Avani Vyas, Sujata Pal
{"title":"Exploiting Redundancy and Mobility in Energy-Efficient Communication for WBANs","authors":"Avani Vyas, Sujata Pal","doi":"10.1145/3369740.3369789","DOIUrl":"https://doi.org/10.1145/3369740.3369789","url":null,"abstract":"Sensor nodes attached with the human body continuously sense and transfer real-time raw data to the coordinator node. The continuous process of sensing generally produces redundant data, which drains energy of the nodes. We study real medical dataset of diabetes, heart rate and body temperature to analyze redundancy in sensed data. We also collected and studied the human pulse rate of different subjects gathered by using pulse sensor for the duration of 20 minutes. This study confirms that redundancy is present in all datasets. Therefore, we propose an auto-regression based prediction algorithm to decide the minimum sampling frequency (rate with which node will sense data) of sensor nodes. This sampling frequency could provide reliable medical information with tolerable prediction error. Additionally, the line-of-sight of communications (LOS) also plays a significant role in the energy consumption of the network. We design Scenario 1 (human standing) and Scenario 2 (walking posture) to study the effect of LOS on the lifetime of the network. In order to address the non-LOS communication, we propose an opportunistic communication protocol for intra-WBANs. The protocol exploits human mobility and data redundancy to maximize the lifetime of the network. Our proposed approach ensures that the remaining lifetime of the nodes is higher compared to other existing relay-based intra-WBAN communication protocols, such as SIMPLE and ATTEMPT. The proposed method is also having least pathloss effect compared to other protocols.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"113 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":"127565816","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}
引用次数: 6
On the Energy in Displacement of Random Sensors for Connectivity and Interference 基于连通性和干扰的随机传感器位移能量研究
Rafał Kapelko
{"title":"On the Energy in Displacement of Random Sensors for Connectivity and Interference","authors":"Rafał Kapelko","doi":"10.1145/3369740.3369768","DOIUrl":"https://doi.org/10.1145/3369740.3369768","url":null,"abstract":"This paper investigates the problem of the minimization of energy consumption in reallocation of wireless mobile sensors network (WMSN) to assure good communication without interference. It is assumed that n sensors are initially randomly placed in the d--dimensional space according to d identical and independent Poisson processes each with arrival rate λ > 0. Let 0 < s ≤ υ be given real numbers. We are allowed to move the sensors, so that every two consecutive sensors are placed at distance greater than or equal to s and less than or equal to υ. In this work, we discover and explain a sharp decline and a sharp increase (a threshold phenomena) for the minimal energy consumption in movement of mobile sensors around the interference-connectivity distances s, υ equal to 1/λ.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"8 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":"132133948","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}
引用次数: 2
SearchCom
Trupil Limbasiya, Debasis Das
{"title":"SearchCom","authors":"Trupil Limbasiya, Debasis Das","doi":"10.1145/3369740.3369772","DOIUrl":"https://doi.org/10.1145/3369740.3369772","url":null,"abstract":"The cutting-edge technologies have improved the journey of vehicle users on the road using different vehicular-based structures (vehicular ad-hoc networks (VANETs), vehicular cloud computing (VCC), and Internet of Vehicles (IoV)). Vehicles generally transmit different road-side data (e.g., traffic, details of nearby vehicles, emergency/environment, location, etc.) from/to another end in a public environment. Hence, three key challenges on data are as follows; (1) secure and effective data storage in the vehicular cloud (VC) (2) efficient data extraction from the VC and (3) reliable data transmission between two entities. Some general methods are to search/store data from/in the cloud, but these techniques are only for data storage and extraction. Next, various communication schemes are proposed for VANETs, VCC, and IoV, but they need high computational resources, and these schemes are vulnerable to multiple security attacks. We find that there is no system, which provides all these data operations (storage, searching, and communication) for vehicle users. In this paper, we propose a dependable system (named as SearchCom) for vehicle applicants to overcome above-mentioned challenges and provide operational facility. The SearchCom is analyzed to verify its security strengths against various security attacks and its performance results in execution time, memory requirement, communication overhead, searching, and energy consumption.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"2015 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":"121656890","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}
引用次数: 7
Towards an Ideal Queue Lock 迈向理想队列锁
P. Jayanti, S. Jayanti, Sucharita Jayanti
{"title":"Towards an Ideal Queue Lock","authors":"P. Jayanti, S. Jayanti, Sucharita Jayanti","doi":"10.1145/3369740.3369784","DOIUrl":"https://doi.org/10.1145/3369740.3369784","url":null,"abstract":"The MCS lock was the first mutual exclusion lock to support an arbitrary number of processes with unknown identities such that each process can acquire and release the lock in a constant number of RMRs on both Cache-Coherent and Distributed Shared Memory multiprocessors. The MCS algorithm, however, has a shortcoming: its Exit section is not bounded. The algorithm also requires hardware support for more than one special instruction, namely, Fetch&Store and Compare&Swap. Many MCS-style algorithms were subsequently designed to overcome these shortcomings, but to the best of our knowledge they either lack some desirable property of the MCS lock or introduce a new shortcoming. In this paper we present a new MCS-style algorithm that has all of the desirable properties and no ostensible shortcoming. We also provide a rigorous, invariant-based proof of correctness. To realize a bounded Exit section, all prior MCS-style algorithms use either the \"node-switching\" or the \"node-toggling\" strategy. Our work unifies these two strategies: we present a single algorithm which, when appropriately instantiated, yields both a node-switching and a node-toggling algorithm. Moreover, the two algorithms so derived are the simplest in their respective classes among all known MCS-style algorithms.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"16 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":"125281589","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}
引用次数: 5
COIDS
Subir Halder, M. Conti, Sajal K. Das
{"title":"COIDS","authors":"Subir Halder, M. Conti, Sajal K. Das","doi":"10.1145/3369740.3369787","DOIUrl":"https://doi.org/10.1145/3369740.3369787","url":null,"abstract":"Controller Area Network (CAN) is an in-vehicle communication protocol which provides an efficient and reliable communication link between Electronic Control Units (ECUs) in real-time. Recent studies have shown that attackers can take remote control of the targeted car by exploiting the vulnerabilities of the CAN protocol. Motivated by this fact, we propose Clock Offset-based Intrusion Detection System (COIDS) to monitor in-vehicle network and detect any intrusion. Precisely, we first measure and then exploit the clock offset of transmitter ECU's clock for fingerprinting ECU. We next leverage the derived fingerprints to construct a baseline of ECU's normal clock behaviour using an active learning technique. Based on the baseline of normal behaviour, we use Cumulative Sum method to detect any abnormal deviation in clock offset. Particularly, if the deviation in clock offset exceeds an unexpected positive or negative value, COIDS declares this change as an intrusion. Further, we use sequential change-point detection technique to determine the exact time of intrusion. We perform exhaustive experiments on real-world publicly available datasets primarily to assess the effectiveness of COIDS against three most potential attacks on CAN, i.e., DoS, impersonation and fuzzy attacks. The results show that COIDS is highly effective in defending all these three attacks. Further, the results show that COIDS considerably faster in detecting intrusion compared to a state-of-the-art solution.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"48 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":"121510029","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}
引用次数: 17
Exploring Collision Avoidance during Communication Over Sound for Healthy Environment 探讨健康环境下声音通信中的避碰问题
P. K. Sharma, Suraj Gupta, Argha Sen, T. De, Sujoy Saha
{"title":"Exploring Collision Avoidance during Communication Over Sound for Healthy Environment","authors":"P. K. Sharma, Suraj Gupta, Argha Sen, T. De, Sujoy Saha","doi":"10.1145/3369740.3372765","DOIUrl":"https://doi.org/10.1145/3369740.3372765","url":null,"abstract":"The rapid rise in Internet of Things (IoT) devices increases communication overhead. The communication is the most crucial part in IoT. However, most of the the traditional methods of communication emit harmful electromagnetic radiations which have severe impact on human health. To reduce the health hazards on the society due to such radiations, we have proposed a harmless mode of communication using the near-ultrasonic audible acoustic signal. We can use the sound signal as communication medium for sensitive systems like healthcare system, smart classroom system, and so on, where the occupants are vulnerable to harmful radiations. In this work, we have used Chirp Software Development Kit (SDK) as the tool for connecting the IoT devices through acoustic signal, which has the capability of multi path transmission where a device is allocated randomly a channel from a pool channels. However, with the rise in the number of devices in the system, the chances that a channel being allocated to many devices increase. It increases the chances of collision during communication, unless necessary precaution is taken in the channel allocation. By resolving the above issues when multiple node used same channel, we have achieved 80% more network throughput than the existing technique. In addition, we have proposed an approach to increase the communication range with acoustic communication, which is another critical issue in the present context.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"5 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":"122097221","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信