• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.13-19
• /
• 2008

A mobile ad-hoc network routing protocols for transmission of multimedia contents need to have low delay time and to maintain the established route because it should secure quality of service(QoS) of the network. In this paper, the proposed protocol, termed HODMRP (History-based On-Demand Multicast Routing Protocol), is enhanced On-Demand Multicast Routing Protocol (ODMRP) by adding the criterion which is the session history for establishing route. The characteristic of this protocol is that data can be transmitted using the redundant route which is already selected by session history, if it occurs that the route is broken, HODMRP have better Packet Delivery Ratio (PDR) value and lower delay time than ODMRP by the simulation results.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1108-1119
• /
• 2015

Multicast communication of mobile ad hoc networks is vulnerable to internal attacks due to its routing structure and high scalability of its participants. Though existing intrusion detection systems (IDSs) act smartly to defend against attack strategies, adversaries also accordingly update their attacking plans intelligently so as to intervene in successful defending schemes. In our work, we present a novel indirect internal stealthy attack on a tree-based multicast routing protocol. Such an indirect stealthy attack intelligently makes neighbor nodes drop their routing-layer unicast control packets instead of processing or forwarding them. The adversary targets the collision avoidance mechanism of the Medium Access Control (MAC) protocol to indirectly affect the routing layer process. Simulation results show the success of this attacking strategy over the existing "stealthy attack in wireless ad hoc networks: detection and countermeasure (SADEC)" detection system. We design a cross-layer automata-based stealthy attack on multicast routing protocols (SAMRP) attacker detection system to identify and isolate the proposed attacker. NS-2 simulation and analytical results show the efficient performance, against an indirect internal stealthy attack, of SAMRP over the existing SADEC and BLM attacker detection systems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.6
• /
• pp.771-781
• /
• 1999

오늘날의 컴퓨팅 환경은 통신 네트워크의 복잡성과 다양한 멀티미디어 서비스 처리를 위해 객체지향 기술을 분산 시스템에 도입하고 통신망을 소프트웨어 계층적 모델로 구조화한 개방형 정보 통신망 구조 연구가 활발히 진행되고 있다. 본 논문은 분산환경에서 멀티미디어 스트림 데이타를 전송하기 위한 아키텍쳐에 관한 모델의 설계 및 구현에 관한 것으로 분산 환경에서 멀티미디어 스트림 데이타를 효율적으로 전송할 수 있는 구조를 제시하고 있다. 설계한 구조는 Point-to-Point와 멀티캐스트를 지원하며 컴퓨터 통신망에서 멀티캐스트 연결을 효율적으로 관리하고 추후 기능 확장 및 기능 변경이 용이하도록 모듈화하고 유연성을 가지는 연결 관리 구조를 설계하고 구현하였다. 신호기능은 CORBA(Common Object Request Broker Architecture)의 ORB를 이용하여 실현하였으며, 데이타 전송 기능은 TCP/IP연결을 이용하였다. 이렇게 신호처리 부분과 데이타 전송 부분을 독립적으로 만들어서 하부망 기술에 독립적인 연결 관리 구조를 채택하고 있으므로 향후 다른 환경에서도 신호처리 부분을 그대로 적용할 수 있다. 분산 객체 개념을 적용하여 연결 관리 기능을 분산 객체화 하였으며 각 분산 객체간 인터페이스를 OMG(Object Management Group) IDL(Interface Definition Language)로 정의함으로써 유연성을 갖도록 하였다.AbstractThis paper proposes communication service architecture to support dynamic communication configuration and multiple connection management which are required to handle a variety of multimedia multicast application. Our communication service architecture was designed to fulfil the objectives as the following:- To build a common networking system for various multimedia multicast services- To build a platform for rapid service development and provisioning- To provide service networking independent on transport network technologiesWe implemented communication service architecture based on Common Object Request Broker Architecture (CORBA) for multimedia multicast applications. Our communication service architecture is distributed and object-oriented for extensibility and easy modification. The interfaces between the distributed objects are specified in (Object Management Group) OMGs Interface Definition Language.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2231-2252
• /
• 2012

With the prevalence of diverse services-oriented applications, such as IPTV systems and on-line games, the current underlying communication networks face more and more challenges on the aspects of flexibility and adaptability. Therefore, an effective and efficient multicast routing mechanism, which can fulfill different requirements of different personalized services, is critical and significant. In this paper, we first define the neighbor gradient, which is calculated based on the weighted sum of attributes such as residual link capacity, normalized hop count, etc. Then two distributed multicast routing algorithms which are neighbor Gradient-based Multicast Routing for Static multicast membership (GMR-S) and neighbor Gradient-based Multicast Routing for Dynamic multicast membership (GMR-D), are proposed. GMR-S is suitable for static membership situation, while GMR-D can be used for the dynamic membership network environment. Experimental results demonstrate the effectiveness and efficiency of our proposed methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.248-256
• /
• 2002

