• Journal of applied mathematics & informatics
• /
• 제32권1_2호
• /
• pp.129-136
• /
• 2014

One of the fundamental issues in the design of dynamic spectrum access policy is the modeling of the dynamic behavior of channel occupancy by primary users. Under a Markovian modeling of channel occupancy, a periodic sensing and greedy access policy is known as one of the simple and practical dynamic spectrum access policies in cognitive radio networks. In this paper, the primary occupancy of each channel is modeled as a discrete-time alternating renewal process with generally distributed on- and off-periods. A periodic sensing and greedy access policy is constructed based on the general channel occupancy model. Simulation results show that the proposed policy has better throughput than the policies using channel models with exponentially distributed on- or off-periods.

• East Asian mathematical journal
• /
• 제30권1호
• /
• pp.23-29
• /
• 2014

To solve inefficient spectrum usage problem under current static spectrum management policy, various kinds of dynamic spectrum access strategies have appeared. Myopic policy, which maximizes immediate throughput, is a simple and robust strategy with reduced complexity. In this paper, we present a simple mathematical model to evaluate the saturation throughput and medium access delay of a myopic policy in the presence of multiple channels.

• 한국정보통신학회논문지
• /
• 제17권11호
• /
• pp.2547-2552
• /
• 2013

동적 스펙트럼 접속 방식에서 각 이차사용자는 자신의 성능을 높이기 위하여 채널의 상태를 추적하여 채널이 사용되지 않을 가능성이 가장 높은 채널을 선택하게 된다. 다수의 이차사용자가 동일한 동적 스펙트럼 접속 방식에 따라 동작한다면, 대부분의 이차사용자는 비슷한 결과의 채널 상태 추적 정보를 얻게 된다. 이로 인해 각 이차사용자가 동일한 채널을 선택할 가능성이 높아지고, 이차사용자 사이의 충돌이 발생할 가능성이 높아진다. 본 논문은 이러한 이차사용자 사이의 충돌을 줄이기 위하여 다른 이차사용자의 신뢰 벡터를 추적하여 그 결과를 채널 선택에 이용하는 동적 스펙트럼 접속 방식을 제안한다. 시뮬레이션 결과는 본 논문에서 제안한 방식이 다른 이차사용자를 고려하지 않는 방식에 비해 성능이 더 나아진다는 것을 보여준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.3075-3093
• /
• 2014

In this paper, we consider an advanced wireless user, called primary-secondary user (PSU) who is capable of harvesting renewable energy and connecting to both the primary network and cognitive radio networks simultaneously. Recently, energy harvesting has received a great deal of attention from the research community and is a promising approach for maintaining long lifetime of users. On the other hand, the cognitive radio function allows the wireless user to access other primary networks in an opportunistic manner as secondary users in order to receive more throughput in the current time slot. Subsequently, in the paper we propose the channel access policy for a PSU with consideration of the energy harvesting, based on a Partially Observable Markov decision process (POMDP) in which the optimal action from the action set will be selected to maximize expected long-term throughput. The simulation results show that the proposed POMDP-based channel access scheme improves the throughput of PSU, but it requires more computations to make an action decision regarding channel access.

• International journal of advanced smart convergence
• /
• 제9권2호
• /
• pp.164-172
• /
• 2020

The interest and importance of the convergence services for healthcare expand more and more as the average life expectancy increases. Convergence of ICT and healthcare technology unfold efficient and quick health services. Recently, healthcare services provide to clients with apps over web. On-demand wireless data broadcast supports any number of clients to access their desired data items dynamically by responding the needs for data items from the clients. In this paper, we propose an on-demand system to broadcast FHIR bundles for efficient healthcare services. We use time-parameterized replacing policy for renewing the bundle items on the wireless broadcast channel. The policy lets the on-demand broadcasting dynamic by controlling the time duration for the bundles to reside over the wireless channel. With simulation studies using an implemented testbed, we evaluate the performances of the proposed system in access time and tuning time. For evaluation, we compare the time-parameterized replacing policy of the proposed system with regular-number replacing policy. The proposed time-parameterized replacing policy shows shorter access time than the regular-number replacing policy because the policy responds more actively and dynamically to the change of the needs of the clients for FHIR bundles.

• 한국정보보호학회:학술대회논문집
• /
• 한국정보보호학회 2001년도 종합학술발표회논문집
• /
• pp.340-347
• /
• 2001

