The routing techniques used in conventional packet radio networks are not suitable for dynamic multihop wireless networks because of their unique architecture. In this paper a new hierarchical multihop routing algorithm is introduced which balances the cost of location-update and path-finding operations by partitioning the terminals and mobile base stations to produce a virtual topology. Based on the virtual topology each network entity stores a fraction of the network topology information and maintains the routing efficiency. Finally, the performance of the hierarchical multihop routing algorithm is investigated through simulations.
No takes yet. Share an insight, caveat, or question.
Akyildiz et al. (2002) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: