Skip to main content
SpringerLink
Log in

Algorithms for k-fault tolerant power assignments in wireless sensor networks

  • Research Papers
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

This paper addresses fault-tolerant many-to-many routing power assignments in heterogeneous wireless sensor networks. We introduce the k-fault tolerant power assignments problem with the objective of assigning each sensor node transmission power such that (1) any pairwise sensor node is k-vertex connected and (2) the total power consumption is minimized. We propose three solutions for this problem: two centralized algorithms, a greedy algorithm and an O(√n/ɛ)-approximation algorithm, and an h-hop distributed and localized algorithm. Related theorems and proofs are presented to prove the correctness of our approaches. Furthermore, simulation and experiment results are presented to verify the efficiency of our approaches.

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.

Similar content being viewed by others

References

  1. Liu L, Hu B, Li L. Algorithms for energy efficient mobile object tracking in wireless sensor networks. Cluster Comput, 2010, 13: 181–197

    Article  Google Scholar 

  2. Li L Y, Li C L. QoS multicast routing protocol in hierarchical wireless MANET. Sci China Ser F-Inf Sci, 2008, 51: 196–212

    Article  MATH  Google Scholar 

  3. Tang Q L, Yang L Q, Qin T F, et al. Energy-saving PPM schemes for WSNs. Sci China Ser F-Inf Sci, 2008, 51: 571–585

    Article  MATH  Google Scholar 

  4. Cardei M, Yang S, Wu J. Algorithms for fault-tolerant topology in heterogeneous wireless sensor networks. IEEE Trans Parall Distrib Syst, 2008, 19: 545–558

    Article  Google Scholar 

  5. Liu L, Hu B, Li L. Energy conservation algorithms for maintaining coverage and connectivity in wireless sensor networks. IET Commun, 2010, 4: 786–800

    Article  Google Scholar 

  6. Wang F, Thai M T, Li Y, et al. Fault tolerant topology control for all-to-one and one-to-all communication in wireless networks. University of Minnesota, Technical Report TR 05-038, 2005

  7. Heizelman W R, Chandrakasan A, Balakrishnan H. Energy-efficient communication protocol for wireless micro sensor networks. In: IEEE Proceedings of the Hawaii International Conference on System Sciences, Maui, Hawaii, USA, 2000. 2: 3005–3014

  8. Li N, Hou J C. FLSS: A fault-tolerant topology control algorithm for wireless networks. In: 10th Annual International Conference on Mobile Computing and Networking, Philadelphia, PA, USA, 2004. 275–286

  9. Hajiaghayi M, Immorlica N, Mirrokni V S. Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. IEEE/ACM Trans Network, 2007, 15: 1345–1358

    Article  Google Scholar 

  10. Jia X, Kim D, Wan P, et al. Power assignment for k-connectivity in wireless ad hoc networks. J Combin Opt, 2005, 9: 213–222

    Article  MATH  MathSciNet  Google Scholar 

  11. Han X F, Cao X, Lloyd E L, et al. Fault-tolerant relay node placement in heterogeneous wireless sensor networks. IEEE Trans Mobile Comput, 2010, 9: 643–656

    Article  Google Scholar 

  12. Li D Y, Wang Y X, Zhu Q H, et al. Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks. Theoret Comput Sci, 2010, doi:10.1016/j.tcs.2009.06.035

  13. Segal M, Shpungin H. On construction of minimum energy k-fault resistant topologies. Ad Hoc Networks, 2009, 7: 363–373

    Article  Google Scholar 

  14. Ghosh A, Wang Y, Krishnamachari B. Efficient distributed topology control in 3-dimensional wireless networks. In: The 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), San Diego, California, USA, 2007. 91–100

  15. Moraes R, Ribeiro C C, Duhamel C. Optimal solutions for fault-tolerant topology control in wireless ad hoc networks. IEEE Trans Wirel Commun, 2009, 8: 5970–5981

    Article  Google Scholar 

  16. Ingelrest F, Simplot-Ryl D, Stojmenovic I. Optimal transmission radius for energy efficient broadcasting protocol in ad hoc and sensor networks. IEEE Trans Parall Distrib Syst, 2006, 17: 536–547

    Article  Google Scholar 

  17. Perkins C E, Belding-Royer E M, Das S. Ad hoc on demand distance vector (AODV) routing. RFC3561, The Internet Society, 2003

  18. Cheriyan J, Vempala S, Vetta A. Approximation algorithms for minimum-cost k-vertex connected subgraphs. In: 34th Annual ACM Symposium on the Theory of Computing. New York: ACM, 2002. 306–312

    Google Scholar 

  19. Kortsarz G, Nutov Z. Approximating node connectivity problems via set covers. In: 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), Lecture Notes in Computer Science, Berlin: Springer, 2000, 1913/2000: 3–21

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Lanzhou University, Lanzhou, 730000, China

    Li Liu, Lian Li & Bin Hu

  2. LRI, Univ Paris-sud and CNRS, Orsay, F-91405, France

    Li Liu

  3. School of Computer and Information, Hefei University of Technology, Hefei, 230009, China

    Lian Li

  4. Department of Computing, Birmingham City University, Galton Building, Perry Barr, Birmingham, B42 2SU, UK

    Bin Hu

Authors
  1. Li Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lian Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bin Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Li Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, L., Li, L. & Hu, B. Algorithms for k-fault tolerant power assignments in wireless sensor networks. Sci. China Inf. Sci. 53, 2527–2537 (2010). https://doi.org/10.1007/s11432-010-4101-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-010-4101-y

Keywords

Search

Navigation