• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.80-87
• /
• 2013

This paper proposes a CW (Contention window) allocation scheme for real-time data transmission of emergency data on VANET (Vehicle to vehicle Ad hoc Network, V2V) protocol. The proposed scheme reduces the probability of packet collisions on V2V protocol and provides bandwidth efficiency with short delay of emergency sporadic data. In the case of high density traffic, the proposed scheme provides a decrease of recollision probability using dynamic CW adjustments. For the performance analysis, a throughput, end-to-end delays, and network loads were investigated on highway traffic. Simulation results show the performance enhancements in terms of the throughput, end-to-end delays, and network loads.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.340-347
• /
• 2007

Vehicle safety service can be effectively achieved with inter-vehicle communication technologies, in which moving vehicles transmit a safety related urgency information such as traffic accidents, sudden stops, obstacle appearance etc. They usually utilize a broadcast of message propagation method because the communicating vehicles are not known each other. The pure broadcasting scheme does not satisfy the requirements of vehicle safety communication service due to the transmission delay with frequent message collisions. To resolve this problem, this paper presents a group based propagation method for the multi-hop transmission, in order to deliver an urgency message to the reasonable size of vehicle troop. A group header is elected in considering of the position information of vehicles and radio transmission range. And a vehicle equivalent group is formed with the header. With benefits of the group based transmission, it is possible to minimize the unnecessary transmission and the possibility of message collisions. Simulation results show that the message propagation performance is so stable regardless of vehicle's congestion degree.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1852-1861
• /
• 1999

In this paper, CDMA Reservation ALOHA scheme which can reduce multiple access interference and packet collision is proposed to support multi-traffic such as voice and random data with and without priority. In this scheme, the time slot is divided into two stage, access and transmission stage. Only packets with spreading codes assigned from base station in access stage can transmit their packets in transmission stage, so MAI can be reduced. To reduce packer collision in access stage, the code reservation and access permission probability are used. Code reservation is allowed for voice traffic and continuous traffic with priority using piggyback and access permission probability based on the estimation of the number of contending users in the steady-state is adaptively applied to each traffic terminal. Also, we analyzed and simulated the numerical performances required for each traffic using Markov chain modeling in a single cell environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.12
• /
• pp.984-986
• /
• 2013

DCF(Distributed Coordination Function) defined in IEEE 802.11 provides two different modes, namely, a 2-way handshake and a 4-way handshake according to the transmission procedure. If secondary transmission would not cause a collision with primary transmission, there is no need to postpone transmission unnecessarily. We study a feasible condition which can transmit data concurrently and propose a concurrent transmission scheme.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.181-183
• /
• 2007

본 논문은 RF 리더기와 RF 태그 상호간의 통신시에 발생할 수 있는 충돌을 감지하고 이를 능동적으로 회피할수 있는 RFID(Radio Frequency IDentification)의 설계에 관한 내용이다. RFID는 사람, 자동차, 화물, 상품 등에 정보를 부가하는 시스템으로 그 부가정보를 무선통신매체를 이용하여 비접족으로 해독하는 시스템으로 기존의 바코드보다 데이터의 전송속도와 용량의 증가 그리고 편리성이 향상되는 장점이 있으나, 동시에 여러개의 RF태그와의 무선통신으로 인한 데이터의 충돌이 발생할 수 있다. 이러한 충돌을 감지하고 이를 적절하게 회피하는 것은 RFID 시스템의 신뢰성을 높이는데 필수적인 요소이다. RFID 태그로 사용되기 위해서는 건전지로 구동될 수 있도록 저전력소모가 요구되며 또한 통신의 시작과 충돌을 파악할 수 있는 캐리어 감지기능이 필수적이다. 본 논문에서는 이러한 조건들을 만족하는 Chipcon 사(社)의 양방향 RF IC를 사용하였다. Chipcon 사(社)의 양방향 RF IC는 다중 주파수 대역의 선택과 변조방식을 시리얼통신을 통해서 손쉽게 변경할 수 있기 때문에 충돌감지시 다양한 회피알고리즘을 상황에 맞게 구현할 수 있다. 본 논문에서는 양방향 RF IC를 사용하여 충돌을 감지하고 회피할 수 있는 RFID시스템을 설계하고 구현하였다.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.316-327
• /
• 2007

