跳到主要內容

臺灣博碩士論文加值系統

(44.201.99.222) 您好!臺灣時間:2022/11/30 17:35
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:阮嘉翔
研究生(外文):Jia-Siang Ruan
論文名稱:互斥式弱連結支配集無線感測/網狀網路修剪演算法與骨幹轉換之研究
論文名稱(外文):Pruning Algorithms and Backbone Rotation for Wireless Sensor/Mesh Networks with Disjoint WCDSs
指導教授:竇奇
指導教授(外文):Chie Dou
口試委員:竇奇翁萬德陳永隆
口試委員(外文):Chie DouWan-De WengYoung-Long Chen
口試日期:2014-07-18
學位類別:碩士
校院名稱:國立雲林科技大學
系所名稱:電機工程系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2014
畢業學年度:102
語文別:中文
論文頁數:49
中文關鍵詞:無線感測/網狀網路支配集弱連結支配集互斥式虛擬骨幹修剪剩餘能量通知WCDS廣播能量感知
外文關鍵詞:Wireless Sensor/Mesh NetworksConnected Dominating SetCluster HeadWeakly Connected Dominating SetDisjointVirtual BackbonePruningTDMAResidual Energy Notification TDMAWCDS Broadcasting TDMAPower-Aware DS Formation Algorithm
相關次數:
  • 被引用被引用:0
  • 點閱點閱:128
  • 評分評分:
  • 下載下載:1
  • 收藏至我的研究室書目清單書目收藏:0
無線感測/網狀網路(Wireless Sensor/Mesh Network,WSN/WMN)具有可靠性高、成本低、擴展性強以及通道使用率高等特點,使得該網路技術越來越受到國內外學者重視,隨著目前高性能微型設備設計技術及無線移動通訊技術的飛躍發展,已經能夠實現在任何時間、任何地點都可以提供使用者所需資訊及服務的無所不在。本論文一開始簡單的介紹互斥式(Disjoint) 弱連結支配集(WCDS)和修剪(Pruning)的觀念,然後使用Two-Hop演算法在網路節點中找出多組的連結支配集,使得網路在運作時,能有不同的虛擬骨幹(Virtual Backbone)可作替換。論文最後提出了能量感知骨幹交替(Power-Aware Backbone Rotation),利用兩種TDMA協定來進行同步,第一種為剩餘能量通知(Residual Energy Notification TDMA),讓各節點之鄰近節點剩餘能量的資訊收集,第二種為WCDS廣播(WCDS Broadcasting TDMA),利用此協定來達成節點間DS轉換的同步,最後用能量感知演算法(Power-Aware DS Algorithem)來找出第二組支配集,以延長無線感測網路/無線網狀網路的生命週期。
Wireless Sensor/Mesh Networks (WSN/WMN) with high reliability, low cost, high scalibility, and channel usage, so that scholars put more and more attention on net technology with increasing advancement of high performance miniature device design and wireless mobile communication technology, providing user information in anytime anywhere is available. In this paper, at first, we breifly introduce Disjoint Weakley Connected Dominating Set(WCDS) and Pruning concept. Also we remove the unsuitable Cluster Head(CH) nodes, then use Two-Hop algorithems to find out sets of Connected Dominating Set (CDS) in network nodes, so that the operation of network can have different Virtual Backbone(VB) be used in replacement. However, we propose the Power-Aware Backbone Rotation, using two TDMA protocol to synchronize. The first protocol is the Residual Energy Notification TDMA, so that each node of the neighboring node residual energy information collection. The second protocol is WCDS Broadcasting TDMA, using this protocol to achieve synchronization between nodes DS conversion. Finally, we use Power-Aware DS Formation Algorithm to find out the second set of CDS, in order to extend the lifetime of WSN/WMN.
中 文 摘 要 i
ABSTRACT ii
目錄 iii
表目錄 v
圖目錄 vi
第1章 緒論 1
1.1 前言 1
1.2 研究動機與目的 1
1.3 各章提要 2
第2章 無線感測網路相關介紹 3
2.1 無線感測網路及ZigBee介紹 3
2.2 無線感測網路的特點 3
2.3 無線感測網路的節點和架構 4
2.4 IEEE 802.15.4 的標準及規格介紹 5
2.4.1 網路拓撲結構 6
2.4.2 實體層 6
2.4.3 MAC層 7
2.4.4 網路層 8
2.4.5 資料傳輸模式 8
第3章 CDS/WCDS介紹 9
3.1 CDS/WCDS介紹 9
3.2 CDS/WCDS演算法 11
3.2.1 簡單的WCDS演算法 11
第4章 Pruning Algorithm’s with Disjoint WCDS 13
4.1 Maximum Independent Set 13
4.2 Domatic Number 14
4.2.1 Domatic Number上限值 14
4.3 模擬參數設定 15
4.4 Disjoint Two-Hop演算法 16
4.5 Pruning演算法 21
4.5.1 Pruning Rule_1演算法 22
4.5.2 Pruning Rule_2演算法 23
4.5.3 Wu and Li Pruning Rule_1演算法[13] 24
4.6 模擬結果 29
第5章 Power-Aware Backbone Rotation 33
5.1 能量下降的方法 33
5.1.1 權重定義 34
5.1.2 能量下降的方法 34
5.2 Residual Energy Notification TDMA Protocol 35
5.3 WCDS Broadcasting TDMA Protocol 38
5.4 Power-Aware骨幹交替機制 41
5.5 Power-Aware Dominating Set Formation Algorithm’s 42
5.5.1 Power-Aware Dominating Set Algorithm_1(PADS Algorithm_1) 42
5.5.2 Power-Aware Dominating Set Algorithm_ 2(PADS Algorithm_2) 43
5.6 模擬結果 43
第6章 結論與未來展望 47
參考文獻 48

