Routing algorithms on wireless multihop networks and their modifications

Abstract

The demand for communication services is rapidly increasing, because the mobile communication service is synonymy of an ideal communication style realizing communication in anytime, anywhere and with anyone. The wireless multihop network system is the one of the important systems in the near future. There exist various problems to which graph theory is applicable in mobile communication services. In this paper, we formulate a routing problem, named information delivering problem, on wireless multihop networks using graph theory. We propose heuristic algorithms for the problem and modify the algorithms for efficient reuse of spectrum.