Energy saving and fast responding of data gathering are two crucial factors for the performance of wireless sensor networks. A dynamic tree based energy equalizing routing scheme (DTEER) was proposed to make an effo...Energy saving and fast responding of data gathering are two crucial factors for the performance of wireless sensor networks. A dynamic tree based energy equalizing routing scheme (DTEER) was proposed to make an effort to gather data along with low energy consumption and low time delay. DTEER introduces a dynamic multi-hop route selecting scheme based on weight-value and height-value to form a dynamic tree and a mechanism similar to token passing to elect the root of the tree. DTEER can simply and rapidly organize all the nodes with low overhead and is robust enough to the topology changes. When compared with power-efficient gathering in sensor information systems (PEGASIS) and the hybrid, energy- efficient, distributed clustering approach (HEED), the simulation results show that DTEER achieves its intention of consuming less energy, equalizing the energy consumption of all the nodes, alleviating the data gathering delay, as well as extending the network lifetime perfectly.展开更多
Trees are arguably one of the most important data structures widely used in information theory and computing science. Different numbers of intermediate nodes in wireless broadcast trees may exert great impacts on the ...Trees are arguably one of the most important data structures widely used in information theory and computing science. Different numbers of intermediate nodes in wireless broadcast trees may exert great impacts on the energy consumption of individual nodes, which are typically equipped with a limited power supply in a wireless sensor network; this limitation may eventually determine how long the given wireless sensor network can last. Thus, obtaining a deep understanding of the mathematical nature of wireless broadcast trees is of great importance. In this paper, we give new proof of Cayley's well-known theorem for counting labeled trees. A distinct feature of this proof is that we purely use combinatorial structures instead of constructing a bijection between two kinds of labeled trees, which is in contrast to all existing proofs. Another contribution of this work is the presentation of a new theorem on trees based on the number of intermediate nodes in the tree. To the best of our knowledge,this work is the first to present a tree enumeration theorem based on the number of intermediate nodes in the tree.展开更多
This paper investigates a new operation strategy for photovoltaic (PV) systems, which improves the overall reliability of the system as a result of the improvement in the reliability of the critical components. Firs...This paper investigates a new operation strategy for photovoltaic (PV) systems, which improves the overall reliability of the system as a result of the improvement in the reliability of the critical components. First, a mathematical model is proposed using the fault tree analysis (FTA) to estimate the reliability of the PV systems in order to find the suitable maintenance strategies. The implementations demonstrate that it is essential to employ smart maintenance plans and monitor the identified most critical components of PV systems. Then, an innovative analytical method based on the Markov process is presented to model smart operation plans in PV systems. The impact of smart operation strategy on the PV systems is then evaluated. The objective of this paper is to develop plans for improving the reliability of PV systems. A series of case studies have been conducted to demonstrate the importance of smart operation well as the applicability and method. strategies for PV systems as feasibility of the proposed展开更多
基金the National Natural Science Foundation of China(60602016);the National Basic Research Program of China(2003CB314801);the Hi-Tech Resrarch and Development Program of China(2007AA01Z428); MOE-MS Key Laboratory of Multimedia Calculation and Communication Open Foundation(05071801);HUAWEI Foundation(YJCB2006062WL,YJCB2007061WL).
文摘Energy saving and fast responding of data gathering are two crucial factors for the performance of wireless sensor networks. A dynamic tree based energy equalizing routing scheme (DTEER) was proposed to make an effort to gather data along with low energy consumption and low time delay. DTEER introduces a dynamic multi-hop route selecting scheme based on weight-value and height-value to form a dynamic tree and a mechanism similar to token passing to elect the root of the tree. DTEER can simply and rapidly organize all the nodes with low overhead and is robust enough to the topology changes. When compared with power-efficient gathering in sensor information systems (PEGASIS) and the hybrid, energy- efficient, distributed clustering approach (HEED), the simulation results show that DTEER achieves its intention of consuming less energy, equalizing the energy consumption of all the nodes, alleviating the data gathering delay, as well as extending the network lifetime perfectly.
基金supported in part by the National Natural Science Foundation of China (No. 61472200)Beijing Municipal Science & Technology Commission (No. Z161100000416004)
文摘Trees are arguably one of the most important data structures widely used in information theory and computing science. Different numbers of intermediate nodes in wireless broadcast trees may exert great impacts on the energy consumption of individual nodes, which are typically equipped with a limited power supply in a wireless sensor network; this limitation may eventually determine how long the given wireless sensor network can last. Thus, obtaining a deep understanding of the mathematical nature of wireless broadcast trees is of great importance. In this paper, we give new proof of Cayley's well-known theorem for counting labeled trees. A distinct feature of this proof is that we purely use combinatorial structures instead of constructing a bijection between two kinds of labeled trees, which is in contrast to all existing proofs. Another contribution of this work is the presentation of a new theorem on trees based on the number of intermediate nodes in the tree. To the best of our knowledge,this work is the first to present a tree enumeration theorem based on the number of intermediate nodes in the tree.
文摘This paper investigates a new operation strategy for photovoltaic (PV) systems, which improves the overall reliability of the system as a result of the improvement in the reliability of the critical components. First, a mathematical model is proposed using the fault tree analysis (FTA) to estimate the reliability of the PV systems in order to find the suitable maintenance strategies. The implementations demonstrate that it is essential to employ smart maintenance plans and monitor the identified most critical components of PV systems. Then, an innovative analytical method based on the Markov process is presented to model smart operation plans in PV systems. The impact of smart operation strategy on the PV systems is then evaluated. The objective of this paper is to develop plans for improving the reliability of PV systems. A series of case studies have been conducted to demonstrate the importance of smart operation well as the applicability and method. strategies for PV systems as feasibility of the proposed