• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.741-762
• /
• 2011

Recently, multicast routing protocols become increasingly important aspect in Mobile Ad hoc Networks (MANETs), as they effectively manage group communications. Meanwhile, multimedia and real-time applications are becoming essential need for users of MANET. Thus it is necessary to design efficient and effective Quality of Service (QoS) multicast routing strategies. In this paper, we address the scalability problem of multicast routing protocols to support QoS over MANETs. In particular, we introduce a Position-Based QoS Multicast Routing Protocol (PBQMRP). Basically, the protocol based on dividing the network area into virtual hexagonal cells. Then, the location information is exploited to perform efficient and scalable route discovery. In comparison with other existing QoS multicast routing protocols, PBQMRP incurs less control packets by eliminating network flooding behavior. Through simulation, the efficiency and scalability of PBQMRP are evaluated and compared with the well-known On-Demand Multicast Routing Protocol (ODMRP). Simulation results justify that our protocol has better performance, less control overhead and higher scalability.

• Journal of Korea Multimedia Society
• /
• v.8 no.1
• /
• pp.62-70
• /
• 2005

In this paper, we present an architecture for supporting QoS multicast routing in mobile ad-hoc networks. The proposed architecture consists of three parts as follows. The first part is a mobility-based clustering as underlying structure for supporting stable multicast services. In the second part, a framework which can support and evaluate the stability of route and network for supporting QoS routing is presented. In the third part, we describe a method which uses two structures of the first and second parts for supporting QoS multicast routing services. The performance evaluation of our proposed architecture is accomplished via modeling and simulation using the Optimized Network Engineering tool(OPNET).

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.116-122
• /
• 2006

Most of the multimedia applications require strict quality of service (QoS) guarantee during the communication between a single source and multiple destinations. This gives rise to the need for an efficient QoS multicast routing strategy. Determination of such QoS-based optimal multicast routes basically leads to a multi-objective optimization problem, which is computationally intractable in polynomial time due to the uncertainty of resources in Internet. This paper describes a network model for researching the routing problem and proposes a new multicast tree selection algorithm based on genetic algorithms to simultaneously optimize multiple QoS parameters. The paper mainly presents a QoS multicast routing algorithm based on genetic algorithm (QMRGA). The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or near-optimal solution within few iterations, even for the networks environment with uncertain parameters. The incremental rate of computational cost can close to polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated using simulations. The simulation results show that this approach has fast convergence speed and high reliability. It can meet the real-time requirement in multimedia communication networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1586-1605
• /
• 2012

With the prevalence of multimedia applications and the potential commercial usage of Mobile Ad hoc Networks (MANETs) in group communications, Quality of Service (QoS) support became a key requirement. Recently, some researchers studied QoS multicast issues in MANETs. Most of the existing QoS multicast routing protocols are designed with flat topology and small networks in mind. In this paper, we investigate the scalability problem of these routing protocols. In particular, a Position-Based QoS Multicast Routing Protocol (PBQMRP) has been developed. PBQMRP builds a source multicast tree guided by the geographic information of the mobile nodes, which helps in achieving more efficient multicast delivery. This protocol depends on the location information of the multicast members which is obtained using a location service algorithm. A virtual backbone structure has been proposed to perform this location service with minimum overhead and this structure is utilized to provide efficient packet transmissions in a dynamic mobile Ad hoc network environment. The performance of PBQMRP is evaluated by performing both quantitative analysis and extensive simulations. The results show that the used virtual clustering is very useful in improving scalability and outperforms other clustering schemes. Compared to On-Demand Multicast Routing Protocol (ODMRP), PBQMRP achieves competing packet delivery ratio and significantly lower control overhead.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.85-94
• /
• 2015

In this paper, an enhanced QoS multicast routing scheduling scheme is proposed to adapt to a dynamic mobile traffic condition for wireless mesh networks (WMNs). It handles the network QoS by controlling the delay constraints for multimedia applications. The group size will be controlled according to both the current network state and QoS requirements. The dynamic reconstruction of QoS multicast tree can be obtained from preprocessing with both the partial multicast routing scheme and the traffic estimation. Performance evaluation of the proposed scheme is carried out on randomly generated graph derived from the wireless mesh network, by choosing the optimal value related to the appropriate delay bounds. Simulation results show that the proposed scheme can improve the performance of QoS multicast routing for WMNs.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.5
• /
• pp.525-532
• /
• 2004

