• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11B
• /
• pp.772-783
• /
• 2005

In this paper, we propose an effective multicasting protocol in wireless ad-hoc networks. Conventional wired and wireless network multicast protocols do not perform well in wireless ad hoc networks because they were designed without consideration of ad hoc environments such as node mobility, limited bandwidth, high error probability. To solve this problem, some multicasting protocols for ad hoc network have been proposed in the literature. However, these protocols can not provide high packet delivery ratio, low control packet overhead and low expended bandwidth at the same time. Therefore, in this paper, we propose RTMA that improves multicasting performance in wireless ad hoc networks. RTMA calculates its current region from its position information by using GPS in order to make tree among the multicast group nodes in the same region. The proposed region-based tree method is for high packet delivery ratio, low control packet overhead when many senders send data packets. RTMA makes a reliable tree by using speed information to fill a gap of the weak points of the tree structure. When searching the routing path, RTMA selects the reliable path excluding high speed nodes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.229-240
• /
• 2012

The development of multimedia applications followed by development of high-speed networks has improved the performance of mobile devices with high transfer speed broadband. Mobile internet access has made possible seamless indoor and outdoor mobile multicast services. Multicasting services are used to support efficient group communications. However, mobile multicasting services have two constraints: tunnel convergence and handover latency. Many protocols and handover methods have been proposed to address these problems. The inter-LMA optimized handover model for multicasting services has previously been proposed for PMIPv6-based networks. The proposed model removes the tunnel convergence issue and reduces router processing costs. It also makes possible the performance of fast handover operations with adaptive transmission mechanisms. In addition, the proposed scheme exhibits low packet delivery costs and handover latency in comparison with existing schemes, and ensures fast handover when moving the inter-LMA domain

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1602-1608
• /
• 2013

PoC (Push-to-Talk over Cellular) provides one-to-one as well as one-to-many communications with VoIP technology based on SIP over cellular networks. According to above property, PoC is considered as perscrptive technology for public protection for disaster relief networks. For this networks, group communication is the essential function. However, since current standardization process takes into general scenarios account without any consideration for mentioned networks, it have some problems in the point of adaptability. To solve above problem, in this paper, we propose how to reduce the overhead on the PoC server to reduce the transmission delay. Simulation results are shown to evaluate the improved performance.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.671-680
• /
• 1998

Network services, such as teleconferencing, remote diagnostics and education, and CSCW require multicasting. Multicast routing methods can be divided into two categories. One is the shortest path tree method and the other is the minimal Steiner tree method. The latter has an advantage over the former in that only one Steiner tree is needed for a group. However, finding a minimal Steiner tree is an NP-complete problem and it is necessary to find an efficient heuristic algorithm. In this paper, we present an evolutionary optimization method for finding minimal Steiner trees without sacrificing too much computational efforts. In particular, we describe a tree-based genetic encoding scheme which is in sharp constast with binary string representations usually adopted in convetional genetic algorithms. Experiments have been performed to show that the presented method can find optimal Steiner trees for given vetwork configurations. Comparitivie studies have shown that the evolutionary method finds on average a better solution than other conventional heustric algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1050-1061
• /
• 2009

The Tactical Internet(TI) managed by Infantry Brigades is used for the purpose of sharing information of Command Control and Situation Awareness. When there are more than two destinations to transmit data in the TI system, a multicasting is utilized based on pre-defined multicast groups. However even in the case when a source node needs to send some messages like weathercast and attack alarm etc to only a part of Battalion or Brigades in a specific geographical region (destination region), the current TI multicasting protocol is designed to transmit the messages to the pre-defined group or all of the Battalion/Brigade nodes, resulting in inefficiency in terms of end-to-end delay and overhead. In this paper, we propose more efficient protocol for such cases, named as "Tactical Internet Geocasting (TIG)". The proposed scheme firstly checks whether the destination region belongs to one Battalion region or more than two Battalion regions using location information, and then performs a greedy forwarding from the source node to the destination region, followed by a local flooding inside of the destination region. With performance analysis and simulations using NS-2, TIG is compared to the current TI multicasting protocol (i.e., Simplified MDP) and the LBM (Location-based Multicast). The simulation results show that the proposed TIG is more efficient than both in terms of delay and network overhead.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.397-405
• /
• 1995

