We consider a system of N autonomous mobile robots that operate following the classic oblivious robots model. In particular, we consider fat robots abstracted as unit discs operating on an infinite grid graph G (embedded on the Euclidean plane), and study the fundamental problem, where starting from an arbitrary initial configuration, N autonomous robots reposition themselves on the nodes of G to reach a configuration where each robot is visible to all others (the Complete Visibility problem). We provide the first [MATH HERE]-time algorithm for this problem under a centralized scheduler. We also show that the algorithm is asymptotically tight, i.e., even under a centralized scheduler, any algorithm needs [MATH HERE] time for this problem. We then provide the first [MATH HERE]-time algorithm for this problem under a distributed scheduler for a special initial configuration. To the best of our knowledge, these are the first sublinear-time results for the visibility of fat oblivious robots.
{"title":"Sublinear-time mutual visibility for fat oblivious robots","authors":"Pavan Poudel, Gokarna Sharma, Aisha Aljohani","doi":"10.1145/3288599.3288602","DOIUrl":"https://doi.org/10.1145/3288599.3288602","url":null,"abstract":"We consider a system of N autonomous mobile robots that operate following the classic oblivious robots model. In particular, we consider fat robots abstracted as unit discs operating on an infinite grid graph G (embedded on the Euclidean plane), and study the fundamental problem, where starting from an arbitrary initial configuration, N autonomous robots reposition themselves on the nodes of G to reach a configuration where each robot is visible to all others (the Complete Visibility problem). We provide the first [MATH HERE]-time algorithm for this problem under a centralized scheduler. We also show that the algorithm is asymptotically tight, i.e., even under a centralized scheduler, any algorithm needs [MATH HERE] time for this problem. We then provide the first [MATH HERE]-time algorithm for this problem under a distributed scheduler for a special initial configuration. To the best of our knowledge, these are the first sublinear-time results for the visibility of fat oblivious robots.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129912475","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}
In order to meet the ever-increasing speed differences between processor clocks and memory access times, there has been an interest in moving computation closer to memory. The near data processing or processing-in-memory is particularly suited for very high bandwidth memories such as the 3D-DRAMs. There are different ideas proposed for PIMs, including simple in-order processors, GPUs, specialized ASICs and reconfigurable designs. In our case, we use Coarse-Grained Reconfigurable Logic to build dataflow graphs for computational kernels as the PIM. We show that our approach can achieve significant speedups and save energy consumed by computations. We evaluated our designs using several processing technologies for building the coarse-gained logic units. The DFPIM concept showed good performance improvement and excellent energy efficiency for the streaming benchmarks that were analyzed. The DFPIM in a 28 nm process with an implementation in each of 16 vaults of a 3D-DRAM logic layer showed an average speed-up of 7.2 over that using 32 cores of an Intel Xeon server system. The server processor required 368 times more energy to execute the benchmarks than the DFPIM implementation.
{"title":"Reconfigurable dataflow graphs for processing-in-memory","authors":"C. Shelor, K. Kavi","doi":"10.1145/3288599.3288605","DOIUrl":"https://doi.org/10.1145/3288599.3288605","url":null,"abstract":"In order to meet the ever-increasing speed differences between processor clocks and memory access times, there has been an interest in moving computation closer to memory. The near data processing or processing-in-memory is particularly suited for very high bandwidth memories such as the 3D-DRAMs. There are different ideas proposed for PIMs, including simple in-order processors, GPUs, specialized ASICs and reconfigurable designs. In our case, we use Coarse-Grained Reconfigurable Logic to build dataflow graphs for computational kernels as the PIM. We show that our approach can achieve significant speedups and save energy consumed by computations. We evaluated our designs using several processing technologies for building the coarse-gained logic units. The DFPIM concept showed good performance improvement and excellent energy efficiency for the streaming benchmarks that were analyzed. The DFPIM in a 28 nm process with an implementation in each of 16 vaults of a 3D-DRAM logic layer showed an average speed-up of 7.2 over that using 32 cores of an Intel Xeon server system. The server processor required 368 times more energy to execute the benchmarks than the DFPIM implementation.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130435328","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}
The ever-increasing use of mobile phones, IoT, and the related infrastructures like wireless access points and mobile base stations is becoming a prominent source of non-ionizing electromagnetic field (EMF) having some harmful effects on our ecology. In this work, the effect of the non-ionizing electromagnetic radiation of BTS (Base Transceiver Station) and the Wi-Fi access points on our ecological system has been investigated over frequency band 900 MHz to 2500 MHz. A testbed is designed utilizing sensors to measure the EMF strength over a given region, and a heat map is generated. Using the standard safe limit of specific absorption rate (SAR) this heat map may enable us to issue alerts whenever the measured EMF exceeds the SAR limit. The stream of data from these sensors may be uploaded on a cloud to implement an adaptive transmitter power control mechanism to reduce the signal strength dynamically to maintain the safe limit of SAR. A modular design is proposed to implement a cloud-based transmission power control mechanism that can be applied for BTS as well as Wi-Fi routers in cellular networks.
{"title":"To protect ecological system from electromagnetic radiation of mobile communication","authors":"Avirup Das, Srabani Kundu","doi":"10.1145/3288599.3295595","DOIUrl":"https://doi.org/10.1145/3288599.3295595","url":null,"abstract":"The ever-increasing use of mobile phones, IoT, and the related infrastructures like wireless access points and mobile base stations is becoming a prominent source of non-ionizing electromagnetic field (EMF) having some harmful effects on our ecology. In this work, the effect of the non-ionizing electromagnetic radiation of BTS (Base Transceiver Station) and the Wi-Fi access points on our ecological system has been investigated over frequency band 900 MHz to 2500 MHz. A testbed is designed utilizing sensors to measure the EMF strength over a given region, and a heat map is generated. Using the standard safe limit of specific absorption rate (SAR) this heat map may enable us to issue alerts whenever the measured EMF exceeds the SAR limit. The stream of data from these sensors may be uploaded on a cloud to implement an adaptive transmitter power control mechanism to reduce the signal strength dynamically to maintain the safe limit of SAR. A modular design is proposed to implement a cloud-based transmission power control mechanism that can be applied for BTS as well as Wi-Fi routers in cellular networks.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129222388","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}
Zhou Fang, Jeng-Hau Lin, M. Srivastava, Rajesh K. Gupta
Offloading techniques enable many emerging computer vision applications on mobile platforms by executing compute-intensive tasks on resource-rich servers. Although there have been a significant amount of research efforts devoted in optimizing mobile offloading frameworks, most previous works are evaluated in a single-tenant setting, that is, a server is assigned to a single client. However, in a practical scenario that servers must handle tasks from many clients running diverse applications, contention on shared server resources may degrade application performance. In this work, we study scheduling techniques to improve serving performance in multi-tenant mobile offloading systems, for computer vision algorithms running on CPUs and deep neural networks (DNNs) running on GPUs. For CPU workloads, we present methods to mitigate resource contention and to improve delay using a Plan-Schedule approach. The planning phase predicts future workloads from all clients, estimates contention, and adjusts future task start times to remove or reduce contention. The scheduling phase dispatches arriving offloaded tasks to the server that minimizes contention. For DNN workloads running on GPUs, we propose adaptive batching algorithms using information of batch size, model complexity and system load to achieve the best Quality of Service (QoS), which are measured from accuracy and delay of DNN tasks. We demonstrate the improvement of serving performance using several real-world applications with different server deployments.
{"title":"Multi-tenant mobile offloading systems for real-time computer vision applications","authors":"Zhou Fang, Jeng-Hau Lin, M. Srivastava, Rajesh K. Gupta","doi":"10.1145/3288599.3288634","DOIUrl":"https://doi.org/10.1145/3288599.3288634","url":null,"abstract":"Offloading techniques enable many emerging computer vision applications on mobile platforms by executing compute-intensive tasks on resource-rich servers. Although there have been a significant amount of research efforts devoted in optimizing mobile offloading frameworks, most previous works are evaluated in a single-tenant setting, that is, a server is assigned to a single client. However, in a practical scenario that servers must handle tasks from many clients running diverse applications, contention on shared server resources may degrade application performance. In this work, we study scheduling techniques to improve serving performance in multi-tenant mobile offloading systems, for computer vision algorithms running on CPUs and deep neural networks (DNNs) running on GPUs. For CPU workloads, we present methods to mitigate resource contention and to improve delay using a Plan-Schedule approach. The planning phase predicts future workloads from all clients, estimates contention, and adjusts future task start times to remove or reduce contention. The scheduling phase dispatches arriving offloaded tasks to the server that minimizes contention. For DNN workloads running on GPUs, we propose adaptive batching algorithms using information of batch size, model complexity and system load to achieve the best Quality of Service (QoS), which are measured from accuracy and delay of DNN tasks. We demonstrate the improvement of serving performance using several real-world applications with different server deployments.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"17 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116708643","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}
Live video upstreaming refers to the flow of live data in the upstream direction from mobile devices to other entities across the Internet and has found use in many modern applications such as remote driving, the recent social media trend of live video broadcasting along with the traditional applications of video calling/conferencing. Combined with the high definition video capturing capabilities of modern mobile devices, live video upstreaming is creating more upstream data traffic then what present day cellular networks are equipped to support, often resulting in sub-optimal video experience, especially in remote or crowded areas with low cellular connectivity and no WiFi. We propose that instead of using its single cellular connection, a mobile device connects to multiple nearby mobile devices and splits the live video data over the cellular bandwidth of these devices using Multipath TCP protocol. The use of MPTCP, for upstreaming live video data, has largely remained unexplored especially for scenarios where WiFi connectivity is not available. We use wireless interface virtualization, offered by Linux, to enable Multipath TCP to scale and connect to a large number of cellular devices. We design and build a system that is able to assess the instantaneous bandwidth of all the connected cellular devices/hotspots and uses the set of the most capable cellular devices for splitting and forwarding the live video data. We test our system in various settings and our experiments show that our system greatly increases the bandwidth and reliability of TCP connections in most cases and in cases where there is a significant difference in the throughput across cellular hotspots, our solution is able to recognize and isolate the better performing cellular hotspots to provide a stable throughput.
{"title":"Scheduling virtual wifi interfaces for high bandwidth video upstreaming using multipath TCP","authors":"Shobhi Maheshwari, Philip Lundrigan, S. Kasera","doi":"10.1145/3288599.3288620","DOIUrl":"https://doi.org/10.1145/3288599.3288620","url":null,"abstract":"Live video upstreaming refers to the flow of live data in the upstream direction from mobile devices to other entities across the Internet and has found use in many modern applications such as remote driving, the recent social media trend of live video broadcasting along with the traditional applications of video calling/conferencing. Combined with the high definition video capturing capabilities of modern mobile devices, live video upstreaming is creating more upstream data traffic then what present day cellular networks are equipped to support, often resulting in sub-optimal video experience, especially in remote or crowded areas with low cellular connectivity and no WiFi. We propose that instead of using its single cellular connection, a mobile device connects to multiple nearby mobile devices and splits the live video data over the cellular bandwidth of these devices using Multipath TCP protocol. The use of MPTCP, for upstreaming live video data, has largely remained unexplored especially for scenarios where WiFi connectivity is not available. We use wireless interface virtualization, offered by Linux, to enable Multipath TCP to scale and connect to a large number of cellular devices. We design and build a system that is able to assess the instantaneous bandwidth of all the connected cellular devices/hotspots and uses the set of the most capable cellular devices for splitting and forwarding the live video data. We test our system in various settings and our experiments show that our system greatly increases the bandwidth and reliability of TCP connections in most cases and in cases where there is a significant difference in the throughput across cellular hotspots, our solution is able to recognize and isolate the better performing cellular hotspots to provide a stable throughput.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121722914","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}
Binary Search Tree (BST) is an important data structure for managing ordered data. Many algorithms have been proposed for concurrent manipulation of a binary search tree in an asynchronous shared memory system that supports search, insert and delete operations based on both external and internal representations of a search tree. An important step in executing an operation on a tree is to traverse the tree from top-to-down in order to locate the operation's window. A process may need to perform this traversal several times to handle failures occurring due to other processes performing concurrent updates on the tree. Most concurrent algorithms that have been proposed so far use a naïve approach and simply restart the traversal from the root of the tree. In this work, we present a new approach to recover from such failures more efficiently for certain types of concurrent binary search tree algorithms using local recovery by restarting the traversal from the "middle" of the tree in order to locate an operation's window (tree section of interest). Our approach is sufficiently general in the sense that it can be applied to most of the existing concurrent binary search trees using internal representation based on both blocking as well as non-blocking approaches. Using experimental evaluation, we demonstrate that our local recovery approach can significantly improve the performance of a concurrent internal BST by up to 124.7% when the contention is high.
{"title":"Improving efficacy of concurrent internal binary search trees using local recovery","authors":"Arunmoezhi Ramachandran, N. Mittal","doi":"10.1145/3288599.3288615","DOIUrl":"https://doi.org/10.1145/3288599.3288615","url":null,"abstract":"Binary Search Tree (BST) is an important data structure for managing ordered data. Many algorithms have been proposed for concurrent manipulation of a binary search tree in an asynchronous shared memory system that supports search, insert and delete operations based on both external and internal representations of a search tree. An important step in executing an operation on a tree is to traverse the tree from top-to-down in order to locate the operation's window. A process may need to perform this traversal several times to handle failures occurring due to other processes performing concurrent updates on the tree. Most concurrent algorithms that have been proposed so far use a naïve approach and simply restart the traversal from the root of the tree. In this work, we present a new approach to recover from such failures more efficiently for certain types of concurrent binary search tree algorithms using local recovery by restarting the traversal from the \"middle\" of the tree in order to locate an operation's window (tree section of interest). Our approach is sufficiently general in the sense that it can be applied to most of the existing concurrent binary search trees using internal representation based on both blocking as well as non-blocking approaches. Using experimental evaluation, we demonstrate that our local recovery approach can significantly improve the performance of a concurrent internal BST by up to 124.7% when the contention is high.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"63 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114045146","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}
P. Paul, C. Mukherjee, B. Ghosh, Sudipta Pandit, Sujoy Saha, S. Nandi
Modeling the demand and supply during an absolute catastrophe is a major challenge for any disaster manager. This paper demonstrates implementation of an easily deployable end-to-end system, by which, various situational data can be collected by the stakeholders during any post-disaster circumstances, and a general summarized view can be plotted on crisis map. The proposed Four Tier Hybrid Ad hoc Network Architecture does not require an Internet backbone but can conduct the complete process in 'offline' mode. Periodic Merging of GIS data enriches the quality of the summarized view. Here we have tried to evaluate the system based on some initial results on a dummy challenged network scenario.
{"title":"On designing a fast-deployable 'localized' GIS platform for using 'offline' during post-disaster situation","authors":"P. Paul, C. Mukherjee, B. Ghosh, Sudipta Pandit, Sujoy Saha, S. Nandi","doi":"10.1145/3288599.3295592","DOIUrl":"https://doi.org/10.1145/3288599.3295592","url":null,"abstract":"Modeling the demand and supply during an absolute catastrophe is a major challenge for any disaster manager. This paper demonstrates implementation of an easily deployable end-to-end system, by which, various situational data can be collected by the stakeholders during any post-disaster circumstances, and a general summarized view can be plotted on crisis map. The proposed Four Tier Hybrid Ad hoc Network Architecture does not require an Internet backbone but can conduct the complete process in 'offline' mode. Periodic Merging of GIS data enriches the quality of the summarized view. Here we have tried to evaluate the system based on some initial results on a dummy challenged network scenario.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123382233","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}
More than 200 million people across the globe are affected by Diabetes Mellitus (DM), which is one of the most common endocrine disorders. DM progression is dangerous as it leads to several life-threatening complications within 5--15 years of onset, depending on the care and management that they receive for DM. Hence, it is important for the public and healthcare policymakers to look proactively at managing the onset of the disease and delay associated complications as far as possible. Proactive management would result in significant reductions in the healthcare expenses. The fight against DM is multidisciplinary and research-oriented. Computer and data scientists can collaborate with medical researchers to augment research and management by using the power of big data analytics, machine learning, IoT (Internet of Things), and cloud computing. Computing principles and techniques can be used to efficiently collect, manage, and analyse data to derive meaningful insights, which can then be used for efficient management of the health concerns of patients. This paper describes the need for diabetes management and reviews technological interventions and related research directions in proactive diabetes management.
{"title":"Proactive diabetes management: research directions","authors":"Merlin George, A. Chacko, Sudeep Koshy Kurien","doi":"10.1145/3288599.3297119","DOIUrl":"https://doi.org/10.1145/3288599.3297119","url":null,"abstract":"More than 200 million people across the globe are affected by Diabetes Mellitus (DM), which is one of the most common endocrine disorders. DM progression is dangerous as it leads to several life-threatening complications within 5--15 years of onset, depending on the care and management that they receive for DM. Hence, it is important for the public and healthcare policymakers to look proactively at managing the onset of the disease and delay associated complications as far as possible. Proactive management would result in significant reductions in the healthcare expenses. The fight against DM is multidisciplinary and research-oriented. Computer and data scientists can collaborate with medical researchers to augment research and management by using the power of big data analytics, machine learning, IoT (Internet of Things), and cloud computing. Computing principles and techniques can be used to efficiently collect, manage, and analyse data to derive meaningful insights, which can then be used for efficient management of the health concerns of patients. This paper describes the need for diabetes management and reviews technological interventions and related research directions in proactive diabetes management.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124900978","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}
We consider high performance computing infrastructures consisting of multiple sites connected over a wide-area network. These sites house heterogeneous computing systems, network elements and local-area connections, and the wide-area network plays a critical, asymmetric role of providing the vital connectivity between them. We model this infrastructure as a recursive system of systems, wherein the basic systems at the finest levels are composed of discrete cyber and physical components. These components may be disabled by cyber and physical disruptions, and their reinforcements protect against them albeit at a cost. We utilize results from a game formulation based on (i) characterizing the disruptions between systems at each level of recursion using aggregate failure correlation functions, and within basic systems using the multiplier functions, and (ii) using utility functions expressed in terms of the number of basic system components attacked and reinforced. At Nash Equilibrium, we derive expressions for the expected capacity of the infrastructure given by the number of computing nodes that are operational and connected to the network.
{"title":"Defense strategies and expected capacity of high performance computing infrastructures","authors":"N. Rao, N. Imam, Chris Y. T. Ma, Fei He","doi":"10.1145/3288599.3288625","DOIUrl":"https://doi.org/10.1145/3288599.3288625","url":null,"abstract":"We consider high performance computing infrastructures consisting of multiple sites connected over a wide-area network. These sites house heterogeneous computing systems, network elements and local-area connections, and the wide-area network plays a critical, asymmetric role of providing the vital connectivity between them. We model this infrastructure as a recursive system of systems, wherein the basic systems at the finest levels are composed of discrete cyber and physical components. These components may be disabled by cyber and physical disruptions, and their reinforcements protect against them albeit at a cost. We utilize results from a game formulation based on (i) characterizing the disruptions between systems at each level of recursion using aggregate failure correlation functions, and within basic systems using the multiplier functions, and (ii) using utility functions expressed in terms of the number of basic system components attacked and reinforced. At Nash Equilibrium, we derive expressions for the expected capacity of the infrastructure given by the number of computing nodes that are operational and connected to the network.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124164629","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}
Arunabha Sen, V. Goliber, K. Basu, Chenyang Zhou, Sumitava Ghosh
We study a monitoring problem on the surface of the earth for significant environmental, social/political and extreme events using satellites as sensors. We assume that the surface of the earth is divided into a set of regions, where a region may be a continent, a country, or a set of neighboring countries. We also assume that, the impact of a significant event spills into neighboring regions and there will be corresponding indicators of such events. Careful deployment of sensors, utilizing Identifying Codes, can ensure that even though the number of deployed sensors is fewer than the number of regions, it may be possible to uniquely identify the region where the event has taken place. We assume that an event is confined to a region. As Earth is almost a sphere, we use a soccer ball (a sphere) as a model. From the model, we construct a Soccer Ball Graph (SBG), and show that the SBG has at least 26 sets of Identifying Codes of cardinality ten, implying that there are at least 26 different ways to deploy ten satellites to monitor the Earth. Finally, we also show that the size of the minimum Identifying Code for the SBG is at least nine.
{"title":"On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment","authors":"Arunabha Sen, V. Goliber, K. Basu, Chenyang Zhou, Sumitava Ghosh","doi":"10.1145/3288599.3288632","DOIUrl":"https://doi.org/10.1145/3288599.3288632","url":null,"abstract":"We study a monitoring problem on the surface of the earth for significant environmental, social/political and extreme events using satellites as sensors. We assume that the surface of the earth is divided into a set of regions, where a region may be a continent, a country, or a set of neighboring countries. We also assume that, the impact of a significant event spills into neighboring regions and there will be corresponding indicators of such events. Careful deployment of sensors, utilizing Identifying Codes, can ensure that even though the number of deployed sensors is fewer than the number of regions, it may be possible to uniquely identify the region where the event has taken place. We assume that an event is confined to a region. As Earth is almost a sphere, we use a soccer ball (a sphere) as a model. From the model, we construct a Soccer Ball Graph (SBG), and show that the SBG has at least 26 sets of Identifying Codes of cardinality ten, implying that there are at least 26 different ways to deploy ten satellites to monitor the Earth. Finally, we also show that the size of the minimum Identifying Code for the SBG is at least nine.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128533752","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：