Exploiting Common Nodes in Overlapped Clusters for Path Optimization in Wireless Sensor Networks

  • Devendra Rao BV
  • D. Vasumathi
  • Satyanarayana V. Nandury
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 381)

Abstract

For operational efficiency, most WSNs employ clustering approach where the cluster head is responsible for finding the shortest path to the sink for all of its cluster nodes. While clustering, it is a common observation that the clusters often tend to overlap, and hence nodes in the overlap region are capable of communicating directly with neighboring nodes within one hop distance. However, traditionally the nodes belonging to one cluster are prohibited from making overtures with other nodes outside its cluster. A common node exploitation (CNE) approach is proposed that deviates from this traditional approach and paves a methodology to exploit the proximity of the common nodes to the other nodes. Two algorithms are developed based on CNE approach for location aware, randomly deployed WSNs to find alternate, shorter, and optimized path to the sink. Simulations performed have shown that the CNE approach outperforms traditional approaches.

Keywords

Cluster overlap Common nodes Latency Path optimization WSN 

References

  1. 1.
    Irfan, A.-A., Melike, E.-K., Hussein, Mouftah, T.: A traffic adaptive inter CH delay control scheme in WSNs. IEEE 910–915 (2013)Google Scholar
  2. 2.
    Low, C.P., Fang, C., Ng, J.M., Ang, Y.H.: Load-balanced clustering algorithms for wireless sensor networks. In: ICC IEEE 2007 Proceedings, pp. 3485–3490. IEEE (2007)Google Scholar
  3. 3.
    Ying, L., Qi, H., Li, W.: Load-balanced clustering algorithm with distributed self-organization for wireless sensor networks. IEEE 1498–1506 (2012)Google Scholar
  4. 4.
    Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-efficient protocol for wireless micro sensor networks. In: Proceedings of the 33rd Hawaii International Conference on System Sciences—2000. IEEE (2000)Google Scholar
  5. 5.
    Israr, N., Awan, I.: Coverage based inter cluster communication for load balancing in wireless sensor networks. In: 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW-2007). IEEE (2007)Google Scholar
  6. 6.
    Beldjehem, M.: Towards a multi-hop multi-path fault-tolerant and load balancing hierarchical routing protocol for wireless sensor network. Wireless Sens. Netw. 5, 215–222 (2013)Google Scholar
  7. 7.
    Al-Anbagi, I., Erol-Kantarci, M., Hussein, Mouftah, T.: QoS-aware inter-CH scheduling in WSNs for high data rate smart grid applications. IEEE 2628–2634 (2013)Google Scholar
  8. 8.
    Tufail, A.: Reliable latency-aware routing for clustered WSNs. Int. J. Distrib. Sens. Netw. 2012, Article ID 681273Google Scholar
  9. 9.
    Liu, X.: A survey on clustering routing protocols in wireless sensor networks. Sensors 12, 11113–11153 (2012)Google Scholar
  10. 10.
    Finding Distances Based on Latitude and Longitude Using Haversine Formula: http://andrew.hedges.name/experiments/haversine/
  11. 11.
    Venkataraman, G., Emmanuel, S., Thambipillai, S.: DASCA: a degree and size based clustering approach for wireless sensor networks. IEEE 508–512 (2005)Google Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  • Devendra Rao BV
    • 1
  • D. Vasumathi
    • 2
  • Satyanarayana V. Nandury
    • 1
  1. 1.CSIR-Indian Institute of Chemical TechnologyHyderabadIndia
  2. 2.Department of CSECEH, Jawaharlal Nehru Tech. UniversityHyderabadIndia

Personalised recommendations