| Presentation | 2005-07-21 Design of Ad hoc Multicast Routing Protocol Using Shortest Path Trees Tsutomu KOZAKA, Toshihiko KATO, Shuichi ITO, Yoshiyori URANO, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In recent years, an ad hoc network is paid to attention, and many routing protocols are studied actively not only for unicasting but also for multicasting. Most of existing multicast routing protocols adopt the shared tree based method that makes a specific core node work as the root node of multicast delivery tree. However, it is considered that the shortest path tree based method is more suitable for ad hoc networks, because the network scale is smaller than Internet and it is necessary to use the resource of wireless links effectively. On the other hand, ODMRP (On-Demand Multicast Routing Protocol), called mesh-based routing protocol, adopts the shortest path tree approach, but it has several problems, such that it does not support dynamic Join and Leave. In this paper, we propose a new ad hoc multicast routing protocol, which constructs the shortest path tree efficiently and guarantees the operation of Dense Mode such as the Broadcast & Prune and dynamic Join. This paper describes the result of designing our multicast routing protocol. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Ad hoc Network / Multicast / Shortest Path Tree |
| Paper # | NS2005-64 |
| Date of Issue |
| Conference Information | |
| Committee | NS |
|---|---|
| Conference Date | 2005/7/14(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 | Network Systems(NS) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Design of Ad hoc Multicast Routing Protocol Using Shortest Path Trees |
| Sub Title (in English) | |
| Keyword(1) | Ad hoc Network |
| Keyword(2) | Multicast |
| Keyword(3) | Shortest Path Tree |
| 1st Author's Name | Tsutomu KOZAKA |
| 1st Author's Affiliation | Graduate School of Information Systems, University of Electro-Communications() |
| 2nd Author's Name | Toshihiko KATO |
| 2nd Author's Affiliation | Graduate School of Information Systems, University of Electro-Communications |
| 3rd Author's Name | Shuichi ITO |
| 3rd Author's Affiliation | Graduate School of Information Systems, University of Electro-Communications |
| 4th Author's Name | Yoshiyori URANO |
| 4th Author's Affiliation | Graduate School of Global Information and Telecommunication Studies, Waseda University |
| Date | 2005-07-21 |
| Paper # | NS2005-64 |
| Volume (vol) | vol.105 |
| Number (no) | 195 |
| Page | pp.pp.- |
| #Pages | 4 |
| Date of Issue | |