(IJCNS) International Journal of Computer and Network Security, 33

Vol. 2, No. 3, March 2010

Resource Allocation in Wireless Networks

1
Manish Varshney, 2Dr Yashpal Singh, 3Vidushi Gupta
1
Sr Lecturer Deptt of Computer Science & Engg, SRMSWCET Bareilly, India
Email itsmanishvarshney@gmail.com
2
Reader Deptt of Computer Science & Engg BIET Jhansi, India
Email yash_biet@yahoo.com
3
Lecturer Deptt of Computer Science & Engg, SRMSWCET Bareilly, India
Email vidu.leo@gmail.com

Abstract: In this paper, we study about the resource allocation
techniques in wireless network ,thus describing utility based
functions and various protocols using directional antenna .In
other words the stud is based on utility-based maximization for
resource allocation. We consider two types of traffic, i.e., best
effort and hard QoS, and develop some essential theorems for
optimal wireless resource allocation. Directional antenna
technology provides the capability for considerable increase in
spatial reuse which is essential in the wireless medium. In this
paper, a bandwidth reservation protocol for QoS routing in
TDMA-based MANETs using directional antennas is presented.
The routing algorithm allows a source node to reserve a path to
a particular destination with the needed bandwidth which is
represented by the number of slots in the data phase of the
TDMA frame. The performance of the proposed schemes is
evaluated via simulations. The results show that optimal
wireless resource allocation is dependent on traffic types, total
available resource, and channel quality, rather than solely
dependent on the channel quality or traffic types as assumed in
most existing work. Further optimizations to improve the
efficiency and resource utilization of the network is provided.
Keywords: Utility-based maximization, wireless networks,
resource allocation, , Mobile ad hoc networks (MANETs), quality
of service (QoS), routing, time division multiple access (TDMA).
1. Introduction
RESOURCE allocation is an important research topic in
wireless networks [1-7]. In such networks, radio resource is
limited, and the channel quality of each user may vary with
time. Given channel conditions and total amount of
available resource, the system may allocate resource to users
according to some performance metrics such as throughput
and fairness [1], [2] or according to the types of traffic
[3].but another foremost factor that is required in wireless
network is spatial reuse of network. In order to
communicate with another node in a particular location, a
node that is transmitting using an omnidirectional antenna
radiates its power equally in all directions. This prevents
other nodes located in the area covered by the transmission
from using the medium simultaneously. For this purpose
directional antennas are used. Directional antennas allow a
transmitting node to focus its antenna in a particular
direction. Similarly, a receiving node can focus its antenna
in a particular direction, which leads to increased sensitivity
in that direction and significantly reducing multi-path
effects and cochannel interference (CCI). This allows
directional antennas to accomplish two objectives: (1) Power
saving: a smaller amount of power can be used to cover the
same desired range (2) Spacial reuse: since transmission is
focused in a particular direction, the surrounding area in the
other directions can still be used by other nodes to
communicate ,now coming back to the point of throughput
and fairness required in resource allocation .
“Throughput” and “fairness,” however, are conflicting
performance metrics. To maximize system throughput, the
system will allocate more resource to the users in better
channel conditions. This may cause radio resource
monopolized by a small number of users, leading to
unfairness. On the other hand, to provide fairness to all
users, the system tends to allocate more resource to the users
in worse channel conditions so as to compensate for their
shares. As a result, the system throughput may be degraded
dramatically. The work in [6-7] show that the system can
behave either throughput-oriented” or “fairness oriented” by
adjusting certain parameters. However, they do not describe
how to determine and justify the value of these parameters,
leaving this trade-off unsolved.
In this paper, we focus on basic techniques required for
resource allocation in wireless networks .through the work
we came to the basic two factors which are to be resolved ,
1)the first factor relates “user satisfaction” for resource
allocation to avoid such a “throughput-fairness” dilemma
Since it is unlikely to fully satisfy the different demands of
all users, we turn to maximize the total degree of user
satisfaction. The degree of user satisfaction with a given
amount of resource can be described by the utility function
U(r), a non-decreasing function with respect to the given
amount of resource r. The more the resource is allocated, the
more the user is satisfied. The marginal utility function
defined by u(r) = dU(r) dr is the derivative of the utility
function U(r) with respect to the given amount of resource r.
The exact expression of a utility function may depend on
traffic types, and can be obtained by studying the behavior
and feeling of users. We leave the work of finding utility
functions to psychologists and economists, and focus on
maximizing the total utility for a given set of utility
functions. and 2) the second factor link to the directional
antennas There are different models that are presented in
the literature for directional antennas [8].In this paper, the
multi-beam adaptive array (MBAA) system is used [1]. It is
capable of forming multiple beams for simultaneous
transmissions or receptions of different data messages.
The rest of the paper is organized as follows. In Sec. II,
resource allocation in wireless networks through utility
functions are proposed and proved to be optimal under
certain conditions while In Sec. III, resource allocation in
34
wireless networks through directional antennas Finally, the
paper is concluded in Sec. IV.
2. Resource Allocation In Wireless Networks
Through Utility Functions
In [4], a utility-based power control scheme with respect to
channel quality is proposed. In that scheme, users with
higher SIR values have higher utilities, and thus are more
likely to transmit packets. Therefore, the wireless medium
can be better utilized and the transmission power can be
conserved, which can adapt to channel conditions and
guarantee the minimum utility requested by each user. In
[8-9], the authors design a utility-based fair allocation
scheme to ensure the same utility value for each user.
However, letting users with different traffic demands to
achieve an identical level of satisfaction may not be an
efficient way of using wireless resource. Worse, traffic
which is difficult to be satisfied tends to consume most of
the system resource leading to another kind of unfairness. In
[5], a utility-based scheduler together with a Forward Error
Correction (FEC) and an ARQ scheme is proposed. That
work gives lagging users more resource and thus results in a
similar performance level (i.e., fixed utility value) for each
user. The work in [13-14] targets at multi-hop wireless
networks Utility functions have also been widely used in
Internet pricing and congestion control [6]. The typical
approach is to set a price to radio resource and to allocate
tokens to users. The objective is then to maximize the
“social welfare” through a bidding process. These kinds of
bidding schemes, while useful for Internet pricing and
congestion control, may not be practical for wireless
networks. In wireless environments, the types of traffic, the
number of users, and channel conditions are all time-
varying. It would-be very expensive to implement a wireless
bidding process because the users would have to keep
exchanging control messages for real-time bidding, and the
control protocols of the wireless system would also have to
be modified to accommodate this process. Finally, the
complexity and efficiency of wireless bidding have not been
analyzed. It is hard to estimate the time elapsed to achieve
the Nash equilibrium. We consider two common types of
traffic: hard QoS and best effort traffic, and propose three
allocation algorithms1 for these two types of traffic, namely,
1) the HQ allocation for hard-QoS traffic, 2) the elastic
allocation for best effort traffic, and 3) the mixed allocation
for the co-existence of both types of traffic. These three
allocation schemes are all polynomial time solutions and
proved to be optimal under certain conditions, and in any
case, the difference between the total utilities obtained by
our solutions and the optimal utility are bounded. The
performance of the proposed schemes is validated via
simulations. The results show that optimal wireless resource
allocation depends on the traffic demand, total available
resource, and wireless channel quality, rather than solely
dependent on channel quality or traffic type as assumed in
most existing work.
(IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 3, March 2010
2.1 Resource Allocation Using Hard Qos, Best, And
Mixed Traffic In Wireless Network Through Utility
Based Functions
2.1.1 Problem Statement and Definitions
Suppose that there are n users served by a base station. Let
rtotal denote the total amount of radio resource available at
the base station, and ri, the amount of resource to be
allocated to user i. Users with the same kind of traffic may
not feel the same way by given the same amount of resource
because the wireless channel quality for each user may not
be identical. Let denote the channel quality 2 of user i, 0 ≤
≤ 1, and i = 1, 2, · · ·n. The smaller the value of the
worse the channel quality. Given an amount of resource r i
and channel quality qi, the amount of resource actually
beneficial to user i is given by θi = · qi . Let T (i) denote the
type of traffic of user i. The utility function of user I is
expressed by where (.) is the utility
function of traffic T (i) and Ui(.) is the utility function for
the type of traffic described by UT(i)(.) but taking into
account the channel quality of user i. The marginal utility
function of Ui(.) is and that of
(.) is (.). Our objective is to maximize
subject to and ∀ ≥ 0. An
optimal allocation for n users with total available resource
is defined as follows. Note that the optimal allocation
may not be unique in the system.
Figure 1. The utility functions of two types of traffic
• Definition 2.1: A resource allocation R+ = {r 1 ,r 2
,∙∙∙,r n } for n users is an optimal allocation if for all
feasible allocations Ra= {r ’1,r ’2,∙∙∙,r ’n},U(R+ ) ≥
U(Ra ),where U(R+ ) = and U(Ra )=
.
• Definition 2.2: R = {r 1, r 2 ,∙∙∙, r n } is a full allocation
if
2.1.2 HQ Allocation for Hard QoS Traffic
Suppose that there are n users in the queue, all with hard
QoS traffic. Let denote the residual resource in the
system. The resource allocation algorithm designed for users
whose utility functions are all unit-step functions is referred
to as the HQ allocation and the output is denoted by RHQ =
{r 1, r 2 ,∙∙∙, r n }. Given the total available resource in the
system , the channel quality and utility function
(.) for all users i, RHQ can be obtained as follows.
1) Initialize ← 0, i = 1, 2, · · · , n; ←
2) Sort all users i in the queue in descending order of
.
3) Repeat Steps (4) and (5) until the queue becomes empty.
4) Pop out user i who is now at the head of the queue.
 (IJCNS) International Journal of Computer and Network Security, 35
