The Experts below are selected from a list of 5943 Experts worldwide ranked by ideXlab platform

Ruay Shiung Chang - One of the best experts on this subject based on the ideXlab platform.

  • A weight-based clustering Multicast Routing Protocol for mobile ad hoc networks
    International Journal of Internet Protocol Technology, 2005
    Co-Authors: Chun-chieh Huang, Ming-huang Guo, Ruay Shiung Chang
    Abstract:

    In mobile ad hoc networks, the mobile nodes can move arbitrarily without any centralised management mechanism. The topology of these networks can be very dynamic due to the mobility of mobile nodes. Under such changeable network topology, Multicasting in mobile ad hoc networks is more challenging than in the internet. In this paper, we propose a new Multicast Routing Protocol, named weight-based clustering Multicast Routing Protocol (WCMRP), for mobile ad hoc networks. The goal of this work is to improve Multicasting performance in mobile ad hoc networks by efficient use of the available knowledge of the network. Simulation results show our Protocol can reduce the overhead and packet losses compared to the On-demand Multicast Routing Protocol (ODMRP).

  • Weight-based clustering Multicast Routing Protocol for mobile ad hoc networks
    2003 IEEE Wireless Communications and Networking 2003. WCNC 2003., 2003
    Co-Authors: Chun-chieh Huang, Ruay Shiung Chang, Ming-huang Guo
    Abstract:

    In this paper, we propose a new Multicast Routing Protocol, named weight-based clustering Multicast Protocol (WCMP), for mobile ad hoc networks. The goal of this work is to improve Multicasting performance in ad hoc networks by efficient use of the available knowledge of the networks.

  • A Self‐Adaptive Load Balanced Internet Multicast Routing Protocol
    European Transactions on Telecommunications, 1999
    Co-Authors: Jhyda Lin, Ruay Shiung Chang
    Abstract:

    The prevailing Internet has brought many novel network applications. These applications often involve the interactions among multiple members in a single session. For example, the images and voices of the lecturer in distance learning must be transmitted to multiple destinations at the same time on demand. The status and opinions of any participant should also be transmitted to each other in a video conferencing for the interactivity of conversations. Without suitable Protocol supports from the underlying networks, these applications may be costly and infeasible. One of the important Protocol supports is the capability of Multicasting, sending a single data packet to a set of receivers that are members of a Multicast group. In the past, there are four well-known Internet Multicast Routing Protocols: DVMRP (Distance Vector Multicast Routing Protocol), MOSPF (Multicast extensions to Open Shortest Path First), CBT (Core-Based Tree), and PIM (Protocol Independent Multicast). In this paper, based on PIM, we propose a new Multicast Routing Protocol called SEAL-PIM (SElf-Adaptive and Load balanced PIM). The new Protocol reduces the PIM message and resource overhead and balances the traffic load in the network by rearranging the links of Routing and the locations of the group rendezvous points to adapt to the current distribution of group members. Finally, simulations are done to compare our algorithm with the original PIM scheme. The results indicate that the performance improvement is good.

Ming-huang Guo - One of the best experts on this subject based on the ideXlab platform.

  • A weight-based clustering Multicast Routing Protocol for mobile ad hoc networks
    International Journal of Internet Protocol Technology, 2005
    Co-Authors: Chun-chieh Huang, Ming-huang Guo, Ruay Shiung Chang
    Abstract:

    In mobile ad hoc networks, the mobile nodes can move arbitrarily without any centralised management mechanism. The topology of these networks can be very dynamic due to the mobility of mobile nodes. Under such changeable network topology, Multicasting in mobile ad hoc networks is more challenging than in the internet. In this paper, we propose a new Multicast Routing Protocol, named weight-based clustering Multicast Routing Protocol (WCMRP), for mobile ad hoc networks. The goal of this work is to improve Multicasting performance in mobile ad hoc networks by efficient use of the available knowledge of the network. Simulation results show our Protocol can reduce the overhead and packet losses compared to the On-demand Multicast Routing Protocol (ODMRP).

  • Weight-based clustering Multicast Routing Protocol for mobile ad hoc networks
    2003 IEEE Wireless Communications and Networking 2003. WCNC 2003., 2003
    Co-Authors: Chun-chieh Huang, Ruay Shiung Chang, Ming-huang Guo
    Abstract:

    In this paper, we propose a new Multicast Routing Protocol, named weight-based clustering Multicast Protocol (WCMP), for mobile ad hoc networks. The goal of this work is to improve Multicasting performance in ad hoc networks by efficient use of the available knowledge of the networks.

