• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.196-197
• /
• 2007

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2409-2424
• /
• 1997

Multicasting to mobile hosts(MHs) based on broadeasting results in overloaded unnecessary messages in case of th number of recipient MHs is relatively small compared with that of nodes in a network. In this paper we propose an improved multicast protocol in which messages are selectively flooded only to the (radio) cells within some distance from the cells where destination MHs reside most recently, so that the number of unnecessary messages carried in broadcasting is reduced. Detailed procedures for the protocol are provided and protocol properties are proven.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.307-309
• /
• 2001

In this paper, we present a scheme for the improving reliable transport and the efficient multicast support in mobile environment. The proposed scheme solves a problem of TCP layer resulted from mobility by using a Representative FA. RFA has a mechanism like a snoop module which has a cache and can provide retransmission of a multicast packet lost and solve the rock implosion problem. Also, we present an additional IGMP message. By using it, We can remove a delay for IGMP query cycle and serve a multicast service more promptly.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.01a
• /
• pp.355-356
• /
• 2014

기존의 MANET 환경에서 동작하는 계층화된 데이터 전송 프로토콜은 각 계층이 독립적인 기능을 수행하기 때문에 노드의 이동 상황에 따라 변하는 네트워크 환경을 잘 반영하지 못하고 있다. 본 논문에서는 라우팅 계층과 MAC 계층 간의 상호 작용을 통하여 MANET의 2-홉 거리에 있는 노드 수를 반영하여 더 우수한 성능을 나타내는 Cross-Layer 모델 기반의 브로트캐스트 기법을 제안한다. 본 논문에서 제안하는 Cross-Layer 모델은 IEEE 802.11 MAC 프로토콜을 수정하여 이동 노드 주위의 상태에 따라 브로드캐스트 패킷을 적응적으로 전송하도록 동작한다.

• Journal of KIISE:Information Networking
• /
• v.33 no.4
• /
• pp.289-298
• /
• 2006

Algorithms for application-level multicast often use trees to deliver data from the source to the multiple receivers. With the tree structure, the throughput experienced by the descendant nodes will be determined by the performance of the slowest ancestor node. Furthermore, the failure of an ancestor node results in the suspension of the session of all the descendant nodes. This paper focuses on the transmission of data using multiple virtual forwarders, and suggests a scheme to overcome the drawbacks of the plain tree-based application layer multicast schemes. The proposed scheme elects multiple forwarders other than the parent node of the delivery tree. A receiver receives data from the multiple forwarders as well as the parent node and it can increase the amount of receiving data per time unit. The multiple forwarder helps a receiver to reduce the impact of the failure of an ancestor node. The proposed scheme suggests the forwarder selection algorithm to avoid the receipt of duplicate packets. We implemented the proposed scheme using MACEDON which provides a development environment for application layer multicast. We compared the proposed scheme with Bullet by applying the implementation in PlanetLab which is a global overlay network. The evaluation results show that the proposed scheme enhanced the throughput by 20 % and reduced the control overhead over 90 % compared with Bullet.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.4
• /
• pp.53-64
• /
• 2009

Inter-vehicular communication that propagates information without infrastructures has drawn a lot of interest. However, it is difficult to apply conventional ad-hoc routing protocols directly in inter-vehicular communication due to frequent changes in the network topology caused by high mobility of the vehicles. MMFP(Multi-hop MAC Forwarding) is a unicast forwarding protocol that transport packets based on the reachability information instead of path selection or position information. However, delivering public safety messages informing road conditions such as collision, obstacles and fog through inter-vehicular communication requires broadcast rather than unicast since these messages contain information valuable to most drivers within a close proximity. Flooding is one of the simplest methods for multi-hop broadcast, but it suffers from reduced packet delivery-ratio and high transmission delay due to an excessive number of duplicated packets. This paper presents two multi-hop broadcast protocols for inter-vehicular communication that extend the MMFP. UMHB(Unreliable Multi-Hop Broadcast) mitigates the duplicated packets of MMFP by limiting the number of nodes to rebroadcast packets. UMHB, however, still suffers from low delivery ratio. RMHB(Reliable Multi-Hop Broadcast) uses acknowledgement and retransmission in order to improve the reliability of UMHB at the cost of increase in transmission delay, which we show through simulation is within an acceptable range for collision avoidance application.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.567-569
• /
• 2000

무선 Ad-hoc 네트워크는 어떠한 하부구조와 중앙관리의 도움 없이 임시 네트워크를 구성하는 무선 이동 호스트들의 집합이다. Ad-hoc 네트워크에도 오디오/비디오 등의 컨퍼런스가 열릴 수 있으며, 이때 다중의 호스트에 데이터를 전달하는 멀티캐스트 작업이 필요하다. Ad-hoc 네트워크에서는 네트워크 토폴로지의 동적인 변화로 인하여 전송경로가 변동되는 문제가 발생될 수 있다. 따라서 기존의 유선 네트워크에서 사용하던 트리 구축방법을 사용할 수 없다. 이러한 문제를 미리 예측하기 위하여 게이트웨이 호스트들의 이동성을 단계별로 분류한 것과 결합도를 전송하여 트리를 구축함으로써 호스트들의 이동에 따른 트리상의 경로가 끊어질 확률을 줄여 트리 재구축으로 소모되는 시간과 경비를 줄일 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.865-875
• /
• 2008

In this paper, we propose a reliable multicast scheme for the tactical wireless ad hoc network where the members share the situation and operation data. Our scheme consists of two phases to guarantee the reliability. During the dissemination phase, we utilizes an epidemic approach similar to gossip-based ad hoc routing. Then the group members interchange the message reception state information periodically so that they are able to recover missing packets from the other members. We evaluate the performance of our scheme through extensive simulations using the network simulator in comparison with other existing reliable multicast schemes in mobile ad hoc network. Our scheme shows higher packet delivery ratio regardless of the mobility and imposes much lower control overhead to the non-group members compared with the existing schemes.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.131-137
• /
• 2000

The communication and collaboration of mobile agents are efficient in doing information processing in the Internet. Therefore, this paper proposes an efficient communication mechanism that support to inter-agent communications and collaborations. For the remark mentioned above, a mobile agent system provides an indirect meeting mechanism as well as an extended information pool, which has an effect on decreasing network bandwidth. In addition, some proposed communication methods can support to message multicasting so that those are effectively adapted for a model of group agent. Finally, the proposed mechanism is implemented and analyzed in the MAS, a mobile agent system model developed by the Java language.