An Autonomous Clustering-Based Hierarchical Multicast Routing for Mobile Ad Hoc Networks
スポンサーリンク
概要
- 論文の詳細を見る
This paper discusses multicast routing in ad hoc networks. In multicast routing, a node delivers the same message to the other nodes within a multicast group along with a multicast tree. Since nodes are moving around in ad hoc networks, the links between the nodes change frequently. However, the multicast tree must be maintained to deliver the messages regardless of the link changes. This paper gives a description of an autonomous clustering-based hierarchical multicast routing protocol in ad hoc networks. Since the autonomous clustering scheme is adaptive to the node movement, the proposed multicast routing can maintain the multicast tree in despite of link changes. This paper shows the effectiveness of autonomous clustering-based hierarchical multicast routing from the point of view of adaptability to link changes and scalability to multicast members.
- 社団法人電子情報通信学会の論文
- 2005-12-01
著者
-
Ohta Tomoyuki
Hiroshima City Univ. Hiroshima‐shi Jpn
-
Ohta Tomoyuki
Graduate School Of Information Sciences Hiroshima City University
-
Ohta Tomoyuki
Faculty Of Information Sciences Hiroshima City University
-
Kakuda Yoshiaki
Hiroshima City Univ. Hiroshima‐shi Jpn
-
Kakuda Yoshiaki
Faculty Of Engineering Science Osaka University
-
Ohta Tomoyuki
Graduate School Of Information Science Hiroshima City University
-
Kawaguchi Toshifumi
Faculty Of Information Sciences Hiroshima City University:(present Address)canon Inc.
関連論文
- A Dynamic Index Allocation Scheme for Data Retrieval and Provision in Peer-to-Peer Networks
- A Hierarchical Geographical Routing with Alternative Paths Using Autonomous Clustering for Mobile Ad Hoc Networks
- New Safety Support System for Children on School Routes Using Mobile Ad Hoc Networks
- Service Discovery Using Self-Regulating Agents in Ad Hoc Networks
- Service Discovery Using Self-Regulating Agents in Ad Hoc Networks
- Service Discovery Using Self-Regulating Agents in Ad Hoc Networks
- Service Discovery Using Self-Regulating Agents in Ad Hoc Networks
- Development of a Topology Controllable Testing Environment for Mobile Ad Hoc Network Software
- An Adaptive Multihop Clustering Scheme for Ad Hoc Networks with High Mobility
- An Equivalent Division Method for Reducing Test Cases in State Transition Testing of MANET Protocols
- Automated Synthesis of Protocol Specifications from Service Specifications with Parallelly Executable Multiple Primitives (Special Section on Net Theory and Its Applications)
- Testing for High Assurance System by FSM(Testing)(Assurance Systems and Networks)
- A New Conformance Testing Technique for Localization of Multiple Faults in Communication Protocols
- Reconfiguration Algorithm for Modular Redundant Linear Array
- A Hierarchical Routing Protocol Based on Autonomous Clustering in Ad Hoc Networks
- A Class of Hierarchical Routing Protocols Based on Autonomous Clustering for Large Mobile Ad Hoc Networks
- New Safety Support System for Children on School Routes Using Mobile Ad Hoc Networks
- Improvement of Dependability against Node Capture Attacks for Wireless Sensor Networks
- A Hierarchical Geographical Routing with Alternative Paths Using Autonomous Clustering for Mobile Ad Hoc Networks
- A Hybrid Greedy Routing with Location Information for Mobile Ad Hoc Networks
- Synthesis of Protocol Specifications for Design of Responsive Protocols (Special Issue on Responsive Computer Systems)
- An Autonomous Clustering-Based Hierarchical Multicast Routing for Mobile Ad Hoc Networks
- Extended-model Based testing by Using Directed Chinese Postman Problem
- On the Complexity of Protocol Validation Problems for Protocols with Bounded Capacity Channels (Special Section on Discrete Mathematics and Its Applications)
- IEICE/IEEE Joint Special Issue on Assurance Systems and Networks
- Route-Split Routing Resilient to Simultaneous Failure for Mobile Ad Hoc Networks
- A Hierarchical Multicast Routing Using Inter-Cluster Group Mesh Structure for Mobile Ad Hoc Networks
- A Distributed Routing Protocol for Finding Two Node-Disjoint Paths in Computer Networks (Special Issue on Distributed Processing for Controlling Telecommunications Systems)
- Effective Automated Testing for Graphical Objects(テスト技法・保守技術)
- FOREWORD