Optimal Data Gathering Paths and Energy Balance Mechanisms in Wireless Networks

  • Aubin Jarry
  • Pierre Leone
  • Sotiris Nikoletseas
  • Jose Rolim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6131)


This paper studies the data gathering problem in wireless networks, where data generated at the nodes has to be collected at a single sink. We investigate the relationship between routing optimality and fair resource management. In particular, we prove that for energy balanced data propagation, Pareto optimal routing and flow maximization are equivalent, and also prove that flow maximization is equivalent to maximizing the network lifetime. We algebraically characterize the network structures in which energy balanced data flows are maximal. Moreover, we algebraically characterize communication links which are not used by an optimal flow. This leads to the characterization of minimal network structures supporting the maximal flows.

We note that energy balance, although implying global optimality, is a local property that can be computed efficiently and in a distributed manner. We suggest online distributed algorithms for energy balance in different optimal network structures and numerically show their stability in particular setting. We remark that although the results obtained in this paper have a direct consequence in energy saving for wireless networks they do not limit themselves to this type of networks neither to energy as a resource. As a matter of fact, the results are much more general and can be used for any type of network and different type of resources.


Energy Consumption Sensor Network Wireless Sensor Network Cluster Head Neighbouring Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aubin, J.-P.: Applied Functional Analysis. Wiley, IEEE (2000)Google Scholar
  2. 2.
    Borkar, V.S.: Stochastic Approximation: A Dynamical Systems ViewPoint. Cambridge University Press, Cambridge (2008)Google Scholar
  3. 3.
    Dagher, J.C., Marcellin, M.W., Neifeld, M.A.: A theory for maximizing the lifetime of sensor networks. IEEE Transactions on Communications 55(2), 323–332 (2007)CrossRefGoogle Scholar
  4. 4.
    Duan, C., Fan, H.: A distributed energy balance clustering protocol for heterogeneous wireless sensor networks (2007)Google Scholar
  5. 5.
    Efthymiou, C., Nikoletseas, S.E., Rolim, J.D.P.: Energy balanced data propagation in wireless sensor networks. In: IPDPS (2004)Google Scholar
  6. 6.
    Geoffrion, A.M.: Proper efficiency and the theory of vector maximization. Journal of Mathematical Analysis and Applications 22(3), 618–630 (1968)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Giridhar, A., Kumar, P.R.: Maximizing the functional lifetime of sensor networks. In: Proceedings of the 4th International Symposium on Information Processing in Sensor Networks, Los Angeles, California (2005)Google Scholar
  8. 8.
    Jarry, A., Leone, P., Powell, O., Rolim, J.: An optimal data propagation algorithm for maximizing the lifespan of sensor networks. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) DCOSS 2006. LNCS, vol. 4026, pp. 405–421. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    Karlin, S.: Mathematical methods and theory in games, programming and economics. Dover Publications, Mineola (2003)Google Scholar
  10. 10.
    Kushner, H.J., Yin, G.G.: Stochastic Approximation and Recursive Algorithms and Applications. Springer, Heidelberg (2003)zbMATHGoogle Scholar
  11. 11.
    Leone, P., Nikoletseas, S.E., Rolim, J.D.P.: An adaptive blind algorithm for energy balanced data propagation in wireless sensors networks. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds.) DCOSS 2005. LNCS, vol. 3560, pp. 35–48. Springer, Heidelberg (2005)Google Scholar
  12. 12.
    Li, C., Ye, M., Chen, G., Wu, J.: An energy-efficient unequal clustering mechanism for wireless sensor networks. In: Proceedings of the IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, November 2005, p. 8 (2005)Google Scholar
  13. 13.
    Meyn, S.: Control Techniques for Complex Networks. Cambridge University Press, Cambridge (2008)zbMATHGoogle Scholar
  14. 14.
    Ok, C., Mitra, P., Lee, S., Kumara, S.: Maximum energy welfare routing in wireless sensor networks. In: Akyildiz, I.F., Sivakumar, R., Ekici, E., Oliveira, J.C.d., McNair, J. (eds.) NETWORKING 2007. LNCS, vol. 4479, pp. 203–214. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. 15.
    Powell, O., Leone, P., Rolim, J.: Energy optimal data propagation in sensor networks. Journal on Parallel and Distributed Computing 67(3), 302–317 (2007)zbMATHCrossRefGoogle Scholar
  16. 16.
    Singh, M., Prasanna, V.: Optimal energy-balanced algorithm for selection in a single hop sensor network (2003)Google Scholar
  17. 17.
    Singh, M., Prasanna, V.K.: Energy-optimal and energy-balanced sorting in a single-hop wireless sensor network. In: Proceedings of the PerCom 2003, pp. 50–59 (2003)Google Scholar
  18. 18.
    Soro, S., Heinzelman, W.: Prolonging the lifetime of wireless sensor networks via unequal clustering. In: Proceedings of the 5th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (IEEE WMAN 2005) (April 2005)Google Scholar
  19. 19.
    Yu, Y., Prasanna, V.K.: Energy-balanced task allocation for collaborative processing in wireless sensor networks 10(1-2), 115–131 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Aubin Jarry
    • 1
  • Pierre Leone
    • 1
  • Sotiris Nikoletseas
    • 2
  • Jose Rolim
    • 1
  1. 1.Computer Science DepartmentUniversity of Geneva, Battelle Batiment AGenevaSwitzerland
  2. 2.University of Patras and Computer Technology InstituteRion, PatrasGreece

Personalised recommendations