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

To improve the cooperative efficiency of node cooperation and multiple access performance for multihop wireless networks, a priority-differentiated cooperative medium access control protocol with contention resolution (CRP-CMAC) is proposed. In the protocol, the helper selection process is divided into the priority differentiation phase and the contention resolution phase for the helpers with the same priority. A higher priority helper can choose an earlier minislot in the priority differentiation phase to send a busy tone. As a result, the protocol promptly selects all the highest priority helpers. The contention resolution phase of the same priority helpers consists of k round contention resolution procedures. The helpers that had sent the first busy tone and are now sending the longest busy tone can continue to the next round, and then the other helpers that sense the busy tone withdraw from the contention. Therefore, it can select the unique best helper from the highest priority helpers with high probability. A packet piggyback mechanism is also adopted to make the high data rate helper with packet to send transmit its data packets to its recipient without reservation. It can significantly decrease the reservation overhead and effectively improve the cooperation efficiency and channel utilization. Simulation results show that the maximum throughput of CRP-CMAC is 74%, 36.1% and 15% higher than those of the 802.11 DCF, CoopMACA and 2rcMAC protocols in a wireless local area network (WLAN) environment, and 82.6%, 37.6% and 46.3% higher in an ad hoc network environment, respectively.

• 한국통신학회논문지
• /
• 제30권3A호
• /
• pp.178-183
• /
• 2005

광 버스트 교환 망에서 contention으로 인한 버스트의 손실은 망 성능에 중요한 영향을 끼친다. 많은 contention resolution 방식들이 제안되었지만 이들 중의 대부분은 contention을 방지하기 보다는 주로 수동적인 형태로 contention을 해결하는데 주력하고 있다. 본 논문에서는 망 내 트래픽 부하와 버스트 손실에 따라 버스트의 전송률을 제어하는 능동적인 contention avoidance 방식을 제안한다. 제안한 방식이, 기존의 광 버스트 전송률 제어 방식 및 버스트 전송률 제어를 제공하지 않는 일반적인 광 버스트 교환 모델과 비교하여 버스트 손실률이 향상됨과 동시에 처리율(throughput)도 보장함을, 시뮬레이션을 통해 입증한다.

• ETRI Journal
• /
• 제29권5호
• /
• pp.682-684
• /
• 2007

A new scheme to alleviate contention in optical burst switching networks is proposed. It consists of preventively reserving resources in a node, to be used if resources are busy on the next hop node. The burst is sent back to the preceding node and then resent forward. Simulations are carried out to assess the feasibility of the proposed scheme. Its performance is compared with that of contention resolution based on deflection routing.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 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.

• 한국통신학회논문지
• /
• 제29권12A호
• /
• pp.1285-1290
• /
• 2004

본 논문에서는 광 버스트 네트워크 내의 버스트 충돌을 해결하기 위한 새로운 알고리즘을 제안하였다. 제안된 알고리즘은 파장 변환(conversion), 경로 변경(deflection), 분리(segmentation), 광섬유 버퍼링을 흔합하여 광 스위치에 적용한 것이다. 제안된 충돌 해결 알고리즘의 성능은 ns(network simulator)-2를 이용하여 분석하였다. 시뮬레이션에 사용한 네트워크 토폴로지는 한국의 기간망을 가정하였고 이를 기반으로 다양한 네트워크 트래픽 조건에서 성능 지표(버림 확률, 전파 지연)의 개선을 보였다.

• Journal of Communications and Networks
• /
• 제13권1호
• /
• pp.43-49
• /
• 2011

In this paper, a new medium access control (MAC) protocol entitled three-phase multiple access with continual contention resolution (TPMA-CCR) is proposed for wireless multi-hop ad hoc networks. This work is motivated by the previously known three-phase multiple access (TPMA) scheme of Hou and Tsai [2] which is the suitable MAC protocol for clustering multi-hop ad hoc networks owing to its beneficial attributes such as easy collision detectible, anonymous acknowledgment (ACK), and simple signaling format for the broadcast-natured networks. The new TPMA-CCR is designed to let all contending nodes participate in contentions for a medium access more aggressively than the original TPMA and with continual resolving procedures as well. Through the systematical performance analysis of the suggested protocol, it is also shown that the maximum throughput of the new protocol is not only superior to the original TPMA, but also improves on the conventional slotted carrier sense multiple access (CSMA) under certain circumstances. Thus, in terms of performance, TPMA-CCR can provide an attractive alternative to other contention-based MAC protocols for multi-hop ad hoc networks.

• Journal of Electrical Engineering and information Science
• /
• 제3권1호
• /
• pp.28-35
• /
• 1998

In this paper, an NxN input-buffered crosspoint packet switch which selects a Head of the Line, HOL, packet in contention randomly is analyzed with a new approach. The approach is based on both a Markov chain representation of the input buffer and the probability that a HOL packet is successfully served. The probability as a function of N is derived, and it makes it possible to express the average packet delay and the average number of packets in the buffer as a function of N. The contention resolution policy based on the occupancy of the input buffer is also presented and analyzed with this same approach and the relationship between two selection policies is analyzed in terms of the occupancy of the input buffer.

• ETRI Journal
• /
• 제45권1호
• /
• pp.60-74
• /
• 2023

Integration of the machine learning (ML) technique in all-optical networks can enhance the effectiveness of resource utilization, quality of service assurances, and scalability in optical networks. All-optical multistage interconnection networks (MINs) are implicitly designed to withstand the increasing highvolume traffic demands at data centers. However, the contention resolution mechanism in MINs becomes a bottleneck in handling such data traffic. In this paper, a select list of ML algorithms replaces the traditional electronic signal processing methods used to resolve contention in MIN. The suitability of these algorithms in improving the performance of the entire network is assessed in terms of injection rate, average latency, and latency distribution. Our findings showed that the ML module is recommended for improving the performance of the network. The improved performance and traffic grooming capabilities of the module are also validated by using a hardware testbed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4259-4271
• /
• 2016

With the increased popularity of IEEE 802.11 WLAN, the density of the WLAN devices per access point has also increased, resulting in throughput performance degradation. One of the solutions to the problem is improving the protocol efficiency by a using multi-round contention scheme. This paper first discusses how to estimate the number of contending stations in a WLAN network by using minimum elapsed backoff counter values that can be easily monitored by each station. An approximate closed form expression is derived for the number of active contending stations using the smallest backoff counter value in the network. We then apply this result to adapt the number of contending rounds according to the network loading level to enhance the throughput performance of a multi-round contention scheme. Through simulation, we show that the accuracy of the estimation algorithm depends on the contention parameters of W and the number of backoff counter observing samples, and found a reasonable value for each parameter. We clearly show that our adaptive multi-round contention scheme outperforms the standard contention scheme that uses a fixed number of rounds.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1996년도 하계종합학술발표회 논문집(상)
• /
• pp.293-296
• /
• 1996