Skip to main content

Revisiting non-tree routing for maximum lifetime data gathering in wireless sensor networks

Abstract

Wireless sensor networks usually adopt a tree structure for routing, where each node sends and forwards messages to its parent. However, lifetime maximization with tree routing structure is NP-hard, and all algorithms attempting to find the optimal solution run in exponential time unless \(P=\mathrm{NP}\). This paper revisits the problem of non-tree routing structure, where a node can send different messages to different neighbors. Though lifetime maximization with non-tree routing can be solved in polynomial time, the existing method transforms it into a series of maximum flow problems, which are either complicated or with high running time. This paper proposes an algorithm with O(mn) running time, where m is the number of edges and n is the number of nodes. The heart of the algorithm is a method to find a routing path from any node to the sink in O(m) time without disconnecting existing routing paths. The proposed algorithm is also suitable for distributed implementation. When a node fails, each influenced node can establish a new routing path in O(m) time. Simulations are conducted to compare the optimal lifetimes of tree structure and non-tree structure on random networks. The results verify the effectiveness of the proposed algorithm.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

References

  1. 1.

    Buragohain C, Agrawal D, Suri S (2005) Power aware routing for sensor databases. In: Proceedings of INFOCOM

  2. 2.

    Liang J, Wang J, Cao J, Chen J, Lu M (2010) An efficient algorithm for constructing maximum lifetime tree for data gathering without aggregation in wireless sensor networks. In: Proceedings of INFOCOM

  3. 3.

    Zhu X, Wu X, Chen G (2015) An exact algorithm for maximum lifetime data gathering tree without aggregation in wireless sensor networks. Wirel Netw 21(1):281–295

    Article  Google Scholar 

  4. 4.

    Cao P, Zhu X (2018) Speeding up exact algorithms for maximizing lifetime of WSNs using multiple cores. Wirel Commun Mob Comput 2018:1–12

    Google Scholar 

  5. 5.

    Chen J, Kleinberg RD, Lovász L, Rajaraman R, Sundaram R, Vetta A (2007) (Almost) tight bounds and existence theorems for single-commodity confluent flows. J ACM 54(4):16

    MathSciNet  Article  Google Scholar 

  6. 6.

    Ma X, Zhu X, Chen B (2017) Exact algorithms for maximizing lifetime of WSNs using integer linear programming. In: Proceedings of WCNC

  7. 7.

    Wu Y, Mao Z, Fahmy S, Shroff N (2010) Constructing maximum-lifetime data-gathering forests in sensor networks. IEEE/ACM Trans Netw 18(5):1571–1584

    Article  Google Scholar 

  8. 8.

    Zhu X, Chen G, Tang S, Wu X, Chen B (2016) Fast approximation algorithm for maximum lifetime aggregation trees in wireless sensor networks. INFORMS J Comput 28(3):417–431

    MathSciNet  Article  Google Scholar 

  9. 9.

    Zhu X, Tang S. Exact algorithms for the minimum load spanning tree problem. INFORMS J Comput (in press)

  10. 10.

    Shan M, Chen G, Luo D, Zhu X, Wu X (2014) Building maximum lifetime shortest path data aggregation trees in wireless sensor networks. ACM Trans Sens Netw 11(1):1–24

    Article  Google Scholar 

  11. 11.

    Fürer M, Raghavachari B (1994) Approximating the minimum-degree Steiner tree to within one of optimal. J Algorithms 17(3):409–423

    MathSciNet  Article  Google Scholar 

  12. 12.

    Singh M, Lau LC (2015) Approximating minimum bounded degree spanning trees to within one of optimal. J ACM 62(1):1

    MathSciNet  Article  Google Scholar 

  13. 13.

    Pal A, Jolfaei A (2020) On the lifetime of asynchronous software defined wireless sensor networks. IEEE Internet Things J 7(7):6069–6077

    Article  Google Scholar 

  14. 14.

    Fariborzi H, Moghavvemi M (2009) Eamtr: energy aware multi-tree routing for wireless sensor networks. IET Commun 3(6):733–739

    Article  Google Scholar 

  15. 15.

    Zhu X, Tang S. A branch and bound algorithm for building optimal data gathering tree in wireless sensor networks. INFORMS J Comput (in press). https://github.com/Xiaojun-Zhu/BranchBoundforWSN

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (61972199,61502232).

Author information

Affiliations

Authors

Corresponding author

Correspondence to Xiaojun Zhu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Zhu, X. Revisiting non-tree routing for maximum lifetime data gathering in wireless sensor networks. J Supercomput 77, 8927–8945 (2021). https://doi.org/10.1007/s11227-021-03621-x

Download citation

Keywords

  • Lifetime maximization
  • Non-tree routing
  • Wireless sensor networks