Aggregating the sensed data by nodes is a natural way to increase the network lifetime and reduce the number of bits sent and received by each sensor node. This paper presents a reliable tree-based data aggregation method. In the proposed method, sensor nodes are organized in the form of a binary tree. Then, aggregation requests are authenticated by a shared key, and if the request is acknowledged, the aggregation process begins. In the proposed method, using dynamic generator polynomial-size for cycle error detection code (CRC), the error generated along the path is detected hop by hop. In case of an error, the request for retransmission will be sent to the previous hop. Also, intermediate nodes apply certain aggregating functions like summation or averaging on the received packages, which cause a reduction in the amount of data transmission on the network. This method reduces the number of sent packets and the amount of energy consumed, so the network has a longer lifetime. Also, this method significantly increased reliability using the CRC code. The proposed method is compared with EESSDA, SDAACA, and LAG methods. The simulation results show that the proposed method has greater superiority over its comparative techniques, particularly on aspects such as energy consumption, network lifetime, and reliability.

按节点聚合感测数据是增加网络寿命并减少每个传感器节点发送和接收的位数的自然方法。本文提出了一种可靠的基于树的数据聚合方法。在提出的方法中，传感器节点以二叉树的形式组织。然后，通过共享密钥对聚合请求进行身份验证，如果请求得到确认，则聚合过程开始。在提出的方法中，使用动态生成器多项式大小作为循环错误检测码（CRC），逐跳检测沿路径生成的错误。发生错误时，重传请求将发送到前一跳。而且，中间节点对接收到的数据包应用某些汇总功能，例如求和或求平均值，这会减少网络上的数据传输量。这种方法减少了发送数据包的数量和消耗的能量，因此网络具有更长的寿命。而且，该方法使用CRC码显着提高了可靠性。将该方法与EESSDA，SDAACA和LAG方法进行了比较。仿真结果表明，所提出的方法比其比较技术具有更大的优越性，特别是在能耗，网络寿命和可靠性等方面。