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
What is scalability in multi-agent systems?
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Towards a fault-tolerant multi-agent system architecture
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Improving fault-tolerance by replicating agents
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Introduction to Multiagent Systems
Introduction to Multiagent Systems
Diagonal and Toroidal Mesh Networks
IEEE Transactions on Computers
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
Consensus Based Formation Control and Trajectory Tracing of Multi-Agent Robot Systems
Journal of Intelligent and Robotic Systems
Topological analysis of AOCD-based agent networks and experimental results
Journal of Computer and System Sciences
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
Self-organization in an agent network: A mechanism and a potential application
Decision Support Systems
| Hi-index | 0.00 |
In our early work, we reported Borel Cayley Graphs (BCGs) have the best topological and graph-spectral properties compared to toroidal and diagonal mesh networks and small-world networks. However, BCGs' dependence on generating parameters in size selection and network characteristics has been a challenge in network applications. In this paper, we propose Expanded Borel Cayley Graphs (Ex-BCGs) as a communication topology for multi-agent systems. Ex-BCGs are group-theoretically expanded graphs from BCGs with fixed generating parameters. Ex-BCGs not only conserve constant nodal degree and node labeling scheme but also inherit the communication efficiency of the original BCGs. With experimental results, we show the proposed Ex-BCGs no longer require new generating parameters for new sizes. Moreover, we show resolution of this constraint to produce efficient topological and graph-spectral properties and fast convergence speed when compared to BCGs of similar sizes. We also present the Cut-Through Rewiring (CTR) algorithm as a fault-tolerant methodology against node-failures by regarding pruning nodes as node-failures and utilizing the CTR as a way of recovering connections for neighbors of the pruned nodes in multi-agent systems. The numerical results show that resized networks from Ex-BCGs by the CTR algorithm are more fault-tolerant with robust connectivity, efficient topological properties and faster convergence speed than BCGs.