Pervasive and Mobile Computing
Source: Reed Elsevier
This paper considers generation of graphs that represent specific scenarios that appear in wireless ad hoc, actuator, sensor and Internet networks. Most simulation studies for these networks use connected random unit disk graphs generated by placing nodes randomly and independently from each other. However, in real life usually networks are created in a cooperative manner; certain restrictions are imposed during the placement of a new node in order to improve network connectivity and functionality. This paper is an initial study on how constrained connected random unit graphs (C-CRUG) can be generated by fast algorithms and what kind of desirable characteristics can be achieved compared to completely random graphs, especially for sparse node densities.