About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Conference paper
Reliability analysis of sparse topologies for packet radio networks
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. © 1992 IEEE.