Integer programming formulation for contention aware connected dominating set in wireless multi-hop network

Simple item page
dc.contributor.authorNawrin Ferdous, Chowdhury
dc.contributor.authorUniversity of Lethbridge. Faculty of Arts and Science
dc.contributor.supervisorGaur, Daya
dc.date.accessioned2020-09-03T21:11:03Z
dc.date.available2020-09-03T21:11:03Z
dc.date.issued2020
dc.degree.levelMastersen_US
dc.description.abstractEfficient 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.en_US
dc.identifier.urihttps://hdl.handle.net/10133/5757
dc.language.isoenen_US
dc.proquest.subject984en_US
dc.proquestyesYesen_US
dc.publisherLethbridge, Alta. : Universtiy of Lethbridge, Department of Mathematics and Computer Scienceen_US
dc.publisher.departmentDepartment of Mathematics and Computer Scienceen_US
dc.publisher.facultyArts and Scienceen_US
dc.relation.ispartofseriesThesis (University of Lethbridge. Faculty of Arts and Science)en_US
dc.subjectContentionen_US
dc.subjectInteger Programmingen_US
dc.subjectMinimum Connected Dominating Seten_US
dc.subjectBenders Decompositionen_US
dc.subjectContention resolution protocols (Computer network protocols)en_US
dc.subjectWireless communication systems -- Managementen_US
dc.subjectAd hoc networks (Computer networks)en_US
dc.subjectRouting (Computer network management)en_US
dc.subjectCombinatorial optimizationen_US
dc.subjectDissertations, Academicen_US
dc.titleInteger programming formulation for contention aware connected dominating set in wireless multi-hop networken_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
NAWRIN FERDOUS_CHOWDHURY_MSC_2020.pdf
Size:
705.58 KB
Format:
Adobe Portable Document Format
Description:
MSC Thesis
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
3.25 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Arts and Science, Faculty of
University of Lethbridge Theses