{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/31982"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/31982","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Backpressure Policies for Wireless ad hoc Networks","abstract":"Interference in ad hoc wireless networks causes the performance of traditional networking protocols to suffer. However, some user applications in ad hoc networks demand high throughput and low end-user delay. In the literature, the backpressure policy, i.e. queue backlog differential-based joint routing and scheduling, is known to be throughput-optimal with robust support for traffic load fluctuations \\cite{Tssailus92}. Unfortunately, many backpressure-based algorithms cannot be implemented due to high end-user delay, inaccurate assumptions for interference, and high control overhead in distributed scenarios. We develop new backpressure based approaches to address these issues. We first propose a heuristic packet forwarding scheme that solves the issue of high end-user delay and still provides near-optimal throughput. Next we develop a novel interference model that provides simple yet accurate interference relationships among users. Such a model is helpful in designing a simple backpressure scheduling algorithm that does not violate realistic interference constraints. Finally we develop distributed backpressure algorithms based on our proposed ideas. Our distributed algorithms provide throughput performance close to the optimal and have low control overhead and simple implementation.","abstract_html":"Interference in ad hoc wireless networks causes the performance of traditional networking protocols to suffer. However, some user applications in ad hoc networks demand high throughput and low end-user delay. In the literature, the backpressure policy, i.e. queue backlog differential-based joint routing and scheduling, is known to be throughput-optimal with robust support for traffic load fluctuations \\cite{Tssailus92}. Unfortunately, many backpressure-based algorithms cannot be implemented due to high end-user delay, inaccurate assumptions for interference, and high control overhead in distributed scenarios. We develop new backpressure based approaches to address these issues. We first propose a heuristic packet forwarding scheme that solves the issue of high end-user delay and still provides near-optimal throughput. Next we develop a novel interference model that provides simple yet accurate interference relationships among users. Such a model is helpful in designing a simple backpressure scheduling algorithm that does not violate realistic interference constraints. Finally we develop distributed backpressure algorithms based on our proposed ideas. Our distributed algorithms provide throughput performance close to the optimal and have low control overhead and simple implementation.","abstract_has_math":false,"creators":["Shukla, Umesh Kumar"],"institution":"Virginia Tech","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Electrical and Computer Engineering","degree_department":"Electrical and Computer Engineering","school":null,"contributors":[],"advisors":[],"committee_chairs":["MacKenzie, Allen B."],"committee_members":["Buehrer, R. Michael","DaSilva, Luiz A."],"year":2010,"date_issued":"2010-03-16","date_published":"2010-03-16","updated_at":"2026-07-22T22:19:57Z","subjects":["Interference models","Backpressure","Routing","Scheduling","Wireless networks"],"languages":[],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-04272010-143912"],"render_values":[{"text":"etd-04272010-143912","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/31982","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["MacKenzie, Allen B."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Buehrer, R. Michael","DaSilva, Luiz A."]},{"key":"dc:contributor.department","label":"Department","values":["Electrical and Computer Engineering"]},{"key":"dc:creator","label":"Author","values":["Shukla, Umesh Kumar"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T20:34:28Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T20:34:28Z","2010-05-14"]},{"key":"dc:date.issued","label":"Date","values":["2010-03-16"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"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":["Virginia Polytechnic Institute and State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Interference models","Backpressure","Routing","Scheduling","Wireless networks"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-04272010-143912"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/31982"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Interference in ad hoc wireless networks causes the performance of traditional networking protocols to suffer. However, some user applications in ad hoc networks demand high throughput and low end-user delay. In the literature, the backpressure policy, i.e. queue backlog differential-based joint routing and scheduling, is known to be throughput-optimal with robust support for traffic load fluctuations \\cite{Tssailus92}. Unfortunately, many backpressure-based algorithms cannot be implemented due to high end-user delay, inaccurate assumptions for interference, and high control overhead in distributed scenarios. We develop new backpressure based approaches to address these issues. We first propose a heuristic packet forwarding scheme that solves the issue of high end-user delay and still provides near-optimal throughput. Next we develop a novel interference model that provides simple yet accurate interference relationships among users. Such a model is helpful in designing a simple backpressure scheduling algorithm that does not violate realistic interference constraints. Finally we develop distributed backpressure algorithms based on our proposed ideas. Our distributed algorithms provide throughput performance close to the optimal and have low control overhead and simple implementation."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:title","label":"Title","values":["Backpressure Policies for Wireless ad hoc Networks"]}]}],"canonical_facts":{"dc:contributor.committeechair":["MacKenzie, Allen B."],"dc:contributor.committeemember":["Buehrer, R. Michael","DaSilva, Luiz A."],"dc:contributor.department":["Electrical and Computer Engineering"],"dc:creator":["Shukla, Umesh Kumar"],"dc:date.accessioned":["2014-03-14T20:34:28Z"],"dc:date.available":["2014-03-14T20:34:28Z","2010-05-14"],"dc:date.issued":["2010-03-16"],"dc:description.abstract":["Interference in ad hoc wireless networks causes the performance of traditional networking protocols to suffer. However, some user applications in ad hoc networks demand high throughput and low end-user delay. In the literature, the backpressure policy, i.e. queue backlog differential-based joint routing and scheduling, is known to be throughput-optimal with robust support for traffic load fluctuations \\cite{Tssailus92}. Unfortunately, many backpressure-based algorithms cannot be implemented due to high end-user delay, inaccurate assumptions for interference, and high control overhead in distributed scenarios. We develop new backpressure based approaches to address these issues. We first propose a heuristic packet forwarding scheme that solves the issue of high end-user delay and still provides near-optimal throughput. Next we develop a novel interference model that provides simple yet accurate interference relationships among users. Such a model is helpful in designing a simple backpressure scheduling algorithm that does not violate realistic interference constraints. Finally we develop distributed backpressure algorithms based on our proposed ideas. Our distributed algorithms provide throughput performance close to the optimal and have low control overhead and simple implementation."],"dc:description.degree":["Master of Science"],"dc:identifier.other":["etd-04272010-143912"],"dc:identifier.uri":["http://hdl.handle.net/10919/31982"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["Interference models","Backpressure","Routing","Scheduling","Wireless networks"],"dc:title":["Backpressure Policies for Wireless ad hoc Networks"],"dc:type":["Thesis"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:19:57Z"}