• Title/Summary/Keyword: Adaptive traffic control

Search Result 227, Processing Time 0.022 seconds

Performance Evaluation of Traffic Adaptive Sleep based MAC in Clustered Wireless Sensor Networks (클러스터 기반 무선 센서 망에서 트래픽 적응적 수면시간 기반 MAC 프로토콜 성능 분석)

  • Xiong, Hongyu;So, Won-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.5
    • /
    • pp.107-116
    • /
    • 2011
  • In this paper, a traffic adaptive sleep based medium access control (TAS-MAC) protocol for wireless sensor networks (WSNs) is proposed. The protocol aims for WSNs which consist of clustered sensor nodes and is based on TDMA-like schema. It is a typical schedule based mechanism which is adopted in previous protocols such as LEACH and Bit-Map Assisted MAC. The proposed MAC, however, considers unexpected long silent period in which sensor nodes have no data input and events do not happen in monitoring environment. With the simple traffic measurement, the TAS-MAC eliminates scheduling phases consuming energy in previous centralized approaches. A frame structure of the protocol includes three periods, investigation (I), transmission (T), and sleep-period (S). Through the I-period, TAS-MAC aggregates current traffic information from each end node and dynamically decide the length of sleep period to avoid energy waste in long silent period. In spite of the energy efficiency of this approach, the delay of data might increase. Thus, we propose an advanced version of TAS-MAC as well, each node in cluster sends one or more data packets to cluster head during the T-period of a frame. Through simulation, the performance in terms of energy consumption and transmission delay is evaluated. By comparing to BMA-MAC, the results indicate the proposed protocol is more energy efficient with tolerable expense in latency, especially in variable traffic situation.

An Efficient Downlink MAC Protocol for Multi-User MIMO WLANs

  • Liu, Kui;Li, Changle;Guo, Chao;Chen, Rui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.9
    • /
    • pp.4242-4263
    • /
    • 2017
  • Multi-User Multiple-Input Multiple-Output (MU-MIMO) technology has recently attracted significant attention from academia and industry because of it is increasingly important role in improving networks' capacity and data rate. Moreover, MU-MIMO systems for the Fifth Generation (5G) have already been researched. High Quality of Service (QoS) and efficient operations at the Medium Access Control (MAC) layer have become key requirements. In this paper, we propose a downlink MU-MIMO MAC protocol based on adaptive Channel State Information (CSI) feedback (called MMM-A) for Wireless Local Area Networks (WLANs). A modified CSMA/CA mechanism using new frame formats is adopted in the proposed protocol. Specifically, the CSI is exchanged between stations (STAs) in an adaptive way, and a packet selection strategy which can guarantee a fairer QoS for scenarios with differentiated traffic is also included in the MMM-A protocol. We then derive the expressions of the throughput and access delay, and analyze the performance of the protocol. It is easy to find that the MMM-A protocol outperforms the commonly used protocols in terms of the saturated throughput and access delay through simulation and analysis results.

Enhanced TDMA based MAC Protocol for Adaptive Data Control in Wireless Sensor Networks

  • Alvi, Ahmad Naseem;Bouk, Safdar Hussain;Ahmed, Syed Hassan;Yaqub, Muhammad Azfar;Javaid, Nadeem;Kim, Dongkyun
    • Journal of Communications and Networks
    • /
    • v.17 no.3
    • /
    • pp.247-255
    • /
    • 2015
  • In this paper, we propose an adaptive time division multiple access based medium access control (MAC) protocol, called bitmap-assisted shortest job first based MAC (BS-MAC), for hierarchical wireless sensor networks (WSNs). The main contribution of BS-MAC is that: (a) It uses small size time slots. (b) The number of those time slots is more than the number of member nodes. (c) Shortest job first (SJF) algorithm to schedule time slots. (d) Short node address (1 byte) to identify members nodes. First two contributions of BS-MAC handle adaptive traffic loads of all members in an efficient manner. The SJF algorithm reduces node's job completion time and to minimize the average packet delay of nodes. The short node address reduces the control overhead and makes the proposed scheme an energy efficient. The simulation results verify that the proposed BS-MAC transmits more data with less delay and energy consumption compared to the existing MAC protocols.

Adaptive and Strict Packet Dropping Mechanism for the Congestion Control of AF Packets in Differentiated Service (차별화 서비스에서 AF 패킷의 혼잡제어를 위한 적응적 엄격 패킷 폐기 메커니즘)

  • Kim, Su-Yeon;Kahng, Hyun-Kook
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.11
    • /
    • pp.1-8
    • /
    • 2001
  • Adaptive and Strict Packet Dropping mechanism we proposed in this paper drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the proposed mechanism makes up for the drawback of RIO mechanism and minimizes the wastes of the bandwidth being capable of predicting in Dynamic and Strict Packet Dropping (DSPD) mechanism. And we executed a simulation and analyzed the throughput and packet drop rate based on the Sending Drop Precedence changing dynamically depending on the network traffic and compared RIO and the DSPD. The results show that the proposed mechanism provides better performance on drop precedence levels and stricter drop precedence policy for AF class than RIO and the DSPD mechanism.

  • PDF

