ComHRP : A hierarchical routing protocol in dynamic sensor networks

Sensor node has node ID for identity on sensor network. ID assignment is a principle technique for hierarchical routing. However, as conventional hierarchical routing methods do not consider end-nodes, those only can support a simple path search. Therefore, those are not adequate in dynamic sensor network environments. In this paper, we propose ComHRP (complement HRP) that inherits advantages of conventional methods. We also present address assignment and search techniques according to ComHRP. Network organizations can be simplified with ComHRP thereby mitigating the complexity of networks. Moreover, network reassignment, which is unpredictable by the nature of ubiquitous sensor networks, can be efficiently processed.