Approximation Theory for Connectivity of Ad Hoc Wireless Networks with Node Faults

7Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this letter, we propose an approximation theory for connectivity of general random geometric graphs (RGGs) with stochastic node faults, which is regarded as an abstract model of ad hoc wireless sensor networks (WSNs) with unreliable nodes. In the model, each node in an RGG is independently at fault and the disconnection probability of a resulting survival network is evaluated. The proposed approximation formula for the probability is asymptotically correct and reveals the phase transition phenomena of connectivity in the model. In addition, we obtain phase transition thresholds of a practical Rayleigh single-input single-output (SISO) model and Rayleigh multiple-input multiple-output (MIMO) model, which shows the effectiveness of the MIMO system against attenuation and random node faults. The numerical results in Rayleigh MIMO model show that the approximation formula well estimates the connection probability even for finite graphs and that it provides useful information for design of WSN immune to node faults.

Cite

CITATION STYLE

APA

Takabe, S., & Wadayama, T. (2019). Approximation Theory for Connectivity of Ad Hoc Wireless Networks with Node Faults. IEEE Wireless Communications Letters, 8(4), 1240–1243. https://doi.org/10.1109/LWC.2019.2912610

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free