• Title/Summary/Keyword: Random MAC

Search Result 87, Processing Time 0.027 seconds

Adaptive and Prioritized Random Access and Resource Allocation Schemes for Dynamic TDMA/TDD Protocols

  • Choi, Hyun-Ho
    • Journal of information and communication convergence engineering
    • /
    • v.15 no.1
    • /
    • pp.28-36
    • /
    • 2017
  • The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.

Transient Coordinator: a Collision Resolution Algorithm for Asynchronous MAC Protocols in Wireless Sensor Networks

  • Lee, Sang Hoon;Park, Byung Joon;Choi, Lynn
    • 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.

An Analysis of Wi-Fi Probe Request for Crowd Counting through MAC-Address classification (MAC-Address 분류를 통한 Wi-Fi Probe Request 기반 유동인구 분석 방법)

  • Oppokhonov, Shokirkhon;Lee, Jae-Hyun;Moon, Jun-young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.4
    • /
    • pp.612-623
    • /
    • 2022
  • Estimation of the presence of people in real time is extremely useful for businesses in providing better services. Many companies and researchers have attempted various researches in order to count the number of floating population in a specific space. Recently, as part of smart cities and digital twins, commercialization of measuring floating populations using Wi-Fi signals has become active in the public and private sectors. In this paper we present a method of estimating the floating population based on MAC-address values collected from smartphones. By distinguishing Real MAC-address and Random MAC-address values, we compare the estimated number of smartphone devices and the actual number of people caught on CCTV screens to evaluate the accuracy of the proposed method. And it appeared to have a similar correlation between the two datas. As a result, we present a method of estimating the floating population based on analyzing Wi-Fi Probe Requests.

Why abandon Randomized MAC-Address : An Analysis of Wi-Fi Probe Request for Crowd Counting (Why abandon Randomized MAC-Address : Wi-Fi Probe Request 기반 유동인구 분석 방법)

  • Oppokhonov, Shokirkhon;Lee, Jae-Hyun;Moon, Jun-young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.24-34
    • /
    • 2021
  • Estimation of the presence of people in real time is extremely useful for businesses in providing better services. Many companies and researchers have attempted various researches in order to count the number of floating population in specific space. Recently, as part of smart cities and digital twins, commercialization of measuring floating populations using Wi-Fi signals has become active in the public and private sectors. This paper explains the floating population measuring system from the perspective of general consumers(non-experts) who uses current population data. Specifically, it presents a method of estimating the floating population based on MAC-address values collected from smartphones. By distinguishing Real MAC-address and Random MAC-address values, we compare the estimated number of smartphone devices and the actual number of people caught on CCTV screens to evaluate the accuracy of the proposed method. And it appeared to have a similar correlation between the two datas. As a result, we present a method of estimating the floating population based on analyzing Wi-Fi Probe Requests

  • PDF

Random Access Channel with Retransmission Gain

  • Shi, Junmin;Sun, Yi;Zhang, Xiaochen;Xiao, Jizhong
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.2 no.3
    • /
    • pp.148-159
    • /
    • 2013
  • An analysis of the throughput and stability region of random access systems is currently of interest in research and industry. This study evaluated the performance of a multiuser random access channel with a retransmission gain. The channel was composed of a media access control (MAC) determined by the transmission probabilities and a multiuser communication channel characterized by the packet reception probabilities as functions of the number of packet transmissions and the collision status. The analysis began with an illustrative two-user channel, and was extended to a general multiuser channel. For the two-user channel, a sufficient condition was derived, under which the maximum throughput was achieved with a control-free MAC. For the channel with retransmission gain, the maximum steady throughput was obtained in a closed form. The condition under which the random access channel can acquire retransmission gain was also obtained. The stability region of the general random access channel was derived. These results include those of the well-known orthogonal channel, collision channel and slotted Aloha channel with packet reception as a special instance. The analytical and numerical results showed that exploiting the retransmission gain can increase the throughput significantly and expand the stability region of the random access channel. The analytical results predicted the performance in the simulations quite well.

  • PDF

Dynamic Channel Assignment Scheme Based on the Number of Success and Collision of Random Channel in HIPERLAN/2 (HIPERLAN/2에서 랜덤채널의 성공수와 충돌수에 기반한 동적 채널할당 방안)

  • Lim, Seog-Ku
    • Journal of Digital Contents Society
    • /
    • v.12 no.3
    • /
    • pp.347-353
    • /
    • 2011
  • In HIPERLAN/2, the radio channels are assigned by AP(Access Point) that is centrally operated and the MAC protocol is based on TDMA/TDD. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channel. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Hence the number of RCH should be allocated properly according to traffic. From these point, this paper proposes an scheme that dynamically assigned the number of RCH which is based on the number of success and collision of message in previous MAC frame. To prove efficiency of proposed scheme, lots of simulations are conducted and analyzed.

