Skip to main content

Advertisement

SpringerLink
Log in

Energy-efficient Tree-based Message Ferrying Routing Schemes for Wireless Sensor Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

Wireless sensor networks (WSNs) are prone to partitioning due to limited energy in sensor nodes and unreliable radio communications between them. Message ferrying (MF) has been proposed as an effective means to deliver data between disjoint parts of a partitioned WSN. In this paper, we propose a tree-based MF algorithm (TMFA) with least ratio tree (LRT) construction in order to prolong the lifetime and reduce energy usage in a WSN employing MF routing. LRT constructs a spanning tree from the topology graph of each partition of the WSN by setting the weight of each edge in the graph as the ratio between the energy cost to deliver a packet over the corresponding wireless link and a linear combination of the residual energy of the transmitting and receiving nodes connected by the link. In addition, the root of the spanning tree is randomly chosen among the nodes in the partition with residual energy equal to or larger than the mean residual energy of all nodes in the partition, so that the energy of nodes are expended evenly. Experimental results show that, compared with the previously proposed Least Energy Tree (LET) and Minimum Spanning Tree (MST) construction methods for TMFA, LRT construction outperforms both the LET and the MST construction in network lifetime and in the ratio of the number of packets reaching the sink to the total energy expended by all the nodes.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

References

  1. Boice J, Garcia-Luna-Aceves JJ, Obraczka K (2007) On-demand routing in disrupted environments, IFIP Networking 2007 Conference, Atlanta, Georgia, May

  2. Mitchener W, Vahdat A (2000) Epidemic routing for partially connected ad-hoc networks, Technical Report, CS-2000-06, Duke University, April

  3. Spyropoulos T, Psounis K, Raghavendra C (2005) Spray and wait: an efficient routing scheme for intermittently connected mobile networks, in ACM SIGCOMM 2005

  4. Shah R, Roy S, Jain S, Brunette W (2003) Data mules: modeling a three-tier architecture for sparse sensor networks, In Proc. of 2003 IEEE International Workshop on Sensor Network Protocols and Applications, pp 30–41, 11 May

  5. Zhao W, Ammar M (2003) Message ferrying: proactive routing in highly-partitioned wireless ad hoc networks, In proc. of The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. pp 308–314, 28–30 May

  6. Yang J, Chen Y, Ammar M, Lee C (2005) Ferry replacement protocols in sparse MANET message ferrying systems, 2005 IEEE Wireless Communications and Networking Conference, vol. 4, pp 2038–2044, 13–17 March

  7. Chen Y, Yang J, Zhao W, Ammar M, Zegura E (2006) Multicasting in sparse MANETs using message ferrying, 2006 IEEE Wireless Communications and Networking Conference. WCNC 2006, vol. 2, pp 691–696, 3–6 April

  8. Chuah MC, Yang P (2007) Performance evaluations of various message ferry scheduling schemes with two traffic classes, 2007 4th IEEE Consumer Communications and Networking Conference, 2007. CCNC 2007. pp 227–233, Jan

  9. Viswanathan R, Li J, Chuah MC (2005) Message ferrying for constrained scenarios, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks, 2005. WoWMoM 2005. pp 487–489, 13–16 June

  10. Jun H, Zhao W, Ammar MH, Zegura EW, Lee C (2005) Trading latency for energy in wireless ad hoc networks using message ferrying, Third IEEE International Conference on Pervasive Computing and Communications Workshops, 2005. PerCom 2005 Workshops. pp 220–225, 8–12 March

  11. Raghunathan V, Schurgers C, Sung P (2002) Energy-aware wireless microsensor networks. IEEE Signal Process Mag 1(7):40–50

    Article  Google Scholar 

  12. Heinzelman WB, Chandrakasan AP, Balakrishnan H (2002) An application-specific protocol architecture for wireless microsensor networks. IEEE Trans Wireless Commu 1(4):660–670

    Article  Google Scholar 

  13. Zhu Y-H, Wu W-D, Leung VCM, Yang L-H (2008) Energy-efficient tree-based message ferrying routing schemes for wireless sensor networks, Third International Conference on Communications and Networking in China, 2008. ChinaCom 2008, pp 844–848, 25–27 Aug

  14. Murugantha SD, Ma DCF, Fapojuwo AO (2005) A centralized energy-efficient routing protocol for wireless sensor networks. IEEE Commun Mag 43(3):s8–13

    Article  Google Scholar 

  15. Papadimitriou CH (1994) Computational complexity, Addison Wesley

  16. Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT Press

  17. Zhu Y-H, Leung VCM (2007) Optimization of sequential paging in movement-based location management based on movement statistics. IEEE Trans Veh Tech 56(2):955–964

    Article  Google Scholar 

  18. Kurose JF, Ross KW (2005) Computer networking: a top-down approach featuring the internet (third edition), Pearson Education Asia Limited

  19. Wang J, Howitt I (2005) Optimal traffic distribution in minimum energy wireless sensor networks, IEEE Global Telecommunications Conference, 2005. GLOBECOM ’05 6:3274–3278

    Google Scholar 

  20. Liang W, Liu Y (2007) Online data gathering for maximizing network lifetime in sensor networks. IEEE Trans Mobile Computing 6(1):2–11

    Article  Google Scholar 

  21. Ross SM (2007) Introduction to probability models (9th Edition). Elsevier (Singapore) Pte LTD, Singapore

    Google Scholar 

Download references

Acknowledgements

This project is supported by National Natural Science Foundation of China under Grants 60873228 and 60673177, and by Zhejiang Provincial Natural Science Foundation of China under grant Y1080483.

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, Zhejiang, China, 310023

    Yi-hua Zhu & Wan-deng Wu

  2. Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC, Canada, V6T 1Z4

    Victor C. M. Leung

Authors
  1. Yi-hua Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wan-deng Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Victor C. M. Leung
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yi-hua Zhu.

Additional information

This paper is based in part on a paper presented at Chinacom, Hangzhou, China, Aug. 2008.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhu, Yh., Wu, Wd. & Leung, V.C.M. Energy-efficient Tree-based Message Ferrying Routing Schemes for Wireless Sensor Networks. Mobile Netw Appl 16, 58–70 (2011). https://doi.org/10.1007/s11036-009-0211-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-009-0211-4

Keywords

Search

Navigation