• 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.

• ETRI Journal
• /
• 제35권1호
• /
• pp.58-68
• /
• 2013

Five-phase reservation protocol (FPRP) is a contention-based media access control protocol for wireless ad hoc networks. FPRP uses a five-phase reservation process to establish slot assignments based on time division multiple access. It allows a node to reserve only one slot in an information frame. Once a node has reserved a slot, it will cease contending for other slots. As a result, there may be less contending nodes in the remaining slots, so the time slots in an information frame are not fully used by FPRP. To improve time slot utilization, this paper proposes an improved pseudo-Bayesian algorithm, based on which an improved contention access mechanism for FPRP is proposed, in which nodes are allowed to contend for more than one slot in a reservation frame according to a certain probability/priority. Simulation results indicate that the proposed mechanism performs better than FPRP in time slot utilization and hence the network throughput under various scenarios.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2499-2522
• /
• 2017

Multi-hop networks are a low-setup-cost solution for enlarging an area of network coverage through multi-hop routing. Carrier sense multiple access with collision avoidance (CSMA/CA) is frequently used in multi-hop networks. Multi-hop networks face multiple problems, such as a rise in contention for the medium, and packet loss under heavy-load, saturated conditions, which consumes more bandwidth due to re-transmissions. The number of re-transmissions carried out in a multi-hop network plays a major role in the achievable quality of service (QoS). This paper presents a statistical, analytical model for the end-to-end delay of contention-based medium access control (MAC) strategies. These strategies schedule a packet before performing the back-off contention for both differentiated heterogeneous data and homogeneous data under saturation conditions. The analytical model is an application of Markov chain theory and queuing theory. The M/M/1 model is used to derive access queue waiting times, and an absorbing Markov chain is used to determine the expected number of re-transmissions in a multi-hop scenario. This is then used to calculate the expected end-to-end delay. The prediction by the proposed model is compared to the simulation results, and shows close correlation for the different test cases with different arrival rates.

• 인터넷정보학회논문지
• /
• 제12권4호
• /
• pp.1-14
• /
• 2011

본 논문은 전송 전력과 전송 범위가 서로 다른 이기종 무선 통신망이 경쟁 기반의 채널 접속 프로토콜을 사용하여 공존하는 경우 채널 공유의 형평성과 효율에 관해 분석한다. 먼저, 기존에 널리 사용되는 경쟁 기반의 채널 접속 메커니즘인 CSMA(Carrier Sensing Multiple Access) 프로토콜을 사용하여 채널을 공유하는 경우, 이기종 시스템간의 반송파 감지의 비대칭성과 간섭으로 인한 전송실패를 인지하지 못하는 이진 지수 백오프 메커니즘과 링크 적응 메커니즘에 의해 채널이 불공평하게 공유됨을 밝힌다. 다음으로, 공간 재사용성과 공평한 채널 공유를 동시에 보장할 수 있는 반송파 감지 문턱값의 조건을 유도하고, 통신망의 처리율에 관한 수학적인 모형을 수립하여 경쟁 윈도우와 전송 속도가 채널 공유의 형평성과 효율에 끼치는 영향을 분석한다. 마지막으로, 다양한 환경에서의 모의 실험을 수행하여 공평한 채널 공유를 위한 여러 가지 접근 방법의 채널 공유 성능을 비교한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.896-909
• /
• 2010

IEEE 802.11 medium access control (MAC) employs the distributed coordination function (DCF) as the fundamental medium access function. DCF operates with binary exponential backoff (BEB) in order to avoid frame collisions. However it may waste wireless resources because collisions occur when multiple stations are contending for frame transmissions. In order to solve this problem, a binary negative-exponential backoff (BNEB) algorithm has been proposed that uses the maximum contention window size whenever a collision occurs. However, when the number of contending stations is small, the performance of BNEB is degraded due to the unnecessarily long backoff time. In this paper, we propose the adaptive BNEB (A-BNEB) algorithm to maximize the throughput regardless of the number of contending stations. A-BNEB estimates the number of contending stations and uses this value to adjust the maximum contention window size. Simulation results show that A-BNEB significantly improves the performance of IEEE 802.11 DCF and can maintain a high throughput irrespective of the number of contending stations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권12호
• /
• pp.5835-5854
• /
• 2017

