Skip to main content

Design, Analysis and Computation in Wireless and Optical Networks

Abstract In the realm of network science, many topics can be abstracted as graph problems, such as routing, connectivity enhancement, resource/frequency allocation and so on. Though most of them are NP-hard to solve, heuristics as well as approximation algorithms are proposed to achieve reasonably good results. Accordingly, this dissertation studies graph related problems encountered in real applications. Two problems studied in this dissertation are derived from wireless network, two more problems studied are under scenarios of FIWI and optical network, one more problem is in Radio- Frequency Identification (RFID) domain and the last problem is inspired by satellite deployment.

The objective of most of relay nodes placement problems, is to place t... (more)
Created Date 2019
Contributor Zhou, Chenyang (Author) / Richa, Andrea (Advisor) / Sen, Arunabha (Advisor) / Xue, Guoliang (Committee member) / Walkowiak, Krzysztof (Committee member) / Arizona State University (Publisher)
Subject Computer science / algorithms / approximation / experiment / network
Type Doctoral Dissertation
Extent 161 pages
Language English
Note Doctoral Dissertation Computer Science 2019
Collaborating Institutions Graduate College / ASU Library
Additional Formats MODS / OAI Dublin Core / RIS

  Full Text
1.3 MB application/pdf
Download Count: 64

Description Dissertation/Thesis