Type of Document Dissertation Author Irwin, Ryan Author's Email Address email@example.com URN etd-04022012-100105 Title Traffic-Aware Channel Assignment for Multi-Transceiver Wireless Networks Degree PhD Department Electrical and Computer Engineering Advisory Committee
Advisor Name Title DaSilva, Luiz A. Committee Chair MacKenzie, Allen B. Committee Co-Chair Gracanin, Denis Committee Member Hou, Yiwei Thomas Committee Member Reed, Jeffrey Hugh Committee Member Keywords
- Topology Control
- Channel assignment
- Cognitive Networks
- Multi-channel Networks
Date of Defense 2012-03-23 Availability unrestricted AbstractThis dissertation addresses the problem of channel assignment in multi-hop, multi-transceiver wireless networks. We investigate (1) how channels can be assigned throughout the network to ensure that the network is connected and (2) how the channel assignment can be adapted to suit the current traffic demands. We analyze a traffic-aware method for channel assignment that addresses both maintaining network connectivity and adapting the topology based on dynamic traffic demands.
The traffic-aware approach has one component that assigns channels independently of traffic conditions and a second component that assigns channels in response to traffic conditions. The traffic-independent (TI) component is designed to allocate as few transceivers or radios as possible in order to maintain network connectivity, while limiting the aggregate interference induced by the topology. The traffic-driven (TD) component is then designed to maximize end-to-end flow rate using the resources remaining after the TI assignment is complete. By minimizing resources in the TI component, the TD component has more resources to adapt the topology to suit the traffic demands and support higher end-to-end flow rate.
We investigate the fundamental tradeoff between how many resources are allocated to maintaining network connectivity versus how many resources are allocated to maximize flow rate. We show that the traffic-aware approach achieves an appropriately balanced resource allocation, maintaining a baseline network connectivity and adapting to achieve near the maximum theoretical flow rate in the scenarios evaluated.
We develop a set of greedy, heuristic algorithms that address the problem of resource- minimized TI assignment, the first component of the traffic-aware assignment. We develop centralized and distributed schemes for nodes to assign channels to their transceivers. These schemes perform well as compared to the optimal approach in the evaluation. We show that both of these schemes perform within 2% of the optimum in terms of the maximum achievable flow rate.
We develop a set of techniques for adapting the network’s channel assignment based on traffic demands, the second component of the traffic-aware assignment. In our approach, nodes sense traffic conditions and adapt their own channel assignment independently to support a high flow rate and adapt when network demand changes. We demonstrate how our distributed TI and TD approaches complement each other in an event-driven simulation.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access IRWIN_RE_D_2012.pdf 1.31 Mb 00:06:02 00:03:06 00:02:43 00:01:21 00:00:06 Irwin_RE_D_2012_Copyright.pdf 15.71 Kb 00:00:04 00:00:02 00:00:01 < 00:00:01 < 00:00:01
If you have questions or technical problems, please Contact DLA.