• Journal of Communications and Networks
• /
• 제3권4호
• /
• pp.365-373
• /
• 2001

We propose a new channel reservation protocol which can reduce message delay by using a counter for detection of d source conflict in a WDM single-hop network with non-equivalent propagation delay. A source convict occurs when a source node has the right to transmit more than or equal to two messages simultaneously, which are transmitted using different wavelengths. In such a case, the source node has to newly obtain the right to transmit the message. In the proposed protocol, by using a source conflict counter a source node can detect a source conflict before a wave-length assignment is performed. Therefore, the source node can start a procedure to newly obtain the right to transmit the message which cannot be transmitted due to a source conflict. We analyse the throughput performance by taking the effect of a source conflict into account, and show that the approximate analysis and the computer simulated results are close. Also, from computer simulated results, we show that our proposed protocol can reduce mean message delay dramatically without degrading throughput performance as the offered load becomes large.

• 대한전자공학회논문지TE
• /
• 제37권5호
• /
• pp.93-102
• /
• 2000

본 논문은 DAMA-SCPC 위성통신 시스템의 디지털 모뎀의 기능 및 성능 규격들을 제시하고, 제시한 규격을 만족하는 위성모뎀의 구조 설계 및 구현에 대하여 기술한다. 다양하면서 융통성이 요구되는 위성모뎀의 규격들을 만족시키기 위하여 디지털 신호 처리기(DSP)와 프로그래머블 게이트 어레이(FPGA)를 기반으로 하여 설계 및 구현되었다. 구현된 위성모뎀은 DAMA-SCPC 위성통신 시스템에 통합하여 수행한 시험에서 안정된 동작과 제시된 기능 및 성능 규격을 모두 만족함을 검증하였다. 연속모드(at Eb/No=4.7, FEC=3/4) 에서 측정된 BER은 약 1×10E-4의 성능을 보여 주었다.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.421-426
• /
• 2007

The problem of vertex labeling with a condition at distance two in a graph, is a variation of Hale's channel assignment problem, which was first explored by Griggs and Yeh. For positive integer $p{\geq}q$, the ${\lambda}_{p,q}$-number of graph G, denoted ${\lambda}(G;p,q)$, is the smallest span among all integer labellings of V(G) such that vertices at distance two receive labels which differ by at least q and adjacent vertices receive labels which differ by at least p. Van den Heuvel and McGuinness have proved that ${\lambda}(G;p,q){\leq}(4q-2){\Delta}+10p+38q-24$ for any planar graph G with maximum degree ${\Delta}$. In this paper, we studied the upper bound of ${\lambda}_{p,q}$-number of some planar graphs. It is proved that ${\lambda}(G;p,q){\leq}(2q-1){\Delta}+2(2p-1)$ if G is an outerplanar graph and ${\lambda}(G;p,q){\leq}(2q-1){\Delta}+6p-4q-1$ if G is a Halin graph.

• Journal of information and communication convergence engineering
• /
• 제14권4호
• /
• pp.240-245
• /
• 2016

Scalable video streaming over wireless networks has many challenges. The most significant challenge is related to packet loss. To overcome this problem, in this paper, we propose an unequal loss protection (ULP) method using a new forward error correction (FEC) mechanism for robust scalable video streaming over wireless networks. For an efficient FEC assignment considering video quality, we first introduce a simple and efficient performance metric, the layer-based recovery rate (LRR), for quantifying the unequal error propagation effects of the temporal and quality layers on the basis of packet losses. LRR is based on the unequal importance in both the temporal and the quality layers of a hierarchical scalable video coding structure. Then, the proposed ULP-LRR method assigns an appropriate number of FEC packets on the basis of the LRR to protect the video layers against packet lossy network environments. Compared with conventional ULP algorithms, the proposed ULP-LRR algorithm demonstrates a higher performance for various error-prone wireless channel statuses.

• 한국경영과학회지
• /
• 제23권3호
• /
• pp.135-151
• /
• 1998

The demand of large capacity in coming cellular systems makes inevitable the deployment of small cells, rendering more frequent handoff occurrences of calls than in the conventional system. The key issue is then how effectively to reduce the chance of unsuccessful handoffs, since the handoff failure is less desirable than that of a new call attempt. In this study, we consider the control policies which give priority to handoff calls by limiting channel assignment for the originating new calls, and allow queueing the new calls which are rejected at their first attempts. On this system. we propose the problem of finding an optimal call control strategy which optimizes the objective function value, while satisfying the requirements on the handoff/new call blocking probabilities and the new call delay. The objective function takes the most general form to include such well-known performance measures as the weighted average carried traffic and the handoff call blocking probability. The problem is formulated into two different linear programming (LP) models. One is based on the direct employment of steady state equations, and the other uses the theory of semi-Markov decision process. Two LP formulations are competitive each other, having its own strength in the numbers of variables and constraints. Extensive experiments are also conducted to show which call control strategy is optimal under various system environments having different objective functions and traffic patterns.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.691-708
• /
• 2010

