## Abstract

This paper presents a tractable analytical framework for the exact calculation of the probability of node isolation and the minimum node degree distribution when N sensor nodes are independently and uniformly distributed inside a finite square region. The proposed framework can accurately account for the boundary effects by partitioning the square into subregions, based on the transmission range and the node location. We show that for each subregion, the probability that a random node falls inside a disk centered at an arbitrary node located in that subregion can be analytically expressed in closed form. Using the results for the different subregions, we obtain the exact probability of node isolation and minimum node degree distribution that serves as an upper bound for the probability of k-connectivity. Our theoretical framework is validated by comparison with the simulation results and shows that the minimum node degree distribution serves as a tight upper bound for the probability of k-connectivity. The proposed framework provides a very useful tool to accurately account for the boundary effects in the design of finite wireless networks.

Original language | English |
---|---|

Article number | 6678301 |

Pages (from-to) | 2836-2847 |

Number of pages | 12 |

Journal | IEEE Transactions on Vehicular Technology |

Volume | 63 |

Issue number | 6 |

DOIs | |

Publication status | Published - Jul 2014 |

Externally published | Yes |

## Keywords

- k-connectivity
- node degree distribution
- probability of connectivity
- probability of node isolation
- sensor networks
- wireless multihop networks