Abstract-Tree topologies are widely used in WSN in order to route convergecast traffic to the sink. We consider in this paper the Shortest Path routing Tree (SPT) problem in WSN under different metrics; we show that the basic SPT based strategies are unsuitable for the many-to-one WSN when considering some metrics to compute link costs. Indeed, existing SPT approaches aim to construct a tree rooted at the sink such that the cost of the path from any node to the sink is minimal, while the cost of a given path is computed as summation of the costs of links that compose this path. However, in many-to-one WSN, links which are close to the sink are more critical than other links when using some metrics. We propose in this paper a new weighted path cost function, and we show that our cost function is more suitable for WSN. Based on this cost function, we propose a simple and efficient weighted shortest path tree construction which does not introduce new overheads. We consider, then, the particular case of energy-aware routing in WSN when we apply our new solution in order to construct more suitable energyaware SPT. We conduct extensive simulations which show that our approach allows to enhance the network lifetime up to 17% compared to the basic one.
Bechkit and Koudil et al. REF presented an approach called A New Weighted Shortest Path Tree For Convergecast Traffic Routing in WSN (WSPTC).
A new weighted shortest path tree for convergecast traffic routing in WSN
2012 IEEE Symposium on Computers and Communications (ISCC)
2012 IEEE Symposium on Computers and Communications (ISCC)
Computer Science