[1]Y. P. Chen and A. L. Liestman, “Approximating Minimum Size Weakly Connected Dominating Sets for Clustering Mobile Ad Hoc Networks,” Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing (), New York, USA:ACM, 2002, pp. 165-172.
[2]B. Han and W. Jia, “Clustering Wireless Ad Hoc Networks with Weakly Connected Dominating Set,” Journal of Parallel and Distributed Computing, 67 (2007) 727 – 737.
[3]D. Kim, Y. Wu, Y. Li, F. Zou and D.-Z. Du, “Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks,” IEEE Transactions on Vol. 20, No. 2, Feb. 2009, pp.147-157.
[4]R. Misra and C. Mandal, “Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks,” IEEE Transactions on Mobile Computing, Vol. 8, No. 4, April 2009, pp. 488-499.
[5]T. Acharya, S. Chattopadhyay and R. Roy, “Multiple Disjoint Power Aware Minimum Connected Dominating Sets for Efficient Routing in Wireless Ad Hoc Network,” Proceedings International Conference on March 2007, pp.336-340.
[6]F. Dai and J, Wu, “An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks,” IEEE Transactions on Vol. 15, Issue 10, Oct. 2004, pp. 908-920.
[7]J. Wu, F. Dai and S. Yang, “Iterative Local Solutions for Connected Dominating Sets in Ad Hoc Wireless Networks,” IEEE Transactions on Computers, Vol. 57, No. 5, May 2008, pp. 702-715.
[8]S. Zhang, J. Fan, J. Jia and J. Wang, “An Efficient Clustering Algorithm in Wireless Sensor Networks Using Cooperative Communication,” International Journal of Distributed Sensor Network, Vol. 2012, pp. 1-11.
[9]F. Wang, M. T. Thai and D. Z. Du, “On the Construction of 2-Connected Virtual Backbone in Wireless Networks,” IEEE Transactions on Wireless Communications, Vol. 8, No. 3, March 2009, pp. 1230-1237.
[10]L. Ding, W. Wu, J. Wilson, H. Du, W. Lee and D. Z. Du, “Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks,” IEEE Transactions on Vol. 22, No. 10, Oct. 2011, pp. 1601-1609.
[11]N. Chakchouk, B. Hamdaoui and M. Frikha, “WCDS-Induced Routing for Data-Aggregation in Wireless Sensor Networks,” Proceedings of the First International Conference on Nov. 2009, pp.1-6.
[12]Domatic Number – From WikipediaF.
[13]F. Dai and J. Wu, “An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Network,” IEEE Transactions on Parallel and Distributed Systems, Vol. 15, No. 10, October 2004.
[14]曾煜棋,,潘孟鉉,林致宇,“無線區域網路及個人網路-隨意及感測網路之技術與應用”,,2006,加樺國際有限公司。
[15]Stefano Basagni, “Distributed Clustering for Ad Hoc Networks”, Proceedings of the 1999 International Symposium on Parallel Architectures Algorithms, and Networks (ISPAN 99); 1999. pp. 3-4.
[16]C. Dou and Y.H. Chang and J.S. Ruan, “On the Performance of Weakly Connected Dominating Set and Loosely-Coupled Dominating Set for Wireless Sensor/Mesh Networks”, ICETI, 2014.
[17]C.R. Lin, M. Gerla, “Adaptive Clustering for Mobile Wireless Networks,” IEEE Journal of Selected Areas in Communications, vol. 15, no. 7, pp. 1265-1275, 1997.
[18]S. Basagni, A. Carosi, C. Petrioli, “Sensor-DMAC: Dynamic Topology Control for Wireless Sensor Networks,” in Proc. of IEEE Vehicular Technology Conference 2004-Fall (VTC 2004), vol. 4, pp. 2930-2935, 2004.
[19]竇奇、張少齊、蕭詠翰,2012,無線網狀網路TDMA時槽分配演算法之效能研究,2012年全國電信研討會,彰師大,台灣,11月16-17日。(Oral)
[20]Amiya Nayak and Ivan Stojmenovic, “Wireless Sensor and Actuator Networks,” A John Wiley & Sons, Inc., Publication.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