在無線感測路中,靠近資料蒐集點的節點需要替其他節點轉傳大量的感測資料,也因此會迅速的耗盡電量。 這個現象會對資料蒐集點產生導致租約違反的結果,也稱為能量洞問題。 在洞產生的時候,遠離資料匯集點會留有充足的電量來維持網路運作,但卻缺乏存活的轉傳節點來協助轉傳到資料匯集點。 這個問題在引述[6][7][8][9][10]的文章裡也相當的重視和研究。 然而他們的研究不是有額外的cost就是在現實情境上有實現的困難。 在我們這篇研究裡,我們會提出利用資料匯集和動態調整節點的睡覺時間的機制來減輕這個問題並延長網路的存活時間。 方法的核心精神是盡可能的延長節點的睡覺時間來減少天線的開機負荷,並且匯集更多的封包,同時保證不超過延遲上限。 我們提出集中式和分散式的兩種方法來實作動態排程。最後的模擬結果會來驗證我們所提出方法的效益。 結果證明了我們的方法可以提昇網路存活時間大約百分之二十五並且平衡所有節點的耗電情形。
In Wireless Sensor Networks (WSNs), nodes close to a sink need to relay a large amount of sensing data for other nodes and thus exhaust energy rapidly. This phenomenon leads to a result of rent breaches to the sink, which is called an energy hole problem. At the moment the hole appears, nodes far from the sink may still have sufficient energy without alive relays to forward data to sink. This problem have been extensively noticed and studied in literatures, such as [6][7][8][9][10]. However, these studies either have extra cost or infeasibility in realistic environment. In this paper, we propose to utilize the concept of data aggregation to dynamically adjust nodes’ sleeping schedules to ease the problem and prolong the network lifetime. The idea is to extend the sleeping interval of nodes as possible to reduce the startup overhead of radio and aggregate more packet and meanwhile guarantee the required delay bound. We propose two algorithms, centralized and distributed, to implement dynamic scheduling. Simulations are constructed to verify the efficiency of the proposed approaches. The results show that our approaches can prolong the network lifetime about 25% and balance energy consumption of all sensor nodes.