• Journal of Communications and Networks
• /
• 제11권5호
• /
• pp.464-472
• /
• 2009

In this paper, we propose a packet scheduling algorithm for cellular relay networks by considering relay selection, variation of channel quality, and packet delay. In the networks, mobile users are equipped with not only cellular but also user relaying radio interfaces, where base station exploits adaptive high speed downlink channel. Our proposed algorithm selects a user with good cellular channel condition as a relay station for other users with bad cellular channel condition but can get access to relay link with good quality. This can achieve flexible packet scheduling by adjusting transmission rates of cellular link. Packets are scheduled for transmission depending on scheduling indexes which are calculated based on user's achieved transmission rate, packet utility, and proportional fairness of their throughput. The performance results obtained by using computer simulation show that the proposed scheduling algorithm is able to achieve high network capacity, low packet loss, and good fairness in terms of received throughput of mobile users.

• ETRI Journal
• /
• 제26권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.

• 한국산학기술학회논문지
• /
• 제12권3호
• /
• pp.1336-1340
• /
• 2011

서로 다른 응용을 위한 중복된 유비쿼터스 네트워크는 결국 어느 지점에서는 중복된 채널이 만들어 지며, 채널 혼선으로 인하여 전체 네트워크의 불안정뿐만 아니라, 보안 문제 그리고 기기 오작동 등의 심각한 문제를 야기 시킬 수 있다. 따라서 본 논문에서는 같은 지역내 다른 목적의 중복된 유비쿼터스용 ZigBee 네트워크간의 혼선 문제를 근본적으로 회피하기 위한 지능형 채널 할당 기법을 제안하고, 이러한 제안기법을 응용하여 무선 임베디드 시스템을 개발하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.733-750
• /
• 2019

Software Defined Networking (SDN) is a new network paradigm, allowing administrators to manage networks through central controllers by separating control plane from data plane. So, one or more controllers must locate outside switches. However, this separation may cause delay problems between controllers and switches. In this paper, we therefore propose a Priority-based Scheduling policy for OpenFlow (PSO) to reduce the delay of some significant traffic. Our PSO is based on packet prioritization mechanisms in both OpenFlow switches and controllers. In addition, we have prototyped and experimented on PSO using a network simulator (ns-3). From the experimental results, PSO has demonstrated low delay for targeted traffic in the out-of-brand control network. The targeted traffic can acquire forwarding rules with lower delay under network congestion in control links (with normalized load > 0.8), comparing to traditional OpenFlow. Furthermore, PSO is helpful in the in-band control network to prioritize OpenFlow messages over data packets.

• Journal of Electrical Engineering and Technology
• /
• 제10권6호
• /
• pp.2406-2412
• /
• 2015

Multi-user multi-input multi-output (MU-MIMO) system has attracted the 4^th generation wireless network as one of core technique for performance enrichment. In this system rate control is a challenging problem and another problem is optimization. Proper scheduling can resolve these problems by deciding which set of user and at which rate the users send their data. This paper proposes a new multi-parameter based scheduling (MPS) for downlink multi-user multiple-input multiple-output (MU-MIMO) system under space-time block coding (STBC) transmissions. Goal of this MPS scheme is to offer improved link level performance in terms of a low average bit error rate (BER), high packet delivery ratio (PDR) with improved resource utilization and service fairness among the user. This scheme allows the set of users to send data based on their channel quality and their demand rates. Simulation compares the MPS performance with other scheduling scheme such as fair scheduling (FS), normalized priority scheduling (NPS) and threshold based fair scheduling (TFS). The results obtained prove that MPS has significant improvement in average BER performance with improved resource utilization and fairness as compared to the other scheduling scheme.

• 대한산업공학회지
• /
• 제3권2호
• /
• pp.93-97
• /
• 1977

PERT/CPM type scheduling systems use a network to graphically portray the interrelationship among the activities of a project. This network representation of the project schedule shows all the precedence relationship regarding the order in which tasks must be performed. In this paper an algorithm is presented that changes the network configurations without violating precedence relationship of the original network.

