• Title/Summary/Keyword: Medium Access Delay

Search Result 171, Processing Time 0.035 seconds

CDASA-CSMA/CA: Contention Differentiated Adaptive Slot Allocation CSMA-CA for Heterogeneous Data in Wireless Body Area Networks

  • Ullah, Fasee;Abdullah, Abdul Hanan;Abdul-Salaam, Gaddafi;Arshad, Marina Md;Masud, Farhan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.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.

Genetic Algorithm based Methodology for Network Performance Optimization (유전자 알고리즘을 이용한 WDM 네트워크 최적화 방법)

  • Yang, Hyo-Sik
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.1
    • /
    • pp.39-45
    • /
    • 2008
  • This paper considers the multi-objective optimization of a multi-service arrayed waveguide grating-based single-hop WDM network with the two conflicting objectives of maximizing throughput while minimizing delay. This paper presents a genetic algorithm based methodology for finding the optimal throughput-delay tradeoff curve, the so-called Pareto-optimal frontier. Genetic algorithm based methodology provides the network architecture parameters and the Medium Access Control protocol parameters that achieve the Pareto-optima in a computationally efficient manner. The numerical results obtained with this methodology provide the Pareto-optimal network planning and operation solution for a wide range of traffic scenarios. The presented methodology is applicable to other networks with a similar throughput-delay tradeoff.

  • PDF

An Exposed-Terminal-Eliminated Dual-Channel MAC Protocol for Exploiting Concurrent Transmissions in Multihop Wireless Networks

  • Liu, Kai;Zhang, Yupeng;Liu, Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.778-798
    • /
    • 2014
  • This paper proposes a novel exposed-terminal-eliminated medium access control (ETE-MAC) protocol by combining channel reservation, collision avoidance and concurrent transmissions to improve multi-access performance of the multihop wireless networks. Based on the proposed slot scheduling scheme, each node senses the control channel (CCH) or the data channel (DCH) to accurately determine whether it can send or receive the corresponding packets without collisions. Slot reservation on the CCH can be simultaneously executed with data packet transmissions on the DCH. Therefore, it resolves the hidden-terminal type and the exposed-terminal type problems efficiently, and obtains more spatial reuse of channel resources. Concurrent packet transmissions without extra network overheads are maximized. An analytical model combining Markov model and M/G/1 queuing theory is proposed to analyze its performance. The performance comparison between analysis and simulation shows that the analytical model is highly accurate. Finally, simulation results show that, the proposed protocol obviously outperforms the link-directionality-based dual-channel MAC protocol (DCP) and WiFlex in terms of the network throughput and the average packet delay.

Modeling and Performance Analysis of MAC Protocol for WBAN with Finite Buffer

  • Shu, Minglei;Yuan, Dongfeng;Chen, Changfang;Wang, Yinglong;Zhang, Chongqing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4436-4452
    • /
    • 2015
  • The IEEE 802.15.6 standard is introduced to satisfy all the requirements for monitoring systems operating in, on, or around the human body. In this paper, analytical models are developed for evaluating the performance of the IEEE 802.15.6 CSMA/CA-based medium access control protocol for wireless body area networks (WBAN) under unsaturation condition. We employ a three-dimensional Markov chain to model the backoff procedure, and an M/G/1/K queuing system to describe the packet queues in the buffer. The throughput and delay performances of WBAN operating in the beacon mode are analyzed in heterogeneous network comprised of different user priorities. Simulation results are included to demonstrate the accuracy of the proposed analytical model.