MAC(Mandatory Access Control)이나 MLS(Multi Level Security) 보안정책이 적용된 보안운영체제는 주체와 객체에 보안등급(Security Level)과 영역(Category) 값을 부여하고, 부여된 이들 정보에 의해 객체에 행해지는 주체의 접근을 제한한다. 하지만, 이러한 MAC과 MLS 보안이 적용된 경우라 하더라도 시스템의 보안정책을 위반하며 불법적 정보를 유통하게 하는 경로가 있을 수 있다. 본 논문에서는 불법적 정보의 유통경로가 되고 있는 IPC(Inter Process Communication) 메커니즘과 스토리지에 의한 비밀채널을(Covert Channel) 문제 해결 위해 커널 수준의 설계와 구현을 시도하였다. IPC 메커니즘에 의한 불법적 정보흐름 제거를 위해 IPC 메커니즘에 MLS 보안정책을 적용하였고, 스토리지 비밀채널는 시스템 콜 명세를 분석하여 이를 식별, 감사, 지연처리가 가능토록 하였다.

• 한국통신학회논문지
• /
• 제21권1호
• /
• pp.175-186
• /
• 1996

An optimal channel input-traffic control (OCIC) policy is proposed for slotted frequency-hopped spread-spectrum multiple access communication systems. When the number of channel input packets is set to the optimal number, the conditional throughput for the OCIC policy is analyzed. The state transition probability is derived, the steady state performance is analyzed, and the mean pracket delay is obtained. It is shown that the mean packet delay decreases considerably when the priority of transmission is given to backlogged users. The smaller is the number of requency slots, the larger are the differences between the preformance of the OCIC policy and that of the other policies.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.2097-2100
• /
• 2003

Many studies have been done on secure operating system using secure kernel that has various access control policies for system security. Secure kernel can protect user or system data from unauthorized and/or illegal accesses by applying various access control policies like DAC(Discretionary Access Control), MAC(Mandatory Access Control), RBAC(Role Based Access Control), and so on. But, even if secure operating system is running under various access control policies, network traffic among these secure operating systems can be captured and exposed easily by network monitoring tools like packet sniffer if there is no protection policy for network traffic among secure operating systems. For this reason, protection for data within network traffic is as important as protection for data within local system. In this paper, we propose a secure operating system trusted channel, SOSTC, as a prototype of a simple secure network protocol that can protect network traffic among secure operating systems and can transfer security information of the subject. It is significant that SOSTC can be used to extend a security range of secure operating system to the network environment.

• Journal of Communications and Networks
• /
• 제11권2호
• /
• pp.134-147
• /
• 2009

Tracking and exploiting instantaneous spectrum opportunities are fundamental challenges in opportunistic spectrum access (OSA) in presence of the bursty traffic of primary users and the limited spectrum sensing capability of secondary users. In order to take advantage of the history of spectrum sensing and access decisions, a sequential decision framework is widely used to design optimal policies. However, many existing schemes, based on a partially observed Markov decision process (POMDP) framework, reveal that optimal policies are non-stationary in nature which renders them difficult to calculate and implement. Therefore, this work pursues stationary OSA policies, which are thereby efficient yet low-complexity, while still incorporating many practical factors, such as spectrum sensing errors and a priori unknown statistical spectrum knowledge. First, with an approximation on channel evolution, OSA is formulated in a multi-armed bandit (MAB) framework. As a result, the optimal policy is specified by the wellknown Gittins index rule, where the channel with the largest Gittins index is always selected. Then, closed-form formulas are derived for the Gittins indices with tunable approximation, and the design of a reinforcement learning algorithm is presented for calculating the Gittins indices, depending on whether the Markovian channel parameters are available a priori or not. Finally, the superiority of the scheme is presented via extensive experiments compared to other existing schemes in terms of the quality of policies and optimality.

• Journal of Communications and Networks
• /
• 제10권3호
• /
• pp.287-296
• /
• 2008

The IEEE 802.11 wireless standard uses the carrier sense multiple access with collision avoidance (CSMA/CA) as its MAC protocol (during the distributed coordination function period). This protocol is an adaptation of the CSMA/CD of the wired networks. CSMA/CA mechanism cannot guarantee quality of service (QoS) required by the application because orits random access method. In this study, we propose a new MAC protocol that considers different types of traffic (e.g., voice and data) and for each traffic type different priority levels are assigned. To improve the QoS of IEEE 802.11 MAC protocols over a multi-channel CSMA/CA, we have developed a new admission policy for both voice and data traffics. This protocol can be performed in direct sequence spread spectrum (DSSS) or frequency hopping spread spectrum (FHSS). For voice traffic we reserve a channel, while for data traffic the access is random using a CSMA/CA mechanism, and in this case a selective reject and push-out mechanism is added to meet the quality of service required by data traffic. To study the performance of the proposed protocol and to show the benefits of our design, a mathematical model is built based on Markov chains. The system could be represented by a Markov chain which is difficult to solve as the state-space is too large. This is due to the resource management and user mobility. Thus, we propose to build an aggregated Markov chain with a smaller state-space that allows performance measures to be computed easily. We have used stochastic comparisons of Markov chains to prove that the proposed access protocol (with selective reject and push-out mechanisms) gives less loss rates of high priority connections (data and voices) than the traditional one (without admission policy and selective reject and push-out mechanisms). We give numerical results to confirm mathematical proofs.