Chun-chieh Huang - One of the best experts on this subject based on the ideXlab platform.

  • A weight-based clustering Multicast Routing Protocol for mobile ad hoc networks
    International Journal of Internet Protocol Technology, 2005
    Co-Authors: Chun-chieh Huang, Ming-huang Guo, Ruay Shiung Chang
    Abstract:

    In mobile ad hoc networks, the mobile nodes can move arbitrarily without any centralised management mechanism. The topology of these networks can be very dynamic due to the mobility of mobile nodes. Under such changeable network topology, Multicasting in mobile ad hoc networks is more challenging than in the internet. In this paper, we propose a new Multicast Routing Protocol, named weight-based clustering Multicast Routing Protocol (WCMRP), for mobile ad hoc networks. The goal of this work is to improve Multicasting performance in mobile ad hoc networks by efficient use of the available knowledge of the network. Simulation results show our Protocol can reduce the overhead and packet losses compared to the On-demand Multicast Routing Protocol (ODMRP).

  • Weight-based clustering Multicast Routing Protocol for mobile ad hoc networks
    2003 IEEE Wireless Communications and Networking 2003. WCNC 2003., 2003
    Co-Authors: Chun-chieh Huang, Ruay Shiung Chang, Ming-huang Guo
    Abstract:

    In this paper, we propose a new Multicast Routing Protocol, named weight-based clustering Multicast Protocol (WCMP), for mobile ad hoc networks. The goal of this work is to improve Multicasting performance in ad hoc networks by efficient use of the available knowledge of the networks.

Mario Gerla - One of the best experts on this subject based on the ideXlab platform.

  • On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks
    2015
    Co-Authors: Mario Gerla, Axel Verdiere
    Abstract:

    The On-Demand Multicast Routing Protocol (ODMRP) is a Multicast Routing Protocol designed for ad hoc networks with mobile hosts. ODMRP is a mesh-based, rather than a conventional tree-based, Multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the Multicast packets via scoped flooding). It applies on- demand procedures to dynamically build routes and maintain Multicast group membership, without relying on pre-existing unicast Routing Protocols. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently and rapidly, and power is constrained.

  • On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks
    Mobile Networks and Applications, 2002
    Co-Authors: William Su, Mario Gerla
    Abstract:

    An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and Multicasting Protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile ad hoc networks. ODMRP is a mesh-based, rather than a conventional tree-based, Multicast scheme and uses a forwarding group concept; only a subset of nodes forwards the Multicast packets via scoped flooding. It applies on-demand procedures to dynamically build routes and maintain Multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP performance with other Multicast Protocols proposed for ad hoc networks via extensive and detailed simulation.

  • exploiting the unicast functionality of the on demand Multicast Routing Protocol
    Wireless Communications and Networking Conference, 2000
    Co-Authors: Sungju Lee, Mario Gerla
    Abstract:

    An ad hoc wireless network is composed of mobile hosts without any wired infrastructure support. In mobile ad hoc networks, unicast and Multicast Routing Protocols are faced with the challenge of producing multihop routes because of limited radio propagation range. In addition, Routing Protocols must manage mobility and be bandwidth and power efficient. The on-demand Multicast Routing Protocol (ODMRP) is a Protocol designed for ad hoc networks with Multicast purposes. Two unique features of ODMRP are its unicast capability and its utilization of a mobility prediction scheme to perform reRouting in anticipation of route disconnection. We describe ODMRP unicast Routing functionality and assess the mobility prediction effectiveness and efficiency. We evaluate the ODMRP performance via detailed simulation and compare it with other ad hoc Routing schemes.

  • on demand Multicast Routing Protocol
    Wireless Communications and Networking Conference, 1999
    Co-Authors: Sungju Lee, Mario Gerla, Chingchuan Chiang
    Abstract:

    This paper presents a novel Multicast Routing Protocol for mobile ad hoc wireless networks. The Protocol, termed ODMRP (on-demand Multicast Routing Protocol), is a mesh-based, rather than a conventional tree-based Multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the Multicast packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain Multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP's scalability and performance via simulation.

  • WCNC - On-demand Multicast Routing Protocol
    WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466), 1
    Co-Authors: Sungju Lee, Mario Gerla, Chingchuan Chiang
    Abstract:

    This paper presents a novel Multicast Routing Protocol for mobile ad hoc wireless networks. The Protocol, termed ODMRP (on-demand Multicast Routing Protocol), is a mesh-based, rather than a conventional tree-based Multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the Multicast packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain Multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP's scalability and performance via simulation.

