{"id":{"repo_id":"lethbridge","oai_identifier":"oai:opus.uleth.ca:10133/5757"},"canonical_url":"https://search.dev.ndltd.org/etd/lethbridge/oai:opus.uleth.ca:10133/5757","repository":{"repo_id":"lethbridge","name":"University of Lethbridge","base_url":"https://opus.uleth.ca/server/oai/request"},"display":{"title":"Integer programming formulation for contention aware connected dominating set in wireless multi-hop network","abstract":"Efficient data propagation across the mobile nodes is an essential concern in wireless networks. Broadcasting with Minimum Connected Dominating Set (MCDS) is used to reduce redundant transmission. Contention occurs when a group of nodes want to transmit over a shared channel at the same time. During contention, nodes defer transmissions for a random time. Using Contention-aware Connected Dominating Set (CACDS) to minimize contention is a new concept. We study computationally (using CPLEX) Integer Programming for MCDS and CACDS and use Benders Decomposition to solve the problem. To find a connected dominating set, we use one state-of-art approach based on the shortest path algorithm, and ours one is based on the number of connected components.We propose IP formulation of selection forwarding-nodes based on Dominant Pruning and Contention-aware Dominant Pruning. The result shows that our approach performs better than the state-of-art approach in large networks. CACDS results better in minimizing contention.","abstract_html":"Efficient data propagation across the mobile nodes is an essential concern in wireless networks. Broadcasting with Minimum Connected Dominating Set (MCDS) is used to reduce redundant transmission. Contention occurs when a group of nodes want to transmit over a shared channel at the same time. During contention, nodes defer transmissions for a random time. Using Contention-aware Connected Dominating Set (CACDS) to minimize contention is a new concept. We study computationally (using CPLEX) Integer Programming for MCDS and CACDS and use Benders Decomposition to solve the problem. To find a connected dominating set, we use one state-of-art approach based on the shortest path algorithm, and ours one is based on the number of connected components.We propose IP formulation of selection forwarding-nodes based on Dominant Pruning and Contention-aware Dominant Pruning. The result shows that our approach performs better than the state-of-art approach in large networks. CACDS results better in minimizing contention.","abstract_has_math":false,"creators":["Nawrin Ferdous, Chowdhury","University of Lethbridge. Faculty of Arts and Science"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2020,"date_issued":"2020","date_published":"2020","updated_at":"2026-07-27T20:02:08Z","subjects":["Contention","Integer Programming","Minimum Connected Dominating Set","Benders Decomposition","Contention resolution protocols (Computer network protocols)","Wireless communication systems -- Management","Ad hoc networks (Computer networks)","Routing (Computer network management)","Combinatorial optimization","Dissertations, Academic"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:10133/5757"],"render_values":[{"text":"hdl:10133/5757","href":null,"code":true}]}]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.issued","label":"Date","values":["2020"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Contention","Integer Programming","Minimum Connected Dominating Set","Benders Decomposition","Contention resolution protocols (Computer network protocols)","Wireless communication systems -- Management","Ad hoc networks (Computer networks)","Routing (Computer network management)","Combinatorial optimization","Dissertations, Academic"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:10133/5757"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.other","label":"Dc Description Other","values":["Efficient data propagation across the mobile nodes is an essential concern in wireless networks. Broadcasting with Minimum Connected Dominating Set (MCDS) is used to reduce redundant transmission. Contention occurs when a group of nodes want to transmit over a shared channel at the same time. During contention, nodes defer transmissions for a random time. Using Contention-aware Connected Dominating Set (CACDS) to minimize contention is a new concept. We study computationally (using CPLEX) Integer Programming for MCDS and CACDS and use Benders Decomposition to solve the problem. To find a connected dominating set, we use one state-of-art approach based on the shortest path algorithm, and ours one is based on the number of connected components.We propose IP formulation of selection forwarding-nodes based on Dominant Pruning and Contention-aware Dominant Pruning. The result shows that our approach performs better than the state-of-art approach in large networks. CACDS results better in minimizing contention."]},{"key":"dc:title","label":"Title","values":["Integer programming formulation for contention aware connected dominating set in wireless multi-hop network"]}]}],"canonical_facts":{"dc:date.issued":["2020"],"dc:description.other":["Efficient data propagation across the mobile nodes is an essential concern in wireless networks. Broadcasting with Minimum Connected Dominating Set (MCDS) is used to reduce redundant transmission. Contention occurs when a group of nodes want to transmit over a shared channel at the same time. During contention, nodes defer transmissions for a random time. Using Contention-aware Connected Dominating Set (CACDS) to minimize contention is a new concept. We study computationally (using CPLEX) Integer Programming for MCDS and CACDS and use Benders Decomposition to solve the problem. To find a connected dominating set, we use one state-of-art approach based on the shortest path algorithm, and ours one is based on the number of connected components.We propose IP formulation of selection forwarding-nodes based on Dominant Pruning and Contention-aware Dominant Pruning. The result shows that our approach performs better than the state-of-art approach in large networks. CACDS results better in minimizing contention."],"dc:identifier":["hdl:10133/5757"],"dc:subject":["Contention","Integer Programming","Minimum Connected Dominating Set","Benders Decomposition","Contention resolution protocols (Computer network protocols)","Wireless communication systems -- Management","Ad hoc networks (Computer networks)","Routing (Computer network management)","Combinatorial optimization","Dissertations, Academic"],"dc:title":["Integer programming formulation for contention aware connected dominating set in wireless multi-hop network"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T20:02:08Z"}