• Title/Summary/Keyword: 슬롯 ALOHA

Search Result 67, Processing Time 0.027 seconds

Evaluation of Multiple Access Protocols for Controlling UUV (무인잠수체 통제를 위한 다중접속 프로토콜 평가)

  • Jung, Seung-Back;Cho, Jin-Soo;Shim, Tae-Bo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.6
    • /
    • pp.279-285
    • /
    • 2008
  • This study includes the efficiency assessment of a multiple access protocol for UUV (Underwater unmanned vehicle) control. Most of UUVs are controled by wire now; however, wireless control is demanded because of the demerit of the wire control that limits the place and activity. This study simulates efficiency of a standardization multiple access protocol (Pure ALOHA, Slotted ALOHA, Nonpersistent CSMA, Slotted Nonpersistent ISMA) formed for the purpose of performing wireless communication controlled by the ship or communication buoy at the sea surface and by the under water communication node at the bottom in order to efficiently control the UUV's. Results show that no significant changes occur related to changing type of the mother ship and the communication node; In addition, the Non-persistent CSMA and the Slotted Non-persistent ISMA show relatively high efficiency for underwater acoustic communication.

Access Control Protocol for Packet Transmission in CDMA-based Slotted (CDMA기반 슬롯 ALOHA 시스템에서 패킷 전송을 위한 접속 제어 프로토콜)

  • 임인택
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.05a
    • /
    • pp.615-618
    • /
    • 2002
  • This Paper Proposes an access control algorithm for guaranteeing fair packet transmissions in CDMA-based slotted ALOHA systems. In the proposed algorithm, the base station calculates the packet transmission and retransmission probabilities based on the offered loads and then broadcasts these probabilities to all mobile stations. Mobile stations, which have a packet to transmit, attempt to transmit a packet with the received probabilities. Simulation results show that the proposed algorithm can offer better system throughput and average delay than the conventional algorithm. Results also show that the proposed algorithm ran guarantee a good fairness among all mobile stations regardless of the offered loads.

  • PDF

Tag Number Estimation Scheme for Dynamic Frame Size Allocation (동적 프레임 크기 할당을 위한 태그 수 추정 기법)

  • Lim, In-Taek;Choi, Jin-Oh;Kim, Su-Hwan;Choi, Jin-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.756-758
    • /
    • 2010
  • Fixed frame size is used in the RFID system with the frame-based slot ALOHA algorithm. Therefore, it is anticipated that the tag identification performances will highly depend on the number of tags within the reader's identification range and the frame size. In this paper, we propose a tag number estimation scheme and analyze the performance with the computer simulations. The proposed scheme is based on the status of slots that the tags respond during a query round as well as the probabilistic calculations.

  • PDF

Improvement of RFID Tag Anti-Collision Algorithm Based on the Dynamic Framed Slotted ALOHA (Dynamic Framed Slotted ALOHA 기반 RFID 태그 충돌방지 알고리즘 개선)

  • Park, Nho-Kyung;Yun, Hyoung-Kie;Moon, Dai-Tchul
    • The Journal of the Acoustical Society of Korea
    • /
    • v.33 no.2
    • /
    • pp.126-132
    • /
    • 2014
  • In this paper, a DFSA (Dynamic Framed Slotted ALOHA) based anti-collision algorithm is described and a performance improved algorithm of DFSA and FSA is proposed. The proposed method makes use of expected values and has merits in operation speed by estimating closest value of the number of tags on a single operation. The algorithm compares and analyses number of empty slots and collide slots in accordance with the number of tags, which enables estimation of actual number of tags. we simulated the proposed algorithm and compared it with conventional methods. Results show that our method needs average 18.8 rounds to identify all tags. In case of less than 1000 tags, an average of 18.2 rounds is necessary and an average of 19.2 rounds is needed to identify all tags for more than 1000 tags. The proposed algorithm improves processing speed by 3.1 % comparing to DFSA with cancellation strategy, 10.1 % comparing to DFSA, 37.5 % comparing to FSA(Framed Slotted ALOHA).

Multichannel Anticollision Protocol for Improving Tag Collection Performance in Active RFID Systems (능동형 RFID 시스템에서 태그 수집 성능 향상을 위한 다중채널 기반 충돌방지 프로토콜)

  • Yoon, Won-Ju;Chung, Sang-Hwa;Park, Shin-Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1A
    • /
    • pp.50-57
    • /
    • 2009
  • Tag collection is one of the major functions in RFID systems. In this paper, we propose a multichannel slotted-aloha anticollision protocol to mitigate the tag collision problem and improve tag collection performance in active RFID systems. In the proposed anticollision protocol, while an RFID reader transmits commands to multiple RFID tags via a common channel, it receives multiple tag responses over multiple channels simultaneously. We also implemented an active RFID system supporting the proposed anticollision protocol. In experiments with the implemented reader and 60 tags, the proposed dual-channel slotted-aloha anticollision protocol showed a large improvement in tag collection performance compared with the single-channel slotted-aloha anticollision protocol. With 60 tags, the average time spent on tag collection using the dual-channel anticollision protocol was 600.543 ms, which was 46.3% of the 1289.721 ms required using the single-channel anticollision protocol.

