English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113648/144635 (79%)
Visitors : 51574418      Online Users : 917
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
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/55481


    Title: 基於人智運算輔助定位分群之群組通訊在耐延遲網路的研究
    Other Titles: A Research on Delay Tolerant Network Based on Human Computation Assisted Geo-Clustering
    Authors: 蔡子傑
    Contributors: 國立政治大學資訊科學系
    行政院國家科學委員會
    Keywords: 耐延遲網路;人智運算;機會編碼;網路編碼;自行車行動網路;有目的性的遊戲;定位;P2P 間斷式影音串流
    Delay Tolerant Network;Human Computation;Opportunistic Coding;Network Coding;BikeNet;GWAP;Location;P2P Interrupted Streaming
    Date: 2010
    Issue Date: 2012-11-12 11:05:22 (UTC+8)
    Abstract: 近年來無線網路與3G 網路的興起,以及智慧型手機漸漸在手機市場中嶄露頭角,利用GPS(Global Position System)系統搭配地圖程式功能來規劃旅遊路線、玩遊戲、聽音樂等,現在在智慧型手機上就可以完成。然而,因為成本的考量與實際上的限制,未必所有的地點都適合架設無線的AP,這些沒涵蓋到的部分形成了通訊上的黑洞。特別是在一個群組出遊的活動中,P2P 或群組通訊是重要的需求,但不一定要利用到基地台或AP 來作群組通訊,更有可能是出遊地點並無法有這些無線網路的完整服務。例如登山或腳踏車隊出遊的活動,通常只在登山口/休息站設立無線AP 供上網,若是在活動沿途想要上傳一些照片與朋友分享、跟群組朋友通訊或個人化的現況詢問,只能由各個節點彼此合作,透過multihop 的方式來傳送訊息。然而,發送端到目的端之間不一定一直存在有一條端點到端點的路徑可供路由傳送。解決在這樣的不穩定網路架構下傳輸問題的概念,就稱為耐延遲網路delay tolerant networks /disruption tolerant networks(DTN)。基於上述,本研究的目的為:在資源受限的DTN環境下,利用分群的概念、 opportunistic network及network coding,來解決網路頻寬,網路連線變化的問題,並且考量行動設備的有限電力,希望設計兼顧energy-efficiency的一套有效提升群組通訊傳輸效能的機制。本計畫將分三年來進行。第一年將研究標靶式定位演算法,並依網路拓樸穩定度的高低不同,分別研究群體通訊的傳輸方式,包含利用機會編碼(opportunistic coding) 設計P2P間斷式影音串流傳輸方式,及利用位置資訊結合網路編碼(network coding)來設計DTN路徑規劃。第二年將以自行車行動網路(BikeNet)為焦點,以地理位置及信賴關係來分群,並研究群內及群間的通訊協定。第三年將引進人智運算的概念,設計 GWAP(Game with a purpose)的輔助定位系統,及大範圍的WiFi定位演算法,藉使BikeNet 的分群與DTN的傳輸機制更可靠。相關的技術將整合實作在BikeNet的平台上實驗評估。
    Recently the wireless and 3G networks have been developed successfully, the mobile smart phones are becoming popular and can play almost everything on them, including using GPS (Global Position System) and e-Map to plan travel routes, gaming, music, etc. However, due to the constraints of cost and practice, not all places are suitable to deploy infrastructure like APs or base-stations. Those areas which have not been covered by wireless infrastructure will become the communication holes. Especially, for the group activities, the P2P or group communication is the important demand. It does not necessarily utilize the APs or base-stations to transport their data, or even it can not use the wireless services due to lack of infrastructure. For example, a mountain-climbing or bike activity, usually wireless APs are only installed at the entrance or rest areas, not the entire trail. If someone wants to share the pictures they take with friends during the activity or query some information, the data transmission can only be done by peer members’ cooperation, namely, multihop relay to forward data to the designated group member(s) or node(s). Moreover, there usually does not exist a stable path from source to destination node. To solve the transport problem in such an unstable or disconnected network environment, a concept of delay/disruption tolerant networks (DTN) is proposed. Based on the aboves, the research goals of the subproject will be: In the resource-constrained DTN environment, how to develop good clustering/grouping algorithms to design the P2P and group communication protocols in order to achieve performance enhancement. How to utilize opportunistic network and network coding to solve network instability and limited bandwidth challenges. We should also take into considerations the energy-efficiency for the mobile devices. This subproject will proceed for three years. In the first year, we will develop a bulls’ eye locating technique, and also design the group communication protocols for different network topology stabilities. They will include P2P interrupted streaming mechanism using opportunistic coding and location-based DTN routing using network coding. In the second year, we will advance to focus the development of a BikeNet. We will use geo-information and group relationships to do clustering or grouping. Then an energy-efficient intra-cluster protocol and a high heuristically reliable inter-cluster protocol will be developed. In the 3rd year, by using the concept of human computation, we will design a game with a purpose (GWAP) which will assist on building Wi-Fi radio maps to enhance the accuracy and extend the coverage of the locating system we developed in the previous year. With the more accurate location information, the clustering and DTN routing mechanism for the BikeNet will achieve more reliable and better performance. We will also integrate the important techniques and practice a real system to prove the concept.
    Relation: 應用研究
    學術補助
    研究期間:9908~ 10007
    研究經費:557仟元
    Data Type: report
    Appears in Collections:[資訊科學系] 國科會研究計畫

    Files in This Item:

    File Description SizeFormat
    99-2221-E-004-005.pdf4437KbAdobe PDF2661View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback