R-BU: recursive binding update for route optimization in nested mobile networks

This paper proposes recursive binding update (R-BU) that optimizes routing for nested mobile networks. Nested mobile network is a hierarchical form of mobile networks, e.g. a wireless personal area network (PAN) in a vehicular network. A mobile network moves as a single unit with one or more mobile routers that connect it to the global Internet. Nested mobile networks have pinball routing problem with hierarchical mobile routers. This problem becomes more serious in the case of macro mobility as the routing distance becomes longer. To solve the pinball routing problem of nested mobile networks, we propose routing optimization scheme called R-BU based on recursive binding update. R-BU maintains optimal route to the destination by updating its binding recursively. R-BU requires no changes in existing mobile IP except binding update operation. By using R-BU, correspondent nodes can maintain optimal route to their destinations after some convergent time. R-BU reduces pinball routing cost and the reduction is more useful as the degree of nesting becomes deeper and the distance between the home agents of a mobile router and its parent/child mobile routers becomes longer.