Implementation of an Efficient Slotted CSMA/CA Anti-collision Protocol for Active RFID System (능동형 RFID 시스템을 위한 효율적인 Slotted CSMA/CA 충돌방지 프로토콜의 구현)

  • Joo, Jin-Hoon;Chung, Sang-Hwa
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.12
    • /
    • pp.1013-1022
    • /
    • 2012
  • Tag collection is one of the major concerns in radio frequency identification(RFID) system. All tags in RFID reader's transmission range send response message back to the reader in response to collection request message on the given rf channel. When multiple tags respond simultaneously, tag-collision may occur. Tag-collision problem is one of the most important issues in active RFID performance. To mitigate this problem, frame slotted ALOHA(FSA) anti-collision protocol is widely used in active RFID system. Several studies show that the maximum system efficiency of FSA anti-collision protocol is 36.8%. In this paper, we propose an efficient slotted CSMA/CA protocol to improve tag collection performance. We compare our protocol to the FSA anti-collision protocol. For the experiment, an 433MHz active RFID system is implemented, which is composed of an RFID reader and multiple tags. We evaluated the tag collection performance using one RFID reader and 40 tags in the real test bed. The experimental result shows that proposed protocol improves the tag collection time, round and collision probability by 18%, 37.4% and 77.8%, respectively.

Modified Back-Off Algorithm to Improve Fairness for Slotted ALOHA Sensor Networks (슬롯화된 ALOHA 센서 네트워크에서 공평성 향상을 위한 변형된 백오프 알고리즘)

  • Lee, Jong-Kwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.5
    • /
    • pp.581-588
    • /
    • 2019
  • In this paper, I propose an modified back-off algorithm to improve the fairness for slotted ALOHA sensor networks. In hierarchical networks, the performance degradation of a specific node can cause degradation of the overall network performance in case the data transmitted by lower nodes is needed to be synthesized and processed by an upper node. Therefore it is important to ensure the fairness of transmission performance to all nodes. The proposed scheme choose a back-off time of a node considering the previous transmission results as well as the current transmission result. Moreover a node that failed to transmit consecutively is given gradually shorter back-off time but a node that is success to transmit consecutively is given gradually longer back-off time. Through simulations, I compare and analyze the performance of the proposed scheme with the binary exponential back-off algorithm(BEB). The results show that the proposed scheme reduces the throughput slightly compared to BEB but improves the fairness significantly.

Retrospective Maximum Likelihood Decision Rule for Tag Cognizance in RFID Networks (RFID 망에서 Tag 인식을 위한 회고풍의 최대 우도 결정 규칙)

  • Kim, Joon-Mo;Park, Jin-Kyung;Ha, Jun;Seo, Hee-Won;Choi, Cheon-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.2
    • /
    • pp.21-28
    • /
    • 2011
  • We consider an RFID network configured as a star in which tags stationarily move into and out of the vicinity of the reader. To cognize the neighboring tags in the RFID network, we propose a scheme based on dynamic framed and slotted ALOHA which determines the number of slots belonging to a frame in a dynamic fashion. The tag cognizance scheme distinctively employs a rule for estimating the expected number of neighboring tags, identified as R-retrospective maximum likelihood rule, where the observations attained in the R previous frames are used in maximizing the likelihood of expected number of tags. Simulation result shows that a slight increase in depth of retrospect is able to significantly improve the cognizance performance.

Slotted ALOHA with Variable Slot Length for Underwater Acoustic Systems (수중 통신 시스템을 위한 가변 길이를 갖는 Slotted ALOHA)

  • Lee, Junman;Kang, Chung G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.1
    • /
    • pp.104-106
    • /
    • 2016
  • In this letter, we consider a random access scheme for underwater acoustic network, in which a slotted ALOHA with variable slot length is designed to enhance the random access performance for the nodes with the varying propagation delay.

Mixed Contention Method for a Quick Reservation Request in a WATM MAC Protocol (WATM 매체접근제어 프로토콜의 신속한 예약 요청을 위한 분산 및 중앙 경재 혼합 방식)

  • 유태화
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1999.10a
    • /
    • pp.12-17
    • /
    • 1999
  • WATM(Wireless ATM)에서의 매체접근제어(Medium Access Control)는 QoS를 보장하기 위해 다양한 방식들이 제안되어 왔다. 현재까지 제안되어 온 매체접근제어 방식들은 시분할 다중화 방식 (TDMA)과 예약경쟁방식을 주로 사용하고 있다. 이때 활용되는 기능에는 QoS를 보장하기 위해 통계적 다중화, 스케쥴링 또는 예약 방식 등이 있는데 경쟁 방식은 아직까지 slotted-ALOHA를 그대로 사용하고 있다. Slotted-ALOHA방식의 단점을 개선하기 위하여 통계적 방식으로 경쟁을 제어하거나 물리적 방식으로 경쟁을 분리시켜 그 효율을 향상 시켜왔으나 우선 순위가 같은 이동국들이 많을 경우에는 해결할 방법이 없었다. 이러한 문제점들은 기지국 중심의 경쟁방식이라는 점이 그 문제를 해결하는데 있어서의 걸림돌이다. 본 논문에서는 이미 슬롯을 할당받은 동료 이동국에게 예약요청을 피기백킹(piggybacking)함으로써 신속하게 슬롯을 할당을 받을 수 있는 분산 경쟁방식을 제안한다.

  • PDF