• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.11
• /
• pp.1-12
• /
• 2005

In wireless personal area networks(PANs), the successful design of channel time allocation algorithm is a key factor in guaranteeing the various quality of service(QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a dynamic channel time allocation algerian for providing delay guarantees to multimedia traffics such as MPEG streams in the IEEE 802.15.3 high-rate WPANs. The dynamic algorithm exploits the characteristics of MPEG stream, wherein the devices (DEVs) send their channel time requests only at the end of superframe boundaries. The algerian uses mini packets for feedback control in order to deliver dynamic parameters for channel time requests from the DEVs to the piconet coordinator (PNC). In this scheme, the duration of channel time allocated to a DEV during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to traditional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.107-110
• /
• 2015

In this paper, we propose a coalitonal game theoritic approach to the power control problem in resource-constrained wireless sensor networks, where the objective is to enhance power efficiency of individual sensors while providing the QoS requirements. We model this problem as two-sided one-to-one matching game and deploly deferred acceptance procedure that produces a single matching in the core. Furthermore, we show that, by applying the procedure repeatedly, a certain stable state is achieved where no sensor can anticipate improvements in their power efficiency as far as all of them are subject to their own QoS constraints. We evaluate our proposal by comparing them with cluster-based and the local optimal solution obtained by maximizing the total system energy efficiency, where the objective function is non-convex.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.11a
• /
• pp.450-455
• /
• 1998

This paper proposes an enhanced transport protocol for multipeer communications. It is assumed that there exists a transport connection owner that takes the roles of the establishment, management and termination of a transport connection. The proposed protocol classifies the data transfer type into simplex, duplex and N-plex multicasts and provides several transport services to support various requirements in group communications. The general operations and reliability controls of each transfer type are different from one another and carried out by a shared control tree. The QoS negotiation is performed during the creation phase. The notification of negotiated values is followed by an acknowledgment procedure for confirmation. The four-way handshake is introduced. After negotiation, such a resource reservation protocol as RSVP can reserve system and network resources according to the arbitrated values. This paper suggests a conceptual model of the transport layer and its protocol behaviors over the IP multicast and RSVP network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.916-924
• /
• 2003

Fair queueing has been an important issue in the multimedia networks where resources are shared among nodes both wired and wireless. In most fair queuing algorithms, based on the generalized processor sharing(GPS), emphasizes fairness guarantee while overlooking bounded delay guarantee which is critical to support multimedia services in the networks. In this paper, we propose a new fair queueing scheme, delay guaranteed fair queueing (DGFQ), which guaranteeing bounded delay of flows according to their individual delay requirements for multimedia services in the wireless packet networks.

• Journal of information and communication convergence engineering
• /
• v.16 no.1
• /
• pp.31-37
• /
• 2018

In this work, we propose an analytic framework for evaluating the quality of service and dimensioning the link capacity in the gateway router of a smart farm with a greenhouse eco-management system. Specifically, we focus on the gateway router of an IoT network that provides an access service for smart farms. We design the link capacity of a gateway router that is used for the remote management of the greenhouse eco-management system to accommodate both time-critical and delay-tolerant traffic in a greenhouse LAN. For this purpose, we first investigate the ecosystem for smart farm, and we define the specification and requirements of the greenhouse eco-management system. Second, we propose a system model for the link capacity of a gateway that is required to guarantee the delay performance of time-critical applications in the greenhouse LAN. Finally, the validity of the proposed system is demonstrated through a series of numerical experiments.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.197-201
• /
• 2003

We study in this paper both distributed power control and removal algorithms for multimedia CDMA wireless networks. In our study, users can have different data rates as well as different quality of service (QoS) requirements. We derive a necessary and sufficient condition for the fully distributed power control (FDPC) algorithm to find a feasible power set. We also prove that, if the maximal power level is used at the start, then the distributed constrained power control (DCPC) algorithm is equivalent to the FDPC algorithm. For the connection removal algorithm, we prove that the non-reinitialized removal algorithm finds a feasible power set faster and employs smaller power levels than the reinitialized one does. Performances of some connection removal criteria are also studied. Our simulation results reveal that the smallest normalized CIR (SNC) and largest CIR requirement (LCR) criteria result in smaller outage probability than the smallest CIR (SC) criterion in a multimedia environment.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.391-396
• /
• 2004

In this paper, we propose a packet scheduling discipline called packet loss fair scheduling, in which the packet loss of each user from different real-time traffic is fairly distributed according to the quality of service requirements. We consider an orthogonal frequency division multiple access (OFDMA) system. The basic frame structure of the system is for the downlink in a cellular packet network, where the time axis is divided into a finite number of slots within a frame, and the frequency axis is segmented into subchannels that consist of multiple subcarriers. In addition, to compensate for fast and slow channel variation, we employ a link adaptation technique such as adaptive modulation and coding. From the simulation results, our proposed packet scheduling scheme can support QoS differentiations while guaranteeing short-term fairness as well as long-term fairness for various real-time traffic.

• 한국정보통신설비학회:학술대회논문집
• /
• 2005.08a
• /
• pp.290-296
• /
• 2005

In this paper, we describe ubiquitous environments and the trend of convergence that is an evolution path of current telecommunication, and show the concept of broadband convergence network, service feature and evolution path. In order to converge wire and wireless communication, telecommunication and broadcasting, voice and data efficiently, broadband convergence network divides a network into service layer, control layer, transport layer, ubiquitous access and terminal layer. Broadband convergence network will be a network that can provide and control broadband multimedia services with QoS and securityof different and customized level. Then we depict characteristics and types of broadband multimedia service, and describe the characteristic of broadband convergence network. Finally, we show ubiquitous network based on the broadband convergence network to provide ubiquitous service which is a future telecommunication service. We also describe requirements of ubiquitous network such as an intelligent and context based platform, convergence terminals, ubiquitous computing devices, etc., and give various emerging technologies and those applications.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.3 no.2
• /
• pp.81-89
• /
• 2004

In this paper, we describe ubiquitous environments and the trend of convergence that is an evolution path of. current telecommunication, and show the concept of broadband convergence network, service feature and evolution path. In order to converge wire and wireless communication, telecommunication and broadcasting, voice and data efficiently, broadband convergence network divides a network into service layer, control layer, transport layer, ubiquitous access and terminal layer. Broadband convergence network will be a network that can provide and control broadband multimedia services with QoS and security of different and customized level. Then we depict characteristics and types of broadband multimedia service, and describe the characteristic of broadband convergence network. Finally, we show ubiquitous network based on the broadband convert- gence network to provide ubiquitous service which is a future telecommunication service. We also describe requirements of ubiquitous network such as an intelligent and context based platform, convergence terminals, ubi- quitous computing devices, etc.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.199-202
• /
• 1998

In this paper, to reduce BER(Bit Error Rate) in satellite ATM Networks, a new scheme for FEC(Forward Error Corection) using multi-stage Viterbi coder is proposed. In terms of structural complexity, proposed multi-stage Viterbi coder is simpler than the traditional single-stage coder based on the same BER performances. and, through simulation, proposed coder shows excellent error correction capabilities, compared with traditional FEC schemes. Also, we propose a selective FEC mechanism that adaptively changes the number of stages to satisfy the QoS(Quality of Service) requirements. This Selective scheme can be easily implemented using the PLCP(Physical Layer Convergence Protocol) frame structure.