Proceedings of the 19th International Conference on Distributed Computing and Networking最新文献

筛选
英文 中文
V-Chord: An efficient file sharing on LTE/GSM Network V-Chord: LTE/GSM网络上的高效文件共享
S. Tetarave, S. Tripathy, R. Ghosh
{"title":"V-Chord: An efficient file sharing on LTE/GSM Network","authors":"S. Tetarave, S. Tripathy, R. Ghosh","doi":"10.1145/3154273.3154329","DOIUrl":"https://doi.org/10.1145/3154273.3154329","url":null,"abstract":"Content sharing in cellular infrastructure including 3G, 4G or LTE through mobile phones or PDAs is now at a premature stage. The users need to pay a fee to the service providers per content access. A number of schemes, assisted by centralized web servers, try to reduce the cost of data usage through Bluetooth or WiFi mechanisms. However, a user still has to pay a fee in order to find the location of the host server and then to download the contents. The cost could be reduced by leveraging P2P file sharing through Vicinity Chord ring (V-Chord) proposed in this paper. V-Chord is a Chord [13] like data structure based on the locations of the mobile users. The analysis of V-Chord establishes that the proposed scheme lead to a reduced cost for data usage compared to other existing schemes. An implementation of a P2P file sharing system over mobile phones, based on V-Chord, has been designed and tested using J2ME midlets.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128610077","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
Enhanced Network Coverage Based on Mobile Sink Management in Wireless sensor network 基于移动汇聚管理的无线传感器网络增强网络覆盖
Mrinmoy Sen, I. Banerjee, T. Samanta
{"title":"Enhanced Network Coverage Based on Mobile Sink Management in Wireless sensor network","authors":"Mrinmoy Sen, I. Banerjee, T. Samanta","doi":"10.1145/3154273.3154301","DOIUrl":"https://doi.org/10.1145/3154273.3154301","url":null,"abstract":"In this paper we describe a scheme of using mobile sink(s) in a Wireless Sensor Network (WSN) to recover the energy holes in the network. Information from the regions containing holes does not provide sufficient data to the sink node. Hence data are not analyzed for further actions to be taken accordingly. Firstly, we generate a power map with the estimated Received Signal Strength (RSS), for a given target field, using static sink nodes. A power map is a 3-D plot, where Z-axis denotes the RSS strength in dBm all over the x-y coordinates in the network. An Inverse Distance Weighting (IDW) interpolation method is invoked in the signal power estimation model for both the static and dynamic power map. Secondly, we use mobile sinks to regenerate the power maps to cover the energy holes created with static sinks power maps. Paths of the mobile sinks aim at covering the holes generated by the static power map. We overlap the power maps derived with both static as well as mobile sink nodes (best suited dynamic power map), which show the coverage of energy hole(s) in static power map by the energy peak(s) of dynamic power map. This ensures enhancement in data collection and better coverage of the network.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124635449","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
A QoE Aware SVC Based Client-side Video Adaptation Algorithm for Cellular Networks 基于QoE感知SVC的蜂窝网络客户端视频自适应算法
Anirban Lekharu, Satish Kumar, A. Sur, A. Sarkar
{"title":"A QoE Aware SVC Based Client-side Video Adaptation Algorithm for Cellular Networks","authors":"Anirban Lekharu, Satish Kumar, A. Sur, A. Sarkar","doi":"10.1145/3154273.3154312","DOIUrl":"https://doi.org/10.1145/3154273.3154312","url":null,"abstract":"The ever-increasing demand for video streaming is set to pose considerable challenges on the state-of-the-art multimedia transmission technologies like Dynamic Adaptive Streaming over HTTP (DASH). In this work, we propose an efficient client-side adaptation algorithm for the DASH framework that attempts to maximize the QoE of an end user by simultaneously balancing three important QoE verticals: (i) providing stutter-free video viewing experience, (ii) minimizing flickers in video outputs by controlling and smoothing the rates of encoding quality switches over time and (iii) maximizing aggregate video quality over an entire video session. In order to maintain uninterrupted high quality video viewing experience, the adaptation strategy dynamically selects the enhancement levels for video segments based on instantaneous network conditions and playout buffer status. We have evaluated the proposed adaptation strategy through theoretical analysis and simulation based experiments. Simulation results reveal that the proposed scheme is able to restrict re-buffering events significantly while simultaneously achieving high video quality and stability in the video output.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125038175","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}
引用次数: 9
A Novel Malware Analysis Framework for Malware Detection and Classification using Machine Learning Approach 基于机器学习方法的新型恶意软件检测与分类分析框架
Kamalakanta Sethi, S. Chaudhary, B. K. Tripathy, P. Bera
{"title":"A Novel Malware Analysis Framework for Malware Detection and Classification using Machine Learning Approach","authors":"Kamalakanta Sethi, S. Chaudhary, B. K. Tripathy, P. Bera","doi":"10.1145/3154273.3154326","DOIUrl":"https://doi.org/10.1145/3154273.3154326","url":null,"abstract":"Nowadays, the digitization of the world is under a serious threat due to the emergence of various new and complex malware every day. Due to this, the traditional signature-based methods for detection of malware effectively become an obsolete method. The efficiency of the machine learning techniques in context to the detection of malwares has been proved by state-of-the-art research works. In this paper, we have proposed a framework to detect and classify different files (e.g., exe, pdf, php, etc.) as benign and malicious using two level classifier namely, Macro (for detection of malware) and Micro (for classification of malware files as a Trojan, Spyware, Ad-ware, etc.). Our solution uses Cuckoo Sandbox for generating static and dynamic analysis report by executing the sample files in the virtual environment. In addition, a novel feature extraction module has been developed which functions based on static, behavioral and network analysis using the reports generated by the Cuckoo Sandbox. Weka Framework is used to develop machine learning models by using training datasets. The experimental results using the proposed framework shows high detection rate and high classification rate using different machine learning algorithms","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129979945","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}
引用次数: 22
An Attack Graph-based On-line Multi-step Attack Detector 基于攻击图的在线多步攻击检测器
M. Angelini, Silvia Bonomi, Emanuele Borzi, Antonella del Pozzo, S. Lenti, G. Santucci
{"title":"An Attack Graph-based On-line Multi-step Attack Detector","authors":"M. Angelini, Silvia Bonomi, Emanuele Borzi, Antonella del Pozzo, S. Lenti, G. Santucci","doi":"10.1145/3154273.3154311","DOIUrl":"https://doi.org/10.1145/3154273.3154311","url":null,"abstract":"Modern distributed systems are characterized by complex deployment designed to ensure high availability through replication and diversity, to tolerate the presence of failures and to limit the possibility of successful compromising. However, software is not free from bugs that generate vulnerabilities that could be exploited by an attacker through multiple steps. This paper presents an attack-graph based multi-step attack detector aiming at detecting a possible on-going attack early enough to take proper countermeasures through; a Visualization interfaced with the described attack detector presents the security operator with the relevant pieces of information, allowing a better comprehension of the network status and providing assistance in managing attack situations (i.e., reactive analysis mode). We first propose an architecture and then we present the implementation of each building block. Finally, we provide an evaluation of the proposed approach aimed at highlighting the existing trade-off between accuracy of the detection and detection time.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116256854","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}
引用次数: 11
Parallel Processing of Packets with a PRAM 用PRAM并行处理数据包
H. B. Acharya
{"title":"Parallel Processing of Packets with a PRAM","authors":"H. B. Acharya","doi":"10.1145/3154273.3154334","DOIUrl":"https://doi.org/10.1145/3154273.3154334","url":null,"abstract":"The operation of policy tables, for access control (firewalls) and for routing (flow tables), is a major component in networks. For example, one of the most important bottlenecks in the Internet is the time taken by backbone routers to resolve packets. In practice, such routers use special hardware such as Ternary Content-Addressable Memory. How well do standard architectures for parallel computing work to speed up such operations? At first glance, it appears that firstmatch policies such as firewalls might force a serial approach, where the only mechanism for speeding up packet processing is to handle different packets on different cores. However, we show in this paper that the operation of packet-processing policies for each individual packet can in fact be sped up with a PRAM parallel computer. We go on to demonstrate how to build a policy engine for XMT (Explicit Multi Threading), a practical near-PRAM architecture and instruction set, and present some performance results.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125821914","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
Non-Intrusive Air Leakage Detection in Residential Homes 住宅非侵入式漏风检测
Nilavra Pathak, David Lachut, Nirmalya Roy, Nilanjan Banerjee, R. Robucci
{"title":"Non-Intrusive Air Leakage Detection in Residential Homes","authors":"Nilavra Pathak, David Lachut, Nirmalya Roy, Nilanjan Banerjee, R. Robucci","doi":"10.1145/3154273.3154345","DOIUrl":"https://doi.org/10.1145/3154273.3154345","url":null,"abstract":"Air leakages pose a major problem in both residential and commercial buildings. They increase the utility bill and result in excessive usage of Heating Ventilation and Air Conditioning (HVAC) systems, which impacts the environment and causes discomfort to residents. Repairing air leakages in a building is an expensive and time intensive task. Even detecting the leakages can require extensive professional testing. In this paper, we propose a method to identify the leaky homes from a set, provided their energy consumption data is accessible from residential smart meters. In the first phase, we employ a Non-Intrusive Load Monitoring (NILM) technique to disaggregate the HVAC data from total power consumption for several homes. We propose a recurrent neural network and a denoising autoencoder based approach to identify the 'ON' and 'OFF' cycles of the HVACs and their overall usages. We categorize the typical HVAC consumption of about 200 homes and any probable insulation and leakage problems using the Air Changes per Hour at 50 Pa (ACH50) metric in the Dataport datasets. We perform our proposed NILM analysis on different granularities of smart meter data such as 1 min, 15 mins, and 1 hour to observe its effect on classifying the leaky homes. Our results show that disaggregation can be used to identify the residential air-conditioning, at 1 min granularity which in turn helps us to identify the leaky potential homes, with an accuracy of 86%.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133964871","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
Precise Localization in Sparse Sensor Networks using a Drone with Directional Antennas 无人机定向天线稀疏传感器网络的精确定位
Francesco Betti Sorbelli, Sajal K. Das, M. C. Pinotti, S. Silvestri
{"title":"Precise Localization in Sparse Sensor Networks using a Drone with Directional Antennas","authors":"Francesco Betti Sorbelli, Sajal K. Das, M. C. Pinotti, S. Silvestri","doi":"10.1145/3154273.3154295","DOIUrl":"https://doi.org/10.1145/3154273.3154295","url":null,"abstract":"In this paper, we study a sensor localization technique that replaces fixed anchors with a drone equipped with directional antennas. Our goal is to localize each sensor in the deployment area achieving the localization precision explicitly required by the final user of the sensor networks. Due to the advent of directional antennas, we precisely localize applying a single trilateration for each sensor. To reach the desired precision, we force that each ground distance measured by the drone is greater than a minimum threshold and we set a suitable beamwidth for the directional antennas. Our proposed solution plans a static path for the drone and determines on it the measurements points such that all the sensors are measured at least three times from different antenna orientations. The performance of our solution, evaluated in terms of the static path length and of the achieved precision, is validated by simulation study. With respect to recently published results on sensor localization using flying anchors, our solution finds a shorter path (at least 30%), localizes all the nodes, and requires a single trilateration for each sensor.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127358737","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}
引用次数: 9
Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless Communication 利用无线通信从磁盘周边两个未知出口疏散两个机器人
D. Pattanayak, H. Ramesh, P. Mandal, Stefan Schmid
{"title":"Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless Communication","authors":"D. Pattanayak, H. Ramesh, P. Mandal, Stefan Schmid","doi":"10.1145/3154273.3154313","DOIUrl":"https://doi.org/10.1145/3154273.3154313","url":null,"abstract":"The evacuation of mobile robots is an interesting emerging application in distributed computing. This paper considers the fundamental problem of how to evacuate two robots from a unit disk. The robots, initially located at the center of the disk, need to exit the disk through two unknown exits, at known distance d from each other, located at the perimeter of the disk. The robots can coordinate when exploring the disk, using wireless communication. The objective is to minimize the evacuation time, i.e., the time until the last robot exits the disk. We consider two different model variants, where exits can either be labeled or unlabeled. We complement our analysis with simulations.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121955613","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
Gathering of Opaque Robots in 3D Space 在3D空间中收集不透明的机器人
Subhash Bhagat, S. Chaudhuri, K. Mukhopadhyaya
{"title":"Gathering of Opaque Robots in 3D Space","authors":"Subhash Bhagat, S. Chaudhuri, K. Mukhopadhyaya","doi":"10.1145/3154273.3154322","DOIUrl":"https://doi.org/10.1145/3154273.3154322","url":null,"abstract":"Gathering is a fundamental coordination problem for multi-robot systems. This paper presents a study of the gathering problem for a set of oblivious, autonomous mobile robots in the three dimensional Euclidean space, under obstructed visibility model. In this model, robots are considered to be opaque. Robots may not have the complete view of the configuration. This paper assumes only an agreement on the direction and orientation of one coordinate axis. A distributed algorithm is proposed to solve the gathering problem for a set of asynchronous robots, when the system does not contain any faulty robot. Another distributed algorithm is presented to solve the problem for a set of semi-synchronous robots under crash fault model. The proposed algorithm can tolerate an arbitrary number of crash faults. Both algorithms work for an arbitrary initial robot configuration.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127435759","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}
引用次数: 9
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学术文献互助群
群 号:481959085
Book学术官方微信