Connectivity reliability of large scale random ad hoc networks

Authors:
Lei Wei
Affiliations:
School of Electrical Engineering and Computer Science, University of Central Florida, Orlando, FL
Venue:
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Year:
2003

Citing 5
Cited 1

Ad Hoc Wireless Networks: Protocols and Systems

Ad Hoc Wireless Networks: Protocols and Systems
The capacity of wireless networks

IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel

IEEE Transactions on Information Theory
The core-assisted mesh protocol

IEEE Journal on Selected Areas in Communications
CEDAR: a core-extraction distributed ad hoc routing algorithm

IEEE Journal on Selected Areas in Communications

A reliability-based framework for multi-path routing analysis in mobile ad-hoc networks

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study connectivity reliability of a large scale randomly connected ad hoc network. We first model the networks as random graphs, and then present a way to exam its connectivity reliability. The results show that if each node can randomly connect to 3 nodes, then for 99.5 % of graphs we can trace to all nodes from one node. If each node can just randomly connect to 2 nodes, then the reliable connectivity can not be established.