UMMAC: A Multi-Channel MAC Protocol for Underwater Acoustic Networks

  • Su, Yishan;Jin, Zhigang
    • Journal of Communications and Networks
    • /
    • v.18 no.1
    • /
    • pp.75-83
    • /
    • 2016
  • In this paper, we propose a multi-channel medium access control (MAC) protocol, named underwater multi-channel MAC protocol (UMMAC), for underwater acoustic networks (UANs). UMMAC is a split phase and reservation based multi-channel MAC protocol which enables hosts to utilize multiple channels via a channel allocation and power control algorithm (CAPC). In UMMAC, channel information of neighboring nodes is gathered via exchange of control packets. With such information, UMMAC allows for as many parallel transmissions as possible while avoiding using extra time slot for channel negotiation. By running CAPC algorithm, which aims at maximizing the network's capacity, users can allocate their transmission power and channels in a distributed way. The advantages of the proposed protocol are threefold: 1) Only one transceiver is needed for each node; 2) based on CAPC, hosts are coordinated to negotiate the channels and control power in a distributed way; 3) comparing with existing RTS/CTS MAC protocols, UMMAC do not introduce new overhead for channel negotiation. Simulation results show that UMMAC outperforms Slotted floor acquisition multiple access (FAMA) and multi-channel MAC (MMAC) in terms of network goodput (50% and 17% respectively in a certain scenario). Furthermore, UMMAC can lower the end-to-end delay and achieves a lower energy consumption compared to Slotted FAMA and MMAC.

Effective Performance Evaluation of IEEE 802.11 WLAN DCF Under Normal Conditions (IEEE 802.11 무선랜 DCF의 정상상태에서의 효과적인 성능 분석)

  • Lee, Kye-Sang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.2
    • /
    • pp.261-266
    • /
    • 2009
  • We analyze the performances of the DCF, which is the medium access control protocol of IEEE 802.11 WLAN, assuming normal traffic condition. There have been much less research efforts under the normal condition than those under the saturated one. This paper proposes an analytical method of approximating the transmission attempt rate under normal condition as proportional to that under saturated condition. In result, we show that we can obtain the transmission attempt rate and the packet collision probability which quickly converge using iterative computations of relatively simple equations, and using these results we derive the network throughput and medium access delay. Numerical results show that our method is much less complex than those based on the Markov Chain while it can predict the performances quite accurately.

Genetic Algorithm based Methodology for an Single-Hop Metro WDM Networks

  • Yang, Hyo-Sik;Kim, Sung-Il;Shin, Wee-Jae
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2005.11a
    • /
    • pp.306-309
    • /
    • 2005
  • We consider the multi-objective optimization of a multi-service arrayed-waveguide grating-based single-hop metro WDM network with the two conflicting objectives of maximizing throughput while minimizing delay. We develop and evaluate a genetic algorithm based methodology for finding the optimal throughput-delay tradeoff curve, the so-called Pareto-optimal frontier. Our methodology provides the network architecture and the Medium Access Control protocol parameters that achieve the Pareto-optima in a computationally efficient manner. The numerical results obtained with our methodology provide the Pareto-optimal network planning and operation solution for a wide range of traffic scenarios. The presented methodology is applicable to other networks with a similar throughput-delay tradeoff.

  • PDF

The study on effective operation of ToP (Timing over Packet) (ToP (Timing over Packet)의 효과적인 운용 방안)

  • Kim, Jung-Hun;Shin, Jun-Hyo;Hong, Jin-Pyo
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2007.08a
    • /
    • pp.136-141
    • /
    • 2007
  • The frequency accuracy and phase alignment is necessary for ensuring the quality of service (QoS) for applications such as voice, real-time video, wireless hand-off, and data over a converged access medium at the telecom network. As telecom networks evolve from circuit to packet switching, proper synchronization algorithm should be meditated for IP networks to achieve performance quality comparable to that of legacy circuit-switched networks. The Time of Packet (ToP) specified in IEEE 1588 is able to synchronize distributed clocks with an accuracy of less than one microsecond in packet networks. But, The ToP can be affected by impairments of a network such as packet delay variation. This paper proposes the efficient method to minimize the expectable delay variation when ToP synchronizes the distributed clocks. The simulation results are presented to demonstrate the improved performance case when the efficient ToP transmit algorithm is applied.

  • PDF

A Medium Access Control Protocol for rt- VBR Traffic in Wireless ATM Networks

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.1
    • /
    • pp.29-34
    • /
    • 2007
  • This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

Adaptive Packet Scheduling Scheme to Support Real-time Traffic in WLAN Mesh Networks

  • Zhu, Rongb;Qin, Yingying;Lai, Chin-Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.9
    • /
    • pp.1492-1512
    • /
    • 2011
  • Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.