Adaptive Delay Differentiation in Next-Generation Networks (차세대 네트워크에서의 적응형 지연 차별화 방식)

  • Paik Jung-Hoon;Park Jae-Woo;Lee Yoo-Kyung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.6 s.348
    • /
    • pp.30-38
    • /
    • 2006
  • In this paper, an algerian that provisions absolute and proportional differentiation of packet delays is proposed with an objective for enhancing quality of service (QoS) in future packet networks. It features a scheme that compensates the deviation for prediction on the traffic to be arrived continuously It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot and derives the difference between them. The deviation is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential traffic. It is demonstrated through simulation that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism.

A QoS Framework for Ad-Hoc Networks (Ad-Hoc Network을 위한 QoS 프레임웍)

  • Kim Junhyung;Mo Sangdok;Chung Kwangsue
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.2
    • /
    • pp.134-146
    • /
    • 2005
  • Research about QoS in the ad-hoc networks for stable service of various applications has been needed as the expectation about the realization of the ad-hoc networks grows bigger. Existing researches about QoS in the ad-hoc network had the problems which can not guarantee the quantitative services or create the overhead. In this paper, we propose a novel algorithm of QFAN(QoS Framework for Ad-hoc Networks) the framework to resolve such problems and considered application of the proposed algorithm into the ad-hoc networks. Our model can guarantee the minimum bandwidth of the real-time traffic as minimized the overhead. And, disproportionate distribution of bandwidth problem can resolve by the proposed algorithm through the fair share between real-time traffic and best-effort traffic about available bandwidth. We design both the TiRe(Tiny Reservation) and the ADR(Adaptive Drop Rate) control algorithm to apply the proposed QFAN. Using simulation, we confirm fair share of available bandwidth between real-time traffic and best-effort traffic as guarantee minimum required bandwidth of real-time traffic.

Flow Assignment and Packet Scheduling for Multipath Routing

  • Leung, Ka-Cheong;Victor O. K. Li
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.230-239
    • /
    • 2003
  • In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.

Dynamic Contention Window based Congestion Control and Fair Event Detection in Wireless Sensor Network

  • Mamun-Or-Rashid, Md.;Hong, Choong-Seon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.1288-1290
    • /
    • 2007
  • Congestion in WSN increases energy dissipation rates of sensor nodes as well as loss of packets and thereby hinders fair and reliable event detections. We find that one of the key reasons of congestion in WSN is allowing sensing nodes to transfer as many packets as possible. This is due to the use of CSMA/CA that gives opportunistic media access control. In this paper, we propose an energy efficient congestion avoidance protocol that includes source count based hierarchical and load adaptive medium access control. Our proposed mechanism ensures load adaptive media access to the nodes and thus achieves fairness in event detection. The results of simulation show our scheme exhibits more than 90% delivery ratio with retry limit 1, even under bursty traffic condition which is good enough for reliable event perception.

  • PDF

Media Access Scheme for Achieving an Effective Traffic Control Mechanism and Energy Efficiency in Sensor Networks (센서 네트워크에서 효과적인 트래픽 제어 방법과 에너지 효율성을 고려한 Media Access 기법)

  • Min Byung-Ung;Choi Sam-Gil;Kim Dong-Il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.95-98
    • /
    • 2006
  • Data collected by sensors in field are transmitted to the base station gathering all of data. Because sensors have to gather data in surroundings and periodically transmit data to the base station, it makes energy consumed much. In this paper, we propose the scheme that is to avoid traffic congestion with achievement of energy efficiency, so collected data is transmitted efficiently. This is to adjust transmission rate differently in case of increasing or decreasing traffic and minimize the energy consumption with setting ideal options up basic CSMA(Carrier Sense Multiple Access) protocol in each sensor. Through the simulation, we find the ideal CSMA options and apply the proposed scheme of traffic control mechanism to them, then show energy efficiency and effective traffic control mechanism.

  • PDF

An efficient Clustering Node Life Time management Technique in MANET algorithm (MANET에서 클러스터링 노드의 효율적인 수명 관리 기법)

  • Lee, Jong-Seung;Kim, Yeong-Sam;Oh, Young-Jun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.746-748
    • /
    • 2011
  • MANET(Mobile Ad-hoc Network) is a self-configuration network or wireless multi-hop network based on inference topology. The proposed ATICC(Adaptive Time Interval Clustering Control) algorithm for hierarchical cluster based MANET. The proposed ATICC algorithm is time interval control technique for node management considering the attribute of node and network traffic. ATICC could be made low the network traffic. Also it could be improving the network life time by using timing control method.

  • PDF