Skip to main content
Springer Nature Link
Log in

Distributed De La Garza algorithm for load-balancing routing in wireless sensor networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Large scale wireless sensor networks raise many challenges in the design of efficient and effective routing algorithm due to their complexity and hardware constraints. However, the scalability challenge may be mitigated from a macroscopic perspective. One example is the distributed De la Garza iteration (DDLGI) algorithm for global routing load-balancing, based on a set of partial differential equations iteratively solved by the De la Garza method. We theoretically analyze the parallelism of DDLGI and illustrate that the region of interest may impact the degree of parallelism and error. Furthermore, though DDLGI always converges, the slow convergence and long-range information exchange problems may lead to excess energy consumption in communication. Thus, we propose various enhanced De la Garza routing (E-DLGR) algorithms to alleviate the energy consumption problem by which nodes may exchange less information and only need to exchange information with closer nodes to complete each iteration. Our theoretical analysis and simulation results show that the proposed E-DLGR algorithms may have less transmission overhead, thus further reducing energy consumption, and converge faster while still maintaining adequate accuracy.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Notes

  1. The definition domain of \(\varPhi \) should be large enough to cover A. We distinguish A and the definition domain of \(\varPhi \) to integrate the two PDEs of (2) into one system of linear equations (10) via \(\delta _{i,j}\) [17].

  2. Though \(\widetilde{\varvec{C}}\) is not invertible, GSI (and its derived routing algorithms including DGSI, DDLGI, and E-DLGR) may still converge for (9). Thus, using GSI to solve (10) and (9) may obtain the same load-balancing routing vector field.

  3. More precisely, the forward sweep begins from the grid points called TL-initiators which have no up and left adjacent grid points.

  4. Via \(\hbox {PRECISE}\) referring to Sect. 4.1.

  5. Via \(\hbox {DONE}\) referring to Sect. 4.1.

  6. The grid points with the same value of \({\mathcal{O}}_{L}^{\scriptscriptstyle DG}\) may update their \(\varPhi \)s simultaneously.

  7. Since DDLGI, E-DLGR1, and E-DLGR2 maintain the lexicographical order of updating \(\varPhi \)s via (13) or equivalently (16); thus, the routing vector fields obtained from these three approaches are same.

  8. Each ROI is divided into \(20 \times 20\) grids. Thus each ROI has \(21 \times 21\) grid points, and some grid points are not in the ROI.

