Critical Node Location in De Bruijn Networks
Abstract
When deploying a wireless network, some highly desirable properties are (a) many short paths between any two nodes, and (b) relatively few edges. One type of network structure that satisfies both of these properties simultaneously is the class of de Bruijn networks. De Bruijn networks have been utilized in many applications, such as fault tolerant networks, peer-to-peer networks, amongst others. Because of their unique properties, many algorithms that are normally time-consuming perform exceptionally well on de Bruijn networks. This class of networks has yet to be considered from an identifying code perspective, and a complete examination of the problem is provided, from both a theoretical and algorithmic perspective.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 2016
- Accession Number
- AD1019487
Entities
People
- Victoria Goliber
Organizations
- Rome Laboratory