TY - GEN
T1 - Rate allocation for maximizing lifetime of data gathering tree without aggregation in wireless sensor networks
AU - Yuan, Jinhui
AU - Zhou, Hongwei
AU - Zhang, Laishun
AU - Chen, Hong
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/8/10
Y1 - 2015/8/10
N2 - Different from data aggregation, in the process of transmitting data without aggregation from leaf node to the sink, the size of the integrated data increases. In this paper, we define that the lifetime of the node is the rounds of transmitting integrated data, which includes its own data and the received data from its children, in view of the feature of data gathering without aggregation. For different rate allocation for sensor nodes will result in the different lifetime of the network, we propose the approach on dealing with rate allocation for constructing maximum lifetime data gathering tree without aggregation in wireless sensor networks. Our algorithm, which denotes as RMLTT (Rate allocation for constructing Maximum-Lifetime data gathering Tree wiThout aggregation), approximately allocates the optimal data rates for sensor nodes with the goal to prolong the lifetime of the network as possible as it can. Simulations show that our approach is effective, which is compared with other algorithm.
AB - Different from data aggregation, in the process of transmitting data without aggregation from leaf node to the sink, the size of the integrated data increases. In this paper, we define that the lifetime of the node is the rounds of transmitting integrated data, which includes its own data and the received data from its children, in view of the feature of data gathering without aggregation. For different rate allocation for sensor nodes will result in the different lifetime of the network, we propose the approach on dealing with rate allocation for constructing maximum lifetime data gathering tree without aggregation in wireless sensor networks. Our algorithm, which denotes as RMLTT (Rate allocation for constructing Maximum-Lifetime data gathering Tree wiThout aggregation), approximately allocates the optimal data rates for sensor nodes with the goal to prolong the lifetime of the network as possible as it can. Simulations show that our approach is effective, which is compared with other algorithm.
KW - Computers
KW - Digital TV
KW - Erbium
UR - https://www.scopus.com/pages/publications/84954322964
U2 - 10.1109/ICACI.2015.7184756
DO - 10.1109/ICACI.2015.7184756
M3 - 会议稿件
AN - SCOPUS:84954322964
T3 - 2015 7th International Conference on Advanced Computational Intelligence, ICACI 2015
SP - 97
EP - 100
BT - 2015 7th International Conference on Advanced Computational Intelligence, ICACI 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 7th International Conference on Advanced Computational Intelligence, ICACI 2015
Y2 - 27 March 2015 through 29 March 2015
ER -