Performance issues in cellular wireless mesh networks
| dc.contributor.advisor | Bunt, Rick | en_US |
| dc.contributor.advisor | Osgood, Nathaniel | en_US |
| dc.contributor.committeeMember | Eager, Derek | en_US |
| dc.contributor.committeeMember | Makaroff, Dwight | en_US |
| dc.contributor.committeeMember | Deters, Ralph | en_US |
| dc.contributor.committeeMember | Klymyshyn, David | en_US |
| dc.contributor.committeeMember | Elmallah, Ehab | en_US |
| dc.creator | Zhang, Dong | en_US |
| dc.date.accessioned | 2010-09-04T13:19:16Z | en_US |
| dc.date.accessioned | 2013-01-04T04:56:32Z | |
| dc.date.available | 2011-09-14T08:00:00Z | en_US |
| dc.date.available | 2013-01-04T04:56:32Z | |
| dc.date.created | 2010 | en_US |
| dc.date.issued | 2010 | en_US |
| dc.date.submitted | 2010 | en_US |
| dc.description.abstract | This 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.uri | http://hdl.handle.net/10388/etd-09042010-131916 | en_US |
| dc.language.iso | en_US | en_US |
| dc.subject | cellular wireless mesh networks | en_US |
| dc.subject | cell capacity | en_US |
| dc.subject | channel assignment | en_US |
| dc.subject | routing | en_US |
| dc.title | Performance issues in cellular wireless mesh networks | en_US |
| dc.type.genre | Thesis | en_US |
| dc.type.material | text | en_US |
| thesis.degree.department | Computer Science | en_US |
| thesis.degree.discipline | Computer Science | en_US |
| thesis.degree.grantor | University of Saskatchewan | en_US |
| thesis.degree.level | Doctoral | en_US |
| thesis.degree.name | Doctor of Philosophy (Ph.D.) | en_US |