{"id":{"repo_id":"wfu","oai_identifier":"oai:wakespace.lib.wfu.edu:10339/57155"},"canonical_url":"https://search.dev.ndltd.org/etd/wfu/oai:wakespace.lib.wfu.edu:10339/57155","repository":{"repo_id":"wfu","name":"Wake Forest University","base_url":"https://wakespace.lib.wfu.edu/oai/request"},"display":{"title":"Using Heading to Improve Autonomous Agent Movement on Networks","abstract":"On large networks where resources for security are at a minimum, a dynamic and lightweight approach to diagnosing threats is needed. A mobile software agent system modeled on ants provides one possible solution to this problem. Using this approach, software agents visit nodes (computing devices) in the network and look for evidence of a security threat. Agents operate autonomously, determining the next node to visit in the network based on local information. Optimally, agents in this system will provide full network (graph) coverage in the most efficient way possible. One way to do this is by using the concept of heading to improve cover time (amount of time required to visit every node in a graph at least once).","abstract_html":"On large networks where resources for security are at a minimum, a dynamic and lightweight approach to diagnosing threats is needed. A mobile software agent system modeled on ants provides one possible solution to this problem. Using this approach, software agents visit nodes (computing devices) in the network and look for evidence of a security threat. Agents operate autonomously, determining the next node to visit in the network based on local information. Optimally, agents in this system will provide full network (graph) coverage in the most efficient way possible. One way to do this is by using the concept of heading to improve cover time (amount of time required to visit every node in a graph at least once).","abstract_has_math":false,"creators":["Hodnett, Fletcher"],"institution":"Wake Forest University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015","date_published":"2015","updated_at":"2026-07-27T22:01:52Z","subjects":[],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10339/57155","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Hodnett, Fletcher"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-06-23T08:35:54Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-06-23T08:35:54Z"]},{"key":"dc:date.issued","label":"Date","values":["2015"]},{"key":"dc:publisher","label":"Institution","values":["Wake Forest University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10339/57155"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["On large networks where resources for security are at a minimum, a dynamic and lightweight approach to diagnosing threats is needed. A mobile software agent system modeled on ants provides one possible solution to this problem. Using this approach, software agents visit nodes (computing devices) in the network and look for evidence of a security threat. Agents operate autonomously, determining the next node to visit in the network based on local information. Optimally, agents in this system will provide full network (graph) coverage in the most efficient way possible. One way to do this is by using the concept of heading to improve cover time (amount of time required to visit every node in a graph at least once)."]},{"key":"dc:title","label":"Title","values":["Using Heading to Improve Autonomous Agent Movement on Networks"]}]}],"canonical_facts":{"dc:creator":["Hodnett, Fletcher"],"dc:date.accessioned":["2015-06-23T08:35:54Z"],"dc:date.available":["2015-06-23T08:35:54Z"],"dc:date.issued":["2015"],"dc:description.abstract":["On large networks where resources for security are at a minimum, a dynamic and lightweight approach to diagnosing threats is needed. A mobile software agent system modeled on ants provides one possible solution to this problem. Using this approach, software agents visit nodes (computing devices) in the network and look for evidence of a security threat. Agents operate autonomously, determining the next node to visit in the network based on local information. Optimally, agents in this system will provide full network (graph) coverage in the most efficient way possible. One way to do this is by using the concept of heading to improve cover time (amount of time required to visit every node in a graph at least once)."],"dc:identifier.uri":["http://hdl.handle.net/10339/57155"],"dc:language.iso":["en"],"dc:publisher":["Wake Forest University"],"dc:title":["Using Heading to Improve Autonomous Agent Movement on Networks"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T22:01:52Z"}