In order to operate the automatic devices of manufacturing process more efficiently and to solve the needs of the resource sharing,network technology is applied to the unit control devices located in common manufacturing zone and operated by connecting them.In this paper,functional standard of the network operation layer is set as MAP standard application layer of MMS(manufacturing message standard)for the cell or group,which is suggested by CIM (computer integrated manufacturing) standardization as common manufacturing zone.MMS is composed of abstract message which is not consider specific devices.Then,specific message standard must be defined to operate MMS.It is designed as VMD (virtual manufacturing device)objects which are abstract objects to perform group management based on the companion standard.Also they are operated in the group management model system.Group management operation takes multicast communication method which is the communication from single source to the multiple sinks, and the group management system and unit control devices are performed as VMD and real device mapping.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.103-105
• /
• 2005

본 논문은 오버레이 멀티캐스트 기반에서 유무선 서비스를 위한 적등적 키관리 기법을 제안한다. IP 멀티캐스트의 라우터 기능을 어플리케이션에서 처리하고, 적응적인 그룹관리를 위해서 유니캐스트와 멀티캐스트의 두가지 통신기법으로 그룹키를 분배한다. 또한, 안전한 그룹키 관리를 위해 멤버의 그룹 가입과 탈퇴시에 키의 갱신을 수행하며, 주기적인 메시지 교환으로 멤버의 상태를 체크하여 비정상적인 그룹탈퇴의 경우에도 동적인 키의 갱신을 통하여 forward secrecy 와 backward secrecy의 보안적 요구사항을 충족시킨다. 그룹키는 갱신된 키의 분배를 우선적으로 하였으며, 대칭키를 이용한 암호화 기법과 이전의 그룹키를 사용하는 두 가지의 기법을 적응적으로 사용하는 기법에 대해서 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.441-443
• /
• 1998

본 논문은 유무선 환경에서 ATM 멀티캐스트 서비스를 제공하기위한 방안으로서{{{{ { SM}^{2 }A }}}} 를 제안한다. 기존의ATM 멀티캐스트 서비스는 ATM자체의 제약으로 멀티캐스트 서비스가 제한적이며 비효율적이다. 한편, ATM의 중용한 응용으로서 인터넷서비스를 심각하게 고려해야하는데 {{{{ { SM}^{2 }A }}}}는 특히 인터넷 서비스를 제공하는데 적합한 구조를 갖도록 설계되었다.{{{{ { SM}^{2 }A }}}}는 기본적으로 양방향성 공유트리방식인 CBT(Core Based Tree)구조를 갖되 각 지역망 (Regional Network)에서 자체적인 코어스위치( Core Switch)를 보유함으로써 결과적으로 다중 코어 구조를 갖는다. 각 지역망을 잇기 위하여 PNNI 프로토콜을 이용하며 PGL(Peer Group Leader)에 가상 루트(Virtual Root) 및 가상 리프(Virtual Leaf)의 개념을 새로 도입한다. 멀티캐스트 통신의 경우 가장 문제되는 것이 셀끼워넣기(Interleaving)문제인데.{{{{ { SM}^{2 }A }}}}에서는 ITU-T표준 ATC(ATM Transfer Capability)인 ABT/IT(ATM Block Transfer/Immediate Transmission)

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.12
• /
• pp.1127-1136
• /
• 2004

This paper proposes a novel multicasting algorithm, called ANMAS (Ad hoc Network Multicasting with Ant System), for Mobile Ad hoc Network (MANET). The algorithm utilizes the indirect communication method of the ants via 'pheromone' to effectively obtain dynamical topology change information, generating safer multicasting paths, and adapts the well-known CBT (Core Based Tree) multicasting algorithm into the ANMAS framework with proper modificiations to make 'tolerable' multicasting group in the MANET environment. We show the efficiency and the effectiveness of ANMAS via simulation studies.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11a
• /
• pp.140-143
• /
• 2003

최근 인터넷의 급속한 발전은 다양한 서비스를 창출하였으며, 모든 사용자에게 제공되던 브로드 캐스팅적 서비스에서 일부 사용자만을 위한 여러 가지 새로운 서비스로 변화하고 있다. 새로운 형태의 서비스의 경우 그룹 형태의 사용자들의 안전성을 보장하면서 효율적인 관리 구조에 대한 연구보다는 그룹의 서비스의 효율성에 목적을 두어 사용자의 프라이버시 침해에 대한 논란을 야기 시키고 있다. 따라서 본 논문에서는 기존의 멀티캐스팅 그룹 설정에 기반한 LBT 트리에 그룹 네트워크가 설정 될 경우 그룹원들간의 안전성을 제공하면서 관리의 효율성과 확장성 갖는 관리 방식을 제안하고자 한다. 제안 방식은 LBT트리의 특징을 그대로 유지하면서 기존 방식에서의 안전성에 대한 취약점을 보완하여 보다 안전하고 효율적인 방식을 제안하였다.