Documente Academic
Documente Profesional
Documente Cultură
AbstractScheduling in a wireless ad hoc network is necessary for sharing of the wireless channel by different nodes
to communicate successfully i.e. while meeting the required
SINR threshold. Contrary to the infra-structure based wireless
networks, the wireless ad hoc network require a scheduling
algorithm that should be easily implementable with as little
as possible coordination between different nodes in distributed
fashion. In this paper, we have proposed a receiver guard zone
based scheduling scheme for a wireless ad hoc network with
long and short hops. Our proposed scheduling scheme has a
performance 74% as compared to centralized scheduling
scheme that is considered as optimal but practically infeasible
for wireless ad hoc networks. The proposed scheduling scheme
also has a remarkable gain in transmission capacity as compared
to random ALOHA and Carrier Sense Multiple Access (CSMA).
I. I NTRODUCTION
The need of an efficient ad hoc network is highly desirable
in todays world because of its properties which can be very
useful with new technologies, devices and applications. That
is why we have seen a lot of research and innovations in
this field since last few years, especially on the topic of
capacity and power control in wireless ad hoc networks [1]
[6]. The Medium Access Control (MAC) protocol plays a very
important role in design of a wireless ad hoc network and
has a major impact on capacity due to distributed nature of
this network and simultaneous transmission in same channel
by different contending nodes [3], [7]. Although, network
capacity is an important parameter to be considered while
designing an ad hoc network, but in practical networks, other
parameters like energy efficiency, quality of service, system
robustness, delays etc. should also be considered [8]. In this
paper we are focusing on capacity of a wireless ad hoc network
like in [1], [2], [9], [10].
A. Related Work
The requirement that a wireless communication channel has
to be shared by all the communication devices in a network,
highlights the importance of scheduling in wireless ad hoc
networks [3], [11], [12] and the implementation technique of
a scheduling scheme has major impact on some of network
parameters like end-to-end delay, outages, power efficiency,
data throughput and channel capacity. In [7] the authors used
a stochastic model to find out the optimal scheduling technique
for an ad hoc network. They propose a Medium Access
Control (MAC) protocol which ensures a random exclusion
TABLE I
N ETWORK PARAMETERS , UNLESS OTHERWISE SPECIFIED .
Symbol
R
n
dmin
N
Description
Network Radius
Receiver Noise
Path loss exponent
Minimum required SINR(SIN Rmin )
Short hop Tx-Rx separation
Number of nodes in the network
Value
50m
0.001
4
10dB
R/20
100
n+
G P
P ll l
i, l {1, 2, ..., N }
i6=l Gli Pi
(1)
Where,
Gli = Gain from ith transmitter to lth receiver i.e. equal to
1
(dli ) , where dli is the distance between ith transmitter and
lth receiver with free space path loss exponent .
Pi = Power transmitted by ith transmitter.
n = Noise power (thermal noise), considered equal on all
the receivers.
The condition i 6= l is necessary because the power
transmitted by ith transmitter is considered as interference
for lth receiver but this is not the case when i = l because
(2a)
(2b)
(3)
GZppc
ALOHA
(4)
Fig. 1. Initial Nodes density (i ), density of nodes after only guard zone
based scheduling (GZ ), Transmission capacity under JSPCA (P areto )
and transmission capacity under proposed scheme (GZppc ) versus . The
maxima of GZppc at = 0.9 shows that the optimal value of guard zone
correspond to Opt = 0.9 for this network at these network parameters.
V. S IMULATION R ESULTS
The optimal value of guard zone for this network was
calculated as described in previous section for different network parameters at N = 100 and then used for simulations
at different values of N . The network transmission capacity
under proposed scheme is then analyzed by comparison with
Transmission capacity of JSPCA, Transmission capacity of
CSMA which uses guard zone around transmitters and Transmission capacity of ALOHA which doesnt use any type of
scheduling.
and CSMA for a wireless ad hoc network with long and short
hops and it can even outperform the near optimal JSPCA for
small path loss exponent at very large initial nodes density
under the assumed system model and network parameters.
The proposed scheduling and its simulated results are suboptimal because of some reasons (i) it searches in a sequence
after arranging all the nodes in a random manner instead of
searching for a largest possible subset (ii) it uses same guard
zone size around all receivers to inhibit a specific interferer
(iii) we optimized the guard zone radius for N = 100 and
then used that Opt for N = 1 300 for simulations, but
the performs can be even better than the simulated one if we
optimize guard zone size for each value of N i.e. if we can
define optimal guard zone size as a function of initial number
of contending nodes Opt = f (N ) which we have left for
future work. Now we can say along with these results that the
proposed guard zone based scheduling scheme for a wireless
ad hoc network at = 3 5 has a performance 74% of
near optimal but practically infeasible JSPCA.
R EFERENCES
[16] Aamir Hasan, M. Ali and Zahid Ali, Modeling Aggregate Interference
in Ad Hoc Networks, International Bhurban Conference on Applied
Sciences & Technology (IBCAST), January, 2010.
[17] S. Weber, J. G. Andrews, and N. Jindal, An overview of the transmission capacity of wireless networks, IEEE Transaction on Communications, vol. 58, pp. 35933604, December 2010.
[18] Jens Zander, Performance of Optimum Transmitter Power Control
in Cellular Radio Systems, IEEE TRANSACTIONS ON VEHICULAR
TECHNOLOGY, VOL. 41, NO. 1, FEBRUARY 1992.
[19] G. J. Foschini and Z. Miljanic, A Simple Distributed Autonomous
Power Control Algorithm and its Convergence, IEEE TRANSACTIONS
ON VEHICULAR TECHNOLOGY, vol. 43, no. 4, November. 1993.