Terminal-Assisted Hybrid MAC Protocol for Differentiated QoS Guarantee in TDMA-Based Broadband Access Networks

  • Hong, Seung-Eun;Kang, Chung-Gu;Kwon, O-Hyung
    • ETRI Journal
    • /
    • v.28 no.3
    • /
    • pp.311-319
    • /
    • 2006
  • This paper presents a terminal-assisted frame-based packet reservation multiple access (TAF-PRMA) protocol, which optimizes random access control between heterogeneous traffic aiming at more efficient voice/data integrated services in dynamic reservation TDMA-based broadband access networks. In order to achieve a differentiated quality-of-service (QoS) guarantee for individual service plus maximal system resource utilization, TAF-PRMA independently controls the random access parameters such as the lengths of the access regions dedicated to respective service traffic and the corresponding permission probabilities, on a frame-by-frame basis. In addition, we have adopted a terminal-assisted random access mechanism where the voice terminal readjusts a global permission probability from the central controller in order to handle the 'fair access' issue resulting from distributed queuing problems inherent in the access network. Our extensive simulation results indicate that TAF-PRMA achieves significant improvements in terms of voice capacity, delay, and fairness over most of the existing medium access control (MAC) schemes for integrated services.

  • PDF

Optimal Frame Aggregation Level for Connectivity-Based Multipolling Protocol in IEEE 802.11 Wireless LANs (IEEE 802.11 무선랜에서 연결정보 기반의 멀티폴링 프로토콜을 위한 최적의 프레임 애그리게이션 레벨)

  • Choi, Woo-Yong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.40 no.5
    • /
    • pp.520-525
    • /
    • 2014
  • When the PCF (Point Coordinated Function) MAC protocol is combined with the frame aggregation method to enhance the MAC performance in IEEE 802.11 wireless LANs, the formulae for the optimal frame aggregation level for best PCF MAC performance were derived in our previous study. We extend the formulae for the PCF protocol to derive the optimal frame aggregation level for the connectivity-based multipolling MAC protocol in IEEE 802.11 wireless LANs. By simulations, we compare the performances of IEEE 802.11 wireless LANs with the optimal and random frame aggregation levels. Compared with the random frame aggregation level, the optimal frame aggregation level significantly improves the performance of IEEE 802.11 wireless LANs.

Performance Evaluation of the HomePNA 3.0 Asynchronous MAC Mode with Collision Management Protocol (HomePNA 3.0 비동기 MAC 모드의 Collision Management Protocol 성능 분석)

  • 김희천;정민영;이태진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7A
    • /
    • pp.727-734
    • /
    • 2004
  • Collision Management Protocol (CMP) efficiently resolves collisions when data frames are transmitted in networks consisting of HomPNA 3.0 asynchronous MAC mode device with random access. Unlike Distributed Fair Priority Queueing (DFPQ) algorithm in HomePNA 2.0 or Binary Exponential Backoff (BEB) algorithm in IEEE 802.11, order of retransmission is decided according to Collision Signaling Sequence (CSS) values allocated to each device. Thus, CMP can minimize the number of mean collisions because order of retransmission is decided in a deterministic way. In this paper. we evaluate the saturation performance of CMP in HomePNA 3.0 using an analytic method.

Random Channel Allocation Scheme Based on Split Algorithm in HIPERLAN 2 (HIPERLAN Type 2에서 Split 알고리즘에 기반한 랜덤채널 할당 기법)

  • 황의석;고유창;이승규;윤철식;이형우;조충호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9A
    • /
    • pp.717-727
    • /
    • 2003
  • The HIPERLAN/2(HIgh PERformance Local Area Network Type2) is one of the wireless LAN standards for providing raw data rates of up to 54 Mbps. The MAC protocol of HIPERLAN/2 is based on TDMA/TDD, and resources in one MAC frame can be allocated dynamically by Access Point(AP). The random channel(RCH) is defined for the purpose of giving a mobile terminal the opportunity to request transmission resources in the uplink MAC frames. It is desirable that the number of RCHs is dynamically adapted by the AP depending on the current traffic situation. Allocation of excessive RCHs may waste radio resources and insufficient RCHs compared to traffic loads may result in many collisions in access attempts. We propose an RCH allocation scheme based on split algorithm in HIPERLAN/2. The simulation and analytic results show that the proposed scheme achieves a higher channel throughput, lower access delay and delay jitter than previously proposed RCH allocation schemes.