• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권8호
• /
• pp.2691-2707
• /
• 2014

Medium access control is critical in wireless networks for efficient spectrum utilization. In this paper, we introduce a novel collision resolution method based on the technique of known interference cancellation, and propose a new MAC protocol named as CR-MAC, in which AP tries to decode all the collided data packets by combining partial retransmissions and known interference cancellation. As the collided transmissions are fully utilized, less retransmission is required, especially in a crowded network. The NS-2simulation and MATLAB numerical results show that, under various network settings, CR-MAC performs much better than the IEEE 802.11 DCF in terms of the aggregation throughput and the expected packet delay.

• 대한전자공학회논문지TC
• /
• 제40권11호
• /
• pp.10-16
• /
• 2003

본 논문은 IEEE 802.16 광대역 무선 액세스 망을 위한 새로운 충돌 감소 방안으로 DCCG 알고리즘을 제안하였다. 이 알고리즘은 채널 경쟁 후 충돌이 발생한 슬롯 수와 가입자의 충돌 횟수에 따라서 상향링크의 자원요청 슬롯 구간을 결정한다. 그 결과 제안한 DCCG 알고리즘은 기존 Binary Back-off 알고리즘보다 처리율이 증가하였고 지연시간이 감소하였다.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• pp.179-182
• /
• 2005

The Home Phoneline Networking Alliance (HomePNA) 2.0 technology can establish a home network using existing in-home phone lines, which provides a channel rate of 4 - 32 Mbps. HomePNA 2.0 Medium Access Control (MAC) protocol adopts an IEEE 802.3 Carrier Sense Multiple Access with Collision Detection (CSMA/CD) access method, a Quality of Service (QoS) algorithm, and a Distributed Fair Priority Queuing (DFPQ) collision resolution algorithm. In this paper, we analyze the HomePNA 2.0 MAC protocol and propose the architecture of HomePNA 2.0 MAC controller circuit. Then, we present the simulation result of each block included in the HomePNA 2.0 MAC controller.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권11호
• /
• pp.1929-1945
• /
• 2011

RFID technologies have attracted a lot of attention in recent years because of their cost/time-effectiveness in large-scale logistics, supply chain management (SCM) and other various potential applications. One of the most important issues of the RFID-based systems is how quickly tags can be identified. Tag collision arbitration plays a more critical role in determining the system performance especially for passive tag-based ones where tag collisions are dealt with rather than prevented. We present a novel tag collision arbitration protocol called Optimum Frame-Slotted Aloha (OFSA). The protocol has been designed to achieve time-optimal efficiency in tag identification through an analytic study of tag identification delay and tag number estimation. Results from our analysis and extensive simulations demonstrate that OFSA outperforms other collision arbitration protocols. Also, unlike most prior anti-collision protocols, it does not require any modification to the current standards and architectures facilitating the rollout of RFID systems.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.74-79
• /
• 2005

In this paper, we propose a novel approach to decentralized motion planning and conflict-resolution for multiple mobile agents working in an environment with unexpected moving obstacles. Our proposed motion planner has two characteristics. One is a real-time collision prognosis based on modified collision map. Collision map is a famous centralized motion planner with low computation load, and the collision prognosis hands over these characteristics. And the collision prognosis is based on current robots status, maximum robot speeds, maximum robot accelerations, and path information produced from off-line path planning procedure, so it is applicable to motion planner for multiple agents in a dynamic environment. The other characteristic is that motion controller architecture is based on potential field method, which is capable of integrating robot guidance to the goals with collision avoidance. For the architecture, we define virtual obstacles making delay time for collision avoidance from the real-time collision prognosis. Finally the results obtained from realistic simulation of a multi-robot environment with unknown moving obstacles demonstrate safety and efficiency of the proposed method.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.155.4-155
• /
• 2001

This paper deals with the inertia property-based redundancy resolution in posture control of a mobile manipulator. As a measure for the redundancy resolution of a mobile manipulator, an effective inertia at the end effector in the operational space is proposed and investigated. The reduced effective inertia has a significant effect on reducing the impulse force in collision with environment. To find a posture satisfying both the reduced inertia and joint limit constraints, we propose a combined potential function method that can deal with multiple constraints. The proposed reduced inertia property algorithm is integrated into a damping controller to reduce the impulse force at collision and to regulate the contact force in mobile manipulation ...

