Dynamic Time Bounded Hierarchical Routing Based On Neighbour Node Density In Wireless Sensor Networks

Authors

  • A.K. Ashfauk Ahamed Assistant Professor (Sr. Gr), Department of Computer Applications, B.S. Abdur Rahman Crescent Institute of Science and Technology, Chennai
  • Ramachandran A Associate Professor, Department of Computer Science and Engineering, Saveetha Engineering College, Thandalam, Chennai.
  • R.Alarmelu Mangai Assistant Professor, Department of Computer Science and Applications, New Prince Shri Bhavani Arts and Science College, Chennai.
  • R Srividhya Assistant Professor, Department of Computer Science, Dr G R Damodaran College of Science, Coimbatore – 641014
  • P Edith Linda Assistant Professor, Department of Computer Science, Dr G R Damodaran College of Science, Coimbatore – 641014

Keywords:

Wireless Sensor network, neighbour Density, Route Discovery, probabilistic rebroadcast, routing overhead.

Abstract

Wireless Sensor Networks (WSN) employed for high data communications among the nodes, there exist regular data link breakages due to regular path failures and route identification. In a route identification, data broadcasting is a significant and crucial data propagation approach, where a node frequently rebroadcasts the data through the alternate path on basis of the vector of received route reply packet to the route request packets until intermediate route selected for the data propagation to base station. Periodic rebroadcast of the route request and route reply packet leads to broadcast storm challenges. In this article, dynamic time bounded hierarchical routing protocol is designed and simulated as probabilistic rebroadcast function on basis of obtaining the signal coverage ratio of the neighbour node to source node in order to reduce the routing overhead in WSN. Further Route signal Strength factor, node processing speed has been obtained on the neighbour signal coverage ratio to mention the node density for path adaptation. On aggregating node signal coverage ratio and route Strength factor can be calculated easily towards path switching with appropriate rebroadcast probability ratio. Particular approach aggregates the benefits of the neighbour density information and its probabilistic node computation approach to significantly minimize the number of data retransmissions through implementation of mobility re-segmenting technique. This technique is capable of reducing the routing overhead and increasing the the routing performance in terms of managing the transmission delay. Simulation analysis of the proposed protocol is carried out in NS2 Simulator and it is found out performing on performance measure of delay on compared with state of art approaches.

Downloads

Published

2023-10-25

How to Cite

A.K. Ashfauk Ahamed, Ramachandran A, R.Alarmelu Mangai, R Srividhya, & P Edith Linda. (2023). Dynamic Time Bounded Hierarchical Routing Based On Neighbour Node Density In Wireless Sensor Networks. Chinese Journal of Computational Mechanics, (5), 588–593. Retrieved from http://jslxxb.cn/index.php/jslxxb/article/view/4403

Issue

Section

Articles