Routing algorithms on wireless multihop networks and their modifications

Author

Tamura, Hiroshi ; Moriyama, Toshiyuhi ; Matsumoto, Naoyuki ; Sengoku, Mitsuhiro ; Mase, Kenichi ; Shinoda, Shoji

Author_Institution

Niigata Inst. of Technol., Kashiwazaki, Japan

Volume

4

fYear

2001

fDate

6-9 May 2001

Firstpage

874

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

Keywords

frequency allocation; graph theory; mobile radio; radio networks; telecommunication network routing; telecommunication services; graph theory; heuristic routing algorithm; information delivery; mobile communication service; spectrum re-use; wireless multihop network; Communications technology; Computational geometry; Graph theory; Heuristic algorithms; Mobile communication; Network theory (graphs); Personal communication networks; Routing; Spread spectrum communication; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on

Conference_Location

Sydney, NSW

Print_ISBN

0-7803-6685-9

Type

conf

DOI

10.1109/ISCAS.2001.922377

Filename

922377