Random Connected Graph Generation for Wireless Sensor Networks

TLDR: A fast and light-weight algorithm has been proposed in this paper to produce a random connected graph for a real-time multi-hop wireless sensor networks (WSNs), which has better performance than other existing methods.

Abstract: For analysing networks like social media networks, wireless sensor networks, etc. in many applications, generating random connected graph is very important. As it is time consuming to generate the random connected graph consisting of large nodes it is necessary to generate it in minimum time. Characteristics like dependent edges and non-binomial degree distribution that are absent in many classical random graph models such as the Erdos-Renyi graph model can be captured by random graphs with a given degree range. The problem of random connected graph generation having a prescribed degree range has been addressed here. Random graphs are used to model wireless sensor networks (WSNs) or IoT comprising of sensor nodes with limited power resources. A fast and light-weight algorithm has been proposed in this paper to produce a random connected graph for a real-time multi-hop wireless sensor networks (WSNs). Results show that our method has better performance than other existing methods.