Presentation 2000/4/20
Ad-hoc networks and the theory of graphs and networks
Hiroshi TAMURA, Kenichi MASE, Masakazu SENGOKU, Shoji SHINODA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In the last two or three decades, graph/network theory and its applications have attained astonishing proportions. Even mobile communications field, the many research results are obtained. In this report, we consider a broadcast routing problem on ad-hoc networks. In case of PHS(personal handy-phone system), each mobile hosts sends a information to only one host in each step. On the above condition, we propose an optimal routing algorithm on tree-like networks using graph theoretical methods and we propose some heuristic routing algorithms on networks.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) ad-hoc networks / graph theory / routing / matching problem
Paper # IN2000-6,MVE2000-6
Date of Issue

Conference Information
Committee MVE
Conference Date 2000/4/20(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Media Experience and Virtual Environment (MVE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Ad-hoc networks and the theory of graphs and networks
Sub Title (in English)
Keyword(1) ad-hoc networks
Keyword(2) graph theory
Keyword(3) routing
Keyword(4) matching problem
1st Author's Name Hiroshi TAMURA
1st Author's Affiliation Dept.of Information and Electronics Engineering, Niigata Institute of Technology()
2nd Author's Name Kenichi MASE
2nd Author's Affiliation Faculty of Engineering, Niigata University
3rd Author's Name Masakazu SENGOKU
3rd Author's Affiliation Faculty of Engineering, Niigata University
4th Author's Name Shoji SHINODA
4th Author's Affiliation Faculty of Science and Engineering, Chuo University
Date 2000/4/20
Paper # IN2000-6,MVE2000-6
Volume (vol) vol.100
Number (no) 18
Page pp.pp.-
#Pages 6
Date of Issue