On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment

Arunabha Sen, Victoria H. Goliber, Kaustav Basu, Chenyang Zhou, Sumitava Ghosh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish (US)
Title of host publicationICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking
PublisherAssociation for Computing Machinery
Pages307-316
Number of pages10
ISBN (Electronic)9781450360944
DOIs
StatePublished - Jan 4 2019
Event20th International Conference on Distributed Computing and Networking, ICDCN 2019 - Bangalore, India
Duration: Jan 4 2019Jan 7 2019

Other

Other20th International Conference on Distributed Computing and Networking, ICDCN 2019
CountryIndia
CityBangalore
Period1/4/191/7/19

Fingerprint

Earth (planet)
Satellites
Sensors
Hazardous materials spills
Monitoring

Keywords

  • Identifying Code
  • Monitoring
  • Upper Bound

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Sen, A., Goliber, V. H., Basu, K., Zhou, C., & Ghosh, S. (2019). On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment. In ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking (pp. 307-316). Association for Computing Machinery. https://doi.org/10.1145/3288599.3288632

On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment. / Sen, Arunabha; Goliber, Victoria H.; Basu, Kaustav; Zhou, Chenyang; Ghosh, Sumitava.

ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking. Association for Computing Machinery, 2019. p. 307-316.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sen, A, Goliber, VH, Basu, K, Zhou, C & Ghosh, S 2019, On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment. in ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking. Association for Computing Machinery, pp. 307-316, 20th International Conference on Distributed Computing and Networking, ICDCN 2019, Bangalore, India, 1/4/19. https://doi.org/10.1145/3288599.3288632
Sen A, Goliber VH, Basu K, Zhou C, Ghosh S. On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment. In ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking. Association for Computing Machinery. 2019. p. 307-316 https://doi.org/10.1145/3288599.3288632
Sen, Arunabha ; Goliber, Victoria H. ; Basu, Kaustav ; Zhou, Chenyang ; Ghosh, Sumitava. / On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment. ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking. Association for Computing Machinery, 2019. pp. 307-316
@inproceedings{72dea879227c431dbe70fc824f02fb7f,
title = "On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment",
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.",
keywords = "Identifying Code, Monitoring, Upper Bound",
author = "Arunabha Sen and Goliber, {Victoria H.} and Kaustav Basu and Chenyang Zhou and Sumitava Ghosh",
year = "2019",
month = "1",
day = "4",
doi = "10.1145/3288599.3288632",
language = "English (US)",
pages = "307--316",
booktitle = "ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking",
publisher = "Association for Computing Machinery",

}

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

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

SP - 307

EP - 316

BT - ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking

PB - Association for Computing Machinery

ER -