• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1855-1869
• /
• 1993

For the traditional ALOHA system without capture, the Markov chain obtained using the number of backlogged users at each slot if shown to be non-ergodic. So the infinite population ALOHA with fixed retransmission probabilities is unstable for any choice of the arrival rates and retransmission probabilities. The capture ALOHA system of also shown to be unstable for any arrival rate unless it has perfect. In this paper, we study a stabilization policy for capture ALOHA system that controls the retransmission probabilities and prove the stability of its multidimensional Markovian model by empolying a continuous Lyapunov function, and thus identify the stability region. We also study a delay performance through computer simulation th show the stability for any input rate below the maximum achievable channel throughput.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.866-872
• /
• 2005

본 연구는 비축출형 우선순위 2-계층 대기행렬을 다룬다. 각 계층별 고객들은 마코비안 도착과정(Markovian arrival process, MAP)에 의하여 시스템에 도착하고, 각 계층마다 고유의 임계점을 갖는다. 시스템 내에 고객들이 존재하지 않으면 서어버는 유휴해지고 어느 계층이든지 상관없이 계층에 부여된 임계점에 먼저 도달하면 서어버는 서비스를 시작한다. 우선순위가 높은 고객들을 먼저 서비스하는 비축출형 우선순위 서비스규칙을 따른다. 본 연구에서는 각 계층별 고객들의 대기시간분포에 대한 라플라스(Laplace-Stieltjes) 변환과 평균 대기시간을 유도한다.

• Journal of applied mathematics & informatics
• /
• v.41 no.6
• /
• pp.1155-1171
• /
• 2023

This paper investigates a non Markovian M/G/1 queue with retrial policy, different kind of service rates as well as unsatisfied clients which is inspired by an example of a transmission medium access control in wireless communications. The server tends to work continuously until it finds at least one client in the system. The server will begin its maintenance tasks after serving all of the clients and if the system becomes empty. Provisioning periods in regular working periods and maintenance service periods should be evenly divided. Using supplementary variable technique, the amount of clients in the system as well as in the orbit were found. Further few performance measures of the system were demonstrated numerically.

• Journal of Communications and Networks
• /
• v.11 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.7
• /
• pp.989-998
• /
• 1993

In a bursty user traffic mode, ALOHA random multiple access protocol achieves higher performance than any conventional fixed assignment technique. One of central problems in slotted ALOHA is synchronization. Because of the long propagation delay in satellite mobile communication, packet may be spilt over into adjacent slots and thus guard time may be included between packet intervals. In conventional ALOHA channels, simultaneous transmission by two or more users results in a collision : the unsuccessful packets have to be retransmitted according to some retransmission algorithm. However, in a radio environment, users are often at different distances from the receiver : therefore, their received signals have substantially different power levels. The packet arriving with the highest energy now has a good chance of being detected accurately. Similarly, in some spread-spectrum random access systems, the earliest arriving packet dominates later arriving packets and thus captures the channel. In this paper slotted ALOHA channel with non zero guard time and capture probability is studied. Using the Markovian model, the performance of slotted ALOHA with guard time and capture effects is derived and compared with that of the conventional ALOHA via numerical analysis.