References

  1. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. E. (2002). A survey on sensor networks. IEEE Communications Magazine, 40(8), 102–114.

    Article  Google Scholar 

  2. Björck, Å., & Elfving, T. (1979). Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations. BIT Numerical Mathematics, 19(2), 145–163.

    Article  MATH  Google Scholar 

  3. Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011). Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundation and Trends in Machine Learning, 3(1), 1–122.

    Article  Google Scholar 

  4. Catanuto, R., Toumpis, S., & Morabito, G. (2007). Opti{c, m}al: Optical/optimal routing in Massively dense wireless networks. In Proceedings of IEEE INFOCOM (pp. 1010–1018). Alaska, USA: Anchorage.

  5. Catanuto, R., Toumpis, S., & Morabito, G. (2009). On asymptotically optimal routing in large wireless networks and geometrical optics analogy. Computer Networks, 53(11), 1939–1955.

    Article  MATH  Google Scholar 

  6. Chen, M., Leung, V. C., Mao, S., & Kwon, T. (2009). Receiver-oriented load-balancing and reliable routing in wireless sensor networks. Wireless Communications and Mobile Computing, 9(3), 405–416.

    Article  Google Scholar 

  7. Chiasserini, C. F., Gaeta, R., Garetto, M., Gribaudo, M., Manini, D., & Sereno, M. (2007). Fluid models for large-scale wireless sensor networks. Performance Evaluation, 64(7–8), 715–736.

    Article  Google Scholar 

  8. Farhat, C., Lesoinne, M., LeTallec, P., Pierson, K., & Rixen, D. (2001). FETI-DP: A dual-primal unified FETI method-part I: A faster alternative to the two-level FETI method. International Journal for Numerical Methods in Engineering, 50(7), 1523–1544.

    Article  MATH  MathSciNet  Google Scholar 

  9. Finn, G. G. (1987). Routing and addressing problems in large Metropolitan-scale internetworks. Research ISI/RR-87-180, Information Sciences Institute.

  10. Golub, G. H., & Van Loan, C. F. (1996). Matrix computations (3rd ed.). Baltimore: The Johns Hopkins University Press.

    MATH  Google Scholar 

  11. Hyytiä, E., & Virtamo, J. (2007). On optimality of single-path routes in massively dense wireless multi-hop networks. In Proceedings of the 10th ACM symposium on modeling, analysis, and simulation of wireless and mobile systems (pp. 28–35). Chania, Crete Island, Greece: ACM.

  12. Hyytiä, E., & Virtamo, J. (2009). On the optimality of field-line routing in massively dense wireless multi-hop networks. Performance Evaluation, 66(3–5), 158–172.

    Article  Google Scholar 

  13. Jacquet, P. (2004). Geometry of information propagation in massively dense ad hoc networks. In Proceedings of the 5th ACM international symposium on mobile ad hoc networking and computing (pp. 157–162). Tokyo, Japan: Roppongi Hills.

  14. Jung, S., Kserawi, M., Lee, D., & Rhee, J. K. K. (2009). Distributed potential field based routing and autonomous load balancing for wireless mesh networks. IEEE Communications Letters, 13(6), 429–431.

    Article  Google Scholar 

  15. Kalantari, M., & Shayman, M. (2006). Design optimization of multi-sink sensor networks by analogy to electrostatic theory. In Proceedings of IEEE wireless communications and networking conference (pp. 431–438). NV USA: Las Vegas.

  16. Karp, B., & Kung, H. T. (2000). GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th annual international conference on mobile computing and networking (pp. 243–254). Boston, MA, USA: ACM.

  17. Ko, R. S. (2011). A distributed routing algorithm for sensor networks derived from macroscopic models. Computer Networks, 55(1), 314–329.

    Article  MATH  Google Scholar 

  18. Ko, R. S. (2011). Macroscopic analysis of wireless sensor network routing problems. Adhoc & Sensor Wireless Networks, 13(1–2), 59–85.

    Google Scholar 

  19. Liu, L., Khodaei, A., Yin, W., & Han, Z. (2013). A distribute parallel approach for big data scale optimal power flow with security constraints. In The 4th IEEE international conference on smart grid communications (pp. 774–778). Canada: Vancouver.

  20. Marsden, J. E., & Tromba, A. J. (2003). Vector calculus (5th ed.). San Francisco: W. H. Freeman.

    Google Scholar 

  21. Toselli, A., & Widlund, O. (2005). Domain decomposition methods—algorithms and theory. Berlin: Springer.

    MATH  Google Scholar 

  22. Toumpis, S. (2008). Mother nature knows best: A survey of recent results on wireless networks based on analogies with physics. Computer Networks, 52(2), 360–383.

    Article  MATH  Google Scholar 

  23. Toussaint, G. T. (1980). The relative neighbourhood graph of a finite planar set. Pattern Recognition, 12(4), 261–268.

    Article  MATH  MathSciNet  Google Scholar 

  24. Yu, Y., Govindan, R., & Estrin, D. (2001). Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks. Technical Report UCLA/CSD-TR-01-0023, Computer Science Department, UCLA.

  25. Zhao, F., & Guibas, L. (2004). Wireless sensor networks: An information processing approach. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.

    Google Scholar 

  26. Zheng, J. Y., & Ko, R. S. (2013). Enhanced De La Garza routing algorithm for wireless sensor networks. In Proceedings of 2013 IEEE eighth international conference on intelligent sensors, sensor networks and information processing. Melbourne, Australia.

Download references

Acknowledgments

This work is supported by the National Science Council, Taiwan, under grant NSC 102-2221-E-194-035.

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Chung Cheng University, Chia-Yi, 621, Taiwan

    Jun-Yun Zheng & Ren-Song Ko

Authors
  1. Jun-Yun Zheng
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Ren-Song Ko
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Ren-Song Ko.

Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary material 1 (pdf 116 KB)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zheng, JY., Ko, RS. Distributed De La Garza algorithm for load-balancing routing in wireless sensor networks. Wireless Netw 21, 297–314 (2015). https://doi.org/10.1007/s11276-014-0771-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-014-0771-5

Keywords