English  |  正體中文  |  简体中文  |  Items with full text/Total items : 73032/73032 (100%)
Visitors : 23045501      Online Users : 283
RC Version 7.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: http://ir.lib.ncu.edu.tw/handle/987654321/68889

    Title: noe;The Optimal k-Connectivity Deployment Pattern of Wireless Sensors
    Authors: 楊宗穎;Yang,Zong-Ying
    Contributors: 資訊工程學系
    Keywords: 連接數;無線網路;connectivity;wireless
    Date: 2015-07-31
    Issue Date: 2015-09-23 14:46:01 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 在現今多樣式的無線網路應用中,為了要達到多重連接,節點佈建的方式扮演了很重要的角色。然而,現有的方法在尋找k連接數的時候,並沒有提供一個有系統性的方法來尋找出最佳化的佈建圖形。
    在這篇論文中,我們假設節點都是相同的,並且以對稱的形式擺放。結果顯示當我們以這種方式擺放的時候,節點的范諾圖(Voronoi diagram)會是三個regular tessellations的其中一種。基於這點想法,我們設計了一套搜尋的演算法,叫做Pruning and Search(PS) 來尋最佳化的k連接佈建圖形。我們的演算法是第一個採用系統性的方法來尋找最佳化的k連接佈建圖形。雖然PS的時間複雜度是指數型,但最佳化的圖型可以預先尋找出來。除此之外,我們可以透過PS跟RES兩個演算法的結合,來找到k連接以及L覆蓋的佈建圖形。
    ;The strategy for sensor node deployment to achieve multiple connectivity plays a critical role in various applications of wireless sensor networks. However, the existing solutions to identify optimal k-connectivity deployment patterns are heuristic in the sense that they do not provide a systematic approach to identify the optimal pattern for a given k value. In this paper, we assume that nodes are homogeneous and deployed to the ground symmetrically. As a result, the Voronoi diagram of wireless nodes will be one of the known three regular tessellations. Based on this idea, we design an intuitive searching algorithm, called Pruning and Search (PS), to identify the optimal k-connectivity deployment pattern for an arbitrary k value. To the best of our knowledge, our PS algorithm is the first one to do this task in a systematical approach. While the time complexity of the algorithm is exponential, the optimal pattern can be pre-computed offline in advance. In addition, PS can be easily combined with the RES algorithm so that the optimal k-connectivity and l-coverage deployment pattern for a given set of k and l values can be found.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File Description SizeFormat

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

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明