Title :
A routing problem on ad-hoc networks and graph theory
Author :
Sengoku, Mitsuhiro ; Tamura, H. ; Mase, Kenichi ; Shinodu, S.
Author_Institution :
Fac. of Eng., Niigata Univ., Japan
Abstract :
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
Keywords :
graph theory; mobile radio; packet radio networks; telecommunication network routing; telecommunication services; ad-hoc networks; channel assignment; coloring algorithms; graph theory; information delivery problem; mobile communication service; network theory; routing problem; Ad hoc networks; Computational geometry; Graph theory; Mobile communication; Mobile computing; Network theory (graphs); Personal communication networks; Routing; Terminology; Tree graphs;
Conference_Titel :
Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-6394-9
DOI :
10.1109/ICCT.2000.890988
