Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Abstract - Wireless LANs provide rapid access to the internet and are broadly deployed in hotspot areas. All nodes in a
WLAN access the internet by the associated access point and share the common wireless channel. As the number of nodes
in a WLAN increases rapidly, severe collision occurs which affect the network performance. The packet loss occurs either
due to the fact that nodes has not enough path and link stability or while the nodes moves out of range. In this paper we
propose an Improved Distributed Multi-User Scheduling(IDMUS)scheme to solve above problems, by taking time variant
link quality and rate adaptation into account and link loss estimation of the neighbouring nodes. By setting a suitable SNR
threshold, at any instant only small number of nodes will join contention. The link loss of neighbour nodes is estimated to
avoid the retransmission. As a result , collision is mitigated, fairness is retained and total throughput is increased.
Keywords - Improved Distributed Multi-User Scheduling, SNR threshold, throughput, scalability, link quality, link loss
estimation.
1. Introduction
Wireless LANs (WLAN) provide rapid access to the Internet and are broadly deployed in hotspot areas[1]. All nodes in a
WLAN can access the Internet by the associated Access Point (AP) and share the common wireless channel with the wellknown Carrier Sense Multi-Access (CSMA) scheme. CSMA works excellent in times of less traffic[2]. However, as the
number of nodes in a WLAN increases, severe collision affect the network performance. Some conventional schemes
which helps to reduce collision, include channel diversity, directional antenna, transmit power control ,adaptive backoff
and carrier sense[3] .
Multi-path fading is another reason which degrades the performance of a WLAN .It is undesirable and different diversity
schemes, such as receive diversity, transmit diversity and time diversity, have been proposed to avoid fading[4]. Thus the
reasons responsible for degrading network performance can be improved by IDMUS .
In this paper we propose a Improved Distributed Multi-User Scheduling (IDMUS) scheme, aiming to improve scalability
and increase throughput of WLANs. Time-variant link quality under multipath fading is considered and nodes are allowed
to transmit data only when their link quality is high. By setting a suitable SNR threshold, at any instance only a small
percentage of nodes join the contention. The SNR threshold is set by the AP, according to the number of nodes in the cell.
During data transmission from source to destination number of packet loss is estimated and is retransmitted to the access
point .In this way throughput is improved. In the case of CSMA to avoid collision, nodes has to perform exponential
backoff[5]. In the proposed IDMUS scheme a fixed contention window is adopted in the case of failure and the collision
probability is controlled by the AP. The total throughput of a WLAN is improved since transmissions are finished at higher
rate by avoiding deep fading.
The rest of the paper is organised as follows. Section II presents the Background and related work, Section III presents the
network models and protocols, in Section IV performance evaluation is shown and finally we conclude with conclusion in
section V.
2. Background and Related Work
2.1. Collision Avoidance
In splitting algorithms nodes involved in a collision are divided into several subsets in order to reduce the collision [3]. The
first subset will transmit first, followed by the second, then the remaining subsets.
__________________________________________________________________________________________
2015 ,IRJIE-All Rights Reserved
Page -75
ISSN: 2395-0560
Fading can be improved by multi-user scheduling[8]. In cellular networks, feedback of CSI to the AP are always available.
In a WLAN, there is no feedback channel, the common channel is shared in a distributed way. In case of Point
Coordination Function (PCF) an AP performs contention free transmission.
__________________________________________________________________________________________
2015 ,IRJIE-All Rights Reserved
Page -76
ISSN: 2395-0560
(1)
where PE(0) is the probability when no link have normalised SNR greater than 0 and channel is idle during contention
period, PS(0) is the probability when single link has normalised SNR greater than 0 and there is no collision, PC(0) is the
probability when more than two link have normalised SNR greater than 0 and collision occurs.
The 0 that an AP selects should maximize channel utility (0). It can be calculated by the following equation.
0 = arg max(0).
(2)
()
(3)
Where d is the average of the dynamic distance between two mobile nodes and k is the mobility proportion. In ideal
condition, i.e., when movement is almost constant, ( = 1) then
=
()
(4)
The number of lost packet is retransmitted to the access point by link loss estimation method.
3.3. Channel Access Method
For the multi-access up-link, the AP will first broadcast a short Poll frame. This frame is used to invite the station to send
its data . At the end of the Poll frame each node measures the instantaneous SNR value. If normalized SNR is greater than
the threshold0 specified in the Poll frame then each node with at least one up streaming packet starts a timer with a
random value. The timers start to count down DIFS (DCF Inter-Frame Space) after the Poll frame ends. The node whose
timer expires earliest sends its packet. Other nodes detecting the channel to become busy cancel their timers. If the AP
correctly receives the packet, it send ACK SIFS (Short Inter-Frame Space) which indicates that packets has been received
,after receiving the ACK from destination source will send the next set of data.
4. Performance Evaluation
In this paper NS2 simulator to show the simulation results. In this paper, I used mobility model as the Random way point,
and we have 20 nodes distributed in an area of 1000m 1000m. Each node independently moves within the specified area.
The simulation parameters used to analyze the performance of the existing and proposed protocol are showed in table 1.
__________________________________________________________________________________________
2015 ,IRJIE-All Rights Reserved
Page -77
ISSN: 2395-0560
Parameter
Value
Simulator
NS2(Ver. 2.28)
Simulation Time
25ms
Number of nodes
20
Routing protocol
AODV
Traffic model
CBR
Simulation Area
1000m1000m
Transmission range
250m
In figure2,this graphs shows the comparison between the existing CSMA and the proposed system where, throughput ratio
is improved by setting the suitable SNR threshold and by link estimation .At the each given time in x-axis the total
number of packets are received by the access point. In the proposed scheme, the throughput indicates , the total amount of
data transferred per unit time. The throughput is calculated by using the following formula,
(5)
__________________________________________________________________________________________
2015 ,IRJIE-All Rights Reserved
Page -78
ISSN: 2395-0560
Conclusion
In the existing techniques all nodes want to join the contention at the same time when the access point is free, as a result
severe collision occur which effects the network performance.
In the Proposed Improved Distributed Multi-User Scheduling (IDMUS) scheme, letting nodes with high link quality to
contend for the channel and retransmitting the packets by estimating the link loss for the nodes, collision is reduced and
throughput is improved.
REFERENCES
[1] Suhua TANG, Ryu MIURA, Sadao OBANA,Distributed Multi-User Scheduling for Improving Throughput of Wireless LAN,ATR
Adaptive Communications Research Laboratories, IEEE,2009.
[2] L. Kleinrock and F. Tobagi, Packet Switching in Radio Channels: Part i Carrier Sense Multiple-Access Modes and Their
Throughput-Delay Characteristics, IEEE Trans. Commun., vol. 23, pp. 14001416, Dec. 1975.
[3] R. Garces and J. J. Garcia-Luna-Acwees, Collision a Avoidance and Resolution Multiple Access for Multichannel Wireless
Network, in Proc. IEEE INFOCOM 2000, vol. 2, 2000, pp. 595602.
[4] DTse and P. Viswanath, Fundamentals of Wireless Communication. New York: Cambridge University Press, 2004.
[5] Y. Kwon, Y. Fang, and H. Latchman, A Novel Mac Protocol with Fast Collision Resolution for Wireless Lans, in Proc. IEEE
NFOCOM 2003, vol. 2, 2003, pp. 853862.
[6] Z. Ji, Y. Yang, J. Zhou, M. Takai, and R. Bagrodia, Exploiting Medium Access Diversity in Rate Adaptive Wireless Lans, in Proc.
CM MobiCom 2004, 2004, pp. 345359.
[7] Geetha Nair and Dr.N.J.R.Muniraj Prediction Based Link Stability Scheme for Mobile Ad Hoc Networks IJCSI International
__________________________________________________________________________________________
2015 ,IRJIE-All Rights Reserved
Page -79