A Proposal of B-Tree Based Routing Algorithm for Monitoring Systems with Regular Movements in MANETs

Routing Protocols in MANETs have been researched for peer-to-peer services in general. Furthermore, these protocols have been concerned with the fairness service amongst nodes’ peers. However, most of those protocols aren’t suitable for the data communication especially in hierarchical networks, where the most data flows are vertical like a monitoring system. Furthermore, for the monitoring system, amongst the nodes, one of them (a.k.a. root node) should be employed as a gateway to connect to Internet. Thus, most reporting data from certain nodes are delivered to the root node. Likewise, data should be delivered to the message originator nodes for responsibility. Therefore, a new routing protocol for such networks including the monitoring system is strongly required. This paper proposes a routing protocol based on the binary-tree shaped network, which derives from the general table driven methods’ routing manners with DSDV families of MANETs. In conclusion, we verify whether our protocol would be efficiently used in such networks through its performance evaluations with simulation results.