HASR: Structured Routing in Mobile Grid

Abstract

Considering heterogeneity of mobile grid, structured routing protocol (HASR) is presented. Firstly it takes heterogeneity into account from point of coarse-grained view. All nodes are divided into general nodes and agent nodes. Agent nodes constitute kernel overlay network which performs routing function. Secondly HASR takes heterogeneity of agent nodes into account from point of fine-grained view. Parameter level is used to represent the ability of agent node. Newly joined node should take full account of node level when constructing its routing table. So node with higher level will undertake more forwarding tasks in routing process. Like some classical routing protocols, kernel overlay routing protocol of HASR has O(log <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> N) routing table size and routing efficiency is also O(log <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> N). While general nodes only maintain agent nodes information, implementing routing function between them through kernel overlay network. Simulation results show that node with higher ability has more in-degree, which means more routing load it takes on.