In this paper, new multicast scheduling algorithms are proposed for the WDM single－hop broadcast－and－select networks. The existing multicast scheduling algorithms do not concerned the previous state of receivers, but the proposed method call H－EAR and PGM that partition a multicast group to subgroups using the tunable transmitter, state information of receivers, and pseudo group concept. the performance of proposed algorithms are evaluated through the computer simulation. They show the better Performance comparing with the existing multicast scheduling algorithm.

• The Journal of Society for e-Business Studies
• /
• v.7 no.1
• /
• pp.66-74
• /
• 2002

Through the increment of requirement for EC(Electronic Commerce) oriented communication services, security multicast communications is becoming more important. However, multicast to EC environment is much different from unicast concept most network security protocols. On the network security, using mandatory access control of multilevel architecture which assigns a specific meaning to each subject, so we accomplish access control. In this way, access control security based on the information security level is proposed. A security protocol based on the architecture proposed in this paper would be utilized in security multicast communications, group key management service and leveled security service through multilevel EC security policy, Also we discuss and propose the security level scaleability and key management method on the network.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.165-168
• /
• 2000

Since the IP multicast was proposed, there have been many research works on reliable multicast protocols［1］. In multicast communication, many reliable multicast schemes were studied in order to overcome packet losses in the network. However the fact that packets are lost in the underlying networks but the solutions are sought in the end hosts makes the search for solutions difficult. If routers can identify packets before dropped from congestion, the routers can initiate recovery process. recovery scheme by routers is proposed. This scheme is much faster than by sender-initiated or receiver-initiated recovery and latency is smaller.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.6
• /
• pp.265-278
• /
• 2013

With the recent advancements in various wireless communication technologies, the importance of mobile multicasting is coming to the fore, in an effort to use network resources more efficiently. In the past, when various mobile IP-based multicast techniques were proposed, the focus was put on the costs needed for network delivery for providing multicast services, as well as on minimizing the multicast handover delay. For techniques using MIPv6 (Mobile IPv6), a host-based mobility management protocol, however, it is fundamentally difficult to resolve the problems of handover delay and tunnel convergence. To resolve these problems, a network-based mobility management protocol called PMIPv6 (Proxy Mobile IPv6) was standardized. Although performance is improved in PMIPv6 over MIPv6, it still suffers from the problems of handover delay and tunnel convergence. In this paper, to overcome these limitations, a technique called LFH (Low-cost and Fast Handoff) is proposed for fast and low-cost mobility management with multicasting support in PMIPv6 networks. To reduce the interactions between the complex multicast routing protocol and the multicast messages, a simplified proxy method called MLD (Multicast Listener Discovery) is implemented and modified. Furthermore, a TCR (Tunnel Combination and Reconstruction) algorithm was used in the multicast handover procedure within the LMA (Local Mobility Anchor) domain, as well as in the multicast handover procedure between domains, in order to overcome the problem of tunnel convergence. As a result, it was found that LFH has reduced multicast delay compared to other types of multicast techniques, and that it requires lower costs as well.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.12 no.3
• /
• pp.75-85
• /
• 2016

MANET is a network composed only mobile network having limited resources and has dynamic topology characteristics. Therefore, every mobile node acts as a route and delivers data by using multi-hop method. In particular, group communication such as multicast is desperately needed because of characteristics such as battery life of limited wireless bandwidth and mobile nodes. However, the multicast technique can have different efficient of data transmission according to configuring method of a virtual topology by the movement of the nodes and the performance of a multicast can be significantly degraded. In this paper, the region based security multicast technique is proposed in order to increase the efficiency of data transmission by maintaining an optimal path and enhance the security features in data transmission. The group management node that manages the state information of the member nodes after the whole network is separated to area for efficient management of multicast member nodes is used. Member node encrypts using member key for secure data transmission and the security features are strengthened by sending the data after encrypted using group key in group management node. The superiority of the proposed technique in this paper was confirmed through experiments.

• Journal of Korea Multimedia Society
• /
• v.2 no.2
• /
• pp.184-194
• /
• 1999

We present a new algorithm to minimize channel contention while sending multiple messages from multiple source to overlapped destination set on Multistage Interconnection Network (MIN) which supports wormhole routed turnaround routing. The multicast tree of the U-MIN(Unicast MIN) algorithm is useful in performing messages from one source to multiple destination but gives rise to a serious channel connection in performing multiple multicast because it has been designed for only single multicast. For multiple multicast communication on MIN, we address how to implement multiple multicast services efficiently. And a SPU-MIN(Source Partitioned Unicast MIN) algorithm is proposed and shown to be superior than the U-MIN algorithm for multiple multicast. The turnaround routing algorithm based on wormhole routing technique is employed as a message sending method.