• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.270-281
• /
• 2003

ETF made the RFCs of MPLS technologies for providing the QoS of ATM or Frame Relay and the flexibility&scalability of IP on the Internet services. IETF has been expanding MPLS technologies as a common control component for supporting the various switching technologies called GMPLS. Also, IETF has standardized the signaling protocols based on such technologies, such as LDP, CR-LDP and RSVP-TE. ETRI developed the MPLS system based on ATM switch in order to provide more reliable services, differentiated services and value-added services like the VPN and traffic engineering service on the Korea Public Sector network. We are planning on deploying model services and commercial services on that network. This paper explains the basic functions of LDP, design and development of LDP on our system, and compares with LDP development and operation on other MPLS systems made by Cisco, Juniper, Nortel and Riverstone. In conclusion, this paper deduces the future services and applications by LDP through these explanation and comparison.

• Journal of Internet Computing and Services
• /
• v.13 no.3
• /
• pp.23-30
• /
• 2012

In order to show the gap between theory and practice, this paper first gives some experimental results for theoretical and real neighbor sets on a test-bed sensor network. The results prove that existing management protocols (e.g., duty-cycling, routing or aggregation) based on the theoretical communication radius cannot achieve their original goal, efficiency. In this paper, we present a practical duty-cycling mechanism based on the real neighbor set, allowing for energy-efficiency. It also guarantees to suppress duplicated transmissions of sensing values with similarity within a specific threshold in each zone (i.e., a portion of intended divided network). Simulation results performed with a set of real sensor data show that our mechanism increases the network life time while guaranteeing the transmission of necessary sensing values.

• Journal of Satellite, Information and Communications
• /
• v.11 no.3
• /
• pp.37-42
• /
• 2016

In this paper, in today's highly complex video and broadcast operations, broadcasters are constantly challenged to reliably deliver low-latency, high-quality video to multiscreen audiences on-air and online. The Adaptive Bit Rate (ABR) protocols enable internet video to a wide range of multiscreen devices. However, video quality is often marginal and would prove unacceptable for valued linear broadcast content delivered to the Big Screen today. The Media information processing technology advances in ABR enables service providers to take control and offer quality managed linear video services to ALL screens in the home, including the Big Screen, with a single unified IP Video infrastructure. The New Multiscreen-Assisted ABR (MSA-ABR) delivery management system proposed using Cloud based multicast-assisted ABR for a broadcast facility that performs routing of contribution content and online publishing services within a virtual, centralized cloud infrastructure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1363-1372
• /
• 2011

Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.801-808
• /
• 2010

LEACH, one of hierarchical based routing protocols, was proposed for energy efficiency which is the most important requirement of Wireless Sensor Network(WSN). LEACH protocol is composed of a cluster of certain large number of clusters, which have a cluster head and member nodes. Member nodes send sensing data to their cluster heads, and the cluster heads aggregate the sensing data and transmit it to BS. The challenges of LEACH protocol are that cluster heads are not evenly distributed, and energy consumption to transmit aggregated data from Cluster heads directly to BS is excessive. This study, to improve LEACH protocol, suggests LECEEP that transmit data to contiguity cluster head that is the nearest and not far away BS forming chain between cluster head, and then the nearest cluster head from BS transmit aggregated data finally to BS. According to simulation, LECEEP consumes less energy and retains more number of survival node than LEACH protocol.

• Convergence Security Journal
• /
• v.9 no.2
• /
• pp.71-78
• /
• 2009

It is very difficult to apply previous security protocols to WSNs(Wireless Sensor Networks) directly because WNSs have resource constrained characteristics such as a low computing ability, power, and a low communication band width. In order to overcome the problem, we proposes a secure group communication scheme applicable to WSNs. The proposed scheme is a combined form of the TEEN(Threshold sensitive Energy Efficient sensor Network protocol) clustering based hierarchical routing protocol and security mechanism, and we assume that WSNs are composed of sensor nodes, cluster headers, and base stations. We use both private key and public key cryptographic algorithms to achieve an enhanced security and an efficient key management. In addition, communications among sensor nodes, cluster headers, and base stations are accomplished by a hierarchical tree architecture to reduce power consumption. Therefore, the proposed scheme in this paper is well suited for WSNs since our design can provide not only a more enhanced security but also a lower power consumption in communications.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.15-24
• /
• 2006

We design and implement explicit mobile multicast, named XMIP, by enhancing explicit multicast for a great number of small group multicast communications. XMIP is a straightforward multicast mechanism without maintaining multicast states due to the inheritance from the explicit multicast based on a unicast routing. This research modifies and extends the functionality of each mobility agent of IETF Mobile IP for interworking XMIP XMIP Packets captured by an extended home agent are forwarded to each extended foreign agent through nested tunnels, named X-in-X tunnels, made by the binding table of the extended home agent. X-in-X tunneling mechanism can effectively solve the serious traffic concentration problems of Mobile IP multicast specifications. Finally heterogeneous mobile networks as an XMIP testbed including CDMA2000 1X EV-DO and WLAN are actually established, and a multi-user instant messenger system for small group communications is developed for verifying the feasibility of the proposed protocols.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.81-93
• /
• 2012

We propose efficient mobility management schemes based on pointer forwarding for Proxy Mobile IPv6 Networks(PMIPv6) with the objective to reduce the overall network traffic incurred by mobility management and packet delivery. The proposed schemes are per-user-based, i.e., the optimal threshold of the forwarding chain length that minimizes the overall network traffic is dynamically determined for each individual mobile user, based on the user's specific mobility and service patterns. We demonstrate that there exists an optimal threshold of the forwarding chain length, given a set of parameters characterizing the specific mobility and service patterns of a mobile user. We also demonstrate that our schemes yield significantly better performance than schemes that apply a static threshold to all mobile users. A comparative analysis shows that our pointer forwarding schemes outperform routing-based mobility management protocols for PMIPv6.

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

Mobility support for mobile networks will be important to minimize the packet overhead, to optimize routing, to reduce handoff latency, and to reduce the volume of handoff signals. Mobile IPv6 (MIPv6) and Hierarchical MIPv6 (HMIPv6) are one of mobility management protocols (MMPs) that provides network layer mobility over all access technologies. However, the communication quality of these candidates is severely degraded during handoffs. As another way to improve the handoff performance of a mobile network by conventional MMPs such as MIPv6 and HMIPv6, we propose a Low Latency Handoff Scheme (LLHS) combining Fast MIPv6 (FMIPv6) with HMIPv6 extension with buffering function, in which Mobility Anchor Points (MAPs) buffer packets destined to the Mobile Routers (MRs) or MNs within a mobile network during handoffs. The simulation results show that the proposed scheme reduces transmission delay and packet loss in UDP communication.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.100-109
• /
• 2005

A Mobile Ad-Hoc Network (MANET) supports a multi-hop wireless network without any prepared base station (BS). The MANET is capable of building a mobile network automatically without any help from DHCP servers for address allocation or routers to forward or route messages. Many routing protocols have been proposed for the MANET, but these specify the most optimized or shortest path from a source to a destination, and they assume that nodes are pre-configured before communication. To make up for this, address allocation algorithms, such as MANETConf [1] and prophet address allocation algorithm [2], have been proposed. Especially, MANETConf proposes address allocation algorithm with duplication address check. In this paper, we present a dynamic node configuration protocol based on 2-tierd hierarchical network architecture for mobile ad-hoc network, modified from [1]. Especially, it reduces the number of broadcast message exchange between nodes when a new node somes into a network, which lessens network overhead, remarkably. This protocol is based on two-tired structure, and it ensures address allocation with simple duplication address defection mechanism.