{"id":{"repo_id":"queens","oai_identifier":"oai:queensu.scholaris.ca:1974/1724"},"canonical_url":"https://search.dev.ndltd.org/etd/queens/oai:queensu.scholaris.ca:1974/1724","repository":{"repo_id":"queens","name":"Queens University","base_url":"https://qspace.library.queensu.ca/server/oai/request"},"display":{"title":"Cellular Automata: Algorithms and Applications","abstract":"Cellular automata (CA) are an interesting computation medium to study because of their simplicity and inherently parallel operation. These characteristics make them a useful and efficient computation tool for applications such as cryptography and physical systems modelling, particularly when implemented on specialized parallel hardware. In this dissertation, we study a number of applications of CA and develop new theoretical results used for them. We begin by presenting conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain technical assumptions, a marker cellular automaton has a unique inverse with a given neighbourhood. We use these results to develop a working key generation algorithm for a public-key cryptosystem based on reversible cellular automata originally conceived by Kari. We also give an improvement to a CA algorithm which solves a version of the convex hull problem, ensuring that the algorithm does not require a global rule change and correcting the operation in a special case. Finally, we study a modified version of an established CA-based car traffic flow model for the single-lane highway case, and use CA as a modelling tool to investigate the coverage problem in wireless sensor network design. We developed functional software implementations for all of these experiments.","abstract_html":"Cellular automata (CA) are an interesting computation medium to study because of their simplicity and inherently parallel operation. These characteristics make them a useful and efficient computation tool for applications such as cryptography and physical systems modelling, particularly when implemented on specialized parallel hardware. In this dissertation, we study a number of applications of CA and develop new theoretical results used for them. We begin by presenting conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain technical assumptions, a marker cellular automaton has a unique inverse with a given neighbourhood. We use these results to develop a working key generation algorithm for a public-key cryptosystem based on reversible cellular automata originally conceived by Kari. We also give an improvement to a CA algorithm which solves a version of the convex hull problem, ensuring that the algorithm does not require a global rule change and correcting the operation in a special case. Finally, we study a modified version of an established CA-based car traffic flow model for the single-lane highway case, and use CA as a modelling tool to investigate the coverage problem in wireless sensor network design. We developed functional software implementations for all of these experiments.","abstract_has_math":false,"creators":["Clarridge, Adam"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computing","school":null,"contributors":[],"advisors":["Salomaa, Kai Jr"],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009-03-23T19:53:31Z","date_published":"2009-03-23T19:53:31Z","updated_at":"2026-07-27T20:35:45Z","subjects":["Cellular automata","Encryption","Public key","Convex hull","Wireless sensor network","Traffic"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1974/1724","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Computing"]},{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Salomaa, Kai Jr"]},{"key":"dc:creator","label":"Author","values":["Clarridge, Adam"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2009-03-23 11:20:58.666"]},{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2009-03-23T19:53:31Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2009-03-23T19:53:31Z"]},{"key":"dc:date.issued","label":"Date","values":["2009-03-23T19:53:31Z"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Cellular automata","Encryption","Public key","Convex hull","Wireless sensor network","Traffic"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1974/1724"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Master, Computing) -- Queen's University, 2009-03-23 11:20:58.666"]},{"key":"dc:description.abstract","label":"Abstract","values":["Cellular automata (CA) are an interesting computation medium to study because of their simplicity and inherently parallel operation. These characteristics make them a useful and efficient computation tool for applications such as cryptography and physical systems modelling, particularly when implemented on specialized parallel hardware. In this dissertation, we study a number of applications of CA and develop new theoretical results used for them. We begin by presenting conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain technical assumptions, a marker cellular automaton has a unique inverse with a given neighbourhood. We use these results to develop a working key generation algorithm for a public-key cryptosystem based on reversible cellular automata originally conceived by Kari. We also give an improvement to a CA algorithm which solves a version of the convex hull problem, ensuring that the algorithm does not require a global rule change and correcting the operation in a special case. Finally, we study a modified version of an established CA-based car traffic flow model for the single-lane highway case, and use CA as a modelling tool to investigate the coverage problem in wireless sensor network design. We developed functional software implementations for all of these experiments."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Sc."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Cellular Automata: Algorithms and Applications"]}]}],"canonical_facts":{"dc:contributor.department":["Computing"],"dc:contributor.supervisor":["Salomaa, Kai Jr"],"dc:creator":["Clarridge, Adam"],"dc:date":["2009-03-23 11:20:58.666"],"dc:date.accessioned":["2009-03-23T19:53:31Z"],"dc:date.available":["2009-03-23T19:53:31Z"],"dc:date.issued":["2009-03-23T19:53:31Z"],"dc:description":["Thesis (Master, Computing) -- Queen's University, 2009-03-23 11:20:58.666"],"dc:description.abstract":["Cellular automata (CA) are an interesting computation medium to study because of their simplicity and inherently parallel operation. These characteristics make them a useful and efficient computation tool for applications such as cryptography and physical systems modelling, particularly when implemented on specialized parallel hardware. In this dissertation, we study a number of applications of CA and develop new theoretical results used for them. We begin by presenting conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain technical assumptions, a marker cellular automaton has a unique inverse with a given neighbourhood. We use these results to develop a working key generation algorithm for a public-key cryptosystem based on reversible cellular automata originally conceived by Kari. We also give an improvement to a CA algorithm which solves a version of the convex hull problem, ensuring that the algorithm does not require a global rule change and correcting the operation in a special case. Finally, we study a modified version of an established CA-based car traffic flow model for the single-lane highway case, and use CA as a modelling tool to investigate the coverage problem in wireless sensor network design. We developed functional software implementations for all of these experiments."],"dc:description.degree":["M.Sc."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1974/1724"],"dc:language.iso":["eng"],"dc:subject":["Cellular automata","Encryption","Public key","Convex hull","Wireless sensor network","Traffic"],"dc:title":["Cellular Automata: Algorithms and Applications"],"dc:type":["thesis"]},"updated_at":"2026-07-27T20:35:45Z"}