TY - GEN
T1 - On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment
AU - Sen, Arunabha
AU - Goliber, Victoria H.
AU - Basu, Kaustav
AU - Zhou, Chenyang
AU - Ghosh, Sumitava
N1 - Publisher Copyright:
© 2019 Association for Computing Machinery.
PY - 2019/1/4
Y1 - 2019/1/4
N2 - 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.
AB - 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.
KW - Identifying Code
KW - Monitoring
KW - Upper Bound
UR - http://www.scopus.com/inward/record.url?scp=85060934509&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85060934509&partnerID=8YFLogxK
U2 - 10.1145/3288599.3288632
DO - 10.1145/3288599.3288632
M3 - Conference contribution
AN - SCOPUS:85060934509
T3 - ACM International Conference Proceeding Series
SP - 307
EP - 316
BT - ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking
PB - Association for Computing Machinery
T2 - 20th International Conference on Distributed Computing and Networking, ICDCN 2019
Y2 - 4 January 2019 through 7 January 2019
ER -