Connectivity and Coverage in Hybrid Wireless Sensor Networks using Dynamic Random Geometric Graph Model

Random Geometric Graphs have been a very influential and well-studied model of large networks, such assensor networks, where the network nodes are represented by the vertices of the RGG, and the direct connectivity between nodes is represented by the edges. This assumes homogeneous wireless nodes with uniform transmission ranges. In real life, there exist heterogeneous wireless networks in which devices have dramatically different capabilities. The connectivity of a WSN is related to the positions of nodes, and those positions are heavily affected by the method of sensor deployment. As sensors may be spread in an arbitrary manner, one of the fundamental issues in a wireless sensor network is the coverage problem. In this paper, I study connectivity and coverage in hybrid WSN based on dynamic random geometric graph.