| Summary: | Data aggregation can reduce the data transmission between the nodes, and thus save the energy and extend the life of the network. Many related researches on in-network data aggregation take the generalized maximum functions. For the cases that the original packets of N nodes aggregated into M (1 <; M <; N) packets, it is a challenge to improve the energy efficiency and reduce the transmission delay under the transmission reliability guarantee. In this paper, a novel ring-based in-network data aggregation scheme is proposed to this problem. The network is partitioned into rings and the data aggregation is executed ring by ring from outside to inside. To ensure transmission reliability, the source or intermediate aggregating node unicasts multiple aggregated packet copies to its next hop node in the inner ring with the maximum residual energy. The reliability is higher with the more unicasting packet copies. However, more sending packets copies will lead to more additional energy cost. Besides, nodes close to the sink tend to relay more size of data packets and the energy is depleted more quickly than nodes far to the sink. Meanwhile, the nodes close to the sink need to relay the aggregated packets, which contain more information. If the number of packet copies is too small, the packets loss will greatly worse the transmission reliability. Based on this, the number of unicasting packet copies is adaptively adjusted through fuzzy logic. The proposed scheme adaptively unicasts variable number of aggregated packets copies continuously in a window according to the request transmission reliability and the imbalance of nodes energy cost. Our analysis and simulation results show the effectiveness of the proposed scheme.
|
|---|
