Title :
Connectivity reliability of large scale random ad hoc networks
Author_Institution :
Sch. of Electr. Eng. & Comput. Sci., Central Florida Univ., Orlando, FL, USA
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 cannot be established.
Keywords :
ad hoc networks; graph theory; mobile radio; telecommunication network reliability; connectivity reliability; large scale ad hoc network; random graphs; Ad hoc networks; Cities and towns; Computer network reliability; Computer science; Error correction; Large-scale systems; Network topology; Parity check codes; Protocols; Tree graphs;
Conference_Titel :
Military Communications Conference, 2003. MILCOM '03. 2003 IEEE
Print_ISBN :
0-7803-8140-8
DOI :
10.1109/MILCOM.2003.1290138
