The algorithm of network topology management using k-edge connected minimal spanning sub-graph

DOI10.16357/J.CNKI.ISSN1000-5862.2016.02.08MaRDI QIDQ2823959zbMATH OpenFDO

Authors Yanwei Sun, Qian Zhou

Publication date 6 October 2016

Published in Journal of Jiangxi Normal University. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

\(k\)-edge-connectedtopology managementminimum spanning subgraphmobile community

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1930757
• Distributed Computing - IWDC 2004
• Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks
• scientific article; zbMATH DE number 2090692
• A decentralized energy-based diffusion algorithm to increase the lifetime of MANETs

Cited in

(1)

• A Centralized Algorithm for Topology Management in Mobile Ad-Hoc Networks through Multiple Coordinators

This page was built for publication: The algorithm of network topology management using \(k\)-edge connected minimal spanning sub-graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2823959)