Skip to main content

Advertisement

Springer Nature Link
Log in

Time orient LEAD based polling point selection algorithm for efficient data aggregation in wireless sensor networks

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Data collection is a problem of which a detailed and indepth study has been made. It is known for numerous approaches and a variety of measures and methods that have the objective of validation. The efficacy of data collection still remains a baffling issue and a challenging task. Algorithms do exist in this area, but each considers only either a single feature or few thereof. This paper presents a time orient location energy availability data rate (LEAD) based scheduling algorithm for the improvements of the performance of data collection in wireless sensor networks. The salient feature of this method is its scheduling the sensors for the polling point on the basis of energy and location of the sensor. The method involves the identification of sensors of a small number of which one of which is chosen as the polling point. Computation of the LEAD weight for the sensors of any region is made and a tiny set with higher LEAD weight is selected. The mobile collector selects the polling point based on the LEAD weight and only one visit is done for the polling point when it has enough score and that too in a periodic manner. Data collection is done on a route whose selection is based on energy, hop, reliable routing. This scheme has the specific advantage of improving data aggregation and network lifetime maximization.

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
$34.99 /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 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

Similar content being viewed by others

References

  1. Waheed Khan, A., Abdullah, A.H., Anisi, M., Iqbal Bangash, J.: A comprehensive study of data collection schemes using mobile sinks in wireless sensor networks. Sensors 14(2), 2510–2548 (2014)

    Article  Google Scholar 

  2. Wang, C.F., Shih, J., Pan, B., Wu, T.: A network lifetime enhancement method for sink relocation and its analysis in wireless sensor networks. IEEE Sens. J. 14(6), 1932–1943 (2014)

    Article  Google Scholar 

  3. Farzad, T., Khosrow, S., Amir, V.: Multihop data gathering in wireless sensor networks with a mobile sink. Int. J. Commun. Syst. 30(12), 1–14 (2017)

    Google Scholar 

  4. Djuraev, M., Byoungchul, A.: A novel data gathering method for large wireless sensor networks. IERI Procedia 4, 288–294 (2013)

    Article  Google Scholar 

  5. Ez-Zaidi, A., Rakrak, S.: Mobility for an optimal data collection in wireless sensor networks. Int. J. Adv. Comput. Sci. Appl. (ijacsa) 8(7), 353–360 (2017)

    Google Scholar 

  6. Yourong, C., Xiaowen, L., Siyi, L., Tiaojuan, R.: A lifetime optimization algorithm limited by data transmission delay and hops for mobile sink-based wireless sensor networks. J. Sens. 2017, 7507625 (2017)

    Google Scholar 

  7. Kumar, A.K., Sivalingam, K.M., Kumar, A.: On reducing delay in mobile data collection based wireless sensor networks. Wirel. Netw. 19(3), 285–299 (2013)

    Article  Google Scholar 

  8. Salarian, H., Chin, K., Naghdy, F.: An energy-efficient mobile-sink path selection strategy for wireless sensor networks. IEEE Trans. Veh. Technol. 63(5), 2407–2419 (2014)

    Article  Google Scholar 

  9. Tashtarian, F., Yaghmaee, M., Sohraby, K., Effati, S.: ODT: optimal deadline-based trajectory for mobile sinks in WSN: a decision tree and dynamic programming approach. Comput. Netw. 77(2), 128–143 (2015)

    Article  Google Scholar 

  10. Liu, L., Bin, H., Lian, L.: Algorithms for energy efficient mobile object tracking in wireless sensor networks. Clust. Comput. 13(2), 181–197 (2010)

    Article  Google Scholar 

  11. Liu, W., Lu, K., Wang, J., Xing, G., Huang, L.: Performance analysis of wireless sensor networks with mobile sinks. IEEE Trans. Veh. Technol. 61(6), 2777–2788 (2012)

    Article  Google Scholar 

  12. Yun, Y., Xia, Y., Behdani, B., Smith, J.: Distributed algorithm for lifetime maximization in a delay-tolerant wireless sensor network with a mobile sink. IEEE Trans. Mob. Comput. 12(10), 1920–1930 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Anna University, Chennai, India

    R. Yuvaraj

  2. CSE Department, St. Joseph’s College of Engineering, Chennai, India

    A. Chandrasekar & S. Jothi

Authors
  1. R. Yuvaraj
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. A. Chandrasekar
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. S. Jothi
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to R. Yuvaraj.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yuvaraj, R., Chandrasekar, A. & Jothi, S. Time orient LEAD based polling point selection algorithm for efficient data aggregation in wireless sensor networks. Cluster Comput 22 (Suppl 2), 3339–3346 (2019). https://doi.org/10.1007/s10586-018-2166-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-018-2166-3

Keywords