Title :
Reliability analysis of sparse topologies for packet radio networks
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Abstract :
Four connectivity measures are used to compare the reliability of various sparse topologies for packet radio networks. Different scenarios, including link failures, node failures, and both types of failures, were simulated for fixed-radius, nearest-neighbor, angle-constrained, degree-constrained, and Delaunay triangulation-based topologies. The simulation results demonstrated that the commonly used fixed-radius topologies were the worst among all topologies tested. Also, the results showed that triangulation-based and angle-constrained topologies maintained high reliability even under component failures
Keywords :
network topology; packet radio networks; reliability; telecommunication network routing; Delaunay triangulation-based topologies; angle-constrained topologies; connectivity measures; degree-constrained topologies; fixed-radius topologies; link failures; nearest-neighbour topologies; node failures; packet radio networks; reliability analysis; sparse topologies; Fading; Fluctuations; Interference; Maintenance; Network topology; Packet radio networks; Radio link; Robustness; Testing; Throughput;
Conference_Titel :
INFOCOM '92. Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE
Conference_Location :
Florence
Print_ISBN :
0-7803-0602-3
DOI :
10.1109/INFCOM.1992.263488