An important issue of supporting multi-users with diverse quality-of-service (QoS) requirements over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resource while, at the same time, to meet each communication service QoS requirement. In this work, we study the problem of a variety of communication services over multi-media heterogeneous cognitive OFDM system. We first divide the communication services into two parts. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive (DS) and need guaranteed throughput. On the other side, services like file transmission and email service are relatively delay tolerant (DT) so varying-rate transmission is acceptable. Then, we formulate the scheduling as a convex optimization problem, and propose low complexity distributed solutions by jointly considering channel assignment, bit allocation, and power allocation. Unlike prior works that do not care computational complexity. Furthermore, we propose the FAASA (Fairness Assured Adaptive Sub-carrier Allocation) algorithm for both DS and DT users, which is a dynamic sub-carrier allocation algorithm in order to maximize throughput while taking into account fairness. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5253-5270
• /
• 2016

With device-to-device (D2D) communications, an inactive user terminal can be utilized as a relay node to support multi-hop communication so that connective experience of the cell-edge user as well as the capacity of the whole system can be significantly improved. In this paper, we investigate the spectrum sharing for a cooperative relay assisted D2D communication underlying a cellular network. We formulate a joint relay selection and channel assignment problem to maximize the throughput of the system while guaranteeing the quality of service (QoS) requirements of cellular users (CUs) and D2D users (DUs). By exploiting coalition formation game theory, we propose two algorithms to solve the problem. The first algorithm is designed based on merge and split rules while the second one is developed based on single user's movement. Both of them are proved to be stable and convergent. Simulation results are presented to show the effectiveness of the proposed algorithms.

• 정보학연구
• /
• 제7권3호
• /
• pp.99-112
• /
• 2004

최근 정보기술을 활용하여 무역의 효율을 극대화하고 있다. 이를 위해 전자무역(e-Trade)을 활용하여, 고효율의 글로벌 마케팅을 적극 추진하고 있다. 기존 종합상사의 기능고도화를 목적으로 e무역상사가 등장하여, 새로운 마케팅을 적극 추진하고 있다. 이를 위해서는 계약체결이전의 바이어 발굴 등 마케팅의 고도화가 전자무역을 통해 활성화되고 있으며, 계약체결이후의 운송, 보험, 결제 등의 전자화도 적극 추진하고 있다. 이와 관련하여 e무역상사의 글로벌 마케팅 추진현황을 살펴보고, 향후 지식형 전자무역을 가능하게 해주고 있는 전자무역의 확산을 위한 전략적 제언을 하고자 한다.

• 한국컴퓨터정보학회논문지
• /
• 제17권12호
• /
• pp.131-136
• /
• 2012

최근 스마트 이동 단말기기의 급속한 보급과 더불어 많은 수의WiFi Access Point (AP)가 설치되어 사용되고 있으며, WiFi AP의 증가는 AP 간의 상호 간섭에 의한 트래픽 처리 성능의 저하를 발생시킨다. 이런 현상은 기존 WiFi 망에 활용할 수 있는 트래픽 성능을 향상시키기 위한 방법을 요구한다. 본 연구에서는 트래픽 성능을 향상시키기 위하여 AP의 무선 자원 관리 (RRM : Radio Resource Management)를 최적화하기 위한 채널 할당 방법과 분산형 Wireless LAN (WLAN) 에서의 트래픽 성능 향상 방법에 대하여 연구하였다. 그 결과, AP 단독으로 실행되어 기존방식의 할당 오류를 개선하고 실행속도를 증가시킬 수 있었다.

• Journal of Communications and Networks
• /
• 제15권1호
• /
• pp.102-110
• /
• 2013

This paper considers a cooperative orthogonal frequency division multiple access (OFDMA)-based cognitive radio network where the primary system leases some of its subchannels to the secondary system for a fraction of time in exchange for the secondary users (SUs) assisting the transmission of primary users (PUs) as relays. Our aim is to determine the cooperation strategies among the primary and secondary systems so as to maximize the sum-rate of SUs while maintaining quality-of-service (QoS) requirements of PUs. We formulate a joint optimization problem of PU transmission mode selection, SU (or relay) selection, subcarrier assignment, power control, and time allocation. By applying dual method, this mixed integer programming problem is decomposed into parallel per-subcarrier subproblems, with each determining the cooperation strategy between one PU and one SU. We show that, on each leased subcarrier, the optimal strategy is to let a SU exclusively act as a relay or transmit for itself. This result is fundamentally different from the conventional spectrum leasing in single-channel systems where a SU must transmit a fraction of time for itself if it helps the PU's transmission. We then propose a subgradient-based algorithm to find the asymptotically optimal solution to the primal problem in polynomial time. Simulation results demonstrate that the proposed algorithm can significantly enhance the network performance.