Repository logo
 

Performance issues in cellular wireless mesh networks

dc.contributor.advisorBunt, Ricken_US
dc.contributor.advisorOsgood, Nathanielen_US
dc.contributor.committeeMemberEager, Dereken_US
dc.contributor.committeeMemberMakaroff, Dwighten_US
dc.contributor.committeeMemberDeters, Ralphen_US
dc.contributor.committeeMemberKlymyshyn, Daviden_US
dc.contributor.committeeMemberElmallah, Ehaben_US
dc.creatorZhang, Dongen_US
dc.date.accessioned2010-09-04T13:19:16Zen_US
dc.date.accessioned2013-01-04T04:56:32Z
dc.date.available2011-09-14T08:00:00Zen_US
dc.date.available2013-01-04T04:56:32Z
dc.date.created2010en_US
dc.date.issued2010en_US
dc.date.submitted2010en_US
dc.description.abstractThis thesis proposes a potential solution for future ubiquitous broadband wireless access networks, called a cellular wireless mesh network (CMESH), and investigates a number of its performance issues. A CMESH is organized in multi-radio, multi-channel, multi-rate and multi-hop radio cells. It can operate on abundant high radio frequencies, such as 5-50 GHz, and thus may satisfy the bandwidth requirements of future ubiquitous wireless applications. Each CMESH cell has a single Internet-connected gateway and serves up to hundreds of mesh nodes within its coverage area. This thesis studies performance issues in a CMESH, focusing on cell capacity, expressed in terms of the max-min throughput. In addition to introducing the concept of a CMESH, this thesis makes the following contributions. The first contribution is a new method for analyzing theoretical cell capacity. This new method is based on a new concept called Channel Transport Capacity (CTC), and derives new analytic expressions for capacity bounds for carrier-sense-based CMESH cells. The second contribution is a new algorithm called the Maximum Channel Collision Time (MCCT) algorithm and an expression for the nominal capacity of CMESH cells. This thesis proves that the nominal cell capacity is achievable and is the exact cell capacity for small cells within the abstract models. Finally, based on the MCCT algorithm, this thesis proposes a series of greedy algorithms for channel assignment and routing in CMESH cells. Simulation results show that these greedy algorithms can significantly improve the capacity of CMESH cells, compared with algorithms proposed by other researchers.en_US
dc.identifier.urihttp://hdl.handle.net/10388/etd-09042010-131916en_US
dc.language.isoen_USen_US
dc.subjectcellular wireless mesh networksen_US
dc.subjectcell capacityen_US
dc.subjectchannel assignmenten_US
dc.subjectroutingen_US
dc.titlePerformance issues in cellular wireless mesh networksen_US
dc.type.genreThesisen_US
dc.type.materialtexten_US
thesis.degree.departmentComputer Scienceen_US
thesis.degree.disciplineComputer Scienceen_US
thesis.degree.grantorUniversity of Saskatchewanen_US
thesis.degree.levelDoctoralen_US
thesis.degree.nameDoctor of Philosophy (Ph.D.)en_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Zhang_Dong_PhD_thesis_09_2010.pdf
Size:
1.4 MB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
905 B
Format:
Plain Text
Description: