Package routing algorithms in mobile ad-hoc wireless networks

Abstract

A mobile ad-hoc network (MANET) is formed by a cluster of mobile stations randomly located within a certain area. Because of their low power, low bandwidth and mobility, routing in a MANET poses special challenges. In this paper, an efficient routing algorithm is discussed for MANETs. This routing algorithm has a small transmission delay and needs only a small and easy-to-update generation table for each station. In addition, the communication channels in the routing algorithm are dynamically assigned, which allows a large MANET to use a limited number of communication channels.