Algorithm of creating routing table for WSNs

  • Authors:

  • Binwei Deng;Guangming Huang

  • Affiliations:

  • Dept. Electronics and Information Engineering, Huazhong Normal University, Wuhan, China and Dept. Electronics and Information Engineering, Huangshi Institute of Technology, Huangshi, China;Dept. Electronics and Information Engineering, Huazhong Normal University, Wuhan, China

  • Venue:
  • WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Wireless Sensor Networks (WSNs) have drawn the attention of the research community in the last few years, driven by a wealth of theoretical and practical challenges. In general, most of the applications have dense sensor deployment and low bandwidth demands, and are usually delay tolerant in WSNs. Therefore, the spatial and temporal correlation and event-to-sink along with nature of the WSNs is characterized. Therefore, the design of routing table of WSNs node is the basis of the study of simulating routing protocol, and range-free location and so on. In this paper we present the algorithm of creating routing table based on classical RIP (Routing information Protocol) and the features of nodes communication in WSNs are investigated. In order to validate our proposed algorithm, DV-Hop based on the information of routing table being created by our algorithm is simulated in MATLAB. The experiment results illustrate that our algorithm is valid.