Energy efficient joint data aggregation and link scheduling in solar sensor networks

详细信息    查看全文

• 作者：Jianhui Zhang^a ;   ; ^c ;   ; ^{jhzhang.zju@gmail.com} ; Xingfa Shen^a ; Shaojie Tang^b ; Guojun Dai^a
• 关键词：Energy harvesting ; Solar node ; CDS ; Link scheduling
• 刊名：Computer Communications
• 出版年：2011
• 出版时间：1 December 2011
• 年：2011
• 卷：34
• 期：18
• 页码：2217-2226
• 全文大小：360 K

文摘

Solar sensor nodes equipped with micro-solar subsystems provide a novel approach to harvest ambient energy, which partially alleviated the energy-limitation in traditional wireless sensor networks. However, it also poses new challenges that the amounts of energy harvested by nodes are dynamic and unbalanced among them thus network life cannot be necessarily prolonged if no well-designed energy-scheduling is adopted. Herein, we present an algorithm to construct Energy-efficient Data Aggregation Tree (EDAT) based on a Maximum-Weighted Connected Dominating Set (MaCDS). The EDAT aims to prolong network life by minimizing differences in energy consumption among sensor nodes. Here we assume that the amount of harvested energy randomly and uniformly distributes in the interval , where and are respectively the maximum and the minimum of . The total energy consumption difference of an EDAT is at most , where , and is the dominating set and n the total number of nodes. Furthermore, we designed a link-scheduling algorithm to minimize the number of time slots necessary for scheduling all links in the whole network based on EDAT. The number of time slots is bounded in the interval [4¦Ä ?1, 2l_k?²], where l_k is determined by hops , and ¦Ä and ¦¤ are respectively the minimal and maximal degree of the network. We found the most efficient work period is not determined by the node with the minimum harvested energy but by the one with the minimum , where d is the node¡¯s degree in the EDAT. We determine the necessary condition required for every node to have sufficient energy to support consecutive operation.