A Merging Clustering Algorithm for Mobile Ad Hoc Networks
暂无分享,去创建一个
[1] Yahui Zhu,et al. A distributed algorithm for minimum weight spanning trees based on echo algorithms , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.
[2] Shay Kutten,et al. A sub-linear time distributed algorithm for minimum-weight spanning trees , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[3] Yao-Nan Lien. A new node-join-tree distributed algorithm for minimum weight spanning trees , 1988, [1988] Proceedings. The 8th International Conference on Distributed.
[4] Baruch Awerbuch,et al. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.
[5] Dhiraj K. Pradhan,et al. A cluster-based approach for routing in dynamic networks , 1997, CCRV.
[6] Julio Solano-González,et al. Connectivity Based k-Hop Clustering in Wireless Networks , 2003, Telecommun. Syst..
[7] Arthur L. Liestman,et al. CLUSTERING ALGORITHMS FOR AD HOC WIRELESS NETWORKS , 2004 .
[8] Pierre A. Humblet,et al. A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.
[9] Saurabh Srivastava,et al. Distributed algorithms for finding and maintaining a k-tree core in a dynamic network , 2003, Inf. Process. Lett..
[10] Samir Khuller,et al. A Clustering Scheme for Hierarchical Routing in Wireless Networks , 2000 .
[11] Ralph P. Grimaldi,et al. Discrete and combinatorial mathematics , 1985 .
[12] Julio Solano-González,et al. Connectivity Based k-Hop Clustering in Wireless Networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.
[13] Ralph P. Grimaldi,et al. Discrete and Combinatorial Mathematics: An Applied Introduction , 1998 .