Responsive image
博碩士論文 etd-0816111-152900 詳細資訊
Title page for etd-0816111-152900
論文名稱
Title
在叢集式無線感測網路中具有電力平衡的管線傳輸機制
Pipelined Forwarding with Energy Balance in Cluster-based Wireless Sensor Networks
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
83
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2011-08-09
繳交日期
Date of Submission
2011-08-16
關鍵字
Keywords
無線感測網路、叢集式、移動式蒐集、電力平衡、管線傳輸
Pipelined forwarding, WSN, Energy balance, Mobile sink, Cluster-based
統計
Statistics
本論文已被瀏覽 5825 次,被下載 2104
The thesis/dissertation has been browsed 5825 times, has been downloaded 2104 times.
中文摘要
無線感測網路(Wireless Sensor Network,WSN)是由許多無線感測器(sensor)組成,感測器蒐集完資料後會透過無線網路將資料傳輸至蒐集點,由於在無線感測網路中,因為需要多重節點路由(Multi-hop Routing)所以會增加封包延遲時間,而且越靠近蒐集點的感測器也會因為幫忙轉傳其他感測器的資料而消耗大量的電力。為了解決此問題,本論文提出了管線傳輸(pipeline forwarding)的叢集式網路機制,將整體無線感測網路區分成數個叢集,藉此縮短將資料傳輸至蒐集點的時間,而每個叢集中的感測器使用pipeline方式傳輸資料,可達到在最短時間內將資料傳輸至蒐集點,由於蒐集點個數增加,需要由mobile sink蒐集資料。此外為了解決越靠近蒐集點的感測器因為幫忙轉傳資料會消耗大量電力,本論文提出定期的路徑交換機制,讓每個感測器可藉由改變資料傳輸的方向以避免持續消耗大量的電力而導致資料傳輸的中斷。

我們推導數學公式以分析驗證所提出的機制,在分析中證明了我們所提出的管線傳輸叢集式網路確實可以藉由縮短感測器與蒐集點的距離降低封包延遲,並藉由增加pipeline的長度以及mobile sink的數量可以增加整體網路的throughput,在分析每單位電力所產生的throughput中,我們發現所提出的pipeline機制比起傳統的非pipeline機制可以更有效的使用電力以達到最大的throughput。
Abstract
Wireless Sensor Network (WSN) is composed of sink and sensors. Sensors transmit data to sink through wireless network after collecting data. Because multi-hop routing and forwarding may be required on WSN, sensors closer to sink will consume more energy than other nodes due to hop-by-hop forwarding. In this Thesis, we propose pipelined forwarding for cluster-based WSN to solve these problems. First, we divide a WSN into several clusters such that the distance between sensors and sink is reduced and packet transmission delay can be decreased. However, since reducing the distance can increase the number of clusters significantly, multiple mobile sinks are embedded in the system to increase overall throughput. Second, we change the direction of pipelined forwarding to avoid from running out of energy of some sensors.

