• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.787-798
• /
• 2003

The flow label field in IPv6 has been proposed to provide the QoS. Since the existing flow label specification scheme like random-number format utilizes the label only as the identifier of flow, it is not appropriate for providing differentiated services according to the characteristics of various types of real-time traffic. This paper proposes a hybrid scheme that makes use of the flow label fields as components of flow and QoS parameters as well. To be specific, this paper investigates a scheme that both guarantees the end-to-end service quality and utilizes efficiently backbone resources by allowing users to specify QoS parameters using flow labels. Assuming an MLPS-TE network as the backbone, we compare the performance of our proposed scheme with that of random-number scheme through simulation. The simulation result shows that our scheme is more efficient than the existing one in terms of the transmission rate as well as the resource utilization of the backbone.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2283-2291
• /
• 1999

Most of collaborative applications use the Server-Client paradigm where all requests of clients will be delivered first to server and that server distributes again the requests to the rest of clients. This server-oriented operation and data transmission mechanism always presents end-to-end communications between the server and clients that can notably decrease the overall performance of applications. In this paper, we propose a new design approach to inhibit the inefficiency of applications using active networking concepts. We propose the ASM service that offers an application-specific in-network multicast functions, the AMTC service and its tree algorithm that builds anon-core based shared tree for multicast. These proposed services locate in active nodes performing its services as part of the overall system to improve the performance of collaborative applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.269-276
• /
• 2016

Internet of Things (IoT) is based on wireless networks being able to connect things and people on a large scale. In the IoT environment, reliable broadcast plays an important role to distribute data to a large number of devices. Energy harvesting from a surrounding environment is a key technique to achieve a sustainable IoT network. In IoT networks, a problem of transmission errors and energy shortage should be mitigated for reliable broadcast. In this paper, we propose an energy-efficient and reliable broadcast method to consider packet errors and energy consumption in the environment where a large number of nodes are connected. The proposed scheme can improve data restoration probability by up to 15% and reduce energy consumption by up to 17%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1093-1105
• /
• 2012

We propose an interference space reuse (ISR) algorithm for the MU-MIMO design in 3-cell downlink interference channels. Also, we provide a strategy for the adoption of the ISR scheme in the cellular network. In the multicell interference channels, the cell edge users may undergo severe interferences and their signals should be protected from the interferers for reliable transmissions. However, the intra cell users do not only experience small interferences but also they require small transmission power for stable communication. We provide a vector design algorithm based on ISR, where intra cell users are served through reusing the cell edge users' interference space. The performance enhancement reaches 20% compared to the fractional frequency reuse (FFR) scheme combined with IA through the scheduling between the cell edge users and the intra cell users. Also, it can be used to enhance the cell edge throughput when the quality of service (QoS) requirements of the intra cell users are fixed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.325-338
• /
• 2012

In this paper, a radio resource allocation scheme for a multi-hop relay transmission in cognitive radio (CR) system is proposed to support the employment of relay nodes in IEEE 802.22 standard for wireless regional area network (WRAN). An optimization problem is formulated to maximize the number of serving secondary users (SUs) under system constraints such as time-divided frame structure for multiplexing and a single resource-unit to every relay-hop. However, due to mathematical complexity, the optimization problem is solved with a sub-optimal manner instead, which takes three steps in the order of user selection, relay/path selection, and frequency selection. In the numerical analysis, this proposed solution is evaluated in terms of service rate denoting as the ratio of the number of serving SUs to the number of service-requesting SUs. Simulation results show the condition of adopting multi-hop relay and the optimum number of relaying hops by comparing with the performance of 1-hop system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9A
• /
• pp.844-851
• /
• 2010

