{"id":{"repo_id":"calpoly","oai_identifier":"oai:digitalcommons.calpoly.edu:theses-1107"},"canonical_url":"https://search.dev.ndltd.org/etd/calpoly/oai:digitalcommons.calpoly.edu:theses-1107","repository":{"repo_id":"calpoly","name":"Cal Poly","base_url":"https://digitalcommons.calpoly.edu/do/oai/"},"display":{"title":"General Direction Routing Protocol","abstract":"The General Direction Routing Protocol (GDRP) is a Wireless Sensor Network (WSN) multi-path routing protocol which abstracts localization information (commonly GPS coordinates) into relative direction information in order to perform routing decisions. By generating relative direction information GDRP is able to operate with fewer precision requirements than other protocols. This abstraction also allows the integration of other emerging hardware-based localization techniques, for example, Beamforming Sensor Arrays. GDRP does not specifically address the next hop a packet should take, but instead specifies a direction it should travel. This direction abstraction allows for multiple paths to be taken through the network thus enhancing network robustness to node mobility and failures. This indirect addressing scheme also provides a solution to sensor node unique identification. GDRP is simulated in a custom simulator written in Java. This simulator supports interfaces for multiple protocols for layers 1, 2, 3, and 7 of the OSI model. For performance comparisons, GDRP is compared against multiple WSN routing protocols. GDRP operates with a significantly lower setup cost in terms of bytes transmitted and a lower setup latency for networks of varying sizes. It also demonstrates an exponentially lower routing cost when compared to another multi- path routing protocol due to a more efficient packet propagation in the network.","abstract_html":"The General Direction Routing Protocol (GDRP) is a Wireless Sensor Network (WSN) multi-path routing protocol which abstracts localization information (commonly GPS coordinates) into relative direction information in order to perform routing decisions. By generating relative direction information GDRP is able to operate with fewer precision requirements than other protocols. This abstraction also allows the integration of other emerging hardware-based localization techniques, for example, Beamforming Sensor Arrays. GDRP does not specifically address the next hop a packet should take, but instead specifies a direction it should travel. This direction abstraction allows for multiple paths to be taken through the network thus enhancing network robustness to node mobility and failures. This indirect addressing scheme also provides a solution to sensor node unique identification. GDRP is simulated in a custom simulator written in Java. This simulator supports interfaces for multiple protocols for layers 1, 2, 3, and 7 of the OSI model. For performance comparisons, GDRP is compared against multiple WSN routing protocols. GDRP operates with a significantly lower setup cost in terms of bytes transmitted and a lower setup latency for networks of varying sizes. It also demonstrates an exponentially lower routing cost when compared to another multi- path routing protocol due to a more efficient packet propagation in the network.","abstract_has_math":false,"creators":["Lydon, Sean Michael"],"institution":null,"degree_name":"MS in Computer Science","degree_level":null,"degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Hugh M. Smith"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009-06-01T07:00:00Z","date_published":"2009-06-01T07:00:00Z","updated_at":"2026-07-24T01:30:51Z","subjects":["Networking","Wireless Sensor Networks","GPS","Digital Communications and Networking"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["10.15368/theses.2009.111"],"render_values":[{"text":"10.15368/theses.2009.111","href":"https://doi.org/10.15368/theses.2009.111","code":true}]}]},"links":{"outbound_url":"https://digitalcommons.calpoly.edu/theses/97","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hugh M. Smith"]},{"key":"dc:creator","label":"Author","values":["Lydon, Sean Michael"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2019-10-22T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS in Computer Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Networking","Wireless Sensor Networks","GPS","Digital Communications and Networking"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.calpoly.edu/theses/97","10.15368/theses.2009.111"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The General Direction Routing Protocol (GDRP) is a Wireless Sensor Network (WSN) multi-path routing protocol which abstracts localization information (commonly GPS coordinates) into relative direction information in order to perform routing decisions. By generating relative direction information GDRP is able to operate with fewer precision requirements than other protocols. This abstraction also allows the integration of other emerging hardware-based localization techniques, for example, Beamforming Sensor Arrays. GDRP does not specifically address the next hop a packet should take, but instead specifies a direction it should travel. This direction abstraction allows for multiple paths to be taken through the network thus enhancing network robustness to node mobility and failures. This indirect addressing scheme also provides a solution to sensor node unique identification. GDRP is simulated in a custom simulator written in Java. This simulator supports interfaces for multiple protocols for layers 1, 2, 3, and 7 of the OSI model. For performance comparisons, GDRP is compared against multiple WSN routing protocols. GDRP operates with a significantly lower setup cost in terms of bytes transmitted and a lower setup latency for networks of varying sizes. It also demonstrates an exponentially lower routing cost when compared to another multi- path routing protocol due to a more efficient packet propagation in the network."]},{"key":"dc:title","label":"Title","values":["General Direction Routing Protocol"]}]}],"canonical_facts":{"dc:contributor":["Hugh M. Smith"],"dc:creator":["Lydon, Sean Michael"],"dc:date.available":["2019-10-22T07:00:00Z"],"dc:description.abstract":["The General Direction Routing Protocol (GDRP) is a Wireless Sensor Network (WSN) multi-path routing protocol which abstracts localization information (commonly GPS coordinates) into relative direction information in order to perform routing decisions. By generating relative direction information GDRP is able to operate with fewer precision requirements than other protocols. This abstraction also allows the integration of other emerging hardware-based localization techniques, for example, Beamforming Sensor Arrays. GDRP does not specifically address the next hop a packet should take, but instead specifies a direction it should travel. This direction abstraction allows for multiple paths to be taken through the network thus enhancing network robustness to node mobility and failures. This indirect addressing scheme also provides a solution to sensor node unique identification. GDRP is simulated in a custom simulator written in Java. This simulator supports interfaces for multiple protocols for layers 1, 2, 3, and 7 of the OSI model. For performance comparisons, GDRP is compared against multiple WSN routing protocols. GDRP operates with a significantly lower setup cost in terms of bytes transmitted and a lower setup latency for networks of varying sizes. It also demonstrates an exponentially lower routing cost when compared to another multi- path routing protocol due to a more efficient packet propagation in the network."],"dc:identifier":["https://digitalcommons.calpoly.edu/theses/97","10.15368/theses.2009.111"],"dc:subject":["Networking","Wireless Sensor Networks","GPS","Digital Communications and Networking"],"dc:title":["General Direction Routing Protocol"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_name":["MS in Computer Science"]},"updated_at":"2026-07-24T01:30:51Z"}