Vol. 2, No. 3, March 2010

5) If > , then = , ; = − Find by summing up over all users j;

Find , the inverted function of .
.
4) If the queue is not empty, then pop out the QoS user i at
The utility function for user i with hard QoS traffic is
the head of the queue; else go to Step (8).
described by where
5) For the popped user i: if ≥ , then = ;else
is a unit-step function, is the channel quality of this user,
Mi is the kind of QoS traffic, is the preferred amount of = 0; go to Step (4).
resource to be allocated. 6) Δ = − .
7) If (Δ > 0), then = − ; go to Step (4); else
= 0; go to Step (8);
8) If ( ) < (0), then = ( ));else = 0.
The allocation rule of this mixed allocation is to: 1) allocate
resource to the first k QoS users at the sorted queue, and 2)
then allocate the residual bandwidth (i.e., − ) to
all best effort users based on the elastic allocation. The
value of k is determined based on the requirement that there
is sufficient resource for this QoS user and the utility gain
ΔUk is positive (i.e., − > 0) .
Figure 2. Allocation ordering of k users in the HQ
allocation. 2.2 Resource Allocation Using Directional Antennas
Medium Access Protocols (MAC) protocols for directional
2.1.3 . Elastic Allocation for Best Effort Traffic antenna systems can be classified into two categories: on
We next consider the best effort traffic. The resource demand and scheduled. In the on-demand scheme nodes
allocation algorithm for users with concave utility functions must exchange short signals to establish a communication
is referred to as the elastic allocation and the output is session.
denoted by = {r 1, r 2 ,∙∙∙, r n }. Given the total
available resource , the channel quality qi and
marginal utility function for each user i, can
be obtained as follows.
1) For each user i, derive , the inverted function of
.
2) Derive , by summing up , over all users i,
i.e, = .
3) Find , the inverted function of .
4) Find , which is equal to ).
5) For all , i = 1, 2, · · · , n,if < (0), then =
; else = 0. Figure 3. An example of mixed allocation
The allocation rule of this scheme is to 1) derive the
aggregated utility function from the inverse functions of all Data message transmission is done using the
users, 2) calculate the allocated marginal utility from the omnidirectional mode, and reception is done using the
aggregated utility function, and 3) determine for each directional mode. Directional antennas are used to transmit
user. request-to-send (RTS) and receive clear-to-send (CTS)
signals while the receiver antenna remains in the
2.1.4 Mixture of Hard QoS and Best Effort Traffic omnidirectional mode during this exchange. In [13],
Finally, we consider the co-existence of QoS and best effort communicating pairs are set up using the multi-beam
traffic in the system, which is referred to as mixed forming ability of directional antennas. through cashing of
allocation and the output of which is denoted by = {r 1, the angle of arrival (AoA), Takai [14] avoided the use of the
r 2 ,∙∙∙, r n }. omnidirectional mode, which is only used when the AoA
Let denote the amount of residual resource to be given to information is not available.
best effort traffic, and ΔUi, the utility gain by allocating
resource to QoS user i. Other notations remain the same as
in the HQ and the elastic allocations. Given the total
available resource , the channel quality and
marginal utility function for each user i, can be
obtained as follows.
Figure 4 . (a) Transmission pattern of an omnidirectional
1) Initialize ri ← 0, i = 1, 2, · · · , n ; and ← .
antenna. (b) Transmission pattern of a directional antenna.
2) Sort all QoS users i in descending order of , and
store them in the queue. 2.2.1 Directional Antenna System Assumptions And
3) For each best effort user j, derive from ; Definitions
36 (IJCNS) International Journal of Computer and Network Security,
In this paper, it is assumed that each node in the network is
equipped with an MBAA-antenna system. Each antenna is
capable of transmitting or receiving using any one of k
beams which can be directed towards the node with which
communication is desired. In order for node x to transmit to
a node y, node x directs one of its k antennas to transmit in
the direction of node y, and node y in turn directs one of its
k antennas to receive from the direction of node x.
Radio signals transmitted by omnidirectional antennas
propagate equally in all directions. On the other hand,
directional antennas install multiple antenna elements so
that individual omnidirectional RF radiations from these
antenna elements interfere with each other in a constructive
or destructive manner.
Figure 5. Transmission pattern of an MBAA antenna
system with k=4 beams. Each of the k beams can be oriented
in a different desired direction. The figure shows: (a) Beams
in transmission mode. (b) Beams in reception mode.
This causes the signal strength to increase in one or multiple
directions. The increase of the signal strength in a desired
direction and the lack of it in other directions are modeled
as a lobe. The angle of the directions, relative to the center
of the antenna pattern, where the radiated power drops to
one-half the maximum value of the lobe is defined as the
antenna beamwidth, denoted by β [9]. With the
advancement of silicon and DSP technologies, DSP modules
in directional antenna systems can form several antenna
patterns in different desired directions (for transmission or
reception) simultaneously. Figure 4(a) shows the
transmission patterns of an omnidirectional antenna. Figure
4(b) shows the transmission pattern of a directional antenna
.In this paper, it is assumed that an MBAA antenna system
is capable of detecting the precise angular position of a
single source for locating and tracking neighbor nodes.
Figure 5 shows a node equipped with an MBAA antenna
array with k=4 beams. Each of the k beams is able to be
oriented in a different desired direction. Figure 5(a) shows
the antenna array in the transmission mode, and Figure 5(b)
shows the antenna array in the reception mode.
2.2.2 Protocols For Directional Antennas
The networking environment that is assumed in this paper is
TDMA where a single channel is used to communicate
between nodes. The TDMA frame is composed of a control
phase and a data phase [17]. Each node in the network has a
designated control time slot, which it uses to transmit its
control information. However, the different nodes in the
network must compete for the use of the data time slots in
the data phase of the frame. In this section, the slot
allocation rules for the TDMA directional antenna
environment are presented. The hidden and exposed
terminal problems make each node’s allocation of slots
Vol. 2, No. 3, March 2010
dependent on its 1-hop and 2-hop neighbor’s current use of
that slot. The model used in this protocol is similar to that
used in [11] and [12], but includes modifications to support
directional antenna systems. Each node keeps track of the
slot status information of its 1-hop and 2-hop neighbors.
This is necessary in order to allocate slots in a way that does
not violate the slot allocation conditions imposed by the
nature of the wireless medium and to take the hidden and
exposed terminal problems into consideration.
2.2.3 Slot Allocation Conditions For Directional
Antennas
A time slot t is considered free to be allocated to send data
from a node x to a node y if the following conditions are
true:
1) Slot t is not scheduled to receive in node x or scheduled to
send in node y, by any of the antennas of either node (i.e.
antennas of x must not be scheduled to receive and antennas
of y must not be scheduled to transmit, in slot t).
2) Slot t is not scheduled for receiving in any node z, that is
a 1-hop neighbor of x, from node x where y and z are not in
the same angular direction with respect to x (i.e. ∩
≠ ).
3) Slot t is not scheduled for receiving in node y from any
node z, that is a 1-hop neighbor of x, where x and z are in
the same angular direction with respect to y (i.e. ∩ ≠
).
4) Slot t is not scheduled for communication (receiving or
transmitting) between two nodes z and w, that are 1-hop
neighbors of x, where w and y are in the same angular
direction with respect to z (i.e. ∩ ≠ ), and x and z
are in the same angular direction with respect to w (i.e.
∩ ≠ ).
In Figure6, which illustrates allocation rule 2, node x cannot
transmit to node y using slot t, because it is already using
slot t to transmit to node z, which is in the same angular
direction as node y. In Figure7, which illustrates allocation
rule 3, node x cannot allocate slot t for sending to node y
because slot t is already scheduled for sending from node z,
that is a 1-hop neighbor of x, and ∩ ≠ . In Figure
9, which illustrates allocation rule 4, slot t cannot be
allocated to send from x to y because it is already scheduled
for communication between two nodes z and w, that are 1-
hop neighbors of x, where ∩ ≠ and ∩ ≠
. When a node S wants to send data to a node D, with a
bandwidth requirement of b slots, it initiates the QoS path
discovery process
Figure 6. Illustration of allocation rule 2.
Figure 7. Illustration of allocation rule 3.
Figure 8. Illustration of allocation rule 4.
 (IJCNS) International Journal of Computer and Network Security, 37
