• Title/Summary/Keyword: Distributed Coordination Function

Search Result 98, Processing Time 0.022 seconds

A Multi-Rate Aware Distributed Packet Scheduling in Ad-hoc Networks (에드혹 네트워크에서 다중 데이터률을 고려하는 분산 패킷 스케쥴링)

  • Roh Kwen-Mun;Chen Yong-Qian;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.7B
    • /
    • pp.642-651
    • /
    • 2006
  • In ad-hoc network, the most of existing packet scheduling schemes provides throughput-based fairness. To provide throughput-based fairness, it basically supposes that the channel capacity is fixed. But, the supposing that the channel capacity is fixed is not appropriate because IEEE 802.11b and 802.11g which are normally used for organizing ad-hoc network can provide various data rate according to channel conditions. So, we define time-based fairness for each flow to consider multi-rate and suggest the MRADPS reaching the defined time-based fairness. Simulation result shows that MRADPS improves the total network throughput in ad-hoc network with providing time-based fairness to each flow.

Short-term Benefits of Mobilization for Patients with Non-Specific Neck Pains: Executive Function and Neck Pain Intensity

  • Choi, Wansuk;Heo, Seoyoon
    • Journal of International Academy of Physical Therapy Research
    • /
    • v.10 no.2
    • /
    • pp.1803-1809
    • /
    • 2019
  • Background: Cervical mobilization has been applied mainly for the improvement of arm and neck movements and pain reduction, and little research has been done to improve the executive function. Since this kind of so-called mechanical neck pain is one of most common symptoms, there are controversial issues about this with spine alignment. Posteroanterior (PA) mobilization from the Maitland concept is a process of examination, assessment, and treatment of neuromusculoskeletal disorder by manipulative physical therapy. Objective: To examine the short-term benefits of mobilization for patients with non-specific neck pain. Design: Dual-group Pretest-Posttest Design from the Quasi-Experimental research Methods: Fourteen participants (male 8, female 6; 20's of their age) with non-specific neck pains which are distributed all the unilateral or bilateral body side were recruited. Participants were categorized to Neck Pain with Movement Coordination Impairments (NPMCI) and Neck Pain with Mobility Deficits (NPMD) groups according to the results of physical examination. Professional physical therapist who has over 15-years-of clinical experience applicated manipulative therapy for the neck pain, an occupational therapist only conducted evaluations; K-NDI (Korean version of the Neck Disability Index), VAS (Visual Analog Scale), BDS-K (Korean version of Behavioral Dyscontrol Scale) for decreasing possible adverse effects; there were no person who reported other symptoms followed 4 weeks from the trial. Results: In the NPMCI group, data analysis indicated statistical differences between the PA mobilization interventions in NDI and BDS-K; even though, pain was reduced in VAS, this is not a significantly differ. In the NPMD group, data analysis represented statistical differences between the PA mobilization interventions in NDI, VAS and BDS-K; the scores were represented to be increased or the pain got relief. Conclusions: PA mobilization techniques according to Maitland concept have beneficial effects in patients with neck pain and other clinical positive effects which included neck disability, pain itself and motor function of upper extremity.

Tone-Based Access Scheme with Repetitive Contention in Contention-Based Medium Access Control (경쟁 기반 MAC에서의 반복적 톤 기반 경쟁 기법)

  • Ahn, Jae-Hyun;Yun, Jeong-Kyun;Bahk, Sae-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5A
    • /
    • pp.460-466
    • /
    • 2007
  • There are two coordination functions in IEEE 802.11 standard. One is PCF, polling based function, and the other is DCF, contention based function. DCF is simpler than PCF but the performance is similar with the latter. That's the reason why DCF is more popular than PCF. However, DCF has a risk of collision with other nodes in the network because the function is a distributed contention based one. CSMA/CA of DCF has collision avoidance algorithm in it, but the performance of avoidance algorithm has limitations. In this paper we proposed a new scheme called TAR(Tone-based Access scheme with Repetitive conention). In TAR, there is narrow contention-only channel other than original data transmitting channel, so that both a data transmission and the contention can be performed simultaneously. The TAR uses the same contention concept with the CSMA/CA, but it has the originality for the narrow contention channel and the repetitive contention scheme which greatly reduce the collision probability. We proved the performance of TAR by some simulations, and it showed good results.

Enhanced MAC Scheme to Support QoS Based on Network Detection over Wired-cum-Wireless Network

  • Kim, Moon;Ye, Hwi-Jin;Cho, Sung-Joon
    • Journal of information and communication convergence engineering
    • /
    • v.4 no.4
    • /
    • pp.141-146
    • /
    • 2006
  • In these days, wireless data services are becoming ubiquitous in our daily life because they offers several fundamental benefits including user mobility, rapid installation, flexibility, and scalability. Moreover, the requests for various multimedia services and the Quality of Service (QoS) support have been one of key issues in wireless data communications. Therefore the research relative to Medium Access Control (MAC) has been progressing rapidly. Especially a number of QoS-aware MAC schemes have been introduced to extend the legacy IEEE 802.11 MAC protocol which has not guaranteed any service differentiation. However, none of those schemes fulfill both QoS features and channel efficiency although these support the service differentiation based on priority. Therefore this paper studies a novel MAC scheme, referred to as Enhanced Distributed Coordination Function with Network Adaptation (EDCF-NA), for enhancements of both QoS and medium efficiency. It uses a smart factor denoted by ACK rate and Network Load Threshold (TH). In this paper, we study how the value of TH has effect on MAC performance and how the use of optimal TH pair improves the overall MAC performance in terms of the QoS, channel utilization, collision rate, and fairness. In addition, we evaluate and compare both the performance of EDCF-NA depending on several pairs of TH and the achievement of various MAC protocols through simulations by using Network Simulator-2 (NS-2).

A Joint Resource Allocation Scheme for Relay Enhanced Multi-cell Orthogonal Frequency Division Multiple Networks

  • Fu, Yaru;Zhu, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.2
    • /
    • pp.288-307
    • /
    • 2013
  • This paper formulates resource allocation for decode-and-forward (DF) relay assisted multi-cell orthogonal frequency division multiple (OFDM) networks as an optimization problem taking into account of inter-cell interference and users fairness. To maximize the transmit rate of system we propose a joint interference coordination, subcarrier and power allocation algorithm. To reduce the complexity, this semi-distributed algorithm divides the primal optimization into three sub-optimization problems, which transforms the mixed binary nonlinear programming problem (BNLP) into standard convex optimization problems. The first layer optimization problem is used to get the optimal subcarrier distribution index. The second is to solve the problem that how to allocate power optimally in a certain subcarrier distribution order. Based on the concept of equivalent channel gain (ECG) we transform the max-min function into standard closed expression. Subsequently, with the aid of dual decomposition, water-filling theorem and iterative power allocation algorithm the optimal solution of the original problem can be got with acceptable complexity. The third sub-problem considers dynamic co-channel interference caused by adjacent cells and redistributes resources to achieve the goal of maximizing system throughput. Finally, simulation results are provided to corroborate the proposed algorithm.

DCF Throughput Analysis of the MAC Layer in the IEEE 802.11 Wireless LAN (IEEE 802.11a 무선 LAN의 MAC 계층DCF 처리율 분석)

  • Jung, Jin-Wook;Ha, Eun-Sil;Lee, Ha-Chul
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.4
    • /
    • pp.509-515
    • /
    • 2005
  • This paper explores the throughput of DCF protocol with both the traffic intensity and MSDU size at the MAC layer in the 802.11a wireless LAN. By exploring the throughput of DCF protocol with the data rate of 6Mbps, 12 Mbps, 24 Mbps and 54 Mbps, we find the fact that the less the data rate be, the higher the throughput be. We also find, from the throughput calculation by means of traffic intensity and MSDU size, that the longer the MSDU size is, the higher the throughput is. We also found the traffic intensity that the throughput is at the maximum point with the fixed MSDU size.

  • PDF

A Scheduling Algorithm of AP for Alleviating Unfairness Property of Upstream-Downstream TCP Flows in Wireless LAN (무선 랜에서의 상.하향 TCP 플로우 공평성 제고를 위한 AP의 스케쥴링 알고리즘 연구)

  • Lim, Do-Hyun;Seok, Seung-Joon
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.11
    • /
    • pp.1521-1529
    • /
    • 2009
  • There is a serious unfairness problem between upstream and downstream flows of AP in IEEE 802.11 Wireless LAN. This problem is because Wireless LAN's DCF MAC protocol provides AP with equal channel access priority to mobile noded. Also, it makes this problem worse that the TCP's Data segment loss is more effective on throughput than the TCP's ACK segment. In this paper, we first make several simulations to analysis the unfairness in the various point of view and to find reasons of the unfairness. Also, this paper presents AP's scheduling scheme to alleviate the unfairness problem and evaluate the scheme through ns2 simulator.

  • PDF

Throughput rate of DCF Protocol based Ricean fading channel in the IEEE 802.1la wireless LAN. (라이시안 페이딩 채널환경에서 IEEE 802.11a 무선 LAN의 DCF 처리율)

  • Ha Eun-Sil;Jung Jin-Wook;Lee Ha-Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9A
    • /
    • pp.803-813
    • /
    • 2005
  • This paper explores the throughput performance of CSMA/CA-based DCF protocol over frequency-selective, slow Ricean fading channels with both the $E_{b}/N_{o}$ and BER at the MAC layer in the 802.1 la wireless LAN. By exploring the throughput of DCF protocol with the data rate of 6Mbps, 12 Mbps, 24 Mbps and 54 Mbps, we find the fact that the higher the $E_{b}/N_{o}$ be and the less the BER be, the higher the throughput be.

The IEEE 802.11 MAC Protocol to solve Unfairness Problem in Multihop Wireless Ad Hoc Networks (다중 무선 에드혹 네트워크에서 불공정 문제를 해결하기 위한 802.11 MAC 프로토콜)

  • Nam, Jae-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.229-234
    • /
    • 2007
  • In the IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time. which is uniformly selected from the Contention Window (CW) This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. The BEB scheme suffers from a unfairness problem and low throughput under high traffic load. In this paper, I propose a new backoff algorithm for use with the IEEE 802.11 Distributed Coordination Function.

  • PDF

Medium Access Control Protocol for Ad Hoc Networks Using Dynamic Contention Window (동적 경쟁윈도우를 이용한 Ad Hoc 망에서의 Medium Access Control 프로토콜)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.4
    • /
    • pp.35-42
    • /
    • 2008
  • Since Bianchi's 2-D Markov Chain Model considers collision problem only in ideal channel condition, it does not reflect real channel impaired by fading, interference, and noise. Distributed Coordination Function(DCF) doubles its contention window(CW) when transmission fails regardless of collision or transmission error. Increase of CW caused by transmission error degrade throughput and increase the delay. In this paper, we present quantitative analysis of the impact of the parameters such as contention window size(CW), transmission probability for a given time slot(${\Im}$), transmission failure probability($p_f$), on the system performance and provide a method how to decrease the initial CW to achieve equivalent performance.

  • PDF