English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90451/105768 (86%)
Visitors : 11045644      Online Users : 596
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    ASIA unversity > 資訊學院 > 資訊工程學系 > 博碩士論文 >  Item 310904400/12699

    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/12699

    Title: An Algorithm of Selecting the Least Nodes and The Shortest Paths Applied to The Sphere Communication
    Authors: Wu, Pochung
    Contributors: Department of Computer Science and Information Engineering
    Hsing-Chung Chen;Lu, Keh-Ming
    Keywords: Spherical communication;The algorithm of the shortest paths;satellite plan;deltahedra
    Date: 2012
    Issue Date: 2012-11-18 17:00:20 (UTC+8)
    Publisher: Asia University
    Abstract: In response to the popularity of broadband Internet, wireless technologymatures, more and more wireless devices and mobile communications products aredeveloping gradually, now using network is no longer limited by fixed wire-lineenvironment and no matter where or when you are, we can use clouds resources onthe internet easily. We propose the points of deltahedra with hop count route for bettercommunication planning and implementation to enhance the best communicationenvironment to optimize the communication without any obstacles, the integrationand application of wireless resources have become more effective than before.Eventually this study is important for global satellite program research.
    Appears in Collections:[資訊工程學系] 博碩士論文

    Files in This Item:

    File Description SizeFormat

    All items in ASIAIR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback