Skip to main content
SpringerLink
Log in

On the Cluster-Connectivity of Wireless Sensor Networks

  • Conference paper
  • First Online:
Computational Science and Its Applications – ICCSA 2016 (ICCSA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9787))

Included in the following conference series:

  • 1475 Accesses

Abstract

Wireless sensor networks consist of sensor devices with limited energy resources and computational capabilities, hence network optimization and algorithmic development in minimizing the total energy or power to maintain the connectivity of the underlying network are crucial for their design and maintenance. We consider a generalized system model of wireless sensor networks whose node set is decomposed into multiple clusters, and show that the decision and the induced minimization problems of the cluster-connectivity of wireless sensor networks appear to be computationally intractable – completeness and hardness, respectively, for the nondeterministic polynomial-time complexity class. An approximation algorithm is devised to minimize the number of endnodes of inter-cluster edges within a factor of 2 of the optimum for the cluster-connectivity.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bondy, J.-A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics. Springer, New York, London (2007)

    MATH  Google Scholar 

  2. Chen, W.-T., Huang, N.-F.: The strongly connecting problem on multihop packet radio networks. IEEE Trans. Commun. 37(3), 293–295 (1989)

    Article  Google Scholar 

  3. Cheng, X., Narahari, B., Simha, R., Cheng, M.X., Liu, D.: Strong minimum energy topology in wireless sensor networks: NP-completeness and heuristics. IEEE Trans. Mob. Comput. 2(3), 248–256 (2003)

    Article  Google Scholar 

  4. Clementi, A.E.F., Penna, P., Silvestri, R.: Hardness results for the power range assignment problem in packet radio networks. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 197–208. Springer, Heidelberg (1999)

    Google Scholar 

  5. Cui, S., Goldsmith, A.J., Bahai, A.: Energy-efficiency of MIMO and cooperative MIMO techniques in sensor networks. IEEE J. Sel. Areas Commun. 22(6), 1089–1098 (2004)

    Article  Google Scholar 

  6. Cui, S., Madan, R., Goldsmith, A.J., Lall, S.: Cross-layer energy and delay optimization in small-scale sensor networks. IEEE Trans. Wireless Commun. 6(10), 3688–3699 (2007)

    Article  Google Scholar 

  7. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)

    Chapter  Google Scholar 

  8. Laneman, J.N., Wornell, G.W.: Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks. IEEE Trans. Inf. Theory 49(10), 2415–2425 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Li, X.: Space-time coded multi-transmission among distributed transmitters without perfect synchronization. IEEE Signal Process. Lett. 11(12), 948–952 (2004)

    Article  Google Scholar 

  10. Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Algorithmic aspects of topology control problems for ad hoc networks. ACM Mobile Netw. Appl. 10(1–2), 19–34 (2005)

    Article  Google Scholar 

  11. Panda, B.S., Shetty, D.P.: A local search based approximation algorithm for strong minimum energy topology problem in wireless sensor networks. In: Hota, C., Srimani, P.K. (eds.) ICDCIT 2013. LNCS, vol. 7753, pp. 398–409. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  12. Panda, B.S., Shetty, D.P., Pandey, A.: k-distinct strong minimum energy topology problem in wireless sensor networks. In: Natarajan, R., Barua, G., Patra, M.R. (eds.) ICDCIT 2015. LNCS, vol. 8956, pp. 187–192. Springer, Heidelberg (2015)

    Google Scholar 

  13. Singh, S., Raghavendra, C.S., Stepanek, J.: Power-aware broadcasting in mobile ad hoc networks. In: Proceedings of IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), 12–15 September 1999, Osaka, Japan, pp. 22–31 (1999)

    Google Scholar 

  14. Stathopoulos, T., Lukac, M., McIntire, D., Heidemann, J.S., Estrin, D., Kaiser, W.J.: End-to-end routing for dual-radio sensor networks. In: Proceedings of IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 6–12 May 2007, Anchorage, Alaska, USA, pp. 2252–2260 (2007)

    Google Scholar 

  15. Čagalj, M., Hubaux, J.-P., Enz, C.: Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In: Proceedings of the Eighth Annual International Conference on Mobile Computing and Networking (MOBICOM), 23–28 September 2002, Atlanta, Georgia, USA, pp. 172–182 (2002)

    Google Scholar 

  16. Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Algorithms for energy-efficient multicasting in static ad hoc wireless networks. ACM Mobile Netw. Appl. 6(3), 251–263 (2001)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Oklahoma State University, Stillwater, OK, 74078, USA

    H. K. Dai

  2. Department of Computer Science, Arkansas State University, Jonesboro, AR, 72401, USA

    H. C. Su

Authors
  1. H. K. Dai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. C. Su
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to H. K. Dai .

Editor information

Editors and Affiliations

  1. University of Perugia , Perugia, Italy

    Osvaldo Gervasi

  2. University of Basilicata , Potenza, Italy

    Beniamino Murgante

  3. Covenant University , Ota, Nigeria

    Sanjay Misra

  4. University of Minho , Braga, Portugal

    Ana Maria A.C. Rocha

  5. Polytechnic University , Bari, Italy

    Carmelo M. Torre

  6. Monash University , Clayton, Victoria, Australia

    David Taniar

  7. Kyushu Sangyo University , Fukuoka, Japan

    Bernady O. Apduhan

  8. Saint Petersburg State University , Saint Petersburg, Russia

    Elena Stankova

  9. Beijing University of Posts & Telecommunication , Beijing, China

    Shangguang Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Dai, H.K., Su, H.C. (2016). On the Cluster-Connectivity of Wireless Sensor Networks. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2016. ICCSA 2016. Lecture Notes in Computer Science(), vol 9787. Springer, Cham. https://doi.org/10.1007/978-3-319-42108-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42108-7_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42107-0

  • Online ISBN: 978-3-319-42108-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation