• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권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.

• 한국인터넷방송통신학회논문지
• /
• 제8권5호
• /
• pp.173-179
• /
• 2008

애드 혹 네트워크는 인프라스트럭쳐를 가지지 않는 멀티 홉의 무선 모바일 노드들로 구성된다. 모바일 애드 혹 네트워크상의 노드들의 이동성 때문에 네트워크의 토폴로지는 빈번히 변화한다. 이러한 환경에서 멀티캐스트 프로토콜은 멀티 홉 경로 생성 및 대역폭 제한이라는 문제에 직면하게 된다. 많은 멀티캐스트 라우팅 프로토콜들이 이미 제안되었다. 우리는 두 가지 애드 훅 멀티캐스트 라우팅 프로토콜 - Serial Multiple Disjoint Tree Multicast Routing Protocol(Serial MDTRP)와 Adaptive Core Multicast Routing Protocol(ACMRP)의 성능을 비교분석하였다. 비교분석에 사용된 시뮬레이션툴은 GloMoSim을 사용하였다.

• International Journal of Computer Science & Network Security
• /
• 제21권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권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.

• 대한전자공학회논문지TE
• /
• 제37권3호
• /
• pp.93-103
• /
• 2000

본 논문은 MPLS (Multiprotocol Label Switiching) 망에서 인터넷 멀티캐스트 라우팅 프로토콜을 지원하기 위한 방안을 제시한다. 인터넷 멀티캐스트 라우팅 프로토콜은 트리의 구성방식과 속성에 따라 최단거리 트리 방식, 공유트리 방식 및 복합트리 방식 등으로 분류된다. 각 방식에 따라 MPLS 망에서 지원해야 하는 기능이 달라진다. 특히, 단/양방향성 트리 링크, Flooding/prune 방식의 트리 구성, 하나의 멀티캐스트 그룹 에 다중 트리의 존재 등 여러 가지 미해결이거나 해결하기 어려운 문제점들이 존재한다. 본 논문에서는 몇가지 가정을 세우고, 이를 바탕으로 각 멀티캐스트 라우팅 프로토콜을 MPLS 망에서 지원하기 위한 방안을 제시한다. Flooding/prune 방식의 멀티캐스트 라우팅 프로토콜에 대해서는 새로이 브로드 캐스팅용의 레이블 을 정의하여 해결하고, 공유트리 방식에 대해서는 기 제안된 블록기반 멀티캐스트 전송기법을 도입하여 셀인터리빙 (Cell Interleaving) 문제를 해결하며, 마지막으로 복합트리 방식에 대해서는 기존 멀티캐스트 라우팅 프로토콜에 기능을 추가하므로써 MPLS 지원문제를 간단히 해결한다.

• 정보처리학회논문지C
• /
• 제10C권1호
• /
• pp.77-86
• /
• 2003

본 논문은 MPLS(Multiprotocol Label Swtiching) 망에서 인터넷 멀티캐스트 라우팅 프로토콜을 지원하기 위한 방안을 제시한다. 인터넷 멀티캐스트 라우팅 프로토콜은 트리의 구성방식과 속성에 따라 최단거리트리 방식, 공유트리 방식 및 복합트리 방식 등으로 분류된다. 각 방식에 따라 MPLS 망에서 지원해야 하는 기능이 달라진다. 특히, 단/양방향성 트리 링크, Flooding/Prune 방식의 트리 구성, 하나의 멀티캐스트 그룹에 다중 트리의 존재 등 여러 가지 미해결이거나 해결하기 어려운 문제점들이 존재한다. 본 논문에서는 몇가지 가정을 세우고, 이를 바탕으로 각 멀티캐스트 라우팅 프로토콜을 MPLS 망에서 지원하기 위한 방안을 제시한다. Flooding/Prune 방식의 멀티캐스트 라우팅 프로토콜에 대해서는 새로이 브로드캐스팅용의 레이블을 정의하여 해결하고, 공유트리 방식에 대해서는 기 제안된 블록기반 멀티캐스트 전송기법을 도입하여 셀 인터리빙(Call Interleaving) 문제를 해결하며, 마지막으로 복합트리 방식에 대해서는 기존 멀티캐스트 라우팅 프로토콜에 수정된 SPT 전환 기능을 추가하므로써 MPLS 지원문제를 해결한다. 제안하는 방법이 기존의 방법보다 비교해 보았을 때 전송지연에서 우수한 성능을 보임을 모의 실험을 통해서 확인하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 I
• /
• pp.133-136
• /
• 2003

In this paper, we propose a multicast routing protocol for the seamless delivery of multicast data to mobile hosts through the optimal route in IP based mobile networks. The proposed multicast routing protocol is a hybrid method employing the merits of the bi-directional tunneling and the remote subscription by considering the mobility of mobile hosts. The proposed protocol satisfies the bound of end-to-end delay and supports the seamless handoff. The simulation results show that the proposed protocol has better performance in the number of multicast tree reconstruction and tunneling length and packet loss time than the previous protocols.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.613-619
• /
• 2014

Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.

• ETRI Journal
• /
• 제33권3호
• /
• pp.355-365
• /
• 2011

IPTV broadcast channels and video content distribution are increasingly saturating network paths. New solutions based on inter-domain multicast protocols could contribute to the enhancement of multimedia content distribution over the Internet. The aim of this paper is to propose new capabilities for an existing inter-domain multicast protocol, the Protocol Independent Multicast-Sparse Mode. We describe the modified protocol and analyze its behavior using newly developed tools based on an open-source software simulator. The resulting protocol does not require topology information, which is advantageous for easier deployment. In addition, the adopted solution avoids inherent problems with inter-domain multicast routing, such as multiple paths and path asymmetries.

• Journal of Communications and Networks
• /
• 제9권3호
• /
• pp.296-311
• /
• 2007

Mobile multi-robot teams are useful in many critical applications such as search and rescue. Explicit communication among robots in such mobile multi-robot teams is useful for the coordination of such teams as well as exchanging data. Since many applications for mobile robots involve scenarios in which communication infrastructure may be damaged or unavailable, mobile robot teams frequently need to communicate with each other via ad hoc networking. In such scenarios, low-overhead and energy-efficient routing protocols for delivering messages among robots are a key requirement. Two important primitives for communication are essential for enabling a wide variety of mobile robot applications. First, unicast communication (between two robots) needs to be provided to enable coordination and data exchange. Second, in many applications, group communication is required for flexible control, organization, and management of the mobile robots. Multicast provides a bandwidth-efficient communication method between a source and a group of robots. In this paper, we first propose and evaluate two unicast routing protocols tailored for use in ad hoc networks formed by mobile multi-robot teams: Mobile robot distance vector (MRDV) and mobile robot source routing (MRSR). Both protocols exploit the unique mobility characteristics of mobile robot networks to perform efficient routing. Our simulation study show that both MRDV and MRSR incur lower overhead while operating in mobile robot networks when compared to traditional mobile ad hoc network routing protocols such as DSR and AODV. We then propose and evaluate an efficient multicast protocol mobile robot mesh multicast (MRMM) for deployment in mobile robot networks. MRMM exploits the fact that mobile robots know what velocity they are instructed to move at and for what distance in building a long lifetime sparse mesh for group communication that is more efficient. Our results show that MRMM provides an efficient group communication mechanism that can potentially be used in many mobile robot application scenarios.