J. Basak, Parama Bhaumik, Siuli Roy, S. Bandyopadhyay
{"title":"A Crowdsourcing based Information System Framework for Coordinated Disaster Management and Building Community Resilience","authors":"J. Basak, Parama Bhaumik, Siuli Roy, S. Bandyopadhyay","doi":"10.1145/3369740.3372730","DOIUrl":"https://doi.org/10.1145/3369740.3372730","url":null,"abstract":"Disaster management involves intensive coordination among multiple agencies like police, fire departments, public health, non-govt. agencies, including local volunteers/field workers. Accurate situational information about damage, resource needs, available resources etc., in the affected areas help the disaster management agencies in proper damage and need assessment and prepare suitable resource deployment plan. Crowdsourcing has become a popular approach for information collection where open crowds of people share multimodal situational information (text, images, audio, video etc.) about any event through social media posts. However, the authenticity and reliability of such posts are still debatable. Gathering situational data directly from the affected community (community-sourcing) can supplement social media posts to generate effective insights. In this paper, we attempt to design and develop a multiplatform disaster management information system where both social media-based crowdsourcing and community sourcing techniques are used to accumulate location-specific situational information. Subsequently, a coherent picture of the disaster situation is evolved through the integration of these local snapshots. Here, we explore how community participation, in the context of disaster management, can be enhanced through collaborative knowledge transaction, which eventually will lead towards the development of a resilient community. A field trial of our system is conducted involving a remote village community at Namkhana, West Bengal.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"19 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":"121360280","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":"Attack resistant Leader Election in Social Overlay Networks by Leveraging Local Voting","authors":"Martin Byrenheid, T. Strufe, Stefanie Roos","doi":"10.1145/3369740.3369770","DOIUrl":"https://doi.org/10.1145/3369740.3369770","url":null,"abstract":"Current leader election algorithms fail in the presence of Sybil attacks, i.e., one malicious entity inserting many nodes, network dynamics, and restricted knowledge about the graph. However, social overlay networks, i.e., peer-to-peer networks with links corresponding to social relationships, face all of the above challenges. Social overlay networks naturally offer privacy, as they avoid connections with strangers, and furthermore prevent a Sybil attacker from controlling a large number of links in the graph. As recent ideas for scalable communication in such overlays rely heavily on attack resistant leader election, solving leader election for such overlays opens the door for decentralized, privacy-preserving, and secure communication at a large scale. In this work, we propose a novel leader election algorithm based on three-majority voting that utilizes timestamps and cryptographic signatures to detect leader faults in an attack resistant manner. We evaluate our algorithm with simulations on real-world as well as synthetic network topologies. Our results indicate that in networks whose degree sequence follows a power law, our leader election algorithm quickly achieves consensus for more than 80% of all nodes. Furthermore, attackers are unlikely to become leaders as long as the number of connections they establish with honest nodes is low.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"41 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":"114397511","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":"Surveillance of Uneven Surface with Unmanned Aerial Vehicles","authors":"D. Saha, D. Pattanayak, P. Mandal","doi":"10.1145/3369740.3369781","DOIUrl":"https://doi.org/10.1145/3369740.3369781","url":null,"abstract":"Unmanned Aerial Vehicles (UAVs) or Drones are of massive interest in monitoring large areas with uneven surfaces or managing large events such as protests while ensuring civil security and public safety. A common requirement for this needs the UAVs to cover each point within the area of interest. In general, the region of interest is modeled as a surface, and thus we focus on surveillance of a surface with a random connected distribution of drones. This paper focuses on developing distributed algorithms for the reorganization of drones from the initial deployment to maximize the covered area without holes. In addition, the target is to provide a compact coverage to minimize the diameter of the network formed by the drones, which helps in faster communications. We propose two algorithms based on Local Voronoi and Virtual Force. Extensive simulation studies show that our proposed techniques result in hole-free maximal compact coverage with limited displacement.","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":"129850241","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}
Simran Tiwari, Ruman Kazi, Ameya Nambisan, Preetida V. Jani
{"title":"Morphius","authors":"Simran Tiwari, Ruman Kazi, Ameya Nambisan, Preetida V. Jani","doi":"10.1145/3369740.3372754","DOIUrl":"https://doi.org/10.1145/3369740.3372754","url":null,"abstract":"Modular robots are made up of mechanically constrained smaller robots with different degrees of freedom. These smaller robots can either detach or attach together to get a desired structure or configuration. The existing technology in this field consists of robots with homogeneous modules that lack the decision making capability and are not currently applicable in disaster struck area for inspection. To improve their performance, heterogeneity has been introduced in its structure making it possible to design versatile, application tailored modules having decision making capability. Each module will independently be able to perform a specific task depending on the attributes and given characteristics with self-configuring and reconfiguring capability. At the same time all the modules communicate and share their data with each other to collectively accomplish the goal. We have also introduced wheels for effective and faster locomotion and self-docking capability using a neutral connector. This paper addresses the two main challenges while developing such modular robotic system - intelligence and speed, in the field of rescue operations with adaptive morphology.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"138 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":"125740220","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":"Inter-Data Center Virtual Machine Migration in Federated Cloud","authors":"Moustafa Najm, V. Tamarapalli","doi":"10.1145/3369740.3373804","DOIUrl":"https://doi.org/10.1145/3369740.3373804","url":null,"abstract":"Cloud computing services have spread widely. This impels cloud providers (CPs) to scale up their resources. Federated cloud has emerged as a solution where many CPs collaborate forming a single platform [2]. It offers several advantages including scalability, high availability, cost optimization, and improved QoS [1].","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"58 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":"132537169","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}
Shadaab Siddiqie, Akhil Ralla, P. K. Reddy, Anirban Mondal
{"title":"Sensor-based Framework for Improved Air Conditioning Under Diverse Temperature Layout","authors":"Shadaab Siddiqie, Akhil Ralla, P. K. Reddy, Anirban Mondal","doi":"10.1145/3369740.3372770","DOIUrl":"https://doi.org/10.1145/3369740.3372770","url":null,"abstract":"Due to advances in technology for better output/production, there has been an increased demand for technology with optimized resource utilization in order to conserve resources. Advancements in sensors have improved resource optimization in many fields such as electric power consumption, water management and quality management. In this regard, air conditioner (AC) management is an important aspect of electric power consumption. In this paper, we address the issue of reducing power consumption for air conditioning of a given room. In previous works, the whole room is maintained at a fixed required temperature by inherently assuming that all of the users prefer the same temperature; this is generally not true in practice. In this paper, we propose a sensor-based framework to place and manage ACs for maintaining diverse temperature zones in a given layout to reduce power consumption. Through a simulation study, we demonstrate that the proposed framework indeed has the potential to reduce power consumption significantly as compared to the naive approach by achieving user satisfaction.","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":"132634003","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":"Reliability Maximization of Grid Transaction Processing System using Cuckoo Search-Ant Colony Optimization","authors":"D. P. Mahato","doi":"10.1145/3369740.3372756","DOIUrl":"https://doi.org/10.1145/3369740.3372756","url":null,"abstract":"This paper discusses the task allocation problem in the grid transaction processing system. The task allocation solution is known to be NP-hard. In order to solve this problem, this paper presents task allocation based on cuckoo search-ant colony optimization (LBTA_CSACO) method. The proposed LBTA_CSACO algorithm is based on the cooperative behavior of cuckoo search and ant colony optimization to find a collection of task allocation solutions. The motivation of this work is to maximize the reliability of the system. Six existing algorithms are taken for comparison of results; Social Spider Optimization (SSO), Honey Bee Optimization (HBO), Ant Colony Optimization (ACO), Hierarchical Load Balanced Algorithm (HLBA), Dynamic and Decentralized Load Balancing (DLB), and Randomized respectively.","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":"133247377","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":"Dynamic and Time Critical Emergency Management for Level Three Disaster: A Case Study Analysis of Kerala Floods 2018","authors":"S. Amritanand, S. Anand, A. Amritesh","doi":"10.1145/3369740.3372755","DOIUrl":"https://doi.org/10.1145/3369740.3372755","url":null,"abstract":"Extreme variability of weather conditions has contributed to the increase in multi hazards events in Kerala, India. This work analyses the processes, systems and solutions used for management of a 24hr call center for an effective emergency response during the 2018 Kerala floods. This paper presents the organically evolved dynamic organizational structure and the real-time dynamically evolved integrated solution portfolio to address the requirements of time critical, mission mode operations. The unique lessons learned during the implementation of the emergency response operation and management, and the challenges experienced in multi scale and multi level coordination and collaboration activities are described and analyzed to unveil the gaps inherent in the existing solutions. The paper proposes the requirements, features and challenges that need to be tackled for effective information management to achieve real-time coordination, collaboration, and dynamic logistics and supply chain management for handling the futuristic multi hazard events.","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":"127861245","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":"Public Key Infrastructure for Named Data Networks","authors":"Ranit Chatterjee, S. Ruj, S. Bit","doi":"10.1145/3369740.3369790","DOIUrl":"https://doi.org/10.1145/3369740.3369790","url":null,"abstract":"Named Data Networking (NDN) is a proposed Internet architecture which changes the basic model of network communication. Instead of host-centric (IP based) addressing of the present day Internet architecture, NDN is primarily a data-centric design. The main design principle of NDN is securing the data rather than securing the communication channel. In this paper we show some limitations of NDN's Trust based security framework and propose anew public key management scheme. Our design is motivated by the concept of Google's Certificate Transparency. By using a Merkle Patricia Trie to store certificates, we are not only able to perform efficient verification of certificates, but also ensure that certificates are not tampered with. We believe this will prevent dangerous frauds on certificate authorities that have taken place in the recent past.","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":"115732573","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":"An Efficient Clustering based Data Collection using Mobile Sink in Wireless Sensor Networks","authors":"Raj Anwit, P. K. Jana","doi":"10.1145/3369740.3369769","DOIUrl":"https://doi.org/10.1145/3369740.3369769","url":null,"abstract":"Data collection using mobile sink is a popular method that mitigates the sink hole problem in wireless sensor networks. In this regard, rendezvous point based data collection is a well-researched topic as it overcomes the problems of latency in data delivery and the scalability of the network. However, finding the optimal number of rendezvous points and their locations for the construction of the mobile sink tour is a challenging issue. An optimal path reduces delay in data collection and balances the energy consumption of the network. In this paper, we propose an algorithm that builds an efficient path for the mobile sink. The algorithm is based on the affinity propagation clustering which obtains an optimal set of rendezvous points. The extensive simulation results of the proposed algorithm show better performance over the existing algorithms in terms of number of the rendezvous points and path length.","PeriodicalId":240048,"journal":{"name":"Proceedings of the 21st International Conference on Distributed Computing and Networking","volume":"138 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":"116372225","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}