• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.10 s.113
• /
• pp.985-992
• /
• 2006

The classic routing algorithms try to minimize the number of hops to reach a destination. In our DPC(Distributed Power Control) this hop-by-hop power level selection is also used to select the path guaranteeing low energy consumption. The main goal is to realize a dynamic protocol able to be aware of mobility and to automatically set security threshold in order to get the best performance in every situation. In conclusion, the simulation DPC has improved energy gain of the AMRIS routing algorithm at the narrow area, and ODMRP routing algorithm has improved energy gain at the wide area.

• 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 KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.620-632
• /
• 2004

IP is not suitable for mobile nodes by network-based routing because mobile nodes are dynamically change their network attachment point. Mobile-IP is an IETF standard providing continuous access to the Internet for mobile nodes, but it has the triangle routing problem. Also it has a performance degradation problem by massive packet loss during layer 3 handoff of mobile nodes. Especially, two IETF multicast support schemes for Mobile-IP do not guarantee the quality of realtime multimedia services because they have several problems such as long routing path, packet duplication(hi-directional tunneling) and massive packet loss(remote subscription). In this paper, we propose a lossless remote subscription scheme that guarantees the quality of realtime multimedia services over Mobile-IP. From the result of simulation, we verified that the proposed scheme in this paper can reduce the delay time of remote subscription by the effect of the low latency handoff scheme that is extended to apply to the multicast group management and it requires only 0.58% buffer spaces of the previously proposed lossless remote subscription scheme.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.95-104
• /
• 2007

Mobile multimedia services such as TV-call or video streaming are gradually becoming popular in the 3rd or more generation mobile network (IMT-2000). Multimedia traffic is expected to continue increasing into the coming years, and IP technology is considered to be the efficient way of transporting such huge volumes of multimedia traffic. IP-based IMT network platform represents an evolution from IMT-2000. The structure of IP-based IMT network as ubiquitous platform is three-layered model : Middleware including Network Control PlatForm (NCPF) and Service Support PlatForm (SSPF), IP-BackBone (IP-BB), access network including sensor network. Mobility Management (MM) architecture in NCPF is proposed for IP-based IMT network in order to manage routing information and location information separately. The generous existing method of multicast control in IP-based IMT network is Remote Subscription. But Remote Subscription has problem that should be reconstructed whole multicast tree when sender in multicast tree moves to another area. To solve this problem, we propose the way to put Multicast-manager in NCPF.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.377-386
• /
• 2003

This study suggested a technique to maintain an efficient core-based multicast tree using weighted clustering factors in mobile Ad-hoc networks. The biggest problem with the core-based multicast tree routing is to decide the position of core node. The distance of data transmission varies depending on the position of core node. The overhead's effect on the entire network is great according to the recomposition of the multicast tree due to the movement of core node, clustering is used. A core node from cluster head nodes on the multicast tree within core area whose weighted factor is the least is chosen as the head core node. Way that compose multicast tree by weighted clustering factors thus and propose keeping could know that transmission distance and control overhead according to position andmobility of core node improve than existent multicast way, and when select core node, mobility is less, and is near in center of network multicast tree could verification by simulation stabilizing that transmission distance is short.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.58-65
• /
• 2008

The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much attention by the advancement of network techniques to enforce routing in application-levels. In this paper, we verified the efficiency of Internet broadcasting through comparing latency time of TBCP with mOBCP that have distributed Tree-first based spanning-tree structures in overlay multicast techniques. We also propose effective tree structures that minimize latency time and provide competent service by choosing optimum parent nodes early in the base of these two methods over the same time slot in multi-user connection. The results of our comparison showed that average latency time in mOBCP techniques declined by 36% from those of TBCP technique.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.9
• /
• pp.1235-1244
• /
• 2002

This paper proposes a group key management protocol for a secure of all the multicast user in PIM-SM multicast group communication. With prosed architect, subgroups for multicast secure group management will be divided by RP (Rendezvous-Point) unit and each RP has a subgroup manager. Each subgroup manager gives a secure key to it's own transmitter md the transmitter compress the data with it's own secure key from the subgroup manager. Before the transmitter send the data to receiver, the transmitter prepare to encrypt a user's service by sending a encryption key to the receiver though the secure channel, after choking the user's validity through the secure channel. As the transmitter sending a data after then, the architecture is designed that the receiver will decode the received data with the transmitter's group key. As a result, the transmitting time is shortened because there is no need to data translation by group key on data sending and the data transmition is possible without new key distribution at path change to SPT (Shortest Path Tree) of the router characteristic. Additionally, the whole architecture size is samller than the other multicast secure architecture by using the conventional PIM-SIM routing structure without any additional equipment.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.3
• /
• pp.31-39
• /
• 2011

In this paper, we propose an evenly distributed mesh scheme to support services in mobile ad-hoc networks. Two strategies, the adaptive upgrading of forwarding nodes and the adaptive downgrading of forwarding nodes, are presented in the scheme. Our proposed scheme can support construction of better multicast mesh that can give higher packet delivery ratio with lower duplicate data as well as solve the problem of serious congestion especially when node mobility and data transmission rate are high in mobile ad-hoc networks. The performance evaluation is performed via simulation using OPNET.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.177-182
• /
• 2004

The existing group key management architectures applied to a small scale routing protocols may have many overheads with key distribution. Therefore this paper proposes a group key management protocol in PIM-SM multicast group communication. This method divide multicast groups with RP, and subgroup key managers are established in each RP and can be transmitted groups keys. And this does not have needs of the data translation and the new key distribution for path change. This does not have needs of the data translation and the new key distribution for path change, so the data transmission time can be reduced.

• Journal of Korea Multimedia Society
• /
• v.3 no.6
• /
• pp.633-642
• /
• 2000

This paper proposes a dominant source-based tree (DSBT) that constructs a localized multicast routing tree for dynamic multicasting without rerouting. To constrain end-to-end delays a multicast tree needs to be reconstructed when a new node joins the group due to additive tree constraint. In DSBT, a multicast group G is expressed by a (DS, NCM) pair, where DS is a dominant source address and NCM is a normalized cost margin. A node wishing to participate in a group selects a path that complies with NCM toward DS such that the end-to-end cost is constrained without any rerouting. Simulation results show that the proposed method performed better in terms of the overall tree cost compared with the Nave algorithm and in terms of the end-to-end delays between any two members compared with the Greedy algorithm.