• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.502-512
• /
• 2016

The wireless carrier sense multiple access with collision detection (WCSMA/CD) and carrier sense multiple access with collision resolution (CSMA/CR) protocols are considered representative distributed collision detection protocols for fully connected dense wireless local area networks. These protocols identify collisions through additional short-sensing within a collision detection (CD) period after the start of data transmission. In this study, we analyze their throughput numerically and show that the throughput has a trade-off that accords with the length of the CD period. Consequently, we obtain the optimal length of the CD period that maximizes the throughput as a closed-form solution. Analysis and simulation results show that the throughput of distributed collision detection protocols is considerably improved when the optimal CD period is allocated according to the number of stations and the length of the transmitted packet.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.690-693
• /
• 2004

This paper proposes a multi-resolution electrostatic potential field (MREPF) based solution to the mobile robot path planning and collision avoidance problem in 2D dynamic environment. The MREPF is an environment method in calculation time and updating field map. The large scale resolution map is added to EPF and this resolution map interacts with the small scale resolution map to find an optimal solution in real time. This approach can be interpreted with Atlantis model. The simulation studies show the efficiency of the proposed algorithm.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• 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.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.50
• /
• pp.33-44
• /
• 1999

This paper describes the Autonomous Vehicles (AV) which are operated for their own tasks. There are chances of conflict resolution such as sharing the same path which can lead to the risk of a collision. This research represents some ways of negotiating the conflict resolution by generating cooperative actions. Negotiation while traveling the path is accomplished by using priority and by announcing the start time of the task. When there is a risk of collision, the AV tries to dissolve the situation of conflict resolution by concurrently adjusting mutual speed and by performing the algorithm of passing. If the speed of the AV cannot be adjusted, it measures the distance between the counterpart of the AV and an obstacle along the path. Then it judges either to proceed by passing the counterpart of the AV or to turn back after observing the current circumstances. The performance of the algorithm described above was proven by a simulator.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.1033-1036
• /
• 2013

A study about collision resolution is needed because huge file, video and multimedia information are transmitted to wireless LAN. CSMA/CR protocol guarantees fairness, but doesn't consider QoS. To practicalize CSMA/CR protocol in saturation fully-connected single hop network environments, this paper proposes method of collision compensation. previous CSMA/CR protocol chooses CR Slot only considering fairness, but this paper chooses front CR Slot for compensation of collision to station experiencing collisions. The station transmits jam signal and has channel priority of transmission. So transmitting efficiency and successful transmission probability rise. This proposed simple method can offer benefit to station experiencing collisions without additional hardware cost.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1098-1115
• /
• 2010

An inseparable challenge associated with every random access network is the design of an efficient Collision Resolution Algorithm (CRA), since collisions cannot be completely avoided in such network. To maximize the collision resolution efficiency of a popular CRA, namely Binary Exponential Backoff (BEB), we propose a reactive backoff algorithm. The proposed backoff algorithm is reactive in the sense that it updates the contention window based on the previously selected backoff value in the failed contention stage to avoid a typical type of collision, referred as cross-collision. Cross-collision would occur if the contention slot pointed by the currently selected backoff value appeared to be present in the overlapped portion of the adjacent (the previous and the current) windows. The proposed reactive algorithm contributes to significant performance improvements in the network since it offers a supplementary feature of Cross Collision Exclusion (XCE) and also retains the legacy collision mitigation features. We formulate a Markovian model to emulate the characteristics of the proposed algorithm. Based on the solution of the model, we then estimate the throughput and delay performances of WLAN following the signaling mechanisms of the Distributed Coordination Function (DCF) considering IEEE 802.11b system parameters. We validate the accuracy of the analytical performance estimation framework by comparing the analytically obtained results with the results that we obtain from the simulation experiments performed in ns-2. Through the rigorous analysis, based on the validated model, we show that the proposed reactive cross collision exclusionary backoff algorithm significantly enhances the throughput and reduces the average packet delay in the network.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.18 no.3
• /
• pp.27-33
• /
• 2010

The goal for the CD&R system is to predict that a conflict is going to occur in the future, communicate the detected conflict to a human operator, and, in some cases, assist in the resolution of the conflict situation. To provide insight into different methods of conflict detection and resolution, a literature review of previous research models and current developmental and operational systems was performed. This paper focuses only on the specific attributes of each model, not on the depth to which a model has been analyzed, validated, or accepted. Thus, care should be taken to remember that a model that seems to be simple according to our categorization scheme may be significantly more viable than an apparently sophisticated model.

• International Journal of Aeronautical and Space Sciences
• /
• v.9 no.2
• /
• pp.1-8
• /
• 2008

This paper presents a real-time algorithm for collision detection, collision avoidance and guidance. Three-dimensional point-mass aircraft models are used. For collision detection, conflict probability is calculated by using the Monte-Carlo Simulation. Time at the closest point of approach(CPA) and distance at CPA are needed to determine the collision probability, being compared to certain threshold values. For collision avoidance, one of possible maneuver options is chosen to minimize the collision probability. For guidance to a designated way-point, proportional navigation guidance law is used. Two scenarios on encounter situation are studied to demonstrate the performance of proposed algorithm.

• The Journal of Korea Robotics Society
• /
• v.17 no.1
• /
• pp.32-39
• /
• 2022

Since the mobile platform and the manipulator mounted on it move at the same time in a mobile manipulator, the risk of mutual collision increases. Most of the studies on collision avoidance of mobile manipulators cannot be applied to differential drive type mobile platforms or the end-effector tends to deviate from the desired trajectory for collision avoidance. In this study, a collision avoidance algorithm based on null space projection (CANS) that solves these two problems is proposed. To this end, a modified repulsive force that overcomes the non-holonomic constraints of a mobile platform is generated by adding a virtual repulsive force in the direction of its instantaneous velocity. And by converting this repulsive force into a repulsive velocity and applying it to the null space, the end-effector of the robot avoids a collision while moving along its original trajectory. The proposed CANS algorithm showed excellent performance through self-collision avoidance tests and door opening tests.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.6 s.324
• /
• pp.33-39
• /
• 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.