Date collection in low duty-cycled wireless sensor networks

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 學位論文 > Item 987654321/94412

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/94412

Title:	Date collection in low duty-cycled wireless sensor networks
Other Titles:	適用於低功耗無線感測網路之資料收集協定
Authors:	劉炳麟;Liu, Ping-Lin
Contributors:	淡江大學資訊工程學系資訊網路與通訊碩士班潘孟鉉;Pan, Meng-Shiuan
Keywords:	資料收集;圖論;排程;建樹演算法;無線感測網路;Convergecast;Graph Theory;scheduling;tree construction;Wireless sensor network
Date:	2013
Issue Date:	2014-01-23 14:36:25 (UTC+8)
Abstract:	先前許多於無線感測網路(WSNs)的研究，提出使用睡醒機制來支援低耗能的運作，時間被分隔為許多的時間槽，而時間槽的分配可分為link-based和receiver-based。本篇研究主要採用receiver-based的分配方法，在網路中各節點已樹狀結構連結，並各自分配到所屬的時間槽，每個周期於自己和父節點的時間槽醒來進行資料收集與資料回報，其餘時間進入省電模式。本篇提出集中式與分散式的時槽分配演算法來達到低延遲匯集資料傳輸，我們發現可藉由更換樹狀結構中節點的連線來進一步降低延遲，具體說明，通過設計我們允許節點可以更換鄰居節點的父節點，以便使用更佳的時間槽來達到降低延遲的目的，模擬與實作結果顯示我們的設計可以有效率的降低延遲。然而這些過去的研究只針對常規模式下的資料收集，我們則進一步考慮事件發生時資料回報的場景，網路中可能會隨機有緊急突發事件的數據報告持續一段時間。我們分配給每個路由器一個常規模式下的時間槽和多個事件模式下的時間槽。我們提出建樹的演算法來支援事件模式下時間槽的分配。模擬的結果顯示我們的設計的確可以同時支援常規模式和事件模式下的資料回報。 Many previous studies propose to use wake-up scheduling to support energy efficient operations in wireless sensor networks (WSNs). In those studies, time is divided into slots, and the proposed wake-up scheduling (or say slot assignment) algorithms can be categorized into link-based and receiver-based. In this thesis, we focus on the scenario that nodes are scheduled in the receiver-based fashion. In the network, nodes are connected by a tree structure, and each node is assigned to a slot. A node wakes up at its slot and its parent’s slot to collect data from its children and to report data to its parent, respectively. Then, it can go to sleep to save energy. This thesis proposed a centralized and a distributed slot assignment schemes to support low latency convergecast. We observe that when assigning slots, the latency can be further reduced by reconnecting some tree links. More specifically, by the designed rules, a node is allowed to locally modify some of its neighbors’ parents. Then, the node can be assigned to a better slot, and will have the benefit of reducing its report latencies. Simulation and implementation results show that using the proposed schemes, convergecast latencies can be effectively reduced. However, these pervious works schedule network nodes with regular patterns to support regular data reporting. In this work, we further consider the event data reporting scenario, where the network may randomly have urgent events. Each network node is assigned to a regular mode slot and several event mode slots. We design tree formation algorithms to facilitate assigning event mode slots. Simulation results show that our designs can indeed support both regular and event data reporting.
Appears in Collections:	[資訊工程學系暨研究所] 學位論文

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	234	View/Open

Loading...