Yuval Shavitt - One of the best experts on this subject based on the ideXlab platform.

  • somr a scalable distributed qos Multicast Routing Protocol
    Journal of Parallel and Distributed Computing, 2008
    Co-Authors: Shigang Chen, Yuval Shavitt
    Abstract:

    Many Internet Multicast applications such as teleconferencing and remote diagnosis have Quality-of-Service (QoS) requirements. The requirements can be additive (end-to-end delay), multiplicative (loss rate), or of a bottleneck nature (bandwidth). Given such diverse requirements, it is a challenging task to build QoS-constrained Multicast trees in a large network where no global network state is available. This paper proposes a scalable QoS Multicast Routing Protocol (SoMR) that supports all three QoS requirement types. SoMR is scalable due to small communication overhead. It achieves favorable tradeoff between Routing performance and Routing overhead by carefully selecting the network sub-graph in which it searches for a path that can support the QoS requirements. The scope of search is automatically tuned based on the current network conditions. An early-warning mechanism helps detect and route around the long-delay paths in the network. The operations of SoMR are completely decentralized. They rely only on the local state stored at each router.

  • a scalable distributed qos Multicast Routing Protocol
    International Conference on Communications, 2004
    Co-Authors: Shigang Chen, Yuval Shavitt
    Abstract:

    Many Internet Multicast applications such as teleconferencing and remote diagnosis have quality-of-service (QoS) requirements. It is a challenging task to build QoS constrained Multicast trees with high performance, high success ratio, low overhead, and low system requirements. This paper presents a new scalable QoS Multicast Routing Protocol (SoMR) that has very small communication overhead and requires no state outside the Multicast tree. SoMR achieves the favorable tradeoff between Routing performance and overhead by carefully selecting the network sub-graph in which it conducts the search for a path that can support the QoS requirement, and by auto-tuning the selection according to the current network conditions. Its early-warning mechanism helps to detect and route around the real bottlenecks in the network, which increases the chance of finding feasible paths for additive QoS requirements. SoMR minimizes the system requirements; it relies only on the local state stored at each router. The Routing operations are completely decentralized.

  • A QoS-aware Multicast Routing Protocol
    IEEE Journal on Selected Areas in Communications, 2000
    Co-Authors: Shigang Chen, Klara Nahrstedt, Yuval Shavitt
    Abstract:

    The future Internet is expected to support Multicast applications with quality of service (QoS) requirements. To facilitate this, QoS Multicast Routing Protocols are pivotal in enabling new receivers to join a Multicast group. However, current Routing Protocols are either too restrictive in their search for a feasible path between a new receiver and the Multicast tree, or burden the network with excessive overhead. We propose QMRP, a new QoS-aware Multicast Routing Protocol. QMRP achieves scalability by significantly reducing the communication overhead of constructing a Multicast tree, yet it retains a high chance of success. This is achieved by switching between single-path Routing and multiple-path Routing according to the current network conditions. The high level design of QMRP makes it operable on top of any unicast Routing algorithm in both intradomain and interdomain. Its responsiveness is improved by using a termination mechanism which detects the failure as well as the success of Routing without the use of timeout. In addition, QMRP always constructs loop-free Multicast trees.

  • INFOCOM - A QoS-aware Multicast Routing Protocol
    Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Socie, 1
    Co-Authors: Shigang Chen, Klara Nahrstedt, Yuval Shavitt
    Abstract:

    The future Internet is expected to support Multicast applications with quality of service (QoS) requirements. To facilitate this, QoS Multicast Routing Protocols are pivotal in enabling new receivers to join a Multicast group. However, current Routing Protocols are either too restrictive in their search for a feasible path between a new receiver and the Multicast tree, or burden the network with excessive overhead. We propose QMRP, a new Qos-aware Multicast Routing Protocol. QMRP achieves scalability by significantly reducing the communication overhead in constructing a Multicast tree, yet it retains a high chance of success. This is achieved by switching between single-path Routing and multiple-path Routing according to the current network conditions. The high-level design of QMRP makes it operable on top of any unicast Routing algorithm both intra-domain and inter-domain. Its responsiveness is improved by using a termination mechanism which detects the failure as well as the success of Routing without the use of timeout. In addition, QMRP always constructs loop-free Multicast trees.