Resource allocation in wireless networks.
dc.contributor.author | Oh, Seong-Jun | |
dc.contributor.advisor | Wasserman, Kimberly M. | |
dc.date.accessioned | 2016-08-30T18:13:11Z | |
dc.date.available | 2016-08-30T18:13:11Z | |
dc.date.issued | 2000 | |
dc.identifier.uri | http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9990955 | |
dc.identifier.uri | https://hdl.handle.net/2027.42/132856 | |
dc.description.abstract | In this dissertation, two types of wireless communication networks are considered: cellular (single-hop) networks and multihop wireless networks. In emerging and future generations of wireless communication systems, heterogeneous communication services will be provided over a single cellular network. Satisfying the diverse service requirements of different users through a single radio band, however, is a challenging issue due to the scarcity of radio resources, user mobility, and the time-varying, unreliable nature of wireless channels. For cellular networks, the problem of radio resource sharing in the context of DS-CDMA wireless networks is studied. The primary concerns are the efficiency of radio resource usage and QoS support among users. The approach to resource sharing problems is via formulation of static nonlinear constrained optimization problems, the solutions of which are used to develop dynamic resource allocation mechanisms. Optimal solutions are derived, and simple autonomous and cooperative implementations of the algorithms are provided. Extensive real-world simulation is used to evaluate their performance over time. For multihop wireless networks, the design of a robust routing protocol, or modifications of conventional routing algorithms, to efficiently adapt to time-varying network topologies arising from user mobility has been a critical issue. An equally important feature of multihop wireless networks is the controllability of its point-to-point connections or topology, because these are primarily determined by the transmission powers of the users. In this work, an active approach of controlling the network topology is taken, rather than a passive approach which attempts to resist degradation of wireless channels. A transmission power allocation algorithm based on graph-theoretic results is provided, and it guarantees certain desirable features of network topology characteristics, such as k-connectivity. The performance and complexity of the algorithm is evaluated via analysis and simulation. | |
dc.format.extent | 97 p. | |
dc.language | English | |
dc.language.iso | EN | |
dc.subject | Code Division Multiple Access | |
dc.subject | Code-division Multiple Access | |
dc.subject | Networks | |
dc.subject | Quality Of Service | |
dc.subject | Resource Allocation | |
dc.subject | Wireless | |
dc.title | Resource allocation in wireless networks. | |
dc.type | Thesis | |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Applied Sciences | |
dc.description.thesisdegreediscipline | Electrical engineering | |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/132856/2/9990955.pdf | |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.