Managing radio resources in dense wireless areas

Placeholder Show Content

Abstract/Contents

Abstract
Smartphone proliferation has created the demand for ubiquitous access to wireless data anywhere and at any time. This demand is particularly perceived in crowded venues such as concert halls, conference halls and sports stadiums, where a large number of mobile devices contend for limited spectrum. This dissertation focuses on highly dense wireless areas, where all users must communicate simultaneously with a common destination node, such as a cellular base-station. The research identifies a solution of multiple, small, dynamic user hotspots to better distribute the limited radio resources. This is achieved by taking advantage of reduced pathloss, communicating over locally available spectrum, and reuse of spectrum over spatially separated links. This dissertation presents two different methods of selecting hotspots, routing data and allocating resources in dense wireless areas. The first part of this dissertation focuses on improving network performance by creating a clustered configuration of nodes where the nodes within each cluster can operate over locally available spectrum (white-spaces). A single node within each cluster is designated as the hotspot, and all the other nodes communicate with the destination node through the hotspots. A semi-distributed algorithm, that clusters the nodes and coordinates the hotspots to tether over locally available white-spaces is proposed. In addition to providing simultaneous service to more users than conventional direct communication in cellular networks, simulation results show that the proposed method can increase the average battery life of devices by 30%. The second part of this dissertation aims at improving network performance in dense wireless areas through multiple hops and spatial reuse of spectrum. The proposed method groups nodes based on their location and creates a structured multi-hop configuration in which each group can forward its neighbor's data. Employing the large number of active radio nodes as relays, and exploiting the common direction of communication toward the single destination allows spatially separated groups to reuse limited spectrum resources. Resource allocation and routing among users is formulated as a convex cross-layer optimization problem. Furthermore, exploiting the structure of such problem leads to a semi-distributed optimization algorithm. As such, each node can optimize its resources independently based on local channel information.

Description

Type of resource text
Form electronic; electronic resource; remote
Extent 1 online resource.
Publication date 2013
Issuance monographic
Language English

Creators/Contributors

Associated with Tabrizi, Haleh
Associated with Stanford University, Department of Electrical Engineering.
Primary advisor Boyd, Stephen P
Primary advisor Cioffi, John M
Thesis advisor Boyd, Stephen P
Thesis advisor Cioffi, John M
Thesis advisor Farhadi, Golnaz
Advisor Farhadi, Golnaz

Subjects

Genre Theses

Bibliographic information

Statement of responsibility Haleh Tabrizi.
Note Submitted to the Department of Electrical Engineering.
Thesis Ph.D. Stanford University 2013.
Location electronic resource

Access conditions

Copyright
© 2013 by Haleh Tabrizi
License
This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).

Also listed in

Loading usage metrics...