• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1462-1476
• /
• 2017

The current literature on discrete-time Markov chain (DTMC) based analysis of IEEE 802.15.6 MAC protocols for wireless body area networks (WBANs), do not consider the ACK timeout state, wherein the colliding nodes check the ill fate of their transmissions, while other contending nodes perform backoff check that slot as usual. In this paper, our DTMC model accurately captures the carrier sense multiple access with collision avoidance (CSMA/CA) mechanism of IEEE 802.15.6 medium access control (MAC) and allows the contending nodes performing backoff to utilize the ACK timeout slot during collisions. The compared rigorous results are obtained by considering a non-ideal channel in non-saturation conditions, and CSMA/CA parameters pertaining to UWB PHY of IEEE 802.15.6 MAC protocols.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 춘계학술발표대회
• /
• pp.842-845
• /
• 2009

Wireless ad hoc networks often suffer from rapidly degrading performance with the number of user increases in the network. One of the major reasons for this rapid degradation of performance is the fact that users are sharing a single channel. Obviously, the problem of using single shared channel schemes is that the probability of collision increases with the number of nodes. Fortunately, it is possible to solve this problem with multi-channel approaches. Due to the especial properties of multiple channels, using the multiple channels is more efficient than single channel because it enhances the capacity of the channel and reduces the error rate during data transmission. Some multi-channel schemes us one dedicated channel for control packets and one separate channel for data transmissions. On the other hand, another protocols use more than two channels for data transmissions. This paper summarizes six multiple channel protocols based on these two kinds of schemes. Then we compare them and discuss the research challenge of multiple channel protocols.

• 한국통신학회논문지
• /
• 제37권5A호
• /
• pp.358-366
• /
• 2012

LED-ID (Light Emitting Diode - Identification) is one of the key technologies for identification, data transmission, and illumination simultaneously. This is the new paradigm in the identification technology environment. There are many issues are still now challenging to achieve high performance in LED-ID system. Collision issue is one of them. Actually this is the most significant issue in all identification system. LED-ID system also suffers from collision problem. In our system, collision occurs when two or more readers transmit data to tag at the same time or vice versa. There are many anti-collision protocols to resolve this problem; such as: Slotted ALOHA, Basic Frame Slotted ALOHA, Query Tree, Tree Splitting, and Q-Algorithm etc. In this paper, we propose modified Q-Algorithm to resolve collision at tag. The proposed protocol is based on Q-Algorithm and used the information of arrived readers to a tag from neighbor. The information includes transmitting slot number of readers and the number of readers that can be arrived in next slot. Our proposed protocol can reduce the numbers of collision slot and the successful time to identify all readers. In this paper our simulation and theoretical results are presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권7호
• /
• pp.1624-1637
• /
• 2013

In RFID systems, one important issue is how to effectively address tag collision, which occurs when multiple tags reply simultaneously to a reader, so that all the tags are correctly identified. However, most existing anti-collision protocols assume isotropic collisions where a reader cannot detect any of the tags from the collided signals. In practice, this assumption turns out to be too pessimistic since the capture effect may take place, in which the reader considers the strongest signal as a successful transmission and the others as interference. In this case, the reader disregards the other collided tags, and in turn, fails to read the tag(s) with weaker signal(s). In this paper, we propose a capture effect-aware anti-collision protocol, called Multi-Round Collision Tree (MRCT) protocol, which efficiently identifies the tags in real RFID environments. MRCT deals with the capture effect as well as channel error by employing a multi-round based identification algorithm. We also analyze the performance of MRCT in terms of the number of slots required for identifying all tags. The simulation results show that MRCT significantly outperforms the existing protocol especially in a practical environment where the capture effect occurs.

• Journal of Information Technology Applications and Management
• /
• 제15권1호
• /
• pp.261-270
• /
• 2008

Wireless Mesh Networks (WMNs) have emerged as one of the new hot topics in wireless communications. WMNs have been suggested for use in situations in which some or all of the users are mobile or are located in inaccessible environments. Unconstrained transmission in a WMN may lead to the time overlap of two or more packet receptions, called collisions or interferences, resulting in damaged useless packets at the destination. There are two types of collisions; primary collision, due to the transmission of the stations which can hear each other, and hidden terminal collision, when stations outside the hearing range of each other transmit to the same receiving stations. For a WMN, direct collisions can be minimized by short propagation and carrier sense times. Thus, in this paper we only consider hidden terminal collision while neglecting direct collisions. To reduce or eliminate hidden terminal collision, code division multiple access (CDMA) protocols have been introduced. The collision-free property is guaranteed by the use of spread spectrum communication techniques and the proper assignment of orthogonal codes. Such codes share the fixed channel capacity allocated to the network in the design stage. Thus, it is very important to minimize the number of codes while achieving a proper transmission quality level in CDMA WMNs. In this paper, an efficient heuristic code assignment algorithm for eliminating hidden terminal collision in CDMA WMNs with general topology.

• 인터넷정보학회논문지
• /
• 제10권2호
• /
• pp.133-141
• /
• 2009

