• ETRI Journal
• /
• 제44권5호
• /
• pp.733-745
• /
• 2022

In software-defined wireless networking (SDWN), the optimal routing technique is one of the effective solutions to improve its performance. This routing technique is done by many different methods, with the most common using integer linear programming problem (ILP), building optimal routing metrics. These methods often only focus on one routing objective, such as minimizing the packet blocking probability, minimizing end-to-end delay (EED), and maximizing network throughput. It is difficult to consider multiple objectives concurrently in a routing algorithm. In this paper, we investigate the application of machine learning to control routing in the SDWN. An intelligent routing algorithm is then proposed based on the machine learning to improve the network performance. The proposed algorithm can optimize multiple routing objectives. Our idea is to combine supervised learning (SL) and reinforcement learning (RL) methods to discover new routes. The SL is used to predict the performance metrics of the links, including EED quality of transmission (QoT), and packet blocking probability (PBP). The routing is done by the RL method. We use the Q-value in the fundamental equation of the RL to store the PBP, which is used for the aim of route selection. Concurrently, the learning rate coefficient is flexibly changed to determine the constraints of routing during learning. These constraints include QoT and EED. Our performance evaluations based on OMNeT++ have shown that the proposed algorithm has significantly improved the network performance in terms of the QoT, EED, packet delivery ratio, and network throughput compared with other well-known routing algorithms.

• 한국통신학회논문지
• /
• 제31권5B호
• /
• pp.365-377
• /
• 2006

매체공유기반 통신시스템은 매체접근제어 과정에서 단말기의 채널 점유 제약 조건에 따라 크게 완전매체공유 시스템과 불완전매체 공유 시스템으로 구분할 수 있다. 본 논문에서는 불완전매체공유 시스템의 채널활용효율을 향상시키기 위한 분산식 매체접근제어기법을 제안한다. 제안하는 매체접근제어기법은 IEEE 802.11 무선랜의 CSMA/CA 기법을 확장한 방법으로써 임의 지연 시간을(random backoff time) 채널에 대해 개별적, 집합적, 큐(queue)에 대해 개별적으로 적용함으로써 크게 3가지 형태로 제시되었다. 모의실험 결과 성능측면에서는 큐에 대해 개별적으로 임의 지연시간을 적용하였을 때 상대적으로 우월한 성능을 보였다. 또한 복잡도 측면에서는 채널에 대하여 집합적으로 임의 지연시간을 적용했을 때 상대적으로 낮은 복잡도를 보였다. 임의 지연시간을 분할된 채널에 대해 개별적으로 적용하는 방식은 성능과 연산복잡도의 trade-off관계에 있어서 앞서 제시된 방식들보다 우위에 있음을 보이고 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1655-1673
• /
• 2018

Mobile computing environment is subject to the constraints of bounded network bandwidth, frequently encountered disconnections, insufficient battery power, and system asymmetry. To meet these constraints and to gain high scalability, data broadcasting has been proposed on data transmission techniques. However, updates made to the database in any broadcast cycle are deferred to the next cycle in order to appear to mobile clients with lower data currency. The main goal of this paper is to enhance the transaction performance processing and database currency. The main approach involves decomposing the main broadcast cycle into a number of sub-cycles, where data items are broadcasted as they were originally sequenced in the main cycle while appearing in the most current versions. A concurrency control method AOCCRBSC is proposed to cope well with the cycle decomposition. The proposed method exploits predeclaration and adapts the AOCCRB method by customizing prefetching, back-off, and partial backward and forward validation techniques. As a result, more than one of the conflicting transactions is allowed to commit at the server in the same broadcast cycle which empowers the processing of both update and read-only transactions and improves data currency.

• Journal of Communications and Networks
• /
• 제13권5호
• /
• pp.472-480
• /
• 2011

In this paper, we investigate two new candidate transmission schemes, non-orthogonal frequency reuse (NOFR) and beam-hopping (BH). They operate in different domains (frequency and time/space, respectively), and we want to know which domain shows overall best performance. We propose a novel formulation of the signal-to-interference plus noise ratio (SINR) which allows us to prove the frequency/time duality of these schemes. Further, we propose two novel capacity optimization approaches assuming per-beam SINR constraints in order to use the satellite resources (e.g., power and bandwidth) more efficiently. Moreover, we develop a general methodology to include technological constraints due to realistic implementations, and obtain the main factors that prevent the two technologies dual of each other in practice, and formulate the technological gap between them. The Shannon capacity (upper bound) and current state-of-the-art coding and modulations are analyzed in order to quantify the gap and to evaluate the performance of the two candidate schemes. Simulation results show significant improvements in terms of power gain, spectral efficiency and traffic matching ratio when comparing with conventional systems, which are designed based on uniform bandwidth and power allocation. The results also show that BH system turns out to show a less complex design and performs better than NOFR system specially for non-real time services.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제11권2호
• /
• pp.149-156
• /
• 2005

