Tree Routing Protocol for Supporting the Optimal Routing Path in IP-USN
Kiwoong Kwon, Daeyoung Kim, Seong-Hoon Kim, Tae‐Hong Kim, Minkeun Ha · 2012
Various routing protocols for supporting an optimal route and a lightweight protocol are suggested in IP-USN area. However, HiLow and RPL based on hierarchical routing have a problem of inefficient routing hop counts because a packet detours through the root node for a destination and LOAD based on on-demand routing causes a problem to generate plenty of control packets for discovering a route and consume memory resources for storing a routing table. In order to solve these problems, this paper suggests JP-based Shortcut Tree Routing Protocol (ISTRP) that can reduce routing hop counts and route management overheads at the same time. ISTRP can reduce routing hop counts because it forwards a packet to the node having lowest remaining hop counts among neighbors instead of forwarding the packet to a parent node or a child node. It can also reduce route management overheads because it determines a route toward a destination through its hierarchical address. In this paper, performance evaluation shows that ISTRP provides routing hop counts reduced 40% in comparison to HiLow and usage of memory resource and control packets reduced 15% and 55% in comparison to LOAD, respectively. In addition, we verified that ISTRP can be adapted in IP-USN by implementing it in IP-USN platform named SNAIL.