We derive mathematical equations to analyze and validate the proposed scheme. From the analytical results, we prove that the proposed scheme can decrease packet transmission delay. The results also show that system throughput can be improved by increasing the length of pipeline and the number of mobile sinks. Finally, we demonstrate that the proposed scheme can increase energy throughput more efficiently than conventional non-pipelined forwarding scheme.
目次 Table of Contents
第一章 導論 1
1.1 研究動機 1
1.2 研究方法 1
1.3章節介紹 3
第二章 無線感測網路 4
2.1 基本架構 4
2.1.1 硬體裝置及通訊協定 5
2.2各種資料蒐集方式 7
2.2.1 Hop-by-Hop的資料蒐集 7
2.2.2 隨機路徑式(Random Waypoint) 8
2.2.3固定軌跡式(Predefined Path) 8
2.3 相關研究 11
2.3.1 固定式蒐集點 12
2.3.2 移動式蒐集點 13
2.4 本論文所提機制 14
第三章 無線感測網路的資料蒐集與傳輸 16
3.1 叢集式無線感測網路 16
3.2 固定式資料蒐集及路徑選擇 17
3.2.1 FDCR中的叢集式網路 18
3.2.2 主線及資料傳輸 20
3.3 移動式資料蒐集及路徑選擇 22
3.3.1 MDCR中的叢集式網路 23
3.3.2 移動式Sink路徑選擇 24
3.4 FDCR/MDCR的Pipeline傳輸 27
3.4.1 Cluster head的三維定義 27
3.4.2 Pipeline傳輸 28
3.4.3 Pipeline路徑交換 30
第四章 數學分析與結果 32
4.1 資料蒐集 32
4.2 數學公式推導 33
4.2.1 固定式蒐集的效能分析 35
4.2.2 移動式蒐集的效能分析 42
4.2.3 電力消耗的分析 45
4.3 分析與討論 51
4.3.1 單一蒐集點 51
4.3.2 多個蒐集點 55
4.3.3 電力消耗 58
4.3.4 不完整Cluster的百分比 61
第五章 結論與未來工作 63
5.1 結論 63
5.2未來工作 64
參考文獻(References) 66
索引(Index) 69
參考文獻 References
[1] I. F. Akyildiz, Su Weilian, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks﹐” IEEE Communications Magazine, Vol. 40, Issue 8, Page(s): 102-114, Aug. 2002.
[2] Jamal N. Al-Karaki and Ahmed E. Kamal, “Routing Techniques in Wireless Sensor Networks : A Survey﹐” IEEE Wireless Communications, Vol. 11, Issue 6, Page(s): 6-28, Dec. 2004.
[3] IEEE Std 802.15.4, 2003.
[4] Liqi Shi and A. O. Fapojuwo, “TDMA Scheduling with Optimized Energy Efficiency and Minimum Delay in Clustered Wireless Sensor Networks﹐” IEEE Transactions on Mobile Computing, Vol. 9, Issue 7, Page(s): 927-940, July 2010.
[5] Z. M. Wang, S. Basagni , E. Melachrinoudis , and C. Petrioli , “Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime﹐”2005 IEEE 38th International Conference on System Sciences, Page(s): 287-195, Jan. 3- 6, 2005.
[6] W. Liang, J. Luo, and X. Xu, “Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks﹐”IEEE Global Telecommunications Conference, Page(s): 1-6, Dec. 6- 10, 2010.
[7] A. Jinthana , W. Pattana , S. Wong, and Chanboon , “A Comparative Study of Random Waypoint and Gauss-Markov Mobility Models in the Performance Evaluation of MANET﹐” International Symposium on Communications and Information Technologies, Page(s): 894- 899, Sept. 20-Oct. 18, 2006.
[8] G. Breinholt and C. Schierz, “Algorithm 781: Generating Hilbert Space-Filling Curve by Recursion﹐” ACM Transactions on Mathematical Software, Vol. 24, Issue 2, Page(s): 184-189, June 1998.
[9] M. F. Mokbel, W. G. Aref, and I. Kamel, “Analysis of Multi-Dimensional Space-Filling Curves﹐”Journal of Geoinformatica, Vol. 7, Issue 13, Page(s): 179-209, Sep. 2003.



