Abstract: Randomscaledsectorgraphs were introduced as a generalization of random geometric graphs to model networks of sensors using optical communication. In the randomscaledsector graph model vertices are placed uniformly at random into the [0, 1]2 unit square. Each vertex i is assigned uniformly at randomsector Si, of central angle {\'a}i, in a circle of radius ri (with vertex i as the origin). An arc is present from vertex i to any vertex j, if j falls in Si. In this work, we study the value of the chromatic number ボ\^O}(Gn), directed clique number {\`u}(Gn), and undirected clique number {\`u}2 (Gn) for randomscaledsectorgraphs with n vertices, where each vertex spans a sector of {\'a} degrees with radius rn = ―~{a}ln n/n. We prove that for values {\'a} < ボ\^I}, as n → ∞ w.h.p., ボ\^O}(Gn) and {\`u}2 (Gn) are {\`E}(ln n/ln ln n), while {\`u}(Gn) is O(1), showing a clear difference with the random geometric graph model. For {\'a} > ボ\^I} w.h.p., ボ\^O}(Gn) and {\`u}2 (Gn) are {\`E} (ln n), being the same for randomscaledsector and random geometric graphs, while {\`u}(Gn) is {\`E}(ln n/ln ln n).