• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.783-792
• /
• 2003

We consider a finite-buffer discrete-time queueing system with fixed-size bulk-service discipline: Geo/ $G^{B}$1/K＋B. The main purpose of this paper is to present a performance analysis of this system that has a wide range of applications in Asynchronous Transfer Mode (ATM) and other related telecommunication systems. For this purpose, we first derive the departure-epoch probabilities based on the embedded Markov chain method. Next, based on simple rate in and rate out argument, we present stable relationships for the steady-state probabilities of the queue length at different epochs: departure, random, and arrival. Finally, based on these relationships, we present various useful performance measures of interest such as the moments of number of packets in the system at three different epochs and the loss probability. The numerical results are presented for a deterministic service-time distribution - a case that has gained importance in recent years.s.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.27-30
• /
• 2003

The introduction of reseller In Australian Fixed Telecommunication Market resulted in the reduction of Telstra's local call market share by 13 percent and average fall rate was reduced. Thus, Telstra increased basic rate at 14.5 percent to compensate loss revenue in the local call market. With the deployment of carrier pre-selection of long distance and international calls, it reduced long distance rate at 23.5 percent and international tall rate at 53 percent, and increased the Churn rate. Therefore, the deployment of service-based competition brought efficient results for long distance and international call market. However, LM market created 13.4 percent reduction in call rates, complications in charge system, technical barriers and the preference of one-bill by customers.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.2
• /
• pp.72-74
• /
• 2006

In this paper, a wireless multimedia service interacting with key input of a phone number is Presented. In the conventional handset, when the key button is pressed, numbers are displayed or the embedded sound is played. Also, the contents are fixed and cannot be changed. In this paper, we propose a wireless multimedia service playing multimedia contents in accordance with the key input of a phone number. The contents can be downloaded from the wireless internet server. To implement this service, file format, fast codec and download structure are proposed. Using the presented structure, this service is being provided by a telecommunication company in Korea. Various applications based on this service are being expected.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.229-231
• /
• 2000

Nowadays, the telecommunication service provider has witnessed an unprecedented growth in data traffic and the need for networking. optical fiber can provide some THz of huge bandwidth WDM technology has been an emerging issue for the efficient use of optical links. WDM uses a number of different wavelength that are assigned to each channel. The minimal number of optical transceivers and receivers should be used in a node to build an economic WDM transmission system without degrading system performance. Hence, the analysis of performance parameters such as throughput and delay is important to guarantee the WDM system performance. in this paper, the performance of a MAC protocol on a slotted WDM system that has a tunable transmitter(Txt), a tunable receiver(Rxt), and a fixed receiver(Rxf), respectively, on each node, was statistically analyzed The computer simulation validates the performance analysis.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.3
• /
• pp.9-18
• /
• 2008

Mobile devices do not need the fixed network infrastructure in ad-hoc network, these devices communicate each other through the distributed control. Accordingly, mobile devices can discover several services using dynamic searching method and provide safely public ownership of these services. Ad-hoc network needs the distributed control and topology of dynamic network because the limited power for processing and network communication. This paper is devoted to provide the secure protocol that provides efficient services discovery using SDP(Service Discovery Protocol) and considers the security requirements. Proposed protocol provides the distributed control based on PKI without central server, the discovery of trusted service, secure telecommunication, the identification among mobile devices, and service access control by user authority.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.281-286
• /
• 2009

The proposed technique uses cyclic frame structure, where three periods such as beacon period (BP), mesh contention access period (MCAP) and slotted period (SP) are in a data frame. This paper studies on a mechanism to allow communication nodes (6lowpan) in a PAN with different logical channel for global healthcare applications monitoring technology. The proposed super framework structure system has installed 6lowpan sensor nodes to communicate with each other. The basic idea is to time share logical channels to perform 6lowpan sensor node. The concept of 6lowpan sensor node and various biomedical sensors fixed on the patient BAN (Body Area Network) for monitoring health condition. In PAN (hospital area), has fixed gateways that received biomedical data from 6lowpan (patient). Each 6lowpan sensor node (patient) has IP-addresses that would be directly connected to the internet. With the help of IP-address service provider can recognize or analyze patient data from all over the globe by the internet service provider, with specific equipments i.e. cell phone, PDA, note book. The NS-2.33 result shows the performance of data transmission delay and data delivery ratio in the case of hop count in a PAN (Personal Area Networks).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.722-724
• /
• 2010

CAS(Conditional Access System) was developed for paid-for service in cable and fixed satellite broadcast system and technology and market maturity are high. However, these assessment is limited by CAS in fixed broadcasting system. In case of digital mobile broadcast such as T-DMB is difficult to apply CAS technology of fixed broadcasting system because of a use method and technology characteristic. Expecially, in case T-DMB using limited resources, a CAS message which must transmit in each service channel can cause problems. It is desirable that system transmits the CAS message which transmitted by each service channel through logical CAS message-only channel. In order to make a logical CAS message channel, we need a multiplexing techniques for CAS message using in each channel. In this paper, we design the CAS message multiplexing techniques for composition of CAS message-only channel.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.489-494
• /
• 2002

Recently, A robot which accomplish many tasks is the universality in fixed environment. But home robot or entertainment robots has interested greatly, and the concept of service robots is outstanding newly. In special, research about the self-steering robot is increasing gradually. Also Internet has become general, many information devices and tools were connected with internet. According to such a trend, we developed the mobile robot that moves by self-localization and is controlled in the basis of internet. Our robot system will assist office workers. In this paper, we introduce mechanical feature, control system and service faculty of robot, MAIRO in an office environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.9
• /
• pp.1684-1697
• /
• 2011

We show that two protocols for RFID mutual authentication in pervasive computing environments, recently proposed by Kang et al, are vulnerable to several attacks. First, we show these protocols do not preserve the privacy of users' location. Once a tag is authenticated successfully, we show several scenarios where legitimate or illegitimate readers can trace the location of that tag without any further information about the tag's identifier or initial private key. Second, since the communication between readers and the database takes place over an insecure communication channel and in the plaintext form, we show scenarios where a compromised tag can gain access to confidential information that the tag is not supposed get access to. Finally, we show that these protocols are also vulnerable to the replay and denial-of-service attacks. While some of these attacks are due to simple flaws and can be easily fixed, others are more fundamental and are due to relaxing widely accepted assumptions in the literature. We examine this issue, apply countermeasures, and re-evaluate the protocols overhead after taking these countermeasures into account and compare them to other work in the literature.

• Korean Management Science Review
• /
• v.29 no.2
• /
• pp.65-77
• /
• 2012

With the explosivley increasing demand in wireless telecommunication service, the shortage of radio spectrum has been worsen. The traditional approach of the current fixed spectrum allocation leads to spectrum underutilization. Recently, CR (Cognitive Radio) technologies are proposed to enhance the spectrum utilization by allocating dynamically radio resources to CR Networks. In this study, we consider a radio resource(power, subcarrier) allocation problem for OFDMA-based CRN in which a base station supports a variety of CUs (CRN Users) while avoiding the radio interference to PRN (Primary Radio Network). The problem is mathematically formulated as a general 0-1 IP problem. The optimal solution method for the IP problem requires an unrealistic execution time due to its complexity. Therefore, we propose an heuristic that gives an approximate solution within a reasonable execution time.