Article Preview
TopMany routings for many-to-one WSNs have been proposed in recent past, aiming at balancing energy consumption and/or prolonging lifetime (Toh, 2001), (Ishmanov, Malik & Kim, 2011). They can be divided into two broad categories, the cost-based and the non-cost-based routings.
Cost-based (aka minimum cost) routings are the simplest and most common method to determine the exact path from each node to the sink. According to this method this path is the one that minimizes the total amount of a certain metric, such as distance, number of hops, energy consumption. The metric is actually the cost (or “weight” in terms of graph theory) of each link. Based on these link-costs, a distributed version of Disjkstra’s or Bellman-Ford shortest path algorithm is applied, resulting in the desirable minimum-cost paths. The summation of link-costs along a path, from each node to the sink, is considered as the cost of this node.
The proposed method needs a cost for each node in order to specify the braided paths and for that purpose it uses a cost-based routing, referred to as the basic routing. Three different metrics will be used in this work. These are: