English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 113648/144635 (79%)
造訪人次 : 51662212      線上人數 : 471
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 >  Item 140.119/58322
    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/58322


    題名: 在機會網路上使用機率預測法搜尋行動代理人 之機制
    Using probabilistic prediction method in the search of mobile agents over opportunistic network
    作者: 游筱慈
    You, Hsiao Tzu
    貢獻者: 連耀南
    Lien, Yao Nan
    游筱慈
    You, Hsiao Tzu
    關鍵詞: 機率
    預測
    搜尋
    機會網路
    probability
    prediction
    search
    opportunistic network
    日期: 2012
    上傳時間: 2013-06-03 17:41:32 (UTC+8)
    摘要: 在機會網路上,訊息的遞送遠比一般網路來得困難許多,溝通交換資訊效率很低。本篇論文以山文誌資訊系統為背景,假設在山區中已佈建完成控制節點並組成控制網路,以及行動代理人機制已導入在控制網路上用來搜尋移動的目標節點。其中行動代理人附屬於登山客所攜帶的設備上,欲搜尋的目標節點會沿著登山路徑不斷移動造成搜尋上的困難,若搜尋失敗不只拉長延後了搜尋時間,也可能錯失黃金救難時間造成極大的損失,如何增進搜尋效率是機會網路上相當重要的議題。為此,本文提出一個搜尋方法,在任意的時間點計算目標行動節點落在每個控制節點之間路段的機率,預測目標代理人的位置,就可依機率高低逐次搜尋各路段,以提高搜尋效率。我們以山文誌登山資訊系統,作為參考的機會網路,提出兩個模型,使用機率預測搜尋法,預測行動節點可能所在位置優先搜尋此路段來降低整體搜尋時間,透過一連串的實驗驗證機率模型之準確度,並評估本法之搜尋效率以及當各路段花費時間的機率分佈假設有誤時,搜尋效率的受損程度。在我們的實驗中,機率模型之準確度極高,誤差不超過7.59%,搜尋效率都在44.44以上,即使機率分佈錯誤,搜尋效能仍高於二分搜尋法約2倍。
    Since transmitting data on an opportunistic network is more difficult than that on a general network, information exchanging is less efficient. Based on “CenWits” system, we assume that control point has entirely construed all over the mountains and a control network has completed altogether; meanwhile, the mobile agent mechanism has applied in the searching of mobile target nodes. With mobile agent attached on the equipment of hikers, the target agent moving constantly along the hiking path grows the difficulties in searching. The failure in locating the mobile agent possibly not only prolongs the searching time, but also misses the golden time of life saving, and causes enormously damages eventually. Therefore, figuring that “improving the efficiency of searching” is a major issue in opportunistic network, in this thesis we develop a searching method which enables us to calculate the probability where a mobile target agent locates in every edge between control points in any arbitrary time point. Through forecasting the location of the target agent, we can start searching from the edge with the highest probability, thus enhance the efficiency of searching. Using “CenWits” system as reference opportunistic network, we designed two probability models as well as associated search methods. We conducted a series of experiments to evaluate the accuracy of probabilistic models and the performance of the proposed search methods. In our experiments, the error of probability models is no more than 7.59%. Our proposed methods out perform Basic Binary Search by 44.44 in average. Furthermore, assuming that there is a discrepancy between the probability assumptions and the real distribution of the traveling time spent on each edge, we evaluate the performance degradation too. The experimental results show that under such circumstance, our Probabilistic Prediction Method can even outperform Basic Binary Search by approximately 200%.
    參考文獻: [1] S. A. Tamhane, M. Kumar, A. Passarella, and M. Conti, "Service Composition in Opportunistic Networks," in Proc. of the 2012 IEEE International Conference on Green Computing and Communications, 2012, pp.285-292
    [2] L. Pelusi, A. Passarella, and M. Conti, "Opportunistic networking: data forwarding in disconnected mobile ad hoc networks," IEEE Communications Magazine, vol. 44, no. 11, pp. 134-141, Nov. 2006.
    [3] C.-M. Huang, K.-c. Lan, and C.-Z. Tsai, "A survey of opportunistic networks," in Proc. of the 22nd International Conference on Advanced Information Networking and Applications, 2008, pp. 1672-1677.
    [4] J. H. Huang, S. Amjad, and S. Mishra, "Cenwits: a sensor-based loosely coupled search and rescue system using witnesses," in Proc. of the 3rd International Conference on Embedded Networked Sensor Systems, 2005, pp. 180-191.
    [5] Y. T. Huang, Y. C. Chen, J. H. Huang, L. J. Chen, and P. Huang, "YushanNet: A delay-tolerant wireless sensor network for hiker tracking in Yushan national park," in Proc. of the 10th International Conference on Mobile Data Management: Systems, Services and Middleware, 2009, pp. 379-380.
    [6] Y. T. Huang, Y. C. Chen, J. H. Huang, L. J. Chen, and P. Huang, "YushanNet: A delay-tolerant wireless sensor network for hiker tracking in Yushan national park," in Proc. of the 10th International Conference on Mobile Data Management: Systems, Services and Middleware, 2009, pp. 379-380.
    [7] 陳伶志, 黃寶儀, and 黃致豪. "山文誌登山資訊系統." Internet: http://nrl.iis.sinica.edu.tw/YushanNet/tw_project.php, Retrieved on May. 1, 2013.
    [8] A. Fujihara, “ZebraNet and its theoretical analysis on distribution functions of data
    gathering times” in Proc. of the Second International Workshop on Mobile Opportunistic
    Networking, 2010, pp. 205-206
    [9] M. Martonosi, “ZebraNet and beyond: applications and systems support for mobile, dynamic networks”, in Proc. of the 2008 International Conference on Compilers, architectures and synthesis for embedded systems, 2008, pp.21-21
    [10] S. Farrell, et al. "InterPlanetary Internet." Internet: http://www.ipnsig.org/, Retrieved on May. 1, 2013.
    [11] Y. Chen, and H. Wu “Communications and Architectures for Interplanetary Internet”, in Proc. of 2011First International Conference on Instrumentation, Measurement, Computer, Communication and Control, 2011, pp. 895-899
    [12] E. Brewer, et al. "Technology and Infrastructure for Emerging Regions (TIER)." Internet: http://tier.cs.berkeley.edu/drupal/about, Retrieved on May. 1, 2013.
    [13] Z. Lu and J. Fan, "Delay/Disruption tolerant network and its application in military communications," in Proc. of the 2010 International Conference on Computer Design and Applications (ICCDA), 2010, pp. 231-234.
    [14] Y. Sasaki and Y. Shibata, "Distributed disaster information system in DTN based mobile communication environment," in Proc. of the 2010 International Conference on Broadband, Wireless Computing, Communication and Applications, 2010, pp. 274-277.
    [15] 陳禹銘, 祝鈞毅, 李雅萍, and 周子勤, "多工協調技術之應用與展望," 機械工業, no. 285, pp. 93-104, Dec. 2006.
    [16] D. S. Milojicic, F. Douglis, and R. Wheeler. Mobility: processes, computers, and agents. New York, NY: ACM Press/Addison-Wesley Publishing Co., 1999.
    [17] D. B. Lange and M. Oshima, "Seven good reasons for mobile agents," Communications of the ACM, vol. 42, no. 3, pp. 88-89, Mar. 1999.
    [18] L. T. Yang. Mobile Intelligence. Hoboken, NJ: John Wiley & Sons, Inc., 2010.
    [19] 楊柏華譯, &quot;<<資訊新知>>:行動代理人技術(上),&quot; 中央研究院計算中心通訊, vol. 18, no. 23, pp. 184-188, Nov. 2002.
    [20] 陳伶志, and 黃有德, &quot;登山客的黑盒子,&quot; 中央研究院週報, no. 1376, pp. 4-6, June 2012.”
    [21] J. H. Huang, S. Amjad, and S. Mishra. &quot;Cenwits Search and Rescue System.&quot; Internet: https://csel.cs.colorado.edu, Retrieved on May.1, 2013.
    [22] Y.N. Lien, Y.S. Lin, &quot;Placement of control network for mobile agents over
    opportunistic networks,&quot; in Proc. of the 2012 IEEE International Conference on Pervasive
    Computing and Communications Workshops, 2012, pp.631-636
    描述: 碩士
    國立政治大學
    資訊科學學系
    98753032
    101
    資料來源: http://thesis.lib.nccu.edu.tw/record/#G0987530321
    資料類型: thesis
    顯示於類別:[資訊科學系] 學位論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    032101.pdf2210KbAdobe PDF2341檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 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 ©   - 回饋