• 한국전자파학회논문지
• /
• 제20권8호
• /
• pp.784-790
• /
• 2009

전방 감시 차량용 레이다에서 표적 거리와 속도 정보를 얻기 위해서는 일반적으로 주파수 변조된 연속파형(FMCW)이나 펄스 도플러(PD) 파형을 사용하고 있다. 그러나 고해상도의 표적 정보를 얻기 위해서는 펄스 폭이 매우 좁고 넓은 대역폭을 사용하여야 하므로 상대적으로 높은 첨두 전력이 필요하고 고속의 디지털 변환 처리속도가 요구된다. 본 논문에서는 계단 주파수 변조된 펄스 도들러 파형을 이용하여 고해상도의 표적 정보를 획득할 수 있는 SFPD(Stepped-frequency Pulsed-Doppler) 처리 기법을 제시한다. 제안된 SFPD 기법은 시뮬레이션을 통하여 기존의 FMCW 및 펄스 도플러 파형 방식과 비교 분석하였다. 본 기법은 필요에 따라서 거리 및 도플러 해상도를 가변할 수 있는 장점이 있기 때문에 이론적으로 고해상도의 표적 영상 형성이 가능하여 향후 정밀한 차량 충돌 방지를 위한 표적 식별에 활용할 수 있을 것으로 기대한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1769-1775
• /
• 2004

In presence of collision between two rigid bodies, they exhibit impulsive behavior to generate physically feasible state. When the frictional impulse is involved, collision resolution can not be easily made based on a simple Newton's law or Poisson's law, mainly due to possible change of collision mode during collision, For example, sliding may change to sticking, and then sliding resumes. We first examine two conventional methods: the method of mode evolution by differential equation, and the other by linear complementarity programming. Then, we propose a new method for mode evolution by solving only algebraic equations defining mode changes. Further, our method attains the original nonlinear impulse cone constraint. The numerical simulation will elucidate the advantage of the proposed method as an alternative to conventional ones.

• Journal of Communications and Networks
• /
• 제7권3호
• /
• pp.313-324
• /
• 2005

The success of the IEEE 802.11 standard has prompted research into efficiency of the different medium access methods and their support for different traffic types. A modified version of the point coordination function (PCF) called modified PCF has been introduced as a way to improve the efficiency over the standard method. It has been shown through a simulation study and a mathematical analysis that channel utilization can be much improved compared to the standard, in case there is no so-called hidden station problem. However, under the hidden station problem, the efficiency of the modified PCF would obviously decrease. In this paper, some enhancements of the modified PCF are introduced. Firstly, we propose a retransmission process to allow frames involved in collisions to be retransmitted. Then, we propose a collision resolution mechanism to reduce the frame collision probability due to the hidden station problem. In addition, we propose a priority scheme to support prioritization for different traffic types such as interactive voice and video, and real-time data traffic in the modified PCF. To prevent the starvation of one low priority traffic, minimum transmission period is also guaranteed to each traffic type via an admission control algorithm. We study the performance of the modified PCF under the hidden station problem and the performance of the modified PCF with priority scheme through simulations. To illustrate the efficiency of the priority scheme, we therefore compare its simulation results with those of some standardized protocols: The distributed coordination function (DCF), the enhanced distributed channel access (EDCA), the PCF, and our previously proposed protocol: The modified PCF without priority scheme. The simulation results show that the increment of delay in the network due to the hidden station problem can be reduced using the proposed collision resolution mechanism. In addition, in a given scenario the modified PCF with priority scheme can provide better quality of service (QoS) support to different traffic types and also support a higher number of data stations than the previous proposals.

• ETRI Journal
• /
• 제29권1호
• /
• pp.116-119
• /
• 2007

In this letter, we design a collision resolution protocol for optical burst switching ring networks to avoid burst collision. We define the offset time condition for no burst transmission collision and manage the free time list of nodes for no burst reception collision. In order to improve the throughput, we use a fiber delay line, void-filling, and void-compression. This protocol does not require any additional procedures for bandwidth reservation such as centralized assignment of bandwidth, lightpath setup of WDM ring networks, or token capturing for the burst transmission. The simulation results show that the proposed protocol can achieve high throughput while saving 70% of wavelengths when compared to round robin with random selection, round robin with persistent, and round robin with non-persistent with only destination delay.