RFID 시스템에서 리더의 식별영역 내에 다수개의 태그가 존재할 경우 태그 충돌 문제가 발생할 수 있으며, 따라서 태그 인식에 많은 시간이 필요하다. 태그 충돌 문제는 RFID 시스템 설계 시 가장 중요한 핵심 이슈중의 하나이며 다양한 프로토콜이 제안되고 있다. 일반적인 트리 기반의 프로토콜들은 적합한 프리픽스를 생성하여 태그 인식을 빠르게 하는 것이 목적이다. 본 논문에서는 리더와 태그의 질의-응답 횟수를 줄일 수 있는 QT-BCS 프로토콜을 제안한다. QT-BCS 프로토콜에서는 타임 슬롯과 비트 변화 감지 유닛을 통하여 프리픽스를 생성한다. 식별영역내의 태그들은 이전 비트와 다른 값이 나올 때까지의 비트값을 리더에 전송하도록 설계되고, 리더는 0-슬롯과 1-슬롯에 첫째 비트 값에 따라 비트값을 저장한다. 이와 같은 방법은 질의 프리픽스를 쉽게 추적하므로 질의 횟수를 효과적으로 줄인다. 시뮬레이션 결과 QT-BCS 프로토콜은 Query Tree, 4-ary Query Tree 프로토콜 보다 질의-응답 횟수를 줄여 태그 인식 속도를 빠르게 개선시켰다.

• 대한전자공학회논문지TC
• /
• 제39권5호
• /
• pp.225-231
• /
• 2002

본 논문에서는 무선 MAC 프로토콜상에서 실시간 응용의 QoS를 보장할 수 있는 지연 민감도를 고려한 차별적인 충돌해결 기법을 제안한다. 제안된 기법은 충돌해결을 위해 접근 요구 메시지들을 지연에 따라 서로 다르게 다루며, 이를 위해 본 논문에서는 지연 민감도가 높은 트래픽의 충돌해결을 보다 빠르게 해결하기 위해 CRP (Collision Resolution Period) 구간을 사용한다. 성능분석과 시뮬레이션 결과 제안된 프로토콜이 접근지연과 충돌의 정도를 줄임으로서 실시간 응용의 지연요구조건을 성공적으로 보장함을 보여준다

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 학술대회지
• /
• pp.681-685
• /
• 2004

Design of efficient Medium Access Control (MAC) protocols with both high throughput performances is a major focus in distributed contention-based MAC protocol research. In this paper, we propose an efficient contention-based MAC protocol for wireless Local Area Networks, namely, the Developed Collision Resolution (DCR) algorithm. This algorithm is developed based on the following innovative ideas: to speed up the collision resolution, we actively redistribute the backoff timers for all active nodes; to reduce the average number of idle slots, we use smaller contention window sizes for nodes with successful packet transmissions and reduce the backoff timers exponentially fast when a fixed number of consecutive idle slots are detected. We show that the proposed DCR algorithm provides high throughput performance and low latency in wireless LANs.

• 한국산업정보학회논문지
• /
• 제19권2호
• /
• pp.1-13
• /
• 2014

In IEEE 802.11p/1609-based vehicular networks, vehicles are allowed to exchange safety and control messages only within time periods, called control channel (CCH) interval, which are scheduled periodically. Currently, the length of the CCH interval is set to the fixed value (i.e. 50ms). However, the fixed-length intervals cannot be effective for dynamically changing traffic load. Hence, some protocols have been recently proposed to support variable-length CCH intervals in order to improve channel utilization. In existing protocols, the CCH interval is subdivided into safety and non-safety intervals, and the length of each interval is dynamically adjusted to accommodate the estimated traffic load. However, they do not consider the presence of hidden nodes. Consequently, messages transmitted in each interval are likely to overlap with simultaneous transmissions (i.e. interference) from hidden nodes. Particularly, life-critical safety messages which are exchanged within the safety interval can be unreliably delivered due to such interference, which deteriorates QoS of safety applications such as cooperative collision warning. In this paper, we therefore propose a new interference-aware Dynamic Safety Interval (DSI) protocol. DSI calculates the number of vehicles sharing the channel with the consideration of hidden nodes. The safety interval is derived based on the measured number of vehicles. From simulation study using the ns-2, we verified that DSI outperforms the existing protocols in terms of various metrics such as broadcast delivery ration, collision probability and safety message delay.

• 한국통신학회논문지
• /
• 제36권3A호
• /
• pp.267-277
• /
• 2011

IEEE 802.15.4는 전송된 프레임의 초기 충돌을 피하기 위해 대부분의 다른 무선 네트워크 프로토콜들처럼 프레임을 전송하기 전 임의의 시간을 지연하는 CA(Collision A voidance) 알고리즘을 사용한다. IEEE 802.15.4의 CA 방식은 현재의 네트워크 상황에 관계없이 고정된 초기 백오프 선택 구간에서 임의의 백오프 지연 시간을 선택하기 때문에, 긴 시간 동안 높은 통신 부하를 유지하는 네트워크에서는 현재 상황에 알맞은 백오프 지연 시간을 선택하기까지 여러 번의 백오프 지연 과정을 반복하게 된다. 본 논문에서는 네트워크의 혼잡 상황에 따른 충돌 확률을 고려하여 초기 백오프 지연 시간을 적응적으로 선택할 수 있는 ACA(Adaptive Collision Avoidance) 알고리즘을 제안한다. ACA 알고리즘의 성능을 측정하기 위해 수학적 모델을 제시하며, ns-2를 이용한 시뮬레이션을 통해 모델의 정확성을 검증하고 네트워크 혼잡 상황에 따른 최적의 초기 백오프 지연 시간을 제시한다. 분석 결과, ACA알고리즘을 사용할 때 표준에 비해 처리량이 최대 41% 이상 증가하고 평균 서비스 지연 시간은 기존보다 더욱 짧게 나타났다.