HLA는 시뮬레이션 표준 아키텍처로서 민수 및 국방 시뮬레이션 분야에서 관심이 높아가고 있다. 국내외에서 워게임과 같은 구조적 시뮬레이션에서는 HLA를 적용한 성공적인 개발사례를 찾아 볼 수 있다. 그러나 네트워크 시율레이터나 인터넷 게임과 같은 실시간 분산 시뮬레이션에서는 그 적용 사례가 아직까지 관찰되고 있지 않다. 그 이유는 실시간 분산 HLA 시뮬레이션에서는 네트워크 수준에서 RTI를 통한 메시지 전송시간이 컴퓨팅 능력, 시뮬레이션 노드 개수, 전송방식, 전송패킷의 크기에 영향을 받고, 응용 수준에서 메시지의 사건처리시간이 메시지 처리방식에 의존하여 실시간 제약조건을 설정하기가 어렵기 때문이다. 따라서 본 논문에서는 차후 M-SAM 시뮬레이터의 개발을 위하여 RTI의 실시간 제약 조건의 수준을 고찰하고자 한다. 이를 위하여 1.Af 환경에서 6대의 PC상에 HLA 기반의 실험용 시뮬레이터를 개발하고 RTI의 성능을 측정하고 분석하였다. 본 연구의 결과로서 이전의 연구에서 제시되지 않았던 다수 노드 환경에서 실제 운용 시나리오와 부하에 따른 메시지 지연시간, RTI 부하 및 RTI 패킷전송 비율에 대한 정량적인 특성 값을 얻을 수 있었고, 이 결과는 향후 M-SAM 시뮬레이터 또는 유사 응용체 계의 개발에서 표적 수, 전송주기 및 메시지 처리방식에 대한 설정지침으로 활용이 기대된다.

• 한국정보처리학회논문지
• /
• 제7권2S호
• /
• pp.649-655
• /
• 2000

Real-time application programs have constraints which need to be met between media-data. These constraints represents the delay time ad quality of service between media-data to be presented. In order to efficiently describe the delay time and quality of service, a new synchronization mechanism is needed. Proposed paper is a dynamic synchronization that minimized the effects of adaptive transmission delay time. That is, the method meets the requirements of synchronization between media-dat by handling dynamically the adaptive waiting time resulted from variations of delay time. In addition, the mechanism has interval adjustment using maximum delay jitter time. This paper decreases the data loss resulted from variation of delay time and from loss time of media-data by means of applying delay jitter in order to deal with synchronization interval adjustment. Plus, the mechanism adaptively manages the waiting time of smoothing buffer, which leads to minimize the gap from the variation of delay time. The proposed paper is suitable to the system which requires the guarantee of high quality of service and mechanism improves quality of services such as decrease of loss rate, increase of playout rate.

• Journal of Electrical Engineering and Technology
• /
• 제12권3호
• /
• pp.1307-1313
• /
• 2017

Sensor networks are composed of provide low powered, inexpensive distributed devices which can be deployed over enormous physical spaces. Coordination between sensor devices is required to achieve a common communication. In low cost, low power and short-range wireless environment, sensor networks cope with significant resource constraints. Security is one of main issues in wireless sensor networks because of potential adversaries. Several security protocols and models have been implemented for communication on computing devices but deployment these models and protocols into the sensor networks is not easy because of the resource constraints mentioned. Memory intensive encryption algorithms as well as high volume of packet transmission cannot be applied to sensor devices due to its low computational speed and memory. Deployment of sensor networks without security mechanism makes sensor nodes vulnerable to potential attacks. Therefore, attackers compromise the network to accept malicious sensor nodes as legitimate nodes. This paper provides the different security models as a metric, which can then be used to make pertinent security decisions for securing wireless sensor network communication.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권3호
• /
• pp.425-445
• /
• 2013

The IEEE 802.11 compliant stations can transmit at multiple transmission rates. Selection of an appropriate transmission rate plays a significant role in determining the overall efficiency of a communication system. The technique which determines the channel state information and accordingly selects an appropriate transmission rate is called rate-adaptation protocol. The IEEE 802.11 standard does not provide standard specification for implementing a rate-adaptation protocol for its multi-rate capable wireless stations. Due to the lack of standard specification, there is a myriad of rate-adaptation protocols, proposed by industry and various research institutes. This paper surveys the existing rate-adaptation schemes, discusses various features which contribute significantly in the process of rate-adaptation, the timing constraints on such schemes, and the performance gains in terms of throughput, delay and energy efficiency; which can be gained by the use of rate-adaptation. The paper also discusses the implication of rate-adaptation schemes on the performance of overall communication and identifies existing research challenges in the design of rate-adaptation schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권10호
• /
• pp.2455-2472
• /
• 2012

Although underlay spectrum sharing has been shown as a promising technique to promote the spectrum utilization in cognitive radio networks (CRNs), it may suffer bad secondary performance due to the strict power constraints imposed at secondary systems and the interference from primary systems. In this paper, we propose a two-phase based cooperative transmission protocol with the interference cancellation (IC) and best-relay selection to improve the secondary performance in underlay models under stringent power constraints while ensuring the primary quality-of-service (QoS). In the proposed protocol, IC is employed at both the secondary relays and the secondary destination, where the IC-based best-relay selection and cooperative relaying schemes are well developed to reduce the interference from primary systems. The closed-form expression of secondary outage probability is derived for the proposed protocol over Rayleigh fading channels. Simulation results show that, with a guaranteed primary outage probability, the proposed protocol can achieve not only lower secondary outage probability but also higher secondary diversity order than the traditional underlay case.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권6호
• /
• pp.1379-1397
• /
• 2013

We consider a system where a licensed radio spectrum is shared by multiple primary users(PUs) and secondary users(SUs). As the spectrum of interest is licensed to primary network, power and channel allocation must be carried out within the cognitive radio network so that no excessive interference is caused to PUs. For this system, we study the joint beamforming and power allocation problem via game theory in this paper. The problem is formulated as a non-cooperative beamforming and power allocation game, subject to the interference constraints of PUs as well as the peak transmission power constraints of SUs. We design a joint beamforming and power allocation algorithm for maximizing the total throughput of SUs, which is implemented by alternating iteration of minimum mean square error based decision feedback beamforming and a best response based iterative power allocation algorithm. Simulation results show that the algorithm has better performance than an existing algorithm and can converge to a locally optimal sum utility.