A routing problem on ad-hoc networks and graph theory

The demand for communication services is rapidly increasing, because the mobile communication service is synonymous with an ideal communication style realizing communication anytime, anywhere and with anyone. There exist various problems to which graph and network theory is applicable in mobile communication services. For example, it is well known that coloring algorithms of graphs are applicable in channel assignment algorithms in cellular systems. We introduce a graph theoretical approach for an information delivery problem in ad-hoc networks.