The chromatic and clique numbers of random scaled sector graphs

Random scaled sector graphs were introduced as a generalization of random geometric graphs to model networks of sensors using optical communication. In the random scaled sector graph model vertices are placed uniformly at random into the [0, 1]2 unit square. Each vertex i is assigned uniformly at random sector Si, of central angle α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 χ(Gn), directed clique number ω(Gn), and undirected clique number ω2 (Gn) for random scaled sector graphs with n vertices, where each vertex spans a sector of α degrees with radius rn = √ln n/n. We prove that for values α π w.h.p., χ(Gn) and ω2 (Gn) are Θ (ln n), being the same for random scaled sector and random geometric graphs, while ω(Gn) is Θ(ln n/ln ln n).

[1]  B. Reed Graph Colouring and the Probabilistic Method , 2001 .

[2]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Archana Bharathidasan,et al.  Sensor Networks : An Overview , 2002 .

[4]  Colin McDiarmid,et al.  Random channel assignment in the plane , 2003, Random Struct. Algorithms.

[5]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[6]  J. J. Garcia-Luna-Aceves,et al.  Transmission scheduling in ad hoc networks with directional antennas , 2002, MobiCom '02.

[7]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[8]  Maria J. Serna,et al.  A Random Graph Model for Optical Networks of Sensors , 2003, IEEE Trans. Mob. Comput..

[9]  Sanjay Kumar Madria,et al.  Sensor networks: an overview , 2003 .

[10]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..