The implementation of IEEE 802.15.6 in Wireless Body Area Network (WBAN) is contention based. Meanwhile, IEEE 802.15.4 MAC provides limited 16 channels in the Superframe structure, making it unfit for N heterogeneous nature of patient's data. Also, the Beacon-enabled Carrier-Sense Multiple Access/Collision-Avoidance (CSMA/CA) scheduling access scheme in WBAN, allocates Contention-free Period (CAP) channels to emergency and non-emergency Biomedical Sensors (BMSs) using contention mechanism, increasing repetition in rounds. This reduces performance of the MAC protocol causing higher data collisions and delay, low data reliability, BMSs packet retransmissions and increased energy consumption. Moreover, it has no traffic differentiation method. This paper proposes a Low-delay Traffic-Aware Medium Access Control (LTA-MAC) protocol to provide sufficient channels with a higher bandwidth, and allocates them individually to non-emergency and emergency data. Also, a Contention Differentiated Adaptive Slot Allocation CSMA-CA (CDASA-CSMA/CA) for scheduling access scheme is proposed to reduce repetition in rounds, and assists in channels allocation to BMSs. Furthermore, an On-demand (OD) slot in the LTA-MAC to resolve the patient's data drops in the CSMA/CA scheme due to exceeding of threshold values in contentions is introduced. Simulation results demonstrate advantages of the proposed schemes over the IEEE 802.15.4 MAC and CSMA/CA scheme in terms of success rate, packet delivery delay, and energy consumption.

• 한국통신학회논문지
• /
• 제34권8A호
• /
• pp.600-609
• /
• 2009

기존의 IEEE 802.11 DCF(Distributed Coordination Function)와 같은 전통적인 CSMA(carrier sense multiple access) 프로토콜은 네트워크 규모가 커짐에 따라서 성능의 급격한 감쇠와 전송 지연 증가를 초래한다. 이러한 문제를 효과적으로 해결하기 위하여 본 논문에서는 무선 센서 네트워크에 적합한 MAC(medium access control) 프로토콜을 제안한다. 기존의 DCF 프로토콜은 데이터 전송을 위한 슬롯(slot)을 선택할 때 패킷 충돌로 인한 재전송이 반복될 때 마다 크기가 커지는 경쟁 윈도우(contention window) 내에서 일반 확률 분포(uniform probability distribution)를 이용한 랜덤(random) 선택 기법을 사용하지만 제안한 프로토콜에서는 전송 지연을 최대한 감소시키기 위하여 경쟁 윈도우의 크기를 고정시키고, 전송 슬롯을 보다 효율적으로 선택하도록 비 균등(non-uniform)확률 분포를 사용하여 전송 슬롯을 랜덤하게 선정한다. 시뮬레이션을 통하여 제안한 프로토콜이 802.11 MAC 표준에 비하여 전송 지연이 감소함을 보여 전송 지연에 민감한 실시간 무선 센서 네트워크의 최적 지연 한계점(best latency bound)을 충족시키는 프로토콜임을 입증한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 통신소사이어티 추계학술대회논문집
• /
• pp.191-194
• /
• 2003

In IEEE 802.11b, Medium Access Control Sublayer consists of DCF (Distributed Coordination Function) and PCF (Point Coordination Function). DCF provides contention based services and PCF provides contention free services for QoS satisfaction. DCF uses CSMA/CA (Carrier Sense Multiple Access/Collision Avoidance) as an access protocol. And PCF uses Polling Scheme. In this paper, a modified New-PCF, which gives weights to channels with heavier traffic load, was suggested. NS-2 simulations were conducted to compare the service performances with original DCF, PCF and the modified New-PCF respectively. Simulation results has shown the increased overall throughput with the proposed New-PCF compared with other cases.

• Journal of information and communication convergence engineering
• /
• 제10권2호
• /
• pp.117-122
• /
• 2012

We propose a hybrid multiple access (HMA) for uplink orthogonal frequency division multiple access (OFDMA) systems, which combines two resource sharing schemes: a scheduling-based resource allocation (SBRA) scheme and a contentionbased resource allocation (CBRA) scheme. The SBRA scheme is appropriate for non-real time high data rate traffic, and, CBRA is appropriate for near-real time low/medium data rate traffic. Thus, the proposed HMA scheme supports various types of traffic. As a CBRA scheme, our proposed random frequency hopping (RFH)-OFDMA scheme was presented. Simulation results show that the proposed HMA yields the best performance among various resource allocation schemes for uplink OFDMA systems.

• Journal of information and communication convergence engineering
• /
• 제11권3호
• /
• pp.153-166
• /
• 2013

A hierarchical time division multiple access (HTDMA) medium access control (MAC) protocol is proposed for clustered mobile underwater acoustic networks. HTDMA consists of two TDMA scheduling protocols (i.e., TDMA1 and TDMA2) in order to accommodate mobile underwater nodes (UNs). TDMA1 is executed among surface stations (e.g., buoys) using terrestrial wireless communication in order to share mobility information obtained from UNs which move cluster to cluster. TDMA2 is executed among UNs, which send data to their surface station as a cluster head in one cluster. By sharing mobility information, a surface station can instantaneously determine the number of time slots in a TDMA2 frame up to as many as the number of UNs which is currently residing in its cluster. This can enhance delay and channel utilization performance by avoiding the occurrence of idle time slots. We analytically investigate the delay of HTDMA, and compare it with that of wellknown contention-free and contention-based MAC protocols, which are TDMA and Slotted-ALOHA, respectively. It is shown that HTDMA remarkably decreases delay, compared with TDMA and Slotted-ALOHA.