Connectivity properties of large-scale sensor networks

Abstract

In wireless sensor networks, both nodes and links are prone to failures. In this paper we study connectivity properties of large-scale wireless sensor networks and discuss their implicit effect on routing algorithms and network reliability. We assume a network model of n sensors which are distributed randomly over a field based on a given distribution function. The sensors may be unreliable with a probability distribution, which possibly depends on n and the location of sensors. Two active sensor nodes are connected with probability p e (n) if they are within communication range of each other. We prove a general result relating unreliable sensor networks to reliable networks. We investigate different graph theoretic properties of sensor networks such as k-connectivity and the existence of the giant component. While connectivity (i.e. k = 1) insures that all nodes can communicate with each other, k-connectivity for k [ 1 is required for multipath routing. We analyze the average shortest path of the k paths from a node in the sensing field back to a base station. It is found that the lengths of these multiple paths in a k-connected network are all close to the shortest path.These results are shown through graph theoretical derivations and are also verified through simulations.

Analysis of Wireless Ad-Hoc and Sensor Networks in Finite Regime

“…In [18], [19], and [21], k-connectivity of wireless networks has been investigated. In [18], k-connectivity was explored in the context of fault-tolerant networks.…”

A study of the Destination Guided Mobility models.

“…Connectivity is a fundamental requirem ent for communication between nodes [15][16][17][18][19][20][21], Establishing a stable connection between nodes of MANETs is necessary for their communication. Mobility of the nodes and their communication range influence the connectivity between them.…”

“…The ^-connectivity of an ad hoc network ensures th a t each node can be reached even if any k -1 nodes are removed from the network [19,21]. Several theoretical and some sim ulation-based analysis related to connectivity, mainly based on RWP mobility model, have been reported in the literature [15][16][17]19,21,52,[64][65][66]. Our stu d y on connectivity uses simulations on DGM models, in comparison with th e RWP mobility model.…”

“…Like [19], the work [21] also provided an analytical approximation for the probability th a t a network is fc-connected. Moreover, this paper investigated the existence o f the cluster in their analysis.…”

“…To analyse the connectivity of any network using simulation, we need a good set of connectivity metrics. In th e literature, there exists a num ber of works [15,16,18,19,21,64] for analysing the connectivity properties of ad hoc networks. Some of them have done analytical studies and the others are simulation-based analyses.…”