• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.323-325
• /
• 2014

The consensus algorithm has a faster convergence speed as the number of cooperating neighbors increases, but the information sharing delay in the wireless network increases due to access collisions as the number of cooperating neighbors increases. Therefore, there exists a tradeoff between these two performances according to node's coverage. In this paper, we present a method of coverage control that minimizes consensus time according to network scale.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.22-29
• /
• 2000

In this paper, we analyzed the performance of EY-NPMA(Elimination Yield-Non-preemptive Priority Multiple Access) protocol-channel access control protocol of HIPERLAN(HIgh PErformance Radio Local Area Network) type 1 specification, adopted as european high speed wireless LAN standard by ETSI(European Telecommunication Standards Institute). We established a system model for EY-NPMA protocol analysis, analyzed success probability in a channel access cycle, and derived expressions for the average length of contention phase. Using a M/G/1 model, we approximated the normalized delay, and throughput, and we evaluated these results by simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.692-699
• /
• 2000

We build and analyze some types of queueing model to discuss capacity dimensioning of access links of a LAN interworking unit connected to the Internet backbone network. We assume that the IWU has a FIFO buffer to transmit IP packets to the Internet through the backbone. In order to analyze the system, we use a Poisson process and an MMPP process as input traffic models of IP packets and we use a general service time distribution as a service time model. But we use both an exponential service time and a deterministic service time in numerical examples for simple and efficient performance comparisons. As performance measures, we obtain the packet loss probability and the mean packet delay. We present some numerical results to show the effect of arrival rate, buffer size and link capacity on packet loss and mean delay.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.1
• /
• pp.67-73
• /
• 2001

This paper proposes a new scheduling algorithm for broadband ATM access network. The existed scheduling algorithms (Train, Chao. Dynamic scheduling algorithm) have high cell loss rate and waste channel. These proposed mechanism utilize to control of multimedia services based on the quality of service level of the input traffic This paper suggests a functional architecture of scheduling and the scheduling algorithm to satisfy various QoS requirements. The performance measures of interest, namely steady-state cell loss probability and average delay, average delay, are discussed by simulation results.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.910-913
• /
• 2012

통신기술의 발달과 스마트 폰의 급격한 보급으로 인하여 모바일 환경은 음성 데이터 기반의 환경에서 인터넷 데이터 기반의 환경으로 급격히 변화되었다. 이로 인하여 음성 서비스 처리 위주의 음성 데이터 기반 모바일 환경은 대용량 동영상 서비스, 인터넷, 메신저 등의 유선 네트워크 환경과 같은 다양한 서비스가 요구되는 환경으로 변화되었다. 이러한 환경 변화로 인하여 모바일 네트워크는 무선 네트워크상의 취약점 뿐 만 아니라 유선환경의 네트워크 취약점을 동시에 지니는 환경으로 변화되었고, 이로 인한 다양한 새로운 취약점들이 부각되기 시작하였다. 본 논문에서는 이와 같이 새롭게 부각되고 있는 모바일 Packet Switched Core Network(PSCN) 환경에서 Service Provider(SP)의 Service Recover로 인해 유발되는 Paging Table Denial of Service(PT-DoS)를 효율적으로 제어하기 위한 Delay Access Control(DAC) 기반의 QoS를 이용한 방법을 설계/구현하였다. 그리고 실험을 통해, PT-DoS를 차단하여 PSCN 공격을 미연에 방지하는 효과를 확인하였다.

• Journal of Internet Computing and Services
• /
• v.18 no.4
• /
• pp.27-34
• /
• 2017

In this paper, the analysis of mobile augmented reality service using 5G network are provided. First of all, the introduction and required performance of mobile augmented reality(MAr) service are provided. After that, 5G network key features, target performance, and network architecture are analyzed. At the end, the additional network entity and functions for the realization of mobile augmented reality service are proposed. The mobile augmented reality service time. At the end, the service delay in existing LTE system and proposed 5G MAr system by using real device and network parameters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1348-1356
• /
• 1991

The need for MAN(Metropolitan Area Network)has been increased by demands for high performance comuter communication. According to the definition of MAN by IEEE 802.6 MANs have diameter of about 50km, bandwidth of more than 1Mbps, and limited delay, Because optical fibers have unique characteristics that make them attractive for the implementation of MANs several fiber optic networks suitable for MAN application have been proposed. Those networks have drawbacks such as unlimited delay, many processing nodes and limited number of stations. Also IEEE 802.6 proposals and oters improved networks were proposed, but they have complicated access procedures and data buffering and difficulties in implementation. This paper descrives the design of Fiber Optic Metropolitan Area Network in Seoul(Seoul FOMAN) to overcome the drawback, Seoul FOMAN is hierarchical MAN and designed based on the topology of 43 end offices in Seoul. We propose MAN topology, proper access protocol and analyze the performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.5
• /
• pp.16-24
• /
• 2007

Wireless mesh network extends the limited coverage of conventional wireless service from one-hop access point to wider area. It is recognized as an important issue to provide seamless handoff in the wide coverage of wireless mesh network. A long handoff delay may cause high packet loss and disconnection of service, degrading the network performance. The handoff delay is mainly introduced from the channel scanning process obtaining information to make handoff decision and the unnecessary handoffs due to inaccurate handoff decision. In this paper, we propose the handoff algorithm based on one-way trip time (OTT) to expedite the handoff procedure. As compared to the handoff algorithm based on the receiving signal power, the proposed algorithm takes advantage of OTT to obtain the necessary handoff information in a relatively shorter time and reduce the unnecessary handoffs. The performance of proposed algorithm is evaluated through the simulations. It is verified that the proposed handoff algorithm can effectively enhance the handoff accuracy, and therefore reduce the handoff delay and unnecessary handoffs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.331-343
• /
• 2015

We propose a distributed medium access control protocol for cognitive radio networks to opportunistically utilize multiple channels. Under the proposed protocol, cognitive radio nodes forecast and rank channel availability observing primary users' activities on the channels for a period of time by time series analyzing using smoothing models for seasonal data by Winters' method. The proposed approach protects primary users, mitigates channel access delay, and increases network performance. We analyze the optimal time to sense channels to avoid conflict with the primary users. We simulate and compare the proposed protocol with the existing protocol. The results show that the proposed approach utilizes channels more efficiently.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.649-656
• /
• 2007

Today, controller area network(CAN) is a field bus that is nowadays widespread in distributed embedded systems due to its electrical robustness, low price, and deterministic access delay. However, its use safety-critical applications has been controversial due to dependability limitation, such as those arising from its bus topology. Thus it is important to analyze the performance of the network in terms of load of data bus, maximum time delay, communication contention, and others during the design phase of the controller area network. In this paper, a simulation algorithm is introduced to evaluate the communication performance of the vehicle network and apply software base fault injection techniques. This can not only reduce any erratic implementation of the vehicle network but it also improves the reliability of the system.