{"id":{"repo_id":"houston","oai_identifier":"oai:uh-ir.tdl.org:10657/1110"},"canonical_url":"https://search.dev.ndltd.org/etd/houston/oai:uh-ir.tdl.org:10657/1110","repository":{"repo_id":"houston","name":"University of Houston","base_url":"https://uh-ir.tdl.org/server/oai/request"},"display":{"title":"Concurrent Transmission with Adaptive Forwarder Set","abstract":"Precisely-timed concurrent transmission(CX) is relatively new in wireless sensor network (WSN), and protocols based on CX can implement reliable and conceptually simple flooding mechanism. These protocols work well; however, they are intrinsically energy inefficient for non-flooding traffic models, because in such cases not every node needs those flooding packets, but all of them have to receive and then forward. Efforts have been spent in reducing forwarder set size for those cases, typically by removing those nodes which are not ``between&quot; the packet source and destination so that they are ``useless&quot;. These efforts are effective, but they have to keep some unnecessary forwarders because they rely on topology information and this information is subject to network dynamics and then not precise. Here we present a new mechanism CXAFS to enhance Forwarder Selection (CXFS) protocol by further removing unnecessary forwarders. We implement 3 variants of CXAFS and evaluate them on our 27-node testbed. Results show that CXAFS can reduce forwarder set size by up to 40% and reduce duty cycle by 40%, at the expense of lower packet reception ratio(less than 10% lower).CXAFS is a feasible option when energy efficiency is top priority and packet reception ratio is not extremely important.","abstract_html":"Precisely-timed concurrent transmission(CX) is relatively new in wireless sensor network (WSN), and protocols based on CX can implement reliable and conceptually simple flooding mechanism. These protocols work well; however, they are intrinsically energy inefficient for non-flooding traffic models, because in such cases not every node needs those flooding packets, but all of them have to receive and then forward. Efforts have been spent in reducing forwarder set size for those cases, typically by removing those nodes which are not ``between&amp;quot; the packet source and destination so that they are ``useless&amp;quot;. These efforts are effective, but they have to keep some unnecessary forwarders because they rely on topology information and this information is subject to network dynamics and then not precise. Here we present a new mechanism CXAFS to enhance Forwarder Selection (CXFS) protocol by further removing unnecessary forwarders. We implement 3 variants of CXAFS and evaluate them on our 27-node testbed. Results show that CXAFS can reduce forwarder set size by up to 40% and reduce duty cycle by 40%, at the expense of lower packet reception ratio(less than 10% lower).CXAFS is a feasible option when energy efficiency is top priority and packet reception ratio is not extremely important.","abstract_has_math":false,"creators":["Li, Qiang 1976-"],"institution":"University of Houston","degree_name":"Master of Science","degree_level":"Masters","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Gnawali, Omprakash"],"committee_chairs":[],"committee_members":["Subhlok, Jaspal","Fonseca, Rodrigo"],"year":2014,"date_issued":"2014-12","date_published":"2014-12","updated_at":"2026-07-24T02:32:34Z","subjects":["Concurrent transmission","Adaptive forwarder set"],"languages":["eng"],"rights":["The author of this work is the copyright owner. UH Libraries and the Texas Digital Library have their permission to store and provide access to this work. Further transmission, reproduction, or presentation of this work is prohibited except with permission of the author(s)."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10657/1110","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Gnawali, Omprakash"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Subhlok, Jaspal","Fonseca, Rodrigo"]},{"key":"dc:creator","label":"Author","values":["Li, Qiang 1976-"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-08-28T01:32:59Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-08-28T01:32:59Z"]},{"key":"dc:date.issued","label":"Date","values":["2014-12"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Houston"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Concurrent transmission","Adaptive forwarder set"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["The author of this work is the copyright owner. UH Libraries and the Texas Digital Library have their permission to store and provide access to this work. Further transmission, reproduction, or presentation of this work is prohibited except with permission of the author(s)."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10657/1110"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Precisely-timed concurrent transmission(CX) is relatively new in wireless sensor network (WSN), and protocols based on CX can implement reliable and conceptually simple flooding mechanism. These protocols work well; however, they are intrinsically energy inefficient for non-flooding traffic models, because in such cases not every node needs those flooding packets, but all of them have to receive and then forward. Efforts have been spent in reducing forwarder set size for those cases, typically by removing those nodes which are not ``between&quot; the packet source and destination so that they are ``useless&quot;. These efforts are effective, but they have to keep some unnecessary forwarders because they rely on topology information and this information is subject to network dynamics and then not precise. Here we present a new mechanism CXAFS to enhance Forwarder Selection (CXFS) protocol by further removing unnecessary forwarders. We implement 3 variants of CXAFS and evaluate them on our 27-node testbed. Results show that CXAFS can reduce forwarder set size by up to 40% and reduce duty cycle by 40%, at the expense of lower packet reception ratio(less than 10% lower).CXAFS is a feasible option when energy efficiency is top priority and packet reception ratio is not extremely important."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Concurrent Transmission with Adaptive Forwarder Set"]}]}],"canonical_facts":{"dc:contributor.advisor":["Gnawali, Omprakash"],"dc:contributor.committeemember":["Subhlok, Jaspal","Fonseca, Rodrigo"],"dc:creator":["Li, Qiang 1976-"],"dc:date.accessioned":["2015-08-28T01:32:59Z"],"dc:date.available":["2015-08-28T01:32:59Z"],"dc:date.issued":["2014-12"],"dc:description.abstract":["Precisely-timed concurrent transmission(CX) is relatively new in wireless sensor network (WSN), and protocols based on CX can implement reliable and conceptually simple flooding mechanism. These protocols work well; however, they are intrinsically energy inefficient for non-flooding traffic models, because in such cases not every node needs those flooding packets, but all of them have to receive and then forward. Efforts have been spent in reducing forwarder set size for those cases, typically by removing those nodes which are not ``between&quot; the packet source and destination so that they are ``useless&quot;. These efforts are effective, but they have to keep some unnecessary forwarders because they rely on topology information and this information is subject to network dynamics and then not precise. Here we present a new mechanism CXAFS to enhance Forwarder Selection (CXFS) protocol by further removing unnecessary forwarders. We implement 3 variants of CXAFS and evaluate them on our 27-node testbed. Results show that CXAFS can reduce forwarder set size by up to 40% and reduce duty cycle by 40%, at the expense of lower packet reception ratio(less than 10% lower).CXAFS is a feasible option when energy efficiency is top priority and packet reception ratio is not extremely important."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/10657/1110"],"dc:language.iso":["eng"],"dc:rights":["The author of this work is the copyright owner. UH Libraries and the Texas Digital Library have their permission to store and provide access to this work. Further transmission, reproduction, or presentation of this work is prohibited except with permission of the author(s)."],"dc:subject":["Concurrent transmission","Adaptive forwarder set"],"dc:title":["Concurrent Transmission with Adaptive Forwarder Set"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["University of Houston"]},"updated_at":"2026-07-24T02:32:34Z"}