Connectivity for the Frisbee Architecture

In this paper we investigate the k-connectivity threshold of distributed dense ad hoc heterogeneous wireless sensor network architecture. We consider the situation when sensors are deployed in the surveillance area according to a uniform distribution perturbed by a Gaussian noise. We derive analytically the minimum detection range which guarantees an emerging structure in the network, namely the connectivity, which becomes larger and larger as the number of sensors in the network increase. This allows the target track to be propagated almost surely throughout the network using the minimum possible amount of prime energy. We report the results of some simulation experiments which further support the theoretical results