• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3152-3165
• /
• 2012

Wireless sensor networks (WSN) often employ asynchronous MAC scheduling, which allows each sensor node to wake up independently without synchronizing with its neighbor nodes. However, this asynchronous scheduling may not deal with collisions due to hidden terminals effectively. Although most of the existing asynchronous protocols exploit a random back-off technique to resolve collisions, the random back-off cannot secure a receiver from potentially repetitive collisions and may lead to a substantial increase in the packet latency. In this paper, we propose a new collision resolution algorithm called Transient Coordinator (TC) for asynchronous WSN MAC protocols. TC resolves a collision on demand by ordering senders' transmissions when a receiver detects a collision. To coordinate the transmission sequence both the receiver and the collided senders perform handshaking to collect the information and to derive a collision-free transmission sequence, which enables each sender to exclusively access the channel. According to the simulation results, our scheme can improve the average per-node throughput by up to 19.4% while it also reduces unnecessary energy consumption due to repetitive collisions by as much as 91.1% compared to the conventional asynchronous MAC protocols. This demonstrates that TC is more efficient in terms of performance, resource utilization, and energy compared to the random back-off scheme in dealing with collisions for asynchronous WSN MAC scheduling.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.287-296
• /
• 2008

The IEEE 802.11 wireless standard uses the carrier sense multiple access with collision avoidance (CSMA/CA) as its MAC protocol (during the distributed coordination function period). This protocol is an adaptation of the CSMA/CD of the wired networks. CSMA/CA mechanism cannot guarantee quality of service (QoS) required by the application because orits random access method. In this study, we propose a new MAC protocol that considers different types of traffic (e.g., voice and data) and for each traffic type different priority levels are assigned. To improve the QoS of IEEE 802.11 MAC protocols over a multi-channel CSMA/CA, we have developed a new admission policy for both voice and data traffics. This protocol can be performed in direct sequence spread spectrum (DSSS) or frequency hopping spread spectrum (FHSS). For voice traffic we reserve a channel, while for data traffic the access is random using a CSMA/CA mechanism, and in this case a selective reject and push-out mechanism is added to meet the quality of service required by data traffic. To study the performance of the proposed protocol and to show the benefits of our design, a mathematical model is built based on Markov chains. The system could be represented by a Markov chain which is difficult to solve as the state-space is too large. This is due to the resource management and user mobility. Thus, we propose to build an aggregated Markov chain with a smaller state-space that allows performance measures to be computed easily. We have used stochastic comparisons of Markov chains to prove that the proposed access protocol (with selective reject and push-out mechanisms) gives less loss rates of high priority connections (data and voices) than the traditional one (without admission policy and selective reject and push-out mechanisms). We give numerical results to confirm mathematical proofs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.310-316
• /
• 2005

In this paper, we proposed and evaluated ARAH(Adaptive Random Access algorithm for HIPERLAN/2) to improve system performance. In this paper, HIPERLAN/2 uses OFDM(Orthogonal Frequency Division Multiplexing) modulation scheme to select appropriate PHY mode by Radio Channel Quality, Proposed the ARAH scheme uses these 7 PHY mode when mobile terminal determines the RCH(Random CHannel) number for random access. In this paper, these 7 PHY mode divided into two group, good and bad, and will be given high priority to mobile terminals which are in a good group. In the result of performance evaluation. ARAH algorithm, ARAH has a better performance of throughput and delay than existing algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.10
• /
• pp.18-23
• /
• 2001

In this paper, we propose stabilized MAC protocol to resolve the bistable problem of the slotted ALOHA. The proposed protocol controls the random access rates according to the characteristics of traffic classes. The mathematical model and the experimental results show that the proposed protocol can guarantee the stable operation of random access procedure.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.456-469
• /
• 2009

