Energy Efficiency in Cooperative Wireless Sensor Networks

The transport of sensitive products is very important because their deterioration may cause the value lost and even the product rejection by the buyer. In addition, it is important to choose the optimal way to achieve this end. In a data network, the task of calculating the best routes is performed by routers. We can consider the optimal path as the one that provides a shortest route. However, if a real transport network is considered the shortest path can sometimes be affected by incidents and traffic jams that would make it inadvisable. On the other hand, when we need to come back, due to features that symmetry provides, it would be interesting to follow the same path in reverse sense. For this reason, in this paper we present a symmetric routing mechanism for cooperative monitoring system for the delivery of fresh products. The systems is based on a combination of fixed nodes and a mobile node that stores the path followed to be able of coming back following the same route in reverse sense. If this path is no longer available, the system will try to maintain the symmetry principle searching the route that provide the shortest time to the used in the initial trip. The paper shows the algorithm used by the systems to calculate the symmetric routes. Finally, the system is tested in a real scenario which combines different kind of roads. As the results shows, the energy consumption of this kind of nodes is highly influenced by the activity of sensors.