Strategies for interconnection networks: some methods from graph theory
Journal of Parallel and Distributed Computing
Vertex-transitivity and routing for Cayley graphs in GCR representations
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Representations of Borel Cayley graphs
SIAM Journal on Discrete Mathematics
Fault diagnosis in a small constant number of parallel testing rounds
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Lightwave networks based on de Bruijn graphs
IEEE/ACM Transactions on Networking (TON)
On a Lightwave Network Topology Using Kautz Digraphs
IEEE Transactions on Computers
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Diagonal and Toroidal Mesh Networks
IEEE Transactions on Computers
Impact of Network Density on Data Aggregation in Wireless Sensor Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Asymptotically optimal time synchronization in dense sensor networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Computer
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
A scheme for robust distributed sensor fusion based on average consensus
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
Dense and Symmetric Graph Formulation and Generation for Wireless Information Networks
WNIS '09 Proceedings of the 2009 International Conference on Wireless Networks and Information Systems
HyperCuP: hypercubes, ontologies, and efficient search on peer-to-peer networks
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
MAC protocols for wireless sensor networks: a survey
IEEE Communications Magazine
Expanded Borel Cayley Graphs (Ex-BCGs): A novel communication topology for multi-agent systems
Journal of Network and Computer Applications
| Hi-index | 0.25 |
A graph theoretic approach is proposed to formulate communication graphs that enable ultrafast information distribution. In our earlier work, we reported that Borel Cayley graph (BCG) is a promising candidate as a logical topology for fast information distribution. However, the practical applications of BCG have been challenging because of its inflexible sizes. In this paper, we propose a simple but effective graph resizing algorithm that removes nodes from an oversized BCG to achieve a desired network size. The proposed resizing algorithm consists of two parts: a random pruning algorithm that identifies nodes to be removed uniformly at random; and a novel cut-through rewiring (CTR) algorithm that rewires the remaining nodes. The proposed resizing algorithm preserves the superior properties of the original BCGs, including a small diameter, a short average path length, a large algebraic connectivity, and ultrafast information distribution performance. Furthermore, analytical formulae were derived to compute the graph disconnection probability of the BCGs after resizing. Analytical results showed that the resized graphs are almost surely connected even after 80~90% size reduction, depending on the original BCG size.