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

筛选
英文 中文
Uniform Circle Formation by Fat Robots Under Non-Uniform Visibility Ranges 胖机器人在非均匀可见范围下的均匀围圆
M. Mondal, S. Chaudhuri
{"title":"Uniform Circle Formation by Fat Robots Under Non-Uniform Visibility Ranges","authors":"M. Mondal, S. Chaudhuri","doi":"10.1145/3369740.3372779","DOIUrl":"https://doi.org/10.1145/3369740.3372779","url":null,"abstract":"This paper describes a distributed algorithm for swarm robots to form a uniform circle which can be required for guarding or covering a geographical boarder by robots. The robots have limited non-uniform visibility range and execute cycles consisting of three phases, look-compute-move in distributed manner.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"8 37","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131436465","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
Security-aware Resource Brokering for Bioinformatics Workflows across Federated Multi-cloud Infrastructures 跨联邦多云基础设施的生物信息学工作流的安全感知资源代理
Minh Nguyen, S. Debroy, P. Calyam, Zhen Lyu, T. Joshi
{"title":"Security-aware Resource Brokering for Bioinformatics Workflows across Federated Multi-cloud Infrastructures","authors":"Minh Nguyen, S. Debroy, P. Calyam, Zhen Lyu, T. Joshi","doi":"10.1145/3369740.3369791","DOIUrl":"https://doi.org/10.1145/3369740.3369791","url":null,"abstract":"Data-intensive science applications often use federated multi-cloud infrastructures to support their compute-intensive processing needs. However, lack of knowledge about: a) individual domain's security policies, b) how that translates to application security assurance, and c) nature of performance and security trade-offs - can cause performance-security conflicts for applications and inefficient resource usage. In this paper, we propose a security-aware resource brokering middleware framework to allocate application resources by satisfying their performance and security requirements. The proposed middleware implements MCPS (Multi-Cloud Performance and Security) Broker that uses a common data model to represent applications' performance and security requirements. It performs a security-aware global scheduling to choose the optimal cloud domain, and a local scheduling to choose the optimal server within the chosen cloud domain. Using real SoyKB application workflows, we implement the proposed MCPS Broker in the GENI Cloud and demonstrate its utility through a NIST-guided risk assessment.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"1 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":"130370818","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}
引用次数: 3
Collaborative Evacuation of Mobile Robots 移动机器人协同疏散
D. Pattanayak, H. Ramesh, P. Mandal
{"title":"Collaborative Evacuation of Mobile Robots","authors":"D. Pattanayak, H. Ramesh, P. Mandal","doi":"10.1145/3369740.3373806","DOIUrl":"https://doi.org/10.1145/3369740.3373806","url":null,"abstract":"Distributed evacuation of mobile robots has recently raised the interest of researchers. Czyzowicz et al. [1] introduced the evacuation problem minimizing the time required for the last searcher to reach the target. They showed the optimal evacuation time for two robots in the wireless model while achieved an upper and lower bound for two robots in the face-to-face model. This has been further improved in subsequent papers. The objective is to plan the path of robots such that the worst-case evacuation time can be minimized. In a variation with faulty robots not able to detect the exit, Czyzowicz et al. [2] focused on minimizing the evacuation time for the latest non-faulty robot. They presented a lower and upper bound for three robots where at most one is susceptible to crash fault with wireless communication. Please refer [3] for detailed related works. Model and Problems. The two robots, initially located at the center of a unit disk, have to evacuate the disk through the two exits situated on the perimeter of the disk at unknown locations. The distance d between the two exits along the perimeter is given. The robots communicate either in the wireless model (sending messages over a long distance) or the face-to-face model (exchange of information is possible by meeting). The objective is to minimize the worst-case evacuation time in both the wireless and face-to-face communication model for two robots with two exits (labeled or unlabeled). The second problem considers a robot can become faulty at any point of time during evacuation. Instead of abandoning the crashed robot, the non-faulty robot chauffeurs it to the exit. It takes α ≥ 1 amount of time to chauffeur for unit distance. The objective is to minimize the worst-case evacuation time even in the presence of one faulty robot with a single exit on the disk. Results. Given two exits located on the perimeter of a unit disk, there are two variations considered. An exit can be labeled or unlabeled. A robot at a labeled exit can exactly determine the location of the other exit, while a robot at an unlabeled exit, can only determine two potential locations for the other exit at a distance d along the perimeter. We propose an algorithm where the robots move towards the perimeter of the disk starting from the center at an angle ζ < d with each other. Both robots move in the opposite direction, i.e., one moves clockwise and the other moves counter-clockwise along the perimeter. Once a robot finds an exit, it sends a message and evacuates. The other robot determines the location of exit by arrival time of the message as it knows the path of the other robot. We analyze the worst-case time with respect to ζ [4]. In the face-to-face model, the robots exchange information by meeting. In this case, we consider the robots starting with an initial angle of ζ = d to reach the perimeter and search in opposite directions. Note that, meeting of the robots depends on the time (distance traveled) at which one fi","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"4 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":"130810957","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
Network Selection for seamless connectivity through edge caching in 5G Heterogeneous Networks 5G异构网络中通过边缘缓存实现无缝连接的网络选择
Preeti Samhita Pati, P. Barik, Chetna Singhal, R. Datta
{"title":"Network Selection for seamless connectivity through edge caching in 5G Heterogeneous Networks","authors":"Preeti Samhita Pati, P. Barik, Chetna Singhal, R. Datta","doi":"10.1145/3369740.3372769","DOIUrl":"https://doi.org/10.1145/3369740.3372769","url":null,"abstract":"In the current context of the massive data traffic surge, the densification of the network seems to be an efficient alternative solution, which demands the installation of small cells (SCs) in the 5G networks leading to its complexity. This calls for an efficient way to manage such complex systems through centralized control and content delivery strategy to help the end-users access high data rate multimedia services quicker wherein the storage and the bandwidth resources are used more effectively. In this paper, we have proposed a cache aided content delivery strategy for the 5G heterogeneous network, where the base stations of all the SCs and the macro cell are connected to the local cache-enabled content server. Moreover, a centralized controller, having a global view of the underlying network, stands responsible for delivering the multimedia content from the local server to the requisite base stations. The strategy mentioned above is found to be a promising solution resulting in the perception of seamless connectivity, thereby improving the QoE (Quality of Experience) of multimedia services. The proposed Network Selection and Resource Allocation (NSRA) strategy are observed to provide a tradeoff between the system throughput and churn rate. Moreover, the minimum rate requirement for all served users in the system is ensured.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"63 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":"126113218","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
Packet Position Modulation: A Technique for Enhancing Information Transfer Capacity in Ultra-low Duty Cycle Networks 分组位置调制:一种提高超低占空比网络信息传输能力的技术
Dezhi Feng, Saptarshi Das, S. Biswas
{"title":"Packet Position Modulation: A Technique for Enhancing Information Transfer Capacity in Ultra-low Duty Cycle Networks","authors":"Dezhi Feng, Saptarshi Das, S. Biswas","doi":"10.1145/3369740.3369792","DOIUrl":"https://doi.org/10.1145/3369740.3369792","url":null,"abstract":"This paper presents a data packet position modulation (DPPM) paradigm to enhance information transfer capacity of communication links used by energy-constrained devices. Packet transmissions in low duty cycle networks are often scheduled as TDMA slots, whose periodicity is determined based on application sampling requirements and the energy inflow, often in the form of energy harvesting. The key idea of DPPM is to modulate the inter-packet spacing for coding additional information without incurring additional transmission energy expenditures. This paper presents a DPPM based solution for single-hop transmit-only networks in which a number of low-energy nodes transmit data to an aggregator. The architecture is first developed for a two-node point-to-point link, followed by a multipoint-to-point multiaccess network. Detailed analytical and simulation models are developed to demonstrate the performance of a symmetric and an asymmetric version DPPM. It is shown that by carefully choosing the protocol parameters, DPPM can enhance the effective information transfer capacity of an ultra-low duty cycle network by up to 65% in certain scenarios.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"4 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":"121997321","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
Range-free Localization Algorithms with Mobile Anchors at Different Altitudes: A Comparative Study 不同高度移动锚点无距离定位算法的比较研究
Francesco Betti Sorbelli, M. C. Pinotti, Giulio Rigoni
{"title":"Range-free Localization Algorithms with Mobile Anchors at Different Altitudes: A Comparative Study","authors":"Francesco Betti Sorbelli, M. C. Pinotti, Giulio Rigoni","doi":"10.1145/3369740.3369766","DOIUrl":"https://doi.org/10.1145/3369740.3369766","url":null,"abstract":"In this work, we compare the performance of range-free localization algorithms either radius-based or radius-free that use a mobile anchor (rover or drone). All the compared algorithms are based on the so called heard/not-heard method. Despite its simplicity, the localization accuracy of the heard/not-heard method heavily depends on the radius of the antennas. Usually the only information available for the antenna is the average radius issued by the manufacturer's technical datasheet. Thinking that the knowledge of the actual average radius can be of help for the localization, we observe in a real test-bed, at different altitudes, the antenna radiation pattern of the DM1001 antennas used in the commercial MDEK1001 kit from DecaWave. We simulate the localization algorithms using the average antenna radius tested during the experiments on the field and using the radius provided by the manufacturer's technical datasheet. In practice, however, the more precise information about the radius does not reduce the localization error. It only reduces the number of unlocalized devices. We conclude that the knowledge of the exact antenna pattern is the essential requirement for any range-free localization algorithm. However, since increasing the altitude the antenna radius becomes smaller and less dispersed, smaller errors occur localizing with a drone than with a rover.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"49 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":"129171998","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
Development of full duplex Laser based data and voice communication system bridging two IoT networks 基于全双工激光的数据和语音通信系统桥接两个物联网网络的开发
Basudeb Das, T. Sarkar, S. Mukherjee, Bappaditya Sinha, S. Mazumdar
{"title":"Development of full duplex Laser based data and voice communication system bridging two IoT networks","authors":"Basudeb Das, T. Sarkar, S. Mukherjee, Bappaditya Sinha, S. Mazumdar","doi":"10.1145/3369740.3372763","DOIUrl":"https://doi.org/10.1145/3369740.3372763","url":null,"abstract":"Recent technology trends show a steep inclination towards the Internet of Things (IoT) using wireless networks. IoT can be implemented using the prevelent communication protocols GSM, Bluetooth, Zigbee, WIFI etc. Moreover, these protocols have their own limitations because of which IoT networks cannot be installed everywhere. This paper describes an Optical Wireless Communication (OWC) System, which may be treated as the intermediate system, connecting two networks. The system mainly comprises of the Transmitter, Receiver, Channel and necessary optics. This developed system, designed to transmit both data and voice across the communication link of 250m. A 100mW, 808nm DPSS LASER is used as an optical source. The data communication unit utilizes an ON-OFF keying modem and the accomplished datarate is 2Mbps. A pulse width modulation technique is used for voice communication. This is a full-duplex optical wireless communication system, which may be used for bridging two IoT networks.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"30 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":"127567238","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 study of approximation in a collaborative multi-agent system 协同多智能体系统中的逼近方法研究
Hrishav Bakul Barua, H. Paul, Chayan Sarkar, A. Banerjee
{"title":"A study of approximation in a collaborative multi-agent system","authors":"Hrishav Bakul Barua, H. Paul, Chayan Sarkar, A. Banerjee","doi":"10.1145/3369740.3373015","DOIUrl":"https://doi.org/10.1145/3369740.3373015","url":null,"abstract":"The effect of approximation has been well studied in stand-alone systems. However, the problem of approximation in a collaborative system has not been studied, to the best of our knowledge. The basic goal of this article is to study the applicability of approximation in collaborative SLAM (simultaneous localization and mapping). Our experiments suggest that it is not trivial to combine multiple stand-alone approximate results to achieve a collaborative approximation, i.e., the resultant error can not be bounded without special effort. Thus, we present a model of the problem and empirically show that such a model can be used to explain the error variance in a collaborative system.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"17 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":"127918720","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
Evaluation of perceived speech quality for VoIP codecs under different loudness and background noise condition 不同响度和背景噪声条件下VoIP编解码器感知语音质量评价
Suparnakanti Das, Paromita Choudhury
{"title":"Evaluation of perceived speech quality for VoIP codecs under different loudness and background noise condition","authors":"Suparnakanti Das, Paromita Choudhury","doi":"10.1145/3369740.3372774","DOIUrl":"https://doi.org/10.1145/3369740.3372774","url":null,"abstract":"The quality of received voice signal plays a major role in case of VoIP communication. This becomes more important under the aegis of IoT, which uses a lot of voice-enabled automation. The quality of the perceived signal depends on different parameters. In this paper, we have tried to evaluate the perceived quality of commonly used VoIP codecs in presence of background Noise at different loudness level. The evaluation of the speech signal was carried out in real scenario with different background signals. Harvard sentences are used as the baseline speech signals. On introduction of background signals at various loudness level, the resultant reference speech signal is packetized and transmitted over network though VoIP phones. The test speech signal is then constructed from the received VoIP packets. Objective speech quality measure, PESQ, is further employed to assess the quality of the test speech signal. Results show that VoIP speech using PCMU and Speex8K codecs are the most consistent in terms of perceived quality performance at different loudness condition.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"80 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":"121173173","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
Evolution in Water Monitoring Technology 水监测技术的演变
A. Das, A. Pramanik, A. Adak
{"title":"Evolution in Water Monitoring Technology","authors":"A. Das, A. Pramanik, A. Adak","doi":"10.1145/3369740.3372773","DOIUrl":"https://doi.org/10.1145/3369740.3372773","url":null,"abstract":"The traditional or conventional chemical methods have played an important dependability in the field of water monitoring system till date. But these systems need modification and much professionalism. The technology for water monitoring system is improving day by day. UV absorbance technologies have huge advantage over the traditional method for water monitoring system. Numerous works on monitoring the various parameters of water quality has been developed. To develop a water quality monitoring or filtering system requires a detailed study of the various available e-sensing technologies. Thus, a concise work summing up the existing technologies is the need of the hour. In this paper, a brief study on the recent works in water monitoring systems is presented. The current study sheds light on the definition, classification, advantages, and disadvantages of different types of water monitoring systems.","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":"124487989","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
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学术官方微信