ユニバーサルアドホックネットワークにおける情報配信アルゴリズムのグラフ理論的考察
俊行 森山, 裕 田村, 憲一 間瀬 et al. · Institutional Repositories DataBase (IRDB) · 2000
An ad-hoc network is composed of mobile terminals with personal communication devices. Information in ad-hoc network is sent from a source to all terminals. We consider how to sent information in the minimum step. In this report, we uses Ad-hoc network by PHSs (Personal Handyphone System) as example of problem. First, we substitute a problem of graph theory for that problem, and we propose some heuristic algorithms for the problem. After that, proposed algorithms are evaluated by the computer simulation.
Cited by 0 works. Open-access PDF