English  |  正體中文  |  简体中文  |  Items with full text/Total items : 21921/27947 (78%)
Visitors : 4237828      Online Users : 359
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: http://140.128.103.80:8080/handle/310901/10841


    Title: 在固定封包速率下並基於頻寬分配之事件觸發式無線感測器網路多路徑壅塞控制
    Other Titles: A Rate-allocation Based Multi-path Congestion Control Scheme for Event-Driven Wireless Sensor Networks on Constant Event Packet Rates
    Authors: 邱炫又
    Chiou, Shiuan-You
    Contributors: 呂芳懌
    Leu, Fang-Yie
    東海大學資訊工程學系
    Keywords: 速率控制;無線感測器網路;公平傳輸;多路徑壅塞控制;事件觸發;頻寬調整
    Rate control;Wireless sensor networks;Transmission fairness;Multi-path congestion control;Event-driven systems;Bandwidth adjustment
    Date: 2011
    Issue Date: 2011-10-12T06:42:07Z (UTC)
    Abstract: 在本論文中,我們提出一在事件觸發式無線感測器網路(Wireless Sensor Network, WSN)下,基於速率分配及使用高可用性封包傳遞路徑之多路徑壅塞控制方式(multi-path congestion control approach)。本方式包含兩部分,第一部分為建立一以基地台(sink)為根節點,連接WSN中各感測器之生成樹,並以其為初始路由路徑。第二部分為藉由使用多路徑及速率分配,來建立一公平之封包傳遞環境。一般來說,新事件的發生會增加網路中的流量,將會使新建立的路由路徑上之節點產生雍塞,尤其是在基地台附近之節點,因而破壞原先流量之平衡並導致封包之丟棄。事實上,若干事件之訊息無法即時地傳遞到sink,可能會造成決策者因資訊不足而做出錯誤的決策。而在事件結束時,因停止傳送封包,亦將破壞路由上之中間節點的流量平衡。因此,我們動態地調整頻寬以維持各流量間之公平性和善加利用現有資源。實驗結果顯示本方法可有效的改善無線感測器網路的吞吐量、封包延遲及封包遺失率。
    In this paper, we proposed a rate-allocation based multi-path congestion control approach, called multi-path-congestion control method (MUCON for short), which enforcing high path availability of packet delivery for event-driven Wireless Sensor Networks (WSNs) consists of two parts. The first is constructing a spanning tree to connect all sensor nodes of a WSN to the sink for initial routing. The second is establishing a fair packet forwarding environment by employing multi-path and rate control to deliver packets through routing paths with a balanced manner. Generally, the occurrence of an event will increase net flow, which may congest the nodes on the newly established routing path if the nodes are currently shared by several routing paths, particularly for those nodes near the sink, consequently ruining originally balanced traffic on paths and forcing some event packets to be dropped. In fact, without the information conveyed on the lost packets, users may make an inaccurate decision and react improperly for events. When an event disappears, the surrounding sensor(s) stops transmitting packets. This will again destroy the fairness and unbalance net flows flowing through the co-node routing paths. Thus, to maintain the fairness and balance net flows for a WSN, a downstream node needs to dynamically adjust bandwidths for all its upstream nodes. Experimental results show that this method can effectively improve a WSN’ throughputs, shorter end-to-end delays and reduce packet loss rates.
    Appears in Collections:[資訊工程學系所] 碩士論文

    Files in This Item:

    File SizeFormat
    099THU00394007-001.pdf1704KbAdobe PDF473View/Open


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


    本網站之東海大學機構典藏數位內容,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。

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