Study of Routing Techniques in Hierarchical based Structures of Wireless Sensor Networks

Article Sidebar

View Abstract PDF download PDF View PDF
DOI https://doi.org/10.18090//samriddhi.v11i02.12
Published Jul 19, 2019
DOI https://doi.org/10.18090//samriddhi.v11i02.12

Main Article Content

Varun K. Kakar
Department of Electronics & Communication, B.T.K.I.T, Dwarahat, India.
Parul Kansal
Department of Electronics & Communication, B.T.K.I.T, Dwarahat, India.

Abstract

In recent years, there is a huge availability of smaller, cheaper and intelligent sensors. These sensors are equipped with wireless interfaces to form a network. This network is well known as Wireless Sensor Network. The applications of wireless sensor networks comprise a wide variety of scenarios and in every scenario, the network composed of a significant number of nodes deployed in an extensive area. Routing techniques are in charge of discovering and maintaining the routes in the network. However, the appropriateness of a particular routing technique mainly depends on the capabilities of the nodes and network architecture to improve Network lifetime expectancy and energy efficiency of WSN. In particular, we systematically analyze routing in hierarchical based structures of WSN and compare these different hierarchical based approaches according to their energy efficiency and network lifetime.

Downloads

Download data is not yet available.

Article Details

How to Cite
Kakar, V., & Kansal, P. (2019). Study of Routing Techniques in Hierarchical based Structures of Wireless Sensor Networks. SAMRIDDHI : A Journal of Physical Sciences, Engineering and Technology, 11(02), 172-175. https://doi.org/10.18090//samriddhi.v11i02.12
Issue
Vol 11 No 02 (2019): SAMRIDDHI: A Journal of Physical Sciences, Engineering and Technology
Section
Research Article

References

[1] J. Yick, B. Mukherjee, D. Ghosal. (2008). Wireless Sensor Network Survey. Proceedings Elsevier Journal Computer Networks 52, 2292–2330.
[2] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci. (2002). A survey on sensor networks. IEEE Commun. Mag. 40 (8), 102-114.
[3] Luis Javier GarcíaVillalba, Ana Lucila Sandoval Orozco, Alicia Triviño Cabrera and Cláudia JacyBarenco Abbas. (2009). Routing Protocols in Wireless Sensor Networks. Sensors, 9, 8399-8421. doi:10.3390/s91108399.
[4] D. Kumar, T.C. Aseri, R.B. Patel. (2011). EECDA: Energy Efficient Clustering and Data Aggregation Protocol for Heterogeneous Wireless Sensor Networks. Int. J. of Computers, Communications & Control, Vol. VI, No. 1 (March), pp. 113-124.
[5] Satish Kumar Nalluri, Venkata Krishna Bharadwaj Parasaram. (2019). Software-Centric Automation Frameworks Integrating AI and Cybersecurity Principles. International Journal of Engineering Science & Humanities, 9(1), 30–40. Retrieved from https://www.ijesh.com/j/article/view/539
[6] K. Akkaya, M. Demirbas, R.S. Aygun. (2008). The Impact of Data Aggregation on the Performance of Wireless Sensor Networks. Wiley Wireless Commun. Mobile Comput. Journal. 8, 171–193.
[7] W. Heinzelman, A. Chandrakasan, H. Balakrishnan. (2000). Energy- efficient communication protocol for wireless microsensor networks. System Sciences. Proceedings of the 33rd Annual Hawaii International Conference. IEEE.
[8] S. Lindsey and C. S. Raghavendra. (2002). PEGASIS: Power- efficient gathering in sensor information systems. IEEE Aerospace Conference.
[9] K. T. Kim, C. H. Lyu, S. S. Moon, and H. Y. Youn. (2010). Tree-based clustering (TBC) for energy efficient wireless sensor networks. The IEEE 24th International Conference on Advanced Information Networking and Applications Workshops. pp. 680–685.
[10] Xu, Y.; Heidemann, J.; Estrin, D. (2001). Geography-informed Energy Conservation for Ad Hoc Routing. Proceedings of the Seventh Annual International Conference on Mobile Computing and Networking (MOBICOM), pp. 70–84.
[11] P. Lohan and R. Chauhan. (2012). Geography-informed sleep scheduled and chaining based energy efficient data routing in WSN. IEEE Students Conference on Electrical, Electronics and Computer Science. pp. 1–4.