系統識別號 | U0002-2708201920161900 |
---|---|
DOI | 10.6846/TKU.2019.00933 |
論文名稱(中文) | 在無線感測網路中具電量及延遲感知之資料收集排程技術 |
論文名稱(英文) | Joint Energy and Delay Aware Data Collection Scheduling for Wireless Sensor Networks |
第三語言論文名稱 | |
校院名稱 | 淡江大學 |
系所名稱(中文) | 資訊工程學系碩士班 |
系所名稱(英文) | Department of Computer Science and Information Engineering |
外國學位學校名稱 | |
外國學位學院名稱 | |
外國學位研究所名稱 | |
學年度 | 107 |
學期 | 2 |
出版年 | 108 |
研究生(中文) | 邱思妤 |
研究生(英文) | Sih-Yu Ciou |
學號 | 607410015 |
學位類別 | 碩士 |
語言別 | 繁體中文 |
第二語言別 | |
口試日期 | 2019-06-14 |
論文頁數 | 39頁 |
口試委員 |
指導教授
-
張志勇(cychang@mail.tku.edu.tw)
共同指導教授 - 郭經華(chkuo@mail.tku.edu.tw) 委員 - 張志勇 委員 - 陳裕賢 委員 - 陳宗禧 |
關鍵字(中) |
電量平衡 無線感測網路 路徑排程規劃 |
關鍵字(英) |
Battery balance wireless sensing network path scheduling |
第三語言關鍵字 | |
學科別分類 | |
中文摘要 |
無線感測網路(Wireless Sensor Networks, WSNs)的應用廣泛,如軍事應用、家庭自動化、遠距健康照護、工業控制、商業應用、及環境監控等。大多數的感測器由電池供電,且更換電池不易,致使感測器電量一旦耗盡,則視同死亡,而整個網路的覆蓋範圍就會變小,死亡節點也無法協助傳輸資料。因此,如何延續無線感測器網路的生命期,一直是學者們所共同努力的目標。 本研究主要目標是延長無線感測網路的生命期,並使得每個回合傳輸資料的排程能最快傳完,以便休眠及省電,我們所提出的EDADC演算法主要包含資料分配階段與傳輸排程階段。在資料分配階段中, EDADC算法透過各感測器的電量比例來分配其可接收的資料量,以便達到電量平衡的目的;在傳輸排程階段中,開發傳輸的最大平行度並避免封包衝撞,使感測器能盡早休眠,達到省電目標。 實驗顯示,利用父節點的電量比例進行資料分配,能有效的解決電量分配不均所導致感測器過早死亡的問題,另外,本論文EDADC演算法與ISBCAS、FAST和NBSA演算法比較時,EDADC演算法能有效降低傳輸資料時產生的碰撞次數,進而減少傳輸資料的時間。 |
英文摘要 |
Wireless Sensor Networks (WSNs) are used in a wide range of applications such as military applications, home automation, remote health care, industrial control, commercial applications, and environmental monitoring. Most sensors are battery powered and it is not easy to replace the battery. As soon as the sensor is exhausted, it will be considered dead, and the coverage of the entire network will become smaller, and the death node will not be able to assist in the transmission of data. Therefore, how to extend the life of the wireless sensor network has always been the goal of scholars. The main goal of this study is to extend the lifetime of the wireless sensing network, and to make the scheduling of each round of transmission data the fastest, so as to sleep and save power. Our proposed EDADC algorithm mainly includes the data distribution phase and Transmission scheduling phase. In the data distribution phase, the EDADC algorithm distributes the amount of data it can receive through the ratio of the power of each sensor in order to achieve the purpose of balancing the power; during the transmission scheduling phase, the maximum parallelism of the transmission is developed and packet collision is avoided. Enable the sensor to sleep as soon as possible to achieve power saving goals. Experiments show that the data distribution of the parent node's power ratio can effectively solve the problem of premature sensor death caused by uneven power distribution. In addition, when the paper's EDADC algorithm is compared with the ISBCAS, FAST and NBSA algorithms, The EDADC algorithm can effectively reduce the number of collisions generated when transmitting data, thereby reducing the time required to transmit data. |
第三語言摘要 | |
論文目次 |
目錄 目錄 V 圖目錄 VI 表目錄 VII 第一章、簡介 1 第二章、相關研究 3 A.電量平衡 3 B.傳輸排程(減少碰撞) 4 第三章、網路環境與問題描述 7 A.網路環境 7 B.問題描述 8 C.假設與限制 9 第四章、具電量及延遲感知之資料收集排程技術(EDADC演算法) 13 A.本論文使用的策略 13 B.演算法 15 第五章、模擬實驗 21 A.電量與資料比例分配的比較 21 B. 碰撞圖權重比例分配的比較 22 C. EDADC與ISBCAS、FAST和NBSA演算法進行所需時槽的比較(不同Α值) 23 第六章、結論 25 參考文獻 26 附錄-英文論文 28 圖目錄 圖 1:無線感測網路環境 8 圖 2:感測網路圖(G) 18 圖 3:碰撞圖(Gcollision) 18 圖 4:在不同數量的感測器下,經過幾個時槽後將有感測器死亡 22 圖 5:在封包不同的傳輸資料量下,傳送資料所需花費的時槽,其中(a)為x=0.3,y=0.2,z=0.1,(b)為x=0.4,y=0.3,z=0.2,(c)為x=0.3,y=0.4,z=0.2,(d)為x=0.3,y=0.2,z=0.4 23 圖 6:ISBCAS、FAST、NBSA及EDADC在不同感測器數量下,傳送資料所需花費的時槽,其中(a)中α=1,(b)中α=5,(c)中α=∞ 24 表目錄 表 1:比較表 5 表 2:符號總表 8 表 3:資料分配階段演算法 16 表 4:傳輸排程演算法 20 |
參考文獻 |
[1] P. Andreou, A. Pamboris, D. Zeinalipour-Yazti, P. K. Chrysanthis and G. Samaras, "ETC: Energy-Driven Tree Construction in Wireless Sensor Networks," 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware, Taipei, 2009, pp. 513-518. [2] Y. Lin and Q. Wu, "Energy-Conserving Dynamic Routing in Multi-sink Heterogeneous Sensor Networks," 2010 International Conference on Communications and Mobile Computing, Shenzhen, 2010, pp. 269-273. [3] W. Alsalih, H. S. Hassanein and S. Akl, "Routing to a Mobile Data Collector on a Predefined Trajectory," 2009 IEEE International Conference on Communications, Dresden, 2009, pp. 1-5. [4] H. Yang, F. Ye and B. Sikdar, "A dynamic query-tree energy balancing protocol for sensor networks," 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733), Atlanta, GA, USA, 2004, pp. 1715-1720 Vol.3. [5] S. Lindsey and C. S. Raghavendra, "PEGASIS: Power-efficient gathering in sensor information systems," Proceedings, IEEE Aerospace Conference, Big Sky, MT, USA, 2002, pp. 3-3. [6] S. Jung, Y. Han and T. Chung, "The Concentric Clustering Scheme for Efficient Energy Consumption in the PEGASIS," The 9th International Conference on Advanced Communication Technology, Okamoto, Kobe, 2007, pp. 260-265. [7] W. Zhao and X. Tang, "Scheduling data collection with dynamic traffic patterns in wireless sensor networks," 2011 Proceedings IEEE INFOCOM, Shanghai, 2011, pp. 286-290. [8] S. C. Ergen, P. Varaiya, "TDMA scheduling algorithms for wireless sensor networks", Wireless Netw., vol. 16, no. 4, pp. 985-997, May 2010. [9] H. Yousefi, M. Malekimajd, M. Ashouri, A. Movaghar, "Fast aggregation scheduling in wireless sensor networks", IEEE Trans. Wireless Commun., vol. 14, no. 6, pp. 3402-3414, Jun. 2015. [10] N. Nguyen, B. Liu, V. Pham and T. Liou, "An Efficient Minimum-Latency Collision-Free Scheduling Algorithm for Data Aggregation in Wireless Sensor Networks," in IEEE Systems Journal, vol. 12, no. 3, pp. 2214-2225, Sept. 2018. [11] J. Sheu, W. Hu and J. Lin, "Distributed Localization Scheme for Mobile Sensor Networks," in IEEE Transactions on Mobile Computing, vol. 9, no. 4, pp. 516-526, April 2010. |
論文全文使用權限 |
如有問題,歡迎洽詢!
圖書館數位資訊組 (02)2621-5656 轉 2487 或 來信