Recent advancements in information and communications technology are changing the information environment in both quantitative and qualitative measures. The developments in directional wireless capabilities necessitate the ability to model these new capabilities, especially in dynamic environments typical of military combat operations. This thesis establishes a foundation for the definition and consideration of the unique network characteristics and requirements introduced by this novel instance of the Network Design Problem (NDP). Developed are a Mixed-Integer Linear Program (MILP) formulation and two heuristic strategies for solving the NDP. A third solution strategy using the MILP formulation with a degree-constrained Minimum Spanning Tree starting solution is also considered. The performance of the various methods are evaluated on the basis of solution quality, computation time, and other network metrics via randomly generated data sets for several different problem sizes.