We develop a new wireless link quality metric, ECOT(Estimated Channel Occupancy Time) that enables a high throughput route setup in wireless mesh networks. The key feature of ECOT is to be applicable to diverse mesh network environments where IEEE 802.11 MAC (Medium Access Control) variants are used. We take into account the exact operational features of 802.11 MAC protocols, such as 802.11 DCF(Distributed Coordination Function), 802.11e EDCA(Enhanced Distributed Channel Access) with BACK (Block Acknowledgement), and 802.11n A-MPDU(Aggregate MAC Protocol Data Unit), and derive the integrated link metric based on which a high throughput end-to-end path is established. Through extensive simulation in random-topology settings, we evaluate the performance of proposed link metric and present that ECOT shows 8.5 to 354.4% throughput gain over existing link metrics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8A
• /
• pp.600-609
• /
• 2009

The traditional carrier sense multiple access (CSMA) protocol like IEEE 802.11 Distributed Coordination Function (DCF) does not handle the constraints adequately, leading to degraded delay latency and throughput as the network scales are enlarged. We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is like the randomized CSMA protocol, but unlike previous legacy protocols, it does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, we carefully decide to select a fixed-size contention window with non-uniform probability distribution of transmitting in each slot. We show that the proposed method can offer up to severaansimes latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely using network simulation package,caS-2. We finally show that proposed MAC scheme comes close to meet bounds on the best latency being achieved by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to delay latency.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.35-38
• /
• 2004

The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and AP (Access Point) can dynamically allocate the number of RCHs (Random CHannels). We propose a dynamic random channel allocation scheme improved by limiting the number of minimum RCHs. On a simulated scenario adopted practical Internet traffic, the proposed scheme is shown to achieve over $19\%$ lower delay than previously studied algorithm. This study will be a first step towards designing scope of RCHs for high-performance wireless packet network

• Journal of information and communication convergence engineering
• /
• v.1 no.4
• /
• pp.194-198
• /
• 2003

Recently, the use of TCP/IP protocols over wireless LANs poses significant problems. In this paper, we have analyzed transmission control protocol (TCP) packet transmission time for mobile IP over wireless local area networks (LANs) using a proposed a new random backoff scheme. We call it as a proxy backoff scheme. It is considered the transmission time of TCP packet on the orthogonal frequency division multiplexing (OFDM) in additive white gaussian noise (AWGN) channel. From the results, a proposed proxy backoff scheme produces a better performance than an original random backoff in mobile IP over wireless LANs environment. Also, in OFDM/quadrature phase shift keying (QPSK) medium access control (MAC), we have obtained that the transmission time in wireless channel decreases as the TCP packet size increases.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.3
• /
• pp.534-541
• /
• 2018

The number of stations existing in the same wireless channel is increasing due to the spread of the wireless LAN devices. CSMA/CA, a conventional wireless LAN protocol, uses a random backoff method. In the random backoff scheme, collision between stations is frequent in a dense region where the number of stations existing in the same channel is several tens or more, and the performance of the performance degradation of such a protocol, the IEEE 802.11ah standard proposed a Restricted Access Window(RAW) wireless access method. RAW improves performance by limiting the number of concurrent access stations by dividing the stations into several groups. In this paper, we propose a method to improve the performance of channel connection by using new group creation, group removal and group relocation algorithm according to traffic change by improving existing RAW method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.899-906
• /
• 2003

In this paper, a channel access control algorithm and a slot allocation algorithm are proposed as MAC protocol for multimedia services in TDMA/TDD-based wireless ATM networks. In the proposed protocol, VBR terminals that require real-time services transmit a reservation request through a random access minislot. VBR terminals, which are successfully transmitted the reservation request, transmits the dynamic parameters through a dynamic parameter minislot without contention. On the other hand, ABR terminals transmit a reservation request with contention basis whenever a non-real-time traffic burst is generated. Based on the received dynamic parameters and the number of requested slots, the base station scheduler allocates a dynamic parameter minislot as well as uplink data slots into VBR terminals. Also the scheduler allocates uplink data slots into ABR terminals in proportion to the number of requested slots.