Skip to main content
Springer Nature Link
Log in

Energy efficient clearance routing in WSN

  • Original Article
  • Published:
International Journal of System Assurance Engineering and Management Aims and scope Submit manuscript

An Erratum to this article was published on 21 February 2017

This article has been updated

Abstract

Wireless Sensor network consists of large number of sensor nodes, which are deployed densely. A key challenge of wireless sensor network is that their sensor nodes contain less amount of battery power. Consequently, efficient utilization of battery power inside the network is a main design consideration. In the querying or monitoring application like critical condition in a particular region, we need the network that respond in few seconds. For the purpose of response in less time, we require energy efficient routing of information inside the network. In this paper, we are proposing an energy efficient clearance routing method to collect/route the query towards a particular region inside the network.

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
€32.70 /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 includes VAT (France)

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
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29
Fig. 30
Fig. 31
Fig. 32
Fig. 33
Fig. 34

Similar content being viewed by others

Change history

  • 21 February 2017

    An erratum to this article has been published.

References

  • Alstrup S, Gavoille C, Kaplan H, Rauhe T (2002) Nearest common ancestors: a survey and a new distributed algorithm. In Proceedings of 14th ACM Symposium Parallel Algorithms and Architectures, pp 258–264

  • Barbancho J, León C, Molina FJ, Barbancho A (2008) A new QoS routing algorithm based on self-organizing maps for wireless sensor networks. J Telecommun Syst 36:73–83

    Article  Google Scholar 

  • Bose P, Morin P, Stojmenovic I, Urrutia J (2001) Routing with guaranteed delivery in ad hoc wireless networks. ACM Wirel Netw 7(6):198–205

    Article  MATH  Google Scholar 

  • Chang J-H, Tassiulas L (2000) Energy conserving routing in wireless ad-hoc networks. 19th IEEE Annual Joint Conference of Computer and Communications Societies, vol 1, pp 22–31

  • Das SM, Pucha H, Hu YC, (2005) Performance comparison of scalable location services for geographic ad hoc routing. IEEE INFOCOM’05

  • Finn G (1987) Routing and addressing problems in large metropolitanscale internetworks. ISI Research Report ISI/RR-87-180, UCSC

  • Finn GG (1987) Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISI/RR-87-180, USC/ISI

  • Gao J (2000) Energy efficient routing for wireless sensor networks. Ph.D. Dissertation, UCLA

  • Gao J, Sohrabi K, Ailawadhi V, Pottie G (2000) An energy conscious self-organizing wireless sensor network. IEEE PCI Magazine

  • Imielinski T, Goel S (2000) Dataspace—querying and monitoring deeply networked collections in physical space. IEEE Personal Communications Magazine

  • Intanagonwiwat C, Govindan R, Estrin Deborah (2000) Directed diffusion: a scalable and robust communication paradigm for sensor networks, ACM Mobicom, Boston

  • Jia J, Wu X, Chen J, Chen J, Wang X (2012) Exploiting sensor redistribution for eliminating the energy hole problem in mobile sensor networks. EURASIP J Wirel Commun Netw 1:68

    Article  Google Scholar 

  • Jin M, Xia S, Wu H, Gu X (2011) Scalable and fully distributed localization with mere connectivity. INFOCOM, 2011 Proceedings IEEE, pp 3164–3172

  • Johnson D, Maltz D, Hu Y (2003) The dynamic source routing protocol for mobile ad hoc networks. IETF MANET Working Group, Internet Draft

  • Karp B, Kung HT (2000) GPSR: greedy perimeter stateless routing for wireless networks, ACM MobiCom

  • Kheiri S, Ghaznavi MB, Rafiee GM, Seyfe B (2009) An improved gossiping data distribution technique with emphasis on reliability and resource constraints. IEEE International Conference on Communications and Mobile Computing. Singapore, pp 1604–1609

  • Ko YB, Vaidya NH (1998) Location-aided routing (LAR) in Mobile Ad Hoc Networks. Fourth ACM/IEEE Annual International Conference on Mobile Computing and Networking, Dallas, pp 66–75

  • Li J, Jannotti J, DeCouto DSJ, Karger DR, Morris R (2000) A scalable location service for geographic ad hoc routing. ACM MobiCom, Boston

  • Liu A, Zhang P, Chen Z (2011) Theoretical analysis of the lifetime and energy hole in cluster based wireless sensor networks. J Parallel Distrib Comput 71(10):1327–1355

    Article  MATH  Google Scholar 

  • Norouzi A, Dabbaghian M, Hatamizadeh A, Ustundag BB (2010) An improved elgossiping data distribution technique with emphasis on reliability and resource constraints in wireless sensor network. International Conference on Electronic Computer Technology (ICECT), Kuala Lumpur, pp 179–183, 7–10 May

  • Perkins CE, Royer EM (1999) Ad hoc on-demand distance vector routing. IEEE International Conference on Mobile Computing System and Applications Workshop. New Orleans, pp 90–100

  • Sanchez JA, Ruiz PM, Marin-Perez R (2009) Beacon-less geographic routing made practical: challenges, design guidelines and protocols. IEEE Commun 47:85–91

    Article  Google Scholar 

  • Stemm M, Katz RH (1997) Measuring and reducing energy consumption of network interfaces in hand-held devices. Institute of Electronics, Information and Communication Engineers (IEICE) Transactions on Communications. Special Issue on Mobile Computing

  • Sugihara R, Gupta R (2011) Sensor localization with deterministic accuracy guarantee. INFOCOM, 2011 Proceedings IEEE, pp 1772–1780

  • Woo SCM, Singh S (2001) Scalable routing protocol for ad hoc networks. J Wirel Netw (WINET) 7(5):513–529

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering (CSE), Graphic Era University, Dehradun, India

    Devesh Pratap Singh

  2. Department of Computer Network Engineering (CNE), Visvesvaraya Technological University (VTU), Belgaum, 590018, India

    R. H. Goudar

Authors
  1. Devesh Pratap Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. H. Goudar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. H. Goudar.

Additional information

The original version of this article was revised: The redundant elements Figure 34 and blank pages have been removed and the original article is updated accordingly.

An erratum to this article is available at https://doi.org/10.1007/s13198-017-0586-8.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Singh, D.P., Goudar, R.H. Energy efficient clearance routing in WSN. Int J Syst Assur Eng Manag 8 (Suppl 2), 555–575 (2017). https://doi.org/10.1007/s13198-014-0263-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13198-014-0263-0

Keywords

Search

Navigation