2.2.4 The Qos Path Reservation Algorithm
Node S determines if enough slots are available to send
from itself to at least one of its 1-hop neighbors. If that is
the case, it broadcasts a QREQ(S, D, id, b, x, PATH, NH) to
all of its neighbors. The message contains the following
fields:
• S, D and id: IDs of the source, destination and the session.
The (S,D, id) triple is therefore unique for every QREQ
message and is used to prevent looping.
• b: Number of slots required.
• x: The node ID of the host forwarding this message.
• PATH: A list of the form (( ). It
contains the accumulated list of hosts and time slots, which
have been allocated by this QREQ message so far? is the
ith host in the path, and is the list of slots used by to
send to . Each of the elements of contains the slot
number that would be used, along with the corresponding
the set of angular groups, , which represents the
direction in which the sending antenna of host i must be
pointed, during that slot, to send data to host i + 1.
• NH: A list of the form (( ). It
contains the next hop information. If node x is forwarding
this QREQ message, then NH contains a list of the next hop
host candidates. The couple is the ID of the host,
which can be a next hop in the path, along with a list of the
slots, which can be used to send data from x to is a
list of the slots to be used to send from host i to host i+1
along with the angular group for each slot. has the same
format as in PATH.
3. Performance Analysis
In this paper we have gone through two methods of resource
allocation i.e resource allocation through utility functions
and the other using directional antennas. Now since both
methods are for resource allocation it is necessary to
analyze the performance of both the above given methods,
analyzing them leads to the comparison of the the resource
allocation method . In this section, we conduct simulations
to evaluate the performance of our allocation algorithms.
firstly analyzing resource allocation in wireless network
through utility function. So we consider QoS traffic, best
effort traffic, and the con-existence of both. The simulation
parameters are described as follows. For QoS traffic, the
utility function is a unit-step function with = 10 and UM
= 1, i.e., UQoS(r) = fu(r − 10); for best effort traffic, UBE(r) =
1 − er/10. The value of qi is randomly generated by a uniform
distribution over [0, 1]. We then measure the distributions
of and θi under different values of . send or receive data in different directions. This functionally
In Fig. 9, different resource allocation schemes are
compared with the proposed allocation schemes. The
comparison is based on the scheme proposed in [10], which
allocates radio resource proportionally based on factor
Depending on the setting of the value α, the system can be
tuned to work with different performance metrics. The curve
denoted ”throughput” is for α = 1, which gives more
resources to the users in better channel conditions, thereby
leading to a larger system throughput. The curve denoted
Vol. 2, No. 3, March 2010
”fairness” is for α = − 1, giving all users an identical value
of θi = · qi . The curve denoted ”fixed” is for α = 0, which
provides the same amount of resource to all users. Note that
the schemes proposed in [18-19] are the examples of the
”fairness” scheme (i.e., α = − 1), and the GR+ scheme in [9]
is an example of the ”throughput” scheme. Fig. 8(a)
compares the proposed HQ allocation with different
allocation schemes, and Fig. 9(b) compares the proposed
elastic allocation with different allocation schemes. Note
that the axis of in Fig. 9(b) is in the logarithmic scale.
Theresults show that the ”throughput-first” scheme has a
higher total utility when is small, but the ”fixed”
allocation one is closer to the proposed scheme as
increases. Finally, when becomes very large, the
”fairness-first” scheme can achieve the highest utility. In
order to verify, and analyze the performance of the
directional antennas (protocols presented in paper),
simulation experiments were conducted. Several
performance measures were computed as the traffic rate
(messages/second) is varied. The measured parameters are
the overall percentage of packets received successfully, the
average number of requests per successful acquisition of
QoS path , The average number of requests per session, and
the average QoS path acquisition time
(a)
(b)
Figure 9. Utility comparison with different resource
allocation schemes a)Qos traffic b)best effort traffic
Simulation results clearly demonstrate the increased
efficiency and performance of the network as the number of
directional antennas increases. As was indicated earlier, this
increased performance is due to the considerable increase in
spatial reuse and the ability for each node to simultaneously
increases the effective number data slots by a multiple of the
number of antennas (or directions) used. This effect
significantly improves performance. As the data shows, the
increase in performance, or speed-up factor, when the
number of antenna is increased by a factor of 2 (i.e. doubled
from 1 to 2, and then from 2 to 4) is significant (speed up
factor > 1).As expected, however, it still below a theoretical
speed-up factor of 2. For the first set of experiments for
example, the data shows that that ratio of the overall
38
average percentage (average for all data traffic rates) of
successful packets of the two-antenna case to the one-
antenna case is 1.61, which is > 1 and < 2. The ratio for the
four-antenna case to the two antenna case is 1.84, which is
also > 1 and < 2, and the ratio for the four-antenna case to
the one-antenna case is 2.95 which are < 4. This is to be
expected from the theory of parallel and distributed systems
because the actual speed-up factor is always below the ratio
of the number of parallel units, or antennas.
4. Conclusion
In this paper, we study about two basic method of allocating
resources in wireless networks the first one Data message
length:100MB was utility-based maximization for resource
allocation in infrastructure-based wireless networks.
(a)
(b)
Figure 10. Simulation results.
In this we develop some essential theorems for utility-
based resource management. Then, three polynomial time
resource allocation algorithms are proposed for two types of
utility functions. We prove that, in any case, the difference
between the total utilities obtained by our proposed
solutions and the optimal utility is bounded, and under
certain conditions, all these three schemes can achieve the
maximum total utility (i.e., optimal). From the simulation
results, we find that different types of traffic require
different kinds of schemes to achieve optimal allocation. In
addition, when is small, the system tends to allocate
more resources to the users in better channel conditions, i.e.,
”throughput-oriented;” however, when is abundant, the
system becomes ”fairness-oriented,” meaning that even with
the same traffic, the preference tendency between
throughput and fairness can still differ. The second one was
a protocol for TDMA-based bandwidth reservation for QoS
routing in MANETs using directional antennas The protocol
takes advantage of the significant increase in spacial reuse
provided by the directional antenna environment, which
drastically increases the efficiency of communication in
MANETs. This is due to the reduction in signal
(IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 3, March 2010
interference, and the amount of power necessary to establish
and maintain communication sessions. Additionally, this
protocol provides for a relatively smaller hop count for QoS
paths due to the extended range of directional antennas
using the same total transmission power compared to the
omnidirectional case. In turn this results in reduced end-to-
end delay. The simulation results clearly show a significant
gain in performance with an increase in the number of
successfully received packets, as well as a decrease in the
QoS path acquisition time. However, as expected, this gain
in performance is still below the theoretical speed-up factor.
In the future, we intend to improve this protocol through the
employment of additional optimization techniques. T
his leads us to conclude that existing channel-dependent-
only resource schemes and schedulers cannot provide
optimal allocation in wireless networks. So In addition, we
intend to perform more simulations in order to further study,
analyze and improve the performance of the protocol under
different network environments including different mobility
rates, and traffic conditions.
References
[1] D.Angelini and M. Zorzi, “On the throughput and
fairness performance of heterogeneous downlink
packet traffic in a locally centralized CDMA/TDD
system,” in Proc. IEEE VTC-Fall 2002.
[2] Furuskar et al., “Performance of WCDMA high speed
Packet data,” in Proc. IEEE VTC 2002-Spring.
[3] Y. Cao, V. O. K. Li, and Z. Cao, “Scheduling delay-
sensitive and besteffort traffic in wireless networks,”
in Proc. IEEE ICC 2003.
[4] M. Xiao, N. B. Shroff, and E. K. P. Chong, “A utility-
based power control scheme in wireless cellular
systems,” IEEE/ACM Trans. Netw., vol. 11, no. 2,
2003.
[5] X. Gao, T. Nandagopal, and V. Bharghavan,
“Achieving application level fairness through utility-
based wireless fair scheduling,” in Proc. IEEE
Globecom 2001.
[6] F. P. Kelly, “Charging and rate control for elastic
traffic,” European Trans. Telecommun., Jan. 1997.
[7] V. A. Siris, B. Briscoe, and D. Songhurst, “Economic
models for resource control in wireless networks,” in
Proc. IEEE PIMRC 2002, Lisbon, Portugal, Sept. 2002.
[8] L. Chen, S. H. Low, and J. C. Doyle, “Joint congestion
control and media access control design for wireless ad
hoc networks,” in Proc. IEEE Infocom, Miami, FL,
March 2005.
[9] L. Bao and J. J. Garcia-Luna-Aceves. Transmission
scheduling in ad hoc networks with directional
antennas. Proc. of the 8th annual international
conference on mobile computing and networking, pages
48–58, September 2002.
[10] Q. Dai and J. Wu. Construction of power efficient
routing tree for adhoc wireless networks using
directional antenna. Distributed Computing Systems
Workshops. Proceedings. 24th International
Conference on, pages 718–722, March 2004.
[11] Jawhar and J. Wu. A race-free bandwidth
reservation protocol for QoS routing in mobile ad
 (IJCNS) International Journal of Computer and Network Security, 39
Vol. 2, No. 3, March 2010

hoc networks. Proc. of the 37th Annual Hawaii has authored various popular books such as Data Structure,
International Conference on System Sciences Database Management System, Design and Implementation of
(HICSS’04), IEEE Computer Society, 9, January 2004. Algorithms, Compiler Design books for the technical students of
[12] W.-H. Liao, Y.-C. Tseng, and K.-P. Shih. A TDMA- graduation and postgraduation.He has published various research
papers in National and International journals. He has also
based bandwidth reservation protocol for QoS routing
attended one faculty development program organized by Oracle
in a wireless mobile ad hoc network. Communications, Mumbai on Introduction to Oracle 9i SQL and DBA
ICC 2002. IEEE International Conference on, Fundamental.
5:3186–3190, 2002.
[13] S.; You J.; Hiromoto R.E.; Nasipuri, A.; Ye. A MAC Vidushi Gupta received her B.tech (C.S)
protocol for mobile ad hoc networks using directional degree from Uttar Pradesh Technical
antennas. Wireless Communications and Networking University, Lucknow.She is also pursuing
Conference, 2000. WCNC. 2000 IEEE, 3(23-28):1214– M.tech from Karnataka University, She is
1219, September 2000. working as Lecturer ( CS/IT department) in
SRMSWCET, and Bareilly She has also
[14] M. Takai, J. Martin, and R. Bagrodia. Directional
attended one faculty development program
virtual carrier sensing for directional antennas in based on the “Research Methodologies”.
mobile ad hoc networks. In Proc. ACM International
Symposium on Mobile Ad Hoc Networking and
Computing (MOBIHOC), Lausanne, Switzerland, June
2002.
[15] J. Ward and R.T.Jr. Compton. High throughput slotted
aloha packet radio networks with adaptive arrays.
Communications, IEEE Transactions on, 41(3):460–
470, March 1993.
[16] J. Zander. Slotted aloha multihop packet radio networks
with directional antennas. Electronics Letters,
26(25):2098–2100, December 1990.
[17] C. R. Lin and J.-S. Liu. QoS routing in ad hoc wireless
networks. IEEE Journal on selected areas in
communications, 17(8):1426–1438, August 1999.
[18] Jawhar and J. Wu. Qos support in TDMA-based mobile
ad hoc networks. The Journal of Computer Science and
Technology (JCST), Springer, 20(6):797–810,
November 2005.
[19] Jawhar and J. Wu. Race-free resource allocation for
QoS support in wireless networks. Ad Hoc and Sensor
Wireless Networks: An International Journal, 1(3):179–
206, May 2005

Authors Profile
Dr. Yahpal Singh is a Reader and HOD (CS)
in BIET, Jhansi (U.P.). He obtained Ph.D.
degree in Computer Science from
Bundelkhand University, Jhansi. He has
experience of teaching in various courses at
undergraduate and postgraduate level since
1999. His areas of interest are Computer
Network, OOPS, DBMS. He has authored
many popular books of Computer Science for graduate and
postgraduate level. He has attended many national and
international repute seminars and conferences. He has also
authored many research papers of international repute.

Manish Varshney received his M.Sc (C.S)

degree from Dr. B.R.A. University, Agra,
M.Tech. (IT) from Allahabad University and
Pursuing PhD in Computer Science. He is
working as a HOD (CS/IT) in SRMSWCET
Bareilly. He has been teaching various
subjects of computer science for more than
half a decade. He is known for his skills at
bringing advanced computer topics down to the novice's level. He
has experience of industry as well as teaching various courses. He