• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7A
• /
• pp.485-492
• /
• 2003

This paper proposes a transmission probability control scheme for guaranteeing fair packet transmissions in CDMA slotted ALOHA system. In CDMA slotted ALOHA system, the packets transmitted in the same slot act as multiple access interference, so that unsuccessful packet transmissions are caused entirely by multiple access interference. Therefore, in order to maximize the system throughput, the number of simultaneously transmitted packets should be kept at a proper level. In the proposed scheme, the base station calculates the packet transmission probability of mobile stations in the next slot according to the offered load and then broadcasts this probability to all the mobile stations. Mobile stations, which have a packet to transmit, attempt to transmit packet with the received probability. Simulation results show that the proposed scheme can offer better system throughput and average delay than the conventional scheme, and guarantee a good fairness among all mobile stations regardless of the offered load.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.603-606
• /
• 2019

In this paper, we propose a slotted-ALOHA-based random access protocol and derive the optimal number of random slots that maximize channel throughput when multiple energy harvesting sensor devices perform random access in wireless-powered sensor networks (WPSN). Throughput numerical analysis, we prove that the throughput has a concavity with respect to the number of random slots and obtain the optimal number of slots. Simulation results show that the throughput of the proposed slotted ALOHA-based random access protocol is maximize when the derived optimal number of slots is employed in the considered WPSN.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.235-237
• /
• 2002

본 논문에서는 전용 코드 방식의 CDMA 슬롯 ALOHA 시스템에서 패킷 전송 확률을 동적으로 제어하는 알고리즘을 제안한다. 전용 코드 방식의 CDMA 슬롯 ALOHA 시스템에서는 고유의 확산코드론 이용하여 패킷을 전송하므로 패킷 충돌로 인한 전송 실패는 없는 반면, 다원 접속 간섭에 의한 비트 오류가 패킷 전송의 실패 요인 된다. 제안한 알고리즘에서는 기지국이 망의 부하에 따라 단말기들의 패킷 전송 확률을 계산하여 방송하고, 단말기에서는 이를 기반으로 패킷 전송을 시도한다. 성능 분석의 결과, 제안한 알고리즘은 망의 부하에 따라 적응적으로 전송 확률을 제어함으로써 동시에 전송되는 패킷의 수를 일정하게 유지시킬 수 있었으며, 이로 인하여 시스템 성능이 향상됨을 알 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.115-117
• /
• 2003

본 논문에서는 CDMA S-ALOHA 시스템에서 공평한 패킷 전송을 위한 MAC 프로토콜을 제안한다. CDMA S-ALOHA 시스템에서 동일한 슬롯에 전송되는 패킷들은 다원접속 간섭으로 작용하며, 이는 패킷 전송 실패의 주요 요인이 된다 따라서 최대의 시스템 처리율을 얻기 위하여 동시에 전송되는 패킷의 수를 일정하게 유지시킬 필요가 있다. 제안한 기법에서는 기지국이 망의 부하에 따라 다음 슬롯의 패킷 전송 확률을 계산하여 방송하고, 단말기들은 수신한 전송 확률을 기반으로 패킷 전송을 시도한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7B
• /
• pp.448-454
• /
• 2007

This paper proposes an estimation method of number of tags which may be necessary in improving anti-collision performance for ALOHA-based RFID systems. In ALOHA-based anti-collision algorithms, since the performance of the multi tag identification can be improved by allocating the optimal slot size corresponding to the number of tags, it is needed to exactly estimate the number of tags. The proposed method uses the a priori knowledge of the relation between the expectation of the number of empty slots and the number of tags. After measuring the number of empty slots in one ROUND, we estimate the number of tags which corresponds to the expectation of the number of empty slots nearest to the measured one. Simulation results show that the proposed method is superior to conventional methods in terms of the estimation accuracy and the computational complexity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.1
• /
• pp.155-162
• /
• 1999

In this paper, an R_ALOHA_CDMA protocol is proposed for voice and data integrated services in the hybrid TDMA/CDMA wireless networks. In the hybrid TDMA/CDMA systems, the backward logical channels are composed of time slots with multiple spreading codes per slot. In the proposed protocol, a voice terminal can reserve a spreading code to transmit voice packets during a talkspurt. On the other hand, whenever a data terminal generates a packet, it transmits the packet through one of the available spreading codes. Throughout the results, it is shown that the system capacity increases in proportion to the number of spreading codes.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.267-274
• /
• 2009

For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. There are two methods of anti-collision algorithms for the identification of multiple tags, conclusive algorithms based on tree and stochastic algorithms based on slotted ALOHA. In this paper, we propose a Dynamic Framed Slotted ALOHA-Slot Congestion(DFSA-SC) Algorithm. The proposed algorithm improves the efficiency of collision resolution. The performance of the proposed DFSA-SC algorithm is showed by simulation. The identification time of the proposed algorithm is shorter than that of the existing DFSA algorithm. Furthermore, when the bit duplication of the tagID is higher, the proposed algorithm is more efficient than Query Tree algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.11A
• /
• pp.1630-1641
• /
• 2000

본 논문은 셀룰러 시스템 상향 링크에서 음성데이터 및 실시간 영상데이터로 구성된 화상전화서비스, 고속 및 저속 데이터베이스의 다중 전송률 멀티미디어 서비스를 통합 지원할수 있는 CDMA R-ALOHA 프로토콜을 제안하였다. 제안된 프로토콜은 액세스슬롯과 전송슬롯으로 구분된 프레임의 구조를 이용한 코드할당 방식으로 전송슬롯에서의 간섭을 줄였다. 그리고, 각 서비스의 트래픽 특성에 따른 전송코드 예약과 화상전화서비스 사용자의 핸드오프호를 고려하여 분석된 각 서비스 부시스템의 Markov-chain 모델을 이용한 각 서비스의 채널 경쟁 사용자수 추정을 기반으로 서비스별 액세스 허용확률을 제안하여, 액세스슬롯에서의 패킷 충돌을 감소시키고 핸드오프호의 우선권을 보장할 수있다. 또한 화상전화서비스의 영상데이터 전송정보를 이용한 코드 예약방식을 제안하여, 음성 트래픽을 패킷의 손실이 없이 지원하였고 고속 및 저속 데이터베이스를 통해 채널 이용효율을 극대화하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.70-77
• /
• 2009

In an RFID network consisting of a single reader and many tags, a framed and slotted ALOHA, which provides a number of slots for the tags to respond, was introduced for arbitrating a collision among tags' responses. In a framed and slotted ALOHA, the number of slots in each frame should be optimized to attain the maximal efficiency in tag cognizance. While such an optimization necessitates the knowledge about the number of tags, the reader hardly knows it. In this paper, we propose a tag cognizance scheme based on framed and slotted ALOHA, which is characterized by directly taking a Bayes action on the number of slots without estimating the number of tags separately. Specifically, a Bayes action is yielded by solving a decision problem which incorporates the prior distribution the number of tags, the observation on the number of slots in which no tag responds and the loss function reflecting the cognizance rate. Also, a Bayes action in each frame is supported by an evolution of prior distribution for the number of tags. From the simulation results, we observe that the pair of evolving prior distribution and Bayes action forms a robust scheme which attains a certain level of cognizance rate in spite of a high discrepancy between the Due and initially believed numbers of tags. Also, the proposed scheme is confirmed to be able to achieve higher cognizance completion probability than a scheme using classical estimate of the number of tags separately.