In this paper, we proposed a multicast routing algorithm for QoS improvement in the wire/wireless integrated environment. We analyzed requests and characteristics of QoS, and then proposed a new algorithm that can improve QoS by adding node mobility to wire environment. This new algorithm constructs a dynamic multicast tree that can prevent a loss of packet and save the bandwidth. As a result of simulations comparing to another multicast algorithms, we showed that this new algorithm can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.342-352
• /
• 2021

Multicast Routings is a big challenge due to limitations such as node power and bandwidth Mobile Ad-hoc Network (MANET). The path to be chosen from the source to the destination node requires protocols. Multicast protocols support group-oriented operations in a bandwidth-efficient way. While several protocols for multi-cast MANETs have been evolved, security remains a challenging problem. Consequently, MANET is required for high quality of service measures (QoS) such infrastructure and application to be identified. The goal of a MANETs QoS-aware protocol is to discover more optimal pathways between the network source/destination nodes and hence the QoS demands. It works by employing the optimization method to pick the route path with the emphasis on several QoS metrics. In this paper safe routing is guaranteed using the Secured Multicast Routing offered in MANET by utilizing the Ant Colony Optimization (ACO) technique to integrate the QOS-conscious route setup into the route selection. This implies that only the data transmission may select the way to meet the QoS limitations from source to destination. Furthermore, the track reliability is considered when selecting the best path between the source and destination nodes. For the optimization of the best path and its performance, the optimized algorithm called the micro artificial bee colony approach is chosen about the probabilistic ant routing technique.

• The Journal of the Korea Contents Association
• /
• v.4 no.1
• /
• pp.100-104
• /
• 2004

In this paper, we propose multicast routing algorithm to guarantee QoS in mobile computing environment. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that DQDMR can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.498-507
• /
• 2001

For the Internet multicast routing, there are some protocols researched. This paper presents a new protocol called DPIM (Delay-bounded PIM) to support QoS of delay in multicast routing. This protocol is based on PIM-SM. When the specified delay bound is not satisfied by dynamic membership, the RP (Rendezvous Point) of shared tree is changed and the shared tree is reconstructed. Therefore, the QoS of delay is always supported in this protocol. Through performance analysis and comparison with other protocol, we certify that this protocol is pertinent.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1112-1125
• /
• 1999

최근 들어 멀티미디어를 지원하는 응용들의 서비스 품질 보장과 멀티캐스트 지원에 대한 요구가 증가되고 있으나 기존의 멀티캐스트 프로토콜로는 이러한 요구를 수용할 수 없는 문제가 발생하고 있다. 현재 인터넷에서 사용되고 있는 라우팅 메커니즘은 네트워크 자원 정보나 세션의 QoS 요구사항을 고려하지 않고 단순히 종단간의 연결에만 초점을 맞추고 있기 때문이다. 따라서 본 논문에서는 멀티캐스트 환경에서 서비스 품질보장을 지원하기 위한 새로운 프로토콜, LayeredQoS을 제안한다. 다중의 CP (Central Point)를 채택하고 각각의 CP에 적절한 QoS 레벨을 부여하여 사용함으로써 대역폭의 공유정도를 높일 뿐만 아니라 전체 트리 비용을 감소시켜 궁극적으로 네트워크 처리량이 증가되도록 하였다. 또한 시뮬레이션 방법을 통하여 다른 프로토콜보다 나은 성능을 가지는 것으로 평가하였다.Abstract Many emerging multimedia applications often require a guaranteed quality of service and multicast connection. But the traditional multicast protocol can't meet the needs since the routing mechanisms deployed in today's Internet are focused on connectivity, not on resource availability in the network or QoS requirements of flows. In this paper, we present LayeredQoS, a new QoS-based multicast routing algorithm. We adopt the multiple CPs(Central Points) and allocate QoS-levels for each CP in order to improve the degree of resource sharing and decrease the total tree cost, and then network throughput is increased. The proposed protocol is verified by simulations and it is shown that the performance of LayeredQoS is much better than the existing protocols.