電子情報通信学会総合大会講演要旨
BS-3-30
Maximizing Lifetime of Shortest Path Tree with Different Sensor Energy Budgets
○Hiroshi Matsuura(NTT)
This paper proposes a routing that can be applied to a shortest path tree with different energy budgets, and in which the time complexity is nearly O(lh), where l indicates the number of links (neighbors) in the WSN and h is the maximum hop-count of a path on the tree. Kajal et al. proposed RaSMaLai, which can increase the lifetime of a shortest path tree by changing the topology of the original tree many times, but its time complexity is larger than O(ln), where n is the number of tree nodes in the WSN. This time complexity is apparently larger than O(lh).