[10] Hans Sagan, “Space-Filling Curves﹐” Springer-Verlag, New York, 1994.
[11] P. Z. Lee, C. W. Huang, and T. Y. Shih, “Space-Filling Curves Algorithm on Cantor﹐”Journal of TAIWAN Geographic Information Science, Vol. 4, Page(s): 13-26, Apr. 2006.
[12] T. Y. Shih and H. Y. Ho, “A Note on the Space Filling Curves﹐”Journal of Cadastral Survey, Vol. 24, Page(s): 46-59, Sep. 2005.
[13] Y. H. Wang, K. F. Huang, C. C. Lin, and C. W. Hung, “The Optimal Sleep Control for Wireless Sensor Networks﹐”IEEE Pervasive Computing Joint Conference, Vol. 10, Page(s): 96-102, Dec 3-5, 2009.
[14] Shuguang Xiong , Jianzhong Li , and Lei Yu , “Maximize the Lifetime of a Data-gathering Wireless Sensor Network﹐” IEEE Communications Society Conference on Mesh and Ad Hoc Communications and Networks, Page(s): 1-9, June 22-26, 2009.
[15] Jinsuk Baek , Sun Kyong An , and P. Fisher, “Dynamic Cluster Header Selection and Conditional Re-clustering for Wireless Sensor Network﹐” IEEE Transactions on Consumer Electronics, Vol. 56, Issue 4, Page(s): 2249-2256, Nov. 2010.
[16] M. Youssef, A. Youssef, and M. Younis, “Overlapping Multihop Clustering for Wireless Sensor Networks﹐” IEEE Transactions on Parallel and Distributed Systems, Vol. 20, Issue 12, Page(s): 1844-1856, Dec. 2009.
[17] M. Elhawary and Z. J. Haas , “Energy-Efficient Protocol for Cooperative Networks﹐” IEEE Transactions on Networking, Vol. 19, Issue 2, Page(s): 561-574, April 2011.
[18] J. Y. Choi , S. M. Jung , Y. J. Han , and T. M. Chung , “Advanced Concentric Clustering Routing Scheme adapted to Large-Scale Sensor Networks﹐”Second International Conference on Sensor Technologies and Applications, Page(s): 366-371, Aug. 25-31, 2008.
[19] N. Gautam , W. I. Lee , and J. Y. Pyun , “Track-Sector Clustering for Energy Efficient Routing in Wireless Sensor Networks﹐” 2009 IEEE 9th International Conference on Computer and Information Technology, Vol. 2, Page(s): 116-121, Oct. 11-14, 2009.
[20] Hyunjun Lee and K. O. Lee , “An Energy Efficient Routing Protocol using Transmission Range and Direction for Sensor Networks﹐” 2009 IEEE 5th International Conference on Wireless Communication and Sensor Networks , Page(s): 1-5, Dec. 15-19, 2009.
[21] L. Y. Li , X. L. Jiang , Shenghai Zhong , and Lei Hu , “Energy Balancing Clustering Algorithm for Wireless Sensor Network﹐” International Conference on Networks Security Wireless Communications and Trusted Computing, Vol. 1, Page(s): 61-64, April 25-26, 2009.
[22] S. Jabbar , A. E. Butt , N. Sahar , and A. A. Minhas , “Threshold Based Load Balancing Protocol for Energy Efficient Routing in WSN﹐”2011 IEEE 13th International Conference on Advanced Communication Technology, Page(s): 196- 201, Feb. 13-16, 2011.
[23] Zhang Cui , Su Yangming , and Liu Yi , “Dynamic Clustering Algorithm with Balanced Load in Wireless Sensor Networks﹐”2009 IEEE 2nd International Conference on Computer Science and Information Technology , Page(s): 177-181, Aug. 8-11, 2009.
[24] Shuai Gao , Hongke Zhang , and S. Das , “Efficient Data Collection in Wireless Sensor Networks with Path-Constrained Mobile Sinks﹐”IEEE International Symposium on World of Wireless, Mobile and Multimedia Networks and Workshops, Page(s): 1-9, June 15-19, 2009.
[25] J. W. Kim , J. S. In , K. Hur, J. W. Kim, and D. S. Eom , “An Intelligent Agent-based Routing Structure for Mobile Sinks in WSNs﹐” IEEE Transactions on Consumer Electronics, Vol. 56, Issue 4, Page(s): 2310-2316, Nov. 2010.
[26] Y. Wu, L. Zhang, Y. Wu, and Z. Niu , “Motion-Indicated Interest Dissemination with Directional Antennas for Wireless Sensor Networks With Mobile Sinks﹐” IEEE Transactions on Vehicular Technology, Vol. 58, Issue 2, Page(s): 977-989, Feb. 2009.
[27] B. Nazir and H. Hasbullah, “Mobile Sink based Routing Protocol (MSRP) for Prolonging Network Lifetime in Clustered Wireless Sensor Network﹐”International Conference on Computer Applications and Industrial Electronics, Page(s): 624-629, Dec. 5-8, 2011.
[28] L. B. Saad and B. Tourancheau , “Multiple Mobile Sinks Positioning in Wireless Sensor Networks for Buildings﹐”International Conference on Sensor Technologies and Application , Page(s): 264-270, June 18-23, 2009.
[29] H. K. D. Sarma, A. Kar, and R. Mall, “Energy Efficient Routing Protocol for Wireless Sensor Networks with Node and Sink Mobility﹐”IEEE Sensors Applications Symposium, Page(s): 239-243, Feb. 22-24, 2011.
[30] Y. H. Wang, C. H. Kuo, and H. M. Huang, “Mobile Sink Routing Protocol with Row-prime Order Clustering in Wireless Sensor Networks﹐”International Conference on Theory and Application of Information Technology, Page(s): 1-9, May 2008.
[31] M. J. Handy, M. Haase, and D. Timmermann, “Low Energy Adaptive Clustering Hierarchy with Deterministic Cluster-Head Selection﹐” International Workshop on Mobile and Wireless Communications Network, Page(s): 368-372, Dec. 2002.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內校外完全公開 unrestricted
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code