• 한국정보통신학회논문지
• /
• 제19권11호
• /
• pp.2576-2583
• /
• 2015

전이중(full-duplex) 셀룰라 네트워크에서 상향링크 사용자는 하향링크 사용자에게 간섭을 유발하므로 같은 무선 자원을 동시에 사용하는 상 하향링크 사용자 쌍을 어떻게 결정하는 지가 시스템 성능에 큰 영향을 미친다. 본 논문에서는 사용자의 서비스의 질을 보장하기 위한 목적으로 아웃티지(outage) 발생의 최소화를 위한 최적화 문제를 제시하고, 낮은 복잡도를 갖는 차선의 사용자 스케쥴링 알고리즘을 제안한다. 제안하는 스케쥴링 방식은 나쁜 신호 품질을 갖는 하향링크 사용자에게 간섭을 덜 미치는 상향링크 사용자를 먼저 선택할 수 있도록 우선권을 주는 방식으로 동작한다. 시뮬레이션 결과 제안하는 사용자 스케쥴링 방식을 사용하는 전이중 시스템은 최적에 가까운 아웃티지 성능을 달성하면서 기존 반이중 모드의 셀룰라 시스템 대비 아웃티지 발생을 현저히 줄인다.

• Journal of Information Processing Systems
• /
• 제9권2호
• /
• pp.301-314
• /
• 2013

In a parallel processing system, Multi-stage Interconnection Networks (MINs) play a vital role in making the network reliable and cost effective. The MIN is an important piece of architecture for a multiprocessor system, and it has a good impact in the field of communication. Optical Multi-stage Interconnection Networks (OMINs) are the advanced version of MINs. The main problem with OMINs is crosstalk. This paper, presents the (1) Destination Based Modified Omega Network (DBMON) and the (2) Destination Based Scheduling Algorithm (DBSA). DBSA does the scheduling for a source and their corresponding destination address for messages transmission and these scheduled addresses are passed through DBMON. Furthermore, the performance of DBMON is compared with the Crosstalk-Free Modified Omega Network (CFMON). CFMON also minimizes the crosstalk in a minimum number of passes. Results show that DBMON is better than CFMON in terms of the average number of passes and execution time. DBSA can transmit all the messages in only two passes from any source to any destination, through DBMON and without crosstalk. This network is the modified form of the original omega network. Crosstalk minimization is the main objective of the proposed algorithm and proposed network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.3876-3895
• /
• 2014

Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2001년도 추계종합학술대회
• /
• pp.113-116
• /
• 2001

본 논문에서는 WDM 단일흡 방송망에서 멀티캐스트 스케줄링 알고리즘을 제안하였다. 기존의 멀티캐스트 스케줄링 알고리즘의 주요 연구내용은 멀티캐스트 그룹에 속하는 수신노드가 수신준비가 끝난 후 데이터 메시지를 수신하기까지 기다리는 지연시간을 최소화 할 수 있도록 서브그룹을 나누는 연구가 대부분이다. 이들 서브그룹을 나누기 위한 방법들은 송신노드에서 사용하는 데이터 채널에 수신기를 튜닝하여 가장 지연시간이 작도록 그룹화 시키는 알고리즘이다. 그러나 수신기의 이전 튜닝상태를 고려하면 보다 최적화된 멀티캐스트 스케줄링이 가능할 것이다. 따라서 본 논문에서는 수신노드의 수신기의 현재 상태를 수집하여 멀티캐스트 메시지의 전송 시간이 최소가 되도록 멀티캐스트 그룹을 서브그룹화 하는 방안을 제안하였다. 제안된 방법은 가변송수신기를 사용하는 WDM 단일홉 방송망에서 동작되며 고정된 제어채널을 통해 수신노드의 상태를 수집할 수 있도록 구성하였다. 또한 제안된 방법은 컴퓨터 시뮬레이션을 통하여 성능을 분석하고 기존의 멀티캐스트 스케줄링 알고리즘과 비교하였다.