يعرض 1 - 1 نتائج من 1 نتيجة بحث عن '"叢聚拓樸"', وقت الاستعلام: 0.30s تنقيح النتائج
  1. 1
    Academic Journal

    المؤلفون: 林明源, Lin, Ming-Yuan

    المساهمون: 林永松, 臺灣大學:資訊管理學研究所

    وصف الملف: 1232029 bytes; application/pdf

    Relation: [1] B. An and S. Papavassiliou, “A mobility-based clustering approach to support mobility management and multicast routing in mobile ad-hoc networks”, International Journal of Network Management 200111 page 387-395. [2] B. An and S. Papavassiliou, “MHMR: mobility-based hybrid multicast routing protocol un mobile ad hoc wireless network”, Wireless Communication and Mobile Computing 2003 3 page 255-270. [3] B. An and S. Papavassiliou, “Geomulticast: architecture and protocols for mobile ad hoc wireless networks”, http://www.ComputerScienceWeb.com received 17 October 2002. [4] A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh, “Max-min D-cluster formation in wireless ad hoc networks”, Inforcom 2000. [5] J.J. Garcai-Luna-Aceves and E. L. Madruga, “ A multicast routing protocol for ad hoc networks”, Processing of Inforcom99 March 99 page 784-792. [6] T. Camp, J. Boleng, and V. Davies, “A survey of mobility models for ad hoc network research“, Wireless Communication and Mobile Computing 2002 2 page 483-502 . [7] S. J. Lee, W. Su, and M. Gerla, “ODMRP On-demand multicast Routing Protocol in Multihop Wireless Mobile Networks”, Mobile Network and Application Dec 2002 7 6 ABI/INFORM Global. [8] Das, A. K. Marks, R. J. El-Sharkawi, M. Arabshahi, and P. Gray, “Minimum power broadcast trees for wireless networks: Integer programming formulations”, INFOCOM 2003, 30 March-3 April 2003, p1001- 1010 vol.2. [9] E. L. JOHNSON, A. MEHROTRA, and G. L. NEMHAUSER, “Cliques and clustering: A combinatorial approach”, Mathematical Programming, 62, 133-151. [10] Alan, D. Amis, and R. Prakash, “Load-balancing clusters in wireless ad hoc networks”, Proceedings of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology 2000, P.25. [11] Jamal N. ,Al-Karaki Ahmed E. ,and K. Raza, “On the optimal clustering in mobile ad hoc networks”, Proceedings of IEEE Consumer Communications and Networking, Las Vegas, Nevada USA/ January 5-8, 2004. [12] JEFFREY E. , WIESELTHIER, and GAM D. NGUYEN, “Algorithms for energy-efficient multicasting in static ad hoc network”, Mobile Networks and Applications 6,251-263,2001. [13] W. Lou, Student Member, IEEE, and J. Wu Senior Member, “On reducing broadcasting redundancy in ad hoc network”, IEEE transactions on mobile computing April-June 2002. [14] J. Aslam, Q. Li*, and D. Rus, “Three power-aware routing algorithms for sensor networks”, WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Commun. Mob. Comput. 2003; 3:187–208 (DOI:10.1002/wcm.111). [15] X.-Y. Li, ‘Algorithmic, geometric and graphic issues in wireless networks”, WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Commun. Mob. Comput. 2003; 3:119–140 (DOI:10.1002/wcm.107). [16] Y. X. FENG, L. L. ZHAO, G. X. Wang, “A Clustering Algorithm Applied to Network Management in MANETS”, Info-tech and Info-net, 2001. Proceedings. ICII 2001-Beijing. 2001 International Conferences on Publication Date: 2001 Volume: 2, p. 626-631 vol.2. [17] K. Liu, J. D. Li, “Mobile cluster protocol in wireless ad hoc networks”, Proc. Intl. Conf. on Commun. Tech. (WCC - ICCT 2000), Vol. 1, 2000. [18] C. Y. Chiu, G. H. Chen, and Eric H. K. Wu, “A stability aware cluster routing protocol for mobile ad hoc networks”, Wireless Communications and Mobile Computing Volume 3, Issue 4 , Pages 503 – 515. [19] S. Harada and H. Higaki (Japan), “Sporadic communication protocol between clusters of mobile computers”, wireless networks and engineering technologies WNET 2004 Track - Wireless Technologies II 424-050. [20] M. L. Fisher, “The Largragian relaxation method for solving integer programming problems’, Management Science Vol. 27. N0. 1. January 1981 Printed in U.S.A.; en-US; http://ntur.lib.ntu.edu.tw/handle/246246/54373; http://ntur.lib.ntu.edu.tw/bitstream/246246/54373/1/ntu-94-R92725034-1.pdf