RFID (Radio Frequency Identification) is one of the most promising air interface technologies in the future for object identification using radio wave. If there are multiple tags within the range of the RFID tag reader, all tags send their tag identifications to the reader at the same time in response to the reader's query. This causes collisions on the reader and no tag is identified. A multi-tag identification problem is a core issue in the RFID. It can be solved by anti-collision algorithm such as slot based ALHOA algorithms and tree based algorithms. This paper, proposes a collision tree based anti-collision algorithm using collision tree in RFID system. It is a memory-less algorithm and is an efficient RFID anti-collision mechanism. The collision tree is a mechanism that can solve multi-tag identification problem. It is created in the process of querying and responding between the reader and tags. If the reader broadcasts K bits of prefix to multiple tags, all tags with the identifications matching the prefix transmit the reader the identifications consisted of k+1 bit to last. According to the simulation result, a proposed collision tree based anti-collision algorithm shows a better performance compared to tree working algorithm and query tree algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.685-687
• /
• 2001

최근 인터넷의 급격한 성장의 일면에는 CSMA/CD 프로토콜에 기반을 둔 이더넷 네트워크 망의 중추적인 서비스 제공에 있다고 볼 수 있다. 사용자의 기하급수적 증가와 더불어 인터넷망의 복잡성은 이더넷 인터넷망에서의 각 호스트들간의 데이터 층들을 급속하게 야기시켜, 전체적인 서비스 지연을 초래하는 경우가 발생되고 있다. 본 논문에서는 전송예약을 통해 기존 CSMA/CD 프로토콜에서의 프레임 충돌횟수를 줄이고 전송효율 또한 높이는 방안을 제시한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.1-3
• /
• 2003

OBS망에서 버스트의 충돌로 인한 버스트의 drop은 TCP의 성능에 중요한 영향을 끼치나, 기존의 drop policy에서는 이를 고려하지 않으며 TCP에 대한 연구로는 버스트의 assembling이 주를 이루고 있다. 본 논문에서는 OBS망에서 TCP의 재전송 문제를 drop policy와 연계하여 그 성능을 향상시키고자 한다. 본 논문에서 제안하는 drop policy는 버스트의 재전송 횟수가 더 작은 버스트를 drop시키는 TCP 기반 DP이다. TCP 기반 DP 모델과 일반적인 DP 모델의 성능을 ns­2를 이용한 시뮬레이션을 통해 평가하며, 이 때 시간의 변화에 따른 TCP throughput과 패킷의 drop rate을 비교 분석한다.

• Journal of Advanced Navigation Technology
• /
• v.13 no.2
• /
• pp.224-230
• /
• 2009

In the latest date, medical body area networks (MBANs) are emerging as a new technology for diagnosis the human body. MBANs in the health care fields are based on short-range and low-power (e.g. ubiquitous computing) among small-sized devices, and have been used by means of medical services. In this paper, we proposed an emergency message transmission protocol using carrier sense multiple access/time division multiple access in MBANs. This scheme focuses on dependability and power-efficiency. In order to increase the reliability of the transmission, this scheme modified a MCTA slot of IEEE 802.15.3 standard to a SR-MCTA slot. SR-MCTA slot is assigned by MBAN coordinator according to requesting terminal nodes. The method, having the priority of transmission, occurs a collision packet randomly. Results from this proposed solution revel that reservation-based TDMA medical body area network(MBAN) protocol for transmitting emergency message was improved in terms of transmission delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.7
• /
• pp.543-552
• /
• 2013

For the safety messages in IEEE 802.11p/WAVE vehicles network environment, strict periodic beacon broadcasting requires status advertisement to assist the driver for safety. In crowded networks where beacon message are broadcasted at a high number of frequencies by many vehicles, which used for beacon sending, will be congested by the wireless medium due to the contention-window based IEEE 802.11p MAC. To resolve the congestion, we consider a MAC scheme based on slotted p-persistent CSMA as a simple non-cooperative Bayesian game which involves payoffs reflecting the attempt probability. Then, we derive Bayesian Nash Equilibrium (BNE) in a closed form. Using the BNE, we propose new congestion control algorithm to improve the performance of the beacon rate under saturation condition in IEEE 802.11p/WAVE vehicular networks. This algorithm explicitly computes packet delivery probability as a function of contention window (CW) size and number of vehicles. The proposed algorithm is validated against numerical simulation results to demonstrate its stability.