Recently, AODV routing protocol which one of the table driven method for the purpose data transmission between nodes has been broadly used in mobile wireless sensor networks. An existing AODV has a little overhead of routing packets because of keeping the routing table for activity route and re-routes to recovery the routes in route discontinuation. However that has faults in that excesses useless of the network bandwidth to recovery the route and takes a lone time to recovery the route. This paper proposes an efficient route recovery method for AODV based on wireless sensor networks in connection breaks. The proposed method. The propose method controls the number of RREQ message considering the energy's node and distance between nodes to restrict the flooding range of RREQ message while expanding the range of local repair. In test results, the proposed method are compared to existing method, the number of drops decrease 15.43% and the delay time for re-route decrease 0.20sec.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8A
• /
• pp.787-793
• /
• 2008

3GPP evolved packet system (EPS) is an all-IP based system that supports various access networks such LTE, HSPA/HSPA+, and non-3GPP networks. Recently, the support of IP flows with packet level QoS profiles was added to the requirements of the EPS. This paper proposes an adaptive modulation and coding (AMC) scheme that supports the QoS of such IP flows in the 3G LTE access network of the EPS. Defining the retransmission as a critical factor for QoS, the proposed scheme applies different maximum packet error probability $P_{max}$ to each packet when selecting the AMC transmission mode. In determining $P_{max}$, the QoS constraints and NACK-to-ACK error as well as channel condition are considered, balancing two objectives: the satisfaction of the QoS and the maximization of spectral efficiency. The simulation results show that it is able to reduce both delay violation and status report by 10%, while improving the throughput 10% in comparison with an existing scheme.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.411-416
• /
• 2007

The General security method of wireless network provides a confidentiality of communication contents based on the cryptographic stability against a malicious host. However, this method exposes the logical and physical addresses of both sender and receiver, so transmission volume and identification of both may be exposed although concealing that content. Covered address scheme that this paper proposes generates an address to which knapsack problem using super increasing sequence is applied, and replaces the addresses of sender and receiver with addresses from super increasing sequence. Also, proposed method changes frequently secret addresses, so a malicious user cannot watch a target system or try to attack the specific host. Proposed method also changes continuously a host address that attacker takes aim at. Accordingly, an attacker who tries to use DDoS attack cannot decide the specific target system.

• The KIPS Transactions:PartC
• /
• v.15C no.2
• /
• pp.87-92
• /
• 2008

This paper proposes a session control model for the P2P(Peer to Peer) IPTV(Internet Protocol Television) services and presents the IPTV session control procedures based on the proposed model. Since, while public IPTV traffic is usually processed via a separate network, P2P IPTV traffic is processed together with the conventional Internet access traffic, the P2P IPTV control mechanism needs to provide multi-stream processing for the constituent TPS(Triple Play Service) traffic and corresponding QoS(Quality of Service) control functions. Besides, P2P IPTV session control mechanism should provide appropriate multicast control functions in order to support effective transmission of video traffic generated by personal IPTV broadcasters. The P2P IPTV session control model proposed in this paper is designed to be based on the standard SIP(Session Initiation Protocol), IGMP(Internet Group Management Protocol), and COPS(Common Open Policy Service) protocol so that it can contribute to the easy and prompt deployment of inter-operable P2P IPTV platform.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.151-160
• /
• 2005

The exponential growth of Web users requires the web serves with high expandability and reliability. It leads to the excessive transmission traffic and system overload problems. To solve these problems, cluster systems are widely studied. In conventional cluster systems, when the request size is large owing to such types as multimedia and CGI, the particular server load and response time tend to increase even if the overall loads are distributed evenly. In this paper, a cluster system is proposed where each Web server in the system has different contents and loads are distributed efficiently using the Web server resource information such as CPU, memory and disk utilization. Web servers having different contents are mutually connected and managed with a network file system to maintain information consistency required to support resource information updates, deletions, and additions. Load unbalance among contents group owing to distribution of contents can be alleviated by reassignment of Web servers. Using a simulation method, we showed that our method shows up to $50\%$ about average throughput and processing time improvement comparing to systems using each LC method and RR method.