English  |  正體中文  |  简体中文  |  Items with full text/Total items : 70548/70548 (100%)
Visitors : 23240820      Online Users : 347
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/44490


    Title: 可避免IEEE 802.15.4 Zigbee 網路隱藏節點問題之節點加入與群組的機制;Node Joining and Grouping Scheme for Avoiding Hidden Node Problem in IEEE 802.15.4 Zigbee Networks
    Authors: 歐曉嬑;Shiau-yi Ou
    Contributors: 通訊工程研究所
    Keywords: 群組機制;隱藏節點;Zigbee;hidden node collision problem;IEEE 802.15.4
    Date: 2010-07-19
    Issue Date: 2010-12-09 13:45:57 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 隨網際網路的普及與相關技術日新月異,對於短距離的無線通訊需求也與日劇增,而IEEE 802.15.4 無線個人區域網路 (WPAN) 就是其中一種應用於短距離傳輸的技術。IEEE802.15.4 是由許多感測節點所組成,而感測節點因其運作環境的特性之故,多半是以電池供應其電源,故IEEE 802.15.4 技術的設計便以符合低功率、低耗電量、簡單、便宜以及長時間運作為考量。因此,IEEE 802.15.4 使用盲目型隨機後退 (blind random backoff) 競爭機制以達到省電的目的,但這項機制卻無法避免隱藏節點 (hidden node) 問題。在先前的研究中發現,在一個節點隨機分佈的網路裡,節點間發生隱藏節點問題的機率高達到41%,當環境中伴隨著隱藏節點碰撞鏈(hidden node collision chain),不僅會對網路造成吞吐量下降、延遲傳送的情況、重複傳送資料外,亦會造成大量的能量耗損,因而降低網路的使用壽命。 由於以往避免隱藏節點的方式,如RTS/CTS (request to send/clear to send) 機制並不適用於IEEE 802.15.4 標準;為了不增加網路額外的負擔,本論文提出以分群策略為基礎的節點加入與群組機制來解決在IEEE 802.15.4 標準上的隱藏節點問題;有鑑於處理隱藏節點碰撞問題,事前預防勝過事後補救,故在節點一開始加入時便啟動執行本機制,直接避免隱藏節點碰撞問題影響網路效能。此機制將網路的成員分成若干群,每個群組內的節點互相不為隱藏節點,此外並依照群組內的節點個數以及群組內節點競爭程度將時間訊框分配與各群組合適的頻寬。在收集隱蔽節點關係資料方面,此論文提出了電力節省導向的方式來收集資料,並有效解決當新節點加入時,不需重新收集資料而只需對和新節點有相對關係的節點做資料更新,減少多餘訊息和電量功率消耗;並證明依照各群整體網路負載均等和先後加入的因素,在不更改已存在節點所在各群組的前提下,最多可分成九群。經由模擬的方式,將提出的方法與IEEE 802.15.4 標準以及先前的分群策略比較,模擬結果顯示本論文的方法有較佳的結果。IEEE 802.15.4 wireless personal area network (WPAN) standard is an advanced wireless communication technology, which is designed to provide short-distance communication services. Due to most of IEEE 802.15.4 nodes relying on battery to operate IEEE 802.15.4 was designed with fetures of ultra low power consumption, low computation power and low hardware cost. To save power resource, IEEE 802.15.4 adopts the blind random backoff contention mechanism, which turns off the transceiver of device when a device does not have data to transmit. However, such design leads the hidden node problem to become inevitable. Previous research has shown that nodes in a random network have 41% probability to incur hidden node situation with the other nodes. Moreover, the hidden node collision chain problem may further downgrade the network throughput, increase transmission delay, retransmit data, and therefore cause more energy loss. Because the conventional two way handshaking mechanism (such as request-to-send/clear-to-send (RTS/CTS)) is not suitable for IEEE 802.15.4 network, this thesis proposes an efficient grouping strategy, which is performed during node joining, to completely avoid the hidden node problem. Members of a group are non-hidden nodes to each other. In the presupposition that the new joining node does not affect the existent groups, this thesis proves that the maximal number of groups in a network is 9. Based on the grouping result, the proposed scheme partitions the time frame into several subperiods, one for each group. The length of subframe for a group is proportional to its group size. Simulation results illustrate that the proposed scheme can not only avoid hidden node problem but also outperform the IEEE 802.15.4 standard and pervious grouping strategy schemes.
    Appears in Collections:[通訊工程研究所] 博碩士論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML651View/Open


    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  - 隱私權政策聲明