INTL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS, 2017, VOL. 63, NO. 3, PP.
277-285
Manuscript received December 20 , 2016; revised June, 2017. DOI: 10.1515/eletel-2017-0037
Optimal Spectrum Utilization and Flow
Controlling In Heterogeneous Network with
Reconfigurable Devices
Syed Shakeel Hashmi, Syed Abdul Sattar, and K. Soundararajan
Abstract—Fairness provisioning in heterogeneous networks is a prime
issue for high-rate data flow, wherein the inter-connectivity property among
different communication devices provides higher throughput. In Hetnet,
optimal resource utilization is required for efficient resource usage. Proper
resource allocation in such a network led to higher data flow performance
for real-time applications. In view of optimal resource allocation, a resource
utilization approach for a reconfigurable cognitive device with spectrum
sensing capability is proposed in this paper. The allocation of the data flow
rate at device level is proposed for optimization of network fairness in a
heterogeneous network. A dynamic approach of rate-inference optimization
is proposed to provide fairness in dynamic data traffic conditions. The
simulation results validate the improvement in offered quality in comparison
to multi-attribute optimization.
Keywords—rate-inference optimization, heterogeneous network, flow
control, spectrum utilization
I. INTRODUCTION
W ITH regard to emerging trends in wireless
communication, heterogeneous networks represent an
evolving area. A heterogeneous network (HetNet) is acquired
as a cluster of distinct subnetworks, which are grouped together
to maintain long-range communication with different wireless
communication architectures. The integrated mode approach of
communication has resulted in efficient communication, with
higher throughput performance for wireless communication.
The architecture is in development to suite the upcoming
requirements of demanded services for next-generation
wireless communication. Such networks are evolving towards
a new mode of communication; various wireless-enabled
networks are integrated together to support long-range
communication, and the optimality issues with respect to
resource utilization and usage are under investigation.
Referring to the changed format of wireless networks integrated
together, the resources are to be properly controlled to achieve
the objective of fairness among the distributed networks with
user compatibility. For optimal resource allocation, various
methods have been developed in the past, e.g., spectrum
allocation, routing optimization, and power efficiency.
For the development of optimal resource allocation in
heterogeneous networks, an approach for the optimal allocation
of resources in terms of spectrum efficiency, fairness and
battery power during communication is outlined in [1]. A multi-
S. S. Hashmi is with the ECE Department, Icfai Tech School, IFHE
University and Research Scholar at JNTU Anantapur, India (e-mail:
hashmi@ifheindia.org)
S. A. Sattar is with ECE Department, NSAKCET, Hyderabad, India (e-mail:
syedabdulsattar1965@gmail.com).
K. Soundararaj is with ECE Department, NSACET, Hyderabad, India (e-
mail: soundararajan.tkr@gmail.com).
attribute scheduling algorithm approach is proposed, where
these parameters are used for resource scheduling. This multi-
attribute approach is significant because it controls the allocated
data rate based on an optimized utility function in the HetNet.
This optimization is proved wrt. optimal rate allocation over
maximization of the spectrum efficiency and fairness factor. In
order to be fair to the user, an interference alignment (IA)
scheme for resource allocation was presented in [2]. A spectral
coexistence mechanism to mitigate the interference in
heterogeneous networks was presented. The resource allocation
in terms of optimal interference management was advised. In
[3], the optimality issue of resource allocation with respect to
traffic density was outlined. The offered capacity for
transmission was governed by the solution of a continuous
linear programming (LP) approach, where a solution is derived
by a scheduler unit based on the number of mobiles in the
network. A weighted distribution scheme for all the available
weights in the network is presented in [4]. The approach of
resource allocation based on an existing wireless network for
user preference and mobile terminal power is presented. A cost
optimization approach was derived for different networks of
macro-, pico-, femto- and relay-based communication
approaches towards service uniformity in these networks. In
[5], a topology-governed inference management for enhancing
the performance of a heterogeneous network is outlined. To
obtain the objective of optimal resource allocation in
heterogeneous networks, an adaptive interference coordination
in inter-cellular interference for smart resource allocation is
presented. An intracellular fairness objective was suggested. In
[6],[7], a new dynamic scheduling over a heterogeneous
network, following packet scheduling, was presented. A media-
independent handover concept has been realized to offer
efficient transmission of multimedia services using
a heterogeneous network. For provisioning of the spectral
efficiency in a heterogeneous network, a cell range expansion
(CRE) problem was addressed in [8],9] by setting a positive
bias factor in the short-range communication network. The
objective was derived as the average area weighted load per
cell, defined as the weighted spectrum efficiency and energy
efficiency approach. With a similar objective for the spectral
efficiency in [10],11], the spectrum efficiency (SE) and energy
efficiency (EE) derived over a realistic network were presented.
An operation relation and quality governance for efficient
coding was suggested. In [12], SE and EE objectives were
analysed using a biased inter- and intra-radio access
technologies (RAT) offloading technique. The analysis yields a
multi-objective optimization problem, maximizing the SE and
EE subjected to the bounding quality of services. Most of the
approaches are developed for resource optimization, and the
offering quality of services is an observable parameter. To offer
278 S. S. HASHMI, S. A. SATTAR, K. SOUNDARARAJAN

QoS in heterogeneous networks, a quality objective with regard for the developed approach. The conventional model of the
to an interference constraint across the cell coverage is multi-attribute optimization approach, based on spectral
presented in [13] . The QoS parameters are defined as a function efficiency and fairness as outlined in [1], is presented in section
of link bandwidth, node buffer and queuing service and are III. Section IV outlines the proposed spectrum sense
employed at the router level in a heterogeneous network. In optimization approach and rate flow control for heterogeneous
[14], an end-to-end QoS framework for heterogeneous networks. Section V illustrates the experimental results derived
networks is focused on. The objective of QoS provisioning was from the proposed approach in comparison to conventional
made over multiple autonomous systems. In [15],16], a routing modelling.
algorithm based on proactive coding was suggested, and a QoS-
driven control selection was outlined. A general backward II. SYSTEM MODEL
utility formation was introduced to observe the dynamic QoS For the communication of data, a cluster of subnetworks
variation in the network. With respect to the resource variation capable of wireless transmission is used. An instance of the
issue and governing of QoS, multi-hop communication with network model following the heterogeneous network
regard to homogeneous and heterogeneous networks was representation is shown in Fig. 1.
presented in [17]. The variant parameter of a micro-site with
regard to a traffic load condition was analysed. In [18],19], IP-
oriented QoS signalling as a function of end-to-end QoS
offering and seamless mobility for joint resource management
was presented. The approach of node automaticity and quality
monitoring was presented with mobility concerns for QoS
offering. The method derived from supporting various services
in different architectures of heterogeneous networks. In
providing QoS, spectrum allocation based on the device level is
presented in [20]. An energy-efficient cooperative spectrum
sensing strategy for immune noise uncertainty was presented.
Coarse and fine sensing schemes are employed to achieve Fig. 1. Heterogeneous Architecture
energy efficiency in HetNets. A relation property of noise
immunity over power consumption was derived. To offer The network is defined with a set of communication
resource utilization via sharing, a device-to-device-level coding terminals, defined as cognitive user units (CuEs), where each
is presented in [21] based on a spectrum partitioning approach, device has the property of cognitive operation. In this network,
and an improved spectrum efficiency for D2D and cellular the communication terminals are linked with access points
networks was derived. Under quality-of-service governance, (APi), where each of these access points is set with different
the spectrum is divided into several subfrequencies, and each communication standards. The access network is defined with
band is allocated a D2D pair for transmission. Optimality was a Wi-Fi terminal, a cellular terminal and a WiMAX link point.
observed for maximization of D2D transmission power. The In the process of communication, a communication terminal
approach was developed under the constraint of offering QoS requests access. Based on the available access terminal, an
to the cellular transmission conformation. In [22], a device- access link is selected to offer maximum resources. The
level coding using cognitive radio units (CRNs) is presented. selected access terminal is then linked with the communication
An active resource allocation problem for heterogeneous terminal via a GRCU (global resource control unit). To perform
networks under imperfect channel conditions was presented the resource allocation, the communication terminal registers
The optimality issue was resolved by applying an optimal the selected access terminal to the GRCU, and then a handshake
power allocation problem under a known channel condition. In process is carried out between the GRCU and the
the suggested approach under network abstraction, the node communication terminal, confirming the allocation. Once the
operating as a router was controlled via different approaches to allocation is confirmed, communication is established from the
achieve the objective of higher performance in a heterogeneous communication terminal to the destination terminal via the
network. In [23], a bandwidth buffering mechanism addressing selected access point, controlled by the GRCU. The flow
the allocation issue and different queuing services to provide control of the heterogeneous network is illustrated in Fig. 2.
end-to-end QoS provision in heterogeneous networks was
suggested. isA self-clocked fair queuing mechanism for
providing QoS governance was presented, and the issues of the
end-to-end requirement and user connectivity were addressed.
While the provision of optimal quality of service and fairness
was solved in different aspects, multi-objective control for
HetNets is still to be developed to achieve optimal equilibrium
in resource utilization with offered QoS and network operation.
In this paper, a new approach for quality-governed data flow
operation is outlined to achieve efficient operational
performance in heterogeneous networks. An integration
approach for device performance and network control is
proposed to reach the target of higher performance in a
heterogeneous network. The remainder of this paper is
organized as follows. Section II outlines the system model used Fig. 2. Control flow diagram of the considered Heterogeneous Network
OPTIMAL SPECTRUM UTILIZATION AND FLOW CONTROLLING IN HETEROGENEOUS NETWORK WITH RECONFIGURABLE DEVICES 279

During the process of communication, a terminal access was where 𝜔𝑢𝑡 is the utility function for the battery life of each
granted by the GRCU, registering the sensed access point with user. These multiple attributes are controlled, to obtain an
the highest available resource. The resource allocations take efficient coding for spectral efficiency, fairness and long life of
place in the GRCU unit, and an optimal data rate is allocated nodes in a heterogeneous network. However, the concerns of
based on the current state of the registered access units. For device efficiency and service quality have not been focused on.
resource allocation, the GRCU unit operates with a multi- The optimization is derived based on the utility factors of these
attribute optimization approach as outlined in [1]. The attributes, and the control is made wrt. the allocated rate at time
conventional approach of multi-attribute optimization is t. To achieve higher efficiency in resource utilization with a
outlined in the next section. quality concern in such Heterogeneous Networks, a quality-
governed approach with device reconfiguration is proposed.
III. MULTI-ATTRIBUTE OPTIMIZATION APPROACH [1]
To provide efficient coding for resource allocation in IV. PROPOSED OPTIMIZATION ATTRIBUTE
heterogeneous networks considering Wi-Fi, 4G
(LTE/WiMAX), and 3G (HSPA/EVDO) architectures, a multi- A. Spectrum sense optimization
attribute optimization approach is suggested in [1]. In the In the present approach, during the initialization process, the
process of the multi-attribute optimization approach, 3 factors cognitive user equipment (CuE) performs a search operation in
were considered: 1) Spectral efficiency, 2) Fairness and 3) Connectivity Access Networks (CANs) based on the order of
Battery life. Spectral efficiency is calculated as the utility network preference. In this approach, the order of preference is
function of the allocated rate over the total spectrum 𝑘 available set as Wi-Fi, WiMAX and Cellular networks. For each of these
at time t for u users belonging to a set of users U, i.e., networks, a utility factor is calculated, and the network offering
∑𝑢∈𝑈 𝑟𝑢𝑡 the higher fairness factor is chosen. The selected CAN is
𝛾𝑡 = (1)
𝑘 registered with the GRC, and communication is then formed
where the allocated rate 𝑟𝑢𝑡 is defined by over the registered CAN. In the process of communication, the
GRC allocates the spectrum for communication under the
𝑟𝑢𝑡 𝑡
= ∑𝑎∈𝐴 𝑥𝑢𝑎 𝑡
∗ 𝑟𝑢𝑎 (2)
limitation of 𝛾𝑢𝑡𝑖𝑙 ∈ [0,1]. The rate allocation is based on the
where A is the set of BS/APs registered and 𝑎 ∈ 𝐴 is the radio demanded spectrum to the GRC, where the GRC performs
offered to A at time t. multi-attribute resource allocation to allocate resources to the
The optimal spectral allocation is obtained by optimizing the requested unit. However, with the communication process, the
allocation rate, defined by the maximum sum rate (MSR) spectrum is dynamically engaged and released based on the
optimization problem. However, the MSR has a limitation for
demanded service. The vacant spectrum can be utilised for
the global user resource allocation problem, which yields an
current active users towards extra spectrum allocation to
unfairness in spectrum allocation. To optimize the spectrum
𝑡 improve service quality. As the devices are cognitive in nature,
allocation, a utility factor 𝛾𝑢𝑡𝑖𝑙 is used, which is defined by [1]
the cognitive property of resource allocation can be used for
as
𝑡
𝛾𝑡 −𝛾𝑚𝑖𝑛
these spectrum allocations. The initial spectrum allocation for
𝑡
𝛾𝑢𝑡𝑖𝑙 = 𝑡 𝑡 (3) user u € U is given by the utility value 𝛾𝑈𝑡 . On the release of a
𝛾𝑚𝑎𝑥 −𝛾𝑚𝑖𝑛
𝑡
primary allocation rate 𝑟𝑖𝑡 , the available spectrum is defined by
where 𝛾𝑚𝑎𝑥 is the maximum achievable spectral efficiency
utility function and 𝛾𝑚𝑖𝑛 𝑡
is the minimum spectral utility
𝑡
𝛾𝑎𝑣1 = ∑𝑢∈𝑈 𝛾𝑢𝑡 − 𝑟𝑖𝑡 (7)
𝑡
function. When the network achieves 𝛾𝑚𝑎𝑥 efficiency, the This available spectrum is called the secondary spectrum and
utility function is given a value of 1, while the value is 0 when can be utilised by the active primary users (𝑝𝑢 ). On the request
𝑡
the achieved spectral efficiency is 𝛾𝑚𝑖𝑛 . To provide a fair for this secondary spectrum, the GRCU computes the spectral
platform, the allocated rate is controlled by a fairness utility interference energy, 𝐸, for n active user as defined by [20] as
𝑡 𝑡
function 𝜃𝑢𝑡𝑖𝑙 . This utility function 𝜃𝑢𝑡𝑖𝑙 is defined by [1] as, 𝑦
𝐸 = ∑𝑛𝑖=1( 𝑖)𝑃 (8)
|𝐵𝑈 𝑡 | 𝜎
𝑡
𝜃𝑢𝑡𝑖𝑙 = 1− (4)
|𝑈| where 𝑦𝑖 is the received information and σ is the observed
The fairness utility function is defined as a function of user channel variance. Parameter ‘P’ is varied over a range of 1-10
blockage, where it takes a value of 1 when the number of to derive the energy variation wrt. the interference variation in
blocked users (BUs) = 0 and takes a value of 0 when the total the channel. To allocate the available secondary spectrum, the
blockage is maximal. For long-term fairness, the utility function obtained energy ‘E’ is used as the allocation parameter. In the
is defined by [1] as data flow process, the optimal encoding mode can be
(∑ ∑𝑡 𝑟𝑢𝑡 )2 determined by reaching the best trade-off between the amount
𝜙𝑢𝑡𝑖𝑙 = |𝑈|∗∑𝑢∈𝑈 𝑡 2 (5)
𝑢∈𝑈(∑𝑡 𝑟𝑢 ) of coding bits and the obtained service quality. This problem
where the long-term fairness is derived by the aggregated can be modelled as a maximum sum rate optimization problem
observation of long-term small rate allocations. As a third [1]. This MSR optimization is developed to achieve the
attribute, battery life is considered for optimal resource objective of fairness of resource utilization in a heterogeneous
allocation. The utility factor under this objective is defined by network. The MSR optimization is governed for allocation of
[1] as the maximum rate of data flow achieving maximum spectral
𝑡 −𝜔𝑡
∑𝑢∈𝑈 𝜔𝑢
𝑡
𝜔𝑢𝑡𝑖𝑙 =1− 𝑡
𝑚𝑖𝑛
(6) efficiency. To achieve better service quality for the spectrum
𝑡
𝜔𝑚𝑎𝑥 −𝜔𝑚𝑖𝑛
allocation, a distribution optimization is proposed. To govern
280
quality, a cost function with distortion and rate allocation is
defined, subjected to minimization of distortion (D), subjected
to an allocation free secondary spectrum ‘R’ constraint to the
𝑡
allocation rate 𝑅𝑐 , which is given by 𝛾𝑎𝑣1 . The optimization
operation of the spectrum is defined as
min{𝐷} 𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 𝑅 ≤ 𝑅𝑐 (9)
{𝑚}
which indicates that the encoder should satisfy the minimum
distortion ’D.’
The allocation of spectrum to a user with the data rate
satisfying the instantaneous fairness utility function θt 𝑢𝑡𝑖𝑙 was
developed [1]. However, in real-time data traffic, such as video
streaming or VoIP services, the fairness is defined by the
offered BER, controlled by the allocation of data rate. In
practical usage, in the network abstraction layer (NAL), the
network operates at a different level to provide proper
allocation of resources under different data traffic conditions.
In wireless communication, the transmission channel is time-
varying and distortive in nature. For minimization of error
during signal propagation, an independent channel model is
used, deriving the bit error rate (BER) of the transmission
channel. The packet loss probability ‘𝜌’ during the transmission
of ‘L’ bits for a given BER is defined by
𝜌 = 1 − (1 − 𝑏𝑒𝑟)𝐿 (10)
𝑡
The quality utility function 𝛾𝑖𝑛𝑡 is then defined by
𝑡 −𝛾 𝑡
𝑡 𝛾𝜑 𝑚𝑖𝑛
𝛾𝑢𝑡𝑖𝑙𝜑
= 𝑡 𝑡 (11)
𝛾𝑚𝑎𝑥 −𝛾𝑚𝑖𝑛
𝑡
∑𝑢∈𝑈 𝛾𝑢𝜑
where, 𝛾𝜑𝑡 = (12)
𝑘
𝑡
𝛾𝑢𝜑 𝑡
= (𝛾𝑢𝑎 + 𝐿) (13)
𝑡 𝑡
where 𝛾𝑢𝜑 is the allocated rate with the primary data rate 𝛾𝑢𝑎
and secondary spectrum of L bits. During the transmission
process, the packet stream is divided into L-bit slices
represented as 𝑠𝑛,𝑚 . For the Tx of the mth slice in the nth frame,
the BER is defined by 𝑏𝑒𝑟𝑛,𝑚 , which is the channel BER for the
transmission, and 𝜌𝑛,𝑚 is the packet loss rate for a slice 𝑠𝑛,𝑚 .
To find the optimal bits of length ‘L,’ minimizing the packet
loss 𝜌, the optimization was subjected to min (𝜌) and max(L).
min(𝑙) ⇒ max(𝐿) (14)
To generate the data transmitting bits ‘L’ for demand service
quality, given by required BER. An optimal value of L is
derived, obtaining minimal packet loss. In the operation of rate
allocation, the fairness utility function is governed by two levels
of maximum or minimum spectral utility functions. The utility
component in this case is normalized to two levels, [0, 1]. While
this is developed with the concern of maximum or minimum
spectrum utilization, the traffic flow per node is not considered.
Data traffic on a heterogeneous node is dynamic in nature, and
the two-level normalization process is only for spectrum
utilization, wherein this is limited at the device level. The issue
arises when the nodes are highly congested due to variable data
traffic from different sources, flowing in at different data rates.
Though the optimal spectrum utilization is used, if the nodes
are blocked at the node level, the network will fail to deliver the
demanded service rate. Hence, in addition to spectrum utility
function, a device-level optimization is required. To achieve
S. S. HASHMI, S. A. SATTAR, K. SOUNDARARAJAN
this objective, a rate interference approach is proposed in
consideration of the data flow per node for the allocated
spectrum. This update in rate allocation results in higher
spectrum efficiency in consideration of the cognitive property
of the CuE. In addition to spectrum efficiency, a fairness
optimization is applied to achieve a higher service level in
Heterogeneous Networks.
B. Rate-inference optimization
While the suggested approach of rate allocation for the
fairness approach is observed to be very effective in data flow,
when applied to the data flow over a wireless channel with
multiple sources, it is observed that the rate of transmission and
the offered quality need to be optimized. In the approach of data
traffic data flow, due to remote capturing, the allocated
resources of power and spectrum will be limited. In such a case,
the proper utilization of resources and intermediate node
support is highly required to achieve greater performance. The
approach of observing for error allocation coding is simpler,and
effective for service data flow, but without control of the flow,
this allocation may not result in effective service quality at
receiving units due to the incurred latency issue. Hence, the
access control is also needed with spectrum allocation; with this
objective, a buffer-based management scheme to control the
rate of allocation was proposed. As in the proposed work, each
intermediate node is considered to be a router, and each node
encounters multiple data traffic at this node and observes heavy
congestion. To overcome this issue, buffer management is
applied. The cross-layer optimization of service stream data
traffic at the router level was proposed in [14]. The approach of
coding was introduced at the network abstraction layer (NAL),
where the buffer-based congestion control follows buffer
management and the relative quality of service (QoS) is
mapped to schedule the rate of data traffic flow. The cross-layer
approach processes the measured buffer length and derives the
packet En buffer or doping probability based on receiving data
traffic. At the Service coding layer, the communication data are
blocked into slices and passed to NAL for rate allocation. The
method computes the utility function ‘γt 𝑢𝑡𝑖𝑙 ’ as
𝑡
0; 𝜃𝑢𝑡𝑖𝑙 < γt 𝑚𝑖𝑛
𝑡
1; 𝜃𝑢𝑡𝑖𝑙 > γt 𝑚𝑎𝑥
γt 𝑢𝑡𝑖𝑙 = (15)
γt 𝑢𝑡𝑖𝑙 −γt 𝑚𝑖𝑛
𝑚𝑎𝑥𝑝 × ; 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
γt 𝑚𝑎𝑥 −γt 𝑚𝑖𝑛
{
where 𝑚𝑎𝑥𝑝 is defined as the maximum number of packets
exchanged over a node. In the approach of cross-layer
𝑡
modelling, 𝜃𝑢𝑡𝑖𝑙 is updated by 1 − 𝜙 𝑡 , where 𝜙 𝑡 is the update
applied in period t and 𝜙 is the constant value 1.001 defined as
the random exponential marking.
The update factor is occasionally updated according to the
average buffer length and the input rate and output rate of the
buffer. This approach controls the flow of data traffic by
accepting or dropping service packets based on the probability
index 𝜙 𝑡 and the importance of the packet. The factor is
incremented if the input rate exceeds the output rate and
decremented otherwise. The approach of traffic flow control at
node level is defined by the following algorithm.
OPTIMAL SPECTRUM UTILIZATION AND FLOW CONTROLLING IN HETEROGENEOUS NETWORK WITH RECONFIGURABLE DEVICES 281

illustrated in Fig. 3. The terminals are defined in a random

Algorithm: Flow control Rate Allocation manner with the topology of N terminals scattered at randomly
distributed X and Y coordinates. The terminals are defined with
Calculate the average buffer length 𝑞1 (𝑡) in period t; random resources of node powers and available spectrum.
Receive packet𝜎; The coverage region for each node is illustrated in Fig. 4. The
Calculate the utility function γt 𝑢𝑡𝑖𝑙 ; bounded region for each node is computed by the possible range
Randomize a number 𝜇; coverage of each node. The communication range of each
if (γt 𝑢𝑡𝑖𝑙 < 𝜇) terminal is defined by its protocol defined for each node, and
En buffer packet 𝜎; the terminal in this coverage range is used for the computation
else of an access link possibility.
re-traffic the packet 𝜎 with 𝑈 = 𝑎𝑟𝑔𝑖𝜖[𝐼,𝐿] 𝑚𝑖𝑛𝑈(𝑖);
TABLE I
buffer packet 𝜎; SIMULATION NETWORK PARAMETERS
End if
Where, Network parameter Values
Node distribution in the Random
𝑈𝑖 (𝑡) The important index of the i packet in the buffer in network
period t Power allocation Random
Communication protocol IEEE 802.11,
The rate allocation is defined by, LTE (4G)
Network area 200 x 200
𝑅(𝑡) + ∆𝑡 𝑖𝑓 𝜃 t 𝑢𝑡𝑖𝑙 < γt 𝑚𝑖𝑛 Number of communication 1-5
𝑅(𝑡) + (∆𝑡 − 𝑑(𝑡)) 𝑖𝑓 θt 𝑢𝑡𝑖𝑙 > γt 𝑚𝑎𝑥 terminals
𝑅𝑎𝑙𝑙𝑜𝑐 (𝑡) = Memory size / node (M) 3M
𝑅(𝑡) γmin 0.15xM
𝑅(𝑡) − , 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒. γmax 0.75xM
{ 𝑑(𝑡)
Initial blockage probability 0.1

where
𝑅𝑎𝑙𝑙𝑜𝑐 (𝑡)= allocated data rate
Nodes in Random Topology
𝑅(𝑡) = full rate 120 12
∆𝑡 = incremental data rate 8
15
22
γt 𝑚𝑖𝑛 = minimum limit of the buffer 100 30
24
γt 𝑚𝑎𝑥 = maximum limit of the buffer 28
25
2
21
80 20
27
1
17
In the above equation, the allocated data rate is varying with 60 7
18
respect to the node congestion level. If the current buffer length 6
4
3
is at the minimum level, the data will be allocated with an 29
40 9
increment of ‘∆𝑡.’ If the current buffer length in a node is in 13
19
between the minimum and maximum utility level, the allocated 16
10
20 11
data rate is governed by the traffic flow. Similarly, if the current 23
26
buffer length exceeds the maximum limit, which represents a 14
5
0
traffic flow, the allocated data rate will vary according to the 0 20 40 60 80 100 120
𝑡
offered traffic utility function 𝜃𝑢𝑡𝑖𝑙 . Fig. 3. Randomly distributed access points for a terminal density of 30

V. EXPERIMENTAL RESULTS
Network with range Circle
To evaluate the operational performance of the proposed 120 12
8
approach, a MATLAB simulation model is developed, where a 15
22
24
distributed wireless Heterogeneous network is simulated with 100 30
28
the proposed optimization attribute of the rate flow control 25
2
approach and compared with the conventional approach of 21
80 20
27
multi-attribute optimization [1] and QoS-based buffer 1
17
management [14]. For the simulation, a network is defined in 18
60 7
Table I with the following network parameters: 6
4
3
For the analysis of the proposed rate flow attribute-based 40
29
9
coding approach over the conventional multi-attribute control 13
19
approach, different networks with varying node distributions 16
10
20 11
are used. Node densities of 30 and 40 terminals are simulated, 23
26
and the obtained observations are illustrated below. 14
5
0
With the network under consideration, a network with 0 20 40 60 80 100 120
randomly distributed terminals is modelled. The randomly Fig. 4. Network with coverage regions marked
distributed network architecture used for the simulation is
282 S. S. HASHMI, S. A. SATTAR, K. SOUNDARARAJAN

Neighbour Links Network Overhead Plot

120 12 50
8 proposed Optimization scheme
15
22 45 Multi attribute optimization [1]
24
100 30 QoS buffer control scheme[14]
28 40
25
2
21 35
80 20
27
1 30
17

Overhead
18
60 7 25
6
4
3 20
29
40 9
13 15
19
16
10 10
20 11
26
23 5
14
5
0 0
0 20 40 60 80 100 120 1 1.5 2 2.5 3 3.5 4 4.5 5
iteration
Fig. 5. Network with 1-Hop neighbours
Fig. 7. Network overhead with packet forwarding
Selected route
120 12 Network Throughput Plot
8 100
15
22 proposed Optimization scheme
24 90 Multi attribute optimization [1]
100 30
28 QoS buffer control scheme[14]
25 80
2
21
80 20 70
27
1 60
17

Throughput
18
60 7 50
6
4
3 40
29
40 9
13 30
19
16
10 20
20 11
26
23 10
14
5
0 0
0 20 40 60 80 100 120 1 1.5 2 2.5 3 3.5 4 4.5 5
iteration

Fig. 6. Network with a selected path for communication Fig. 8. Network throughput with the forwarding of packets

The network with 1-hop neighbours is illustrated in Fig. 5.
Each node computes the distance of nodes with all other
terminals, and the distance below the communication range is
defined as a 1-hop neighbour for the refereeing node. In the
process of neighbour discovery, the Terminal distances falling
below the communication range are declared as direct
neighbours, and each node exchanges their one-hop neighbour
details to formulate a link network.
With the one-hop neighbour list, an AODV routing protocol
is developed to evaluate the route from a given source to the
destination. The routes are generated via the data exchange
from source to destination in a broadcasting manner. A forward
and backward tracing method is applied to obtain the route
parameters used for forwarding packets. Among the generated
routes, a path with minimum hops (i.e., the shortest path) is
selected for communication. The selected path for the
developed network is as illustrated in Fig. 6.
In the process of communication, data are forwarded along
the path selected from source to destination via intermediate
terminals. During the process of data exchange, the packets are
buffered, and based on the computed congestion level, packets
are forwarded. To transfer the packets, the per node forwarding
data rate is computed based on the congestion level, and
allocated data rate packets are released or queued in the node.
The queued packets internally build an overhead in the network.
This overhead is defined as the number of packets queued for
processing at each node. With the forwarding of packets from
source to destination at each intermediate node, packets are
buffered; the overhead observed is hence presented in Fig. 7.
Due to the rate flow attribute coding, the congestion is
controlled over a limit of buffering in contrast to buffering to a
higher level of buffer queue. Due to early control and rate flow
attribute estimation, the overhead for such a network is
observed to be minimized with the forwarding of packets.
The network throughput for the developed network is
illustrated in Fig. 8. Due to the higher data rate of packet
forwarding in the proposed approach, it is observed that more
packets are received, hence resulting in higher throughout in the
network. The throughput of these simulated systems is defined
as the number of packets generated over packets received for an
observed communication time period. The throughput is
observed to be the same for the first 1-hop forwarding, and in
such a case, the buffering is observed to be minimized; hence,
the allocated data rate is improved. However, as the amount of
packet forwarding increases, the congestion level increases,
resulting in the decrement of throughput, which is maintained
to be higher and linear in the case of rate flow attribute coding.
The observed end-to-end delay factor for the developed
system is presented in Fig. 9. The delay for the rate control
approach is higher than that of the rate flow attribute coding, as
the buffering of data at each node is minimized at the node level
and the packets are released faster. The congestion level in such
coding is developed in a rate flow attribute manner, wherein
packets are buffered in the queue based on the rate control
approach, which builds the forwarding delay for each node.
The buffered Q length for such a system is presented in Fig.
10. The Q lengths are measured as the volumes of data packets
buffered with an increase in forwarding of data packets. It is
OPTIMAL SPECTRUM UTILIZATION AND FLOW CONTROLLING IN HETEROGENEOUS NETWORK WITH RECONFIGURABLE DEVICES 283

observed that the Q length of buffering is reduced for rate flow Allocation Rate Plot
25
attribute coding due to the increment in the data rate. The proposed Optimization scheme
queuing is, however, observed to be equal in the initial Multi attribute optimization [1]
QoS buffer control scheme[14]
communication phase and gradually increases with the 20

forwarding of packets.

Allocated Data Rate (B/s)

The allocated data rate for the developed method over the 15
simulation network is as outlined in Fig. 11. The terminal is
communicated for the given data packet, and each level of
10
buffering of these terminals computes the allocable data rate for
forwarding. This forwarding results in proper control of
congestion and hence results in efficient network performance. 5

To evaluate the impact of node density, a similar observation

is made for the node density of 40 terminals. The obtained 0
1 1.5 2 2.5 3 3.5 4 4.5 5
observation for such a network is illustrated in the following iteration

observation. Fig. 11. Allocated data rate with forwarding

of packet
End to End Delay Plot
30 Nodes in Random Topology
proposed Optimization scheme 160
16 17
Multi attribute optimization [1] 32 14
25 QoS buffer control scheme[14] 140 10 26
22 21
34 35
120
8 12
20
30 9
100
36 5
delay (Sec)

11 2937
15
80
28 6
3 39
18 38
10 60 13 24
31 23
40 4 2
5 40 15
20 27
20 7 25
19 33
0
0
1
1 1.5 2 2.5 3 3.5 4 4.5 5
0 20 40 60 80 100 120 140 160
iteration
Fig. 9. Observed delay for the simulated network with a node density of 30 Fig. 12. Network topology for randomly distributed terminals with a node
density of 40
Queue Length Plot
100
proposed Optimization scheme
90 Multi attribute optimization [1]
QoS buffer control scheme[14]
80

70
Queue Length

60

50

40

30

20

10

0
1 1.5 2 2.5 3 3.5 4 4.5 5
iteration

Fig. 10. Buffered Q_length with an increase in forwarded packets Fig. 13. Marked coverage regions for each node in the network
284 S. S. HASHMI, S. A. SATTAR, K. SOUNDARARAJAN

Neighbour Links Network Throughput Plot

160
16 17 100

32 14 proposed Optimization scheme

90
140 10 26 Multi attribute optimization [1]
22 21 80
QoS buffer control scheme[14]
34 35
120
8 12 70
30 9
100
36 5 60

Throughput
11 2937
50
80
28 6
3 39 40
18 38
60 13 24 30
31 23
40 4 2 20
40 15
20 27 10
20 7 25
19 33 0
1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 6
0
1 iteration
0 20 40 60 80 100 120 140 160
Fig. 17. Network throughput for the developed network for a node density
Fig. 14. Network with 1-hop neighbour links of 40

Selected route The network throughput for this developed network is

160
16 17 observed to be improved from 30 to 52 in the case of the rate
32 14
140 10 26 flow attribute-based control approach. This is observed to be
22 21 minimized in the case of the rate control method due to the
34 35
120
8 12 higher data buffering per node.
30 9 End to End Delay Plot
100
36 5 30
11 2937 proposed Optimization scheme
Multi attribute optimization [1]
80
28 6 25 QoS buffer control scheme[14]
3 39
18 38
60 13 24 20
31 23
delay (Sec)

40 4 2
40 15 15

20 27
20 7 25 10
19 33
0
1
0 20 40 60 80 100 120 140 160 5

Fig. 15. Network with a selected route for communication

0
1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 6
iteration

The node distribution, coverage range, neighbour links and Fig. 18. End-to-end delay for the developed network
selected path for communication are as illustrated in Figures
Queue Length Plot
12-15, respectively. 100
proposed Optimization scheme
90 Multi attribute optimization [1]
QoS buffer control scheme[14]
Network Overhead Plot 80
80
proposed Optimization scheme 70
70 Multi attribute optimization [1]
Queue Length

QoS buffer control scheme[14] 60

60 50

40
50
Overhead

30
40
20

30 10

0
20 1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 6
iteration

10
Fig. 19. Observed Q-Length at the terminal for the developed network
Allocation Rate Plot
0 25
1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 6
iteration proposed Optimization scheme
Multi attribute optimization [1]
QoS buffer control scheme[14]
20
Fig. 16. Network overhead with an increase in the forwarding of packets
Allocated Data Rate (B/s)

15
The network overhead in such a case is observed to be
reduced from 122 to 71. The overhead is minimized due to the
10
existence of more terminals to exchange the data, which results
in faster data exchange. However, due to the non-optimal rate
5
control approach, the overhead is observed to be higher in the
rate control approach in comparison to the rate flow attribute
0
approach. 1 1.5 2 2.5 3 3.5
iteration
4 4.5 5 5.5 6

Fig. 20. Allocation of data rate for the developed methods

OPTIMAL SPECTRUM UTILIZATION AND FLOW CONTROLLING IN HETEROGENEOUS NETWORK WITH RECONFIGURABLE DEVICES 285

The observed delay factor is minimized from 10 to 7 for [5] A. Khandekar, N. Bhushan, J. Tingfang, V. Vanghi, “LTE-advanced:
Heterogeneous networks”, In Wireless Conference (EW), 2010
higher node density, the Q_length is decreased from 42 to 25,
European (pp. 978-982), IEEE, 2010.
and the allocable data rate is increased from 5 to 7 for the [6] W. Mansouri, K. Mnif, F. Zarai, M. S. Obaidat, “A new multi-rat
developed rate flow attribute method. The obtained scheduling algorithm for Heterogeneous wireless networks”, Journal of
observations for the delay, Q_length and allocated data rate is Systems and Software, Elsevier, 2015.
[7] F. W. Karam, T. Jensen, "On schemes for supporting QoS and mobility
presented in Figures 18-20. The observation made for a node
in heterogeneous networks." Proceedings of the 7th International
density of 40 terminals is presented in Table II. The allocated Conference on Frontiers of Information Technology. ACM, 2009.
data rate could be observed to be improvised in rate flow [8] M. Liu, Y. Teng, M. Song. "Tradeoff Analysis between Spectrum
attribute-based coding as presented in Table II. The average Efficiency and Energy Efficiency in Heterogeneous Networks (HetNets)
Using Bias Factor." Journal of Communications 10.10, 2015.
queue length is hence reduced from 29 to 19 in this case. The
[9] K. Son, E. Oh, B. Krishnamachari. "Energy-efficient design of
network throughput is observed to be increased from 13.34 to heterogeneous cellular networks from deployment to
53.36 in such case. The delay is minimized from 13 to 7 for the operation."Computer Networks vol. 78, pp. 95-106, 2015.
rate flow attribute-based control approach in comparison to the [10] G. He, S. Zhang,, Y. Chen, S. Xu, “Spectrum efficiency and energy
efficiency tradeoff for heterogeneous wireless networks”, In 2013 IEEE
rate control approach.
Wireless Communications and Networking Conference (WCNC), pp.
TABLE II
2570-2574, IEEE, 2013.
COMPARATIVE OBSERVATION OF THE THREE DEVELOPED METHODS AT A
[11] R. Q. Hu, Y. Qian, "An energy efficient and spectrum efficient wireless
NODE DENSITY OF 40
heterogeneous network framework for 5G systems." IEEE
Average Communications Magazine vol. 52.5 (2014), pp. 94-101, 2014.
Method Allocated DR Throughput Delay
Q_Length [12] J. B. Rao, A. O. Fapojuwo, "Analysis of Spectrum Efficiency and Energy
Efficiency of Heterogeneous Wireless Networks With Intra-/Inter-RAT
Multi- Offloading," IEEE Transactions on Vehicular Technology 64.7 (2015),
attribute [73 73 40 20 [4 4 9 pp. 3120-3139, 2015.
[11 11 6 3 2] [0 4 8 17 29]
optimization 13] 12 13] [13] H. Shi, J. Li, Z. Li, H. Ju. "Dynamic spectrum allocation in heterogeneous
[1] wireless networks under interference constraints across the cell
QoS coverage." Wireless Communications and Mobile Computing15, no. 7
Buffer [73 73 47 32 [4 4 7 (2015), pp. 1188-1197, 2015.
[11 11 8 5 5] [0 4 8 15 22] [14] B. Iancu, D. Vasile, A. Peculea. "A novel end-to-end QoS framework over
optimization 27] 10 11]
[14] heterogeneous networks-an architectural approach."Acta Technica
Napocensis 51.2 (2010): 42, 2010.
Proposed [15] L. Badia, M. Miozzo, M. Rossi, M. Zorzi, „Routing schemes in
[73.33 73.33 [4 4 5
approach [11 11 10 9 8] [0 4 8 13 19] heterogeneous wireless networks based on access advertisement and
66 60 53.6] 6 7]
optimization backward utilities for QoS support [Quality of Service based Routing
Algorithms for Heterogeneous Networks],“ . IEEE Communications
Magazine,45(2), pp. 67-73, 2007.
CONCLUSION [16] K. Yang, Y. Wu, H. H. Chen. "QoS-aware routing in emerging
heterogeneous wireless networks [Quality-of-Service-Based Routing
In the suggested approach, the cognitive property of devices Algorithms for Heterogeneous Networks]." IEEE Communications
is utilised for a secondary spectrum sensing operation to Magazine 45.2 (2007), pp. 74-80, 2007.
achieve a higher data rate allocation under ideal spectrum [17] F. Richter, A.. J. Fehske, P. Marsch, G.P. Fettweis, (2010, May). Traffic
availability. In the flow control approach, the buffer control demand and energy efficiency in heterogeneous cellular mobile radio
networks. In Vehicular Technology Conference (VTC 2010-Spring), 2010
mechanism is improved for the given quality of service, where IEEE 71st, pp. 1-6. IEEE.
the traffic monitoring is introduced based on the allocated data [18] G. Fodor, E. Anders, A. Tuoriniemi. "Providing quality of service in
rate and buffer status. An improvement in the network always best connected networks." IEEE Communications Magazine 41.7
operation metric of throughput is observed. (2003), pp. 154-163, 2003.
[19] G. Aristomenopoulos, T. Kastrinogiannis, Z. Li, S. Papavassiliou, (2011),
“An autonomic qos-centric architecture for integrated heterogeneous
REFERENCES wireless networks”, Mobile Networks and Applications, 16(4),pp. 490-
[1] R. Amin, J. Martin, J. Deaton, L. A. DaSilva, A. Hussien, A. Eltawil, 504, 2011.
“Balancing spectral efficiency, energy consumption, and fairness in future [20] J. C. Clement, B. B. Reddy, D. S. Emmanuel, "An Energy-Efficient
heterogeneous wireless systems with reconfigurable devices,” IEEE Cooperative Spectrum Sensing Strategy with Robustness Against Noise
Journal on Selected Areas in Communications, vol. 31(5), pp. 969-980, Uncertainty for Cognitive Radio Networks." Arabian Journal for Science
2013. DOI: 10.1109/JSAC.2013.130515 and Engineering (2015), pp. 1-7, 2015.
[2] S. K. Sharma, S. Chatzinotas, B. Ottersten. "Interference alignment for [21] Z. Dai, J. Liu, C. Wang. "QoS-based device-to-device communication
spectral coexistence of heterogeneous networks," EURASIP Journal on schemes in heterogeneous wireless networks." IET Communications 9.3
Wireless Communications and Networking , vol. 201(1), pp. 1-14, 2013. (2015), pp. 335-341, 2015.
DOI: 10.1186/1687-1499-2013-46 [22] R. Xie, F. R. Yu, H. Ji. "Dynamic resource allocation for heterogeneous
[3] S.V. Hanly, C. Liu, P. Whiting, "Capacity and stable scheduling in services in cognitive radio networks with imperfect channel
heterogeneous wireless networks." IEEE Journal on Selected Areas in sensing." IEEE Transactions on Vehicular Technology 61.2 (2012): 770-
Communications vol. 33(6), pp. 1266-1279, 2015. DOI: 780, 2012.
10.1109/JSAC.2015.2416971 [23] W. Sheikh, A. Ghafoor, “Quality-of-service routing in heterogeneous
[4] H. M. Tahir, A. H. Al-Ghushami, Z. R. Yahya, "Selection of access networks with optimal buffer and bandwidth allocation”, In2007 IEEE
network using cost function method in heterogeneous wireless International Conference on Communications (pp. 480-485) IEEE, 2007.
network." Multimedia Computing and Systems (ICMCS), 2014
International Conference on. IEEE, 2014.
 International Journal on Communications Antenna and Propagation (I.Re.C.A.P.), Vol. 7, N. 1
ISSN 2039 – 5086 February 2017

Multi Objective Coordination Approach for Resource Utilization

in Heterogeneous Cognitive Radio Network

Syed Shakeel Hashmi, Syed Abdul Sattar, K. Soundararajan

Abstract – The Heterogeneous network has the advantage of utilizing multiple wireless
architectures to exchange information over a wireless medium. In coordination with multiple
devices, long range data transmission is achieved. The advantage of multiple network utilization
has brought out the significance of higher service applications for any network device with the
advantage of using multiple networks for communication. In this network, the demand for proper
resource utilization arises due to a shift to multiple networks. As the network switches from one
network to another, and observed issues like fairness, power, spectrum utilization in the resources
are varied, which impacts the flow of data. Hence it is required to optimize the resource utilization
to achieve a fair and efficient communication. Towards achieving the objective of fairness in an
heterogeneous network with cognitive devices, a multi objective coordination approach for
optimal resource utilization is proposed. The resource utilization problem is defined by an
effective spectrum utilization among the network users. The simulation results show a significant
improvement in resource utilization compared to conventional approaches. Copyright © 2017
Praise Worthy Prize S.r.l. - All rights reserved.

Keywords: Multi Objective Coordination, Heterogeneous Network, CRN Devices, Distortion

Monitoring, Quality Governance

Nomenclature The design and implementation details of cognitive

radio terminals used to build a rapidly deployable,
CRRM Cognitive Radio Resource Management frequency-agile heterogeneous wireless network is
CR- device Cognitive Radio device presented in [2]. To carry diverse communication
SE Spectral Efficiency paradigms with different challenges, a range of cognitive
EE Energy Efficiency radio resource management CRRM schemes has been
PU Primary User recently proposed. To provide a general reconfigurable
SU Secondary User structure, a software-defined design of the CRRM is
TSU Third Party Secondar User presented in [3]. The cognitive radio devices (CR-device)
CRN Cognitive Radio Network are developed as a software defined radio unit [3] where
Offered rate a user in the network utilizes the spectrum from other
Minimum data rate active users by sensing the availability.
Maximum offered data rate Cognitive radio users have the capability to access
Network delay unused portions of the multichannel spectrum. Spectrums
Processing delay are shared to communicate data from free spectrums. The
major interference can be produced by CR as well as by
licensed users. Conventional MAC based operations are
I. Introduction gone through using common-control-channels to handle
The Heterogeneous network is an emerging network cognitive radio end users. A new Multi-objective based
for data communication in wireless domain where multi-radio, multi-channel wireless mesh network (MR-
multiple networks are integrated to form a larger MC-WMNs) framework using TDMA based MAC
network, providing long range communication with protocol to optimize the network performance, channel
groups of different wireless networks. These networks interference and access delay issues in the network is
are able to provide rapid, cost efficient and customized proposed in [4].
solutions in such a complicated communication scenario. Existing services continue to grow at impressive rates,
A brief survey of various heterogeneous wireless network thereby creating demand for access to additional
architectures and their key challenges are proposed in spectrum. Entrepreneurs are looking for spectrum to
[1]. The unique ability to alter communication protocols propose new services. At the same time, mainly “prime”
to meet changing system demands makes cognitive radio spectrum has been assigned, and it is becoming ever
suitable for wireless applications. more difficult to find spectrums that can be made

Copyright © 2017 Praise Worthy Prize S.r.l. - All rights reserved DOI: 10.15866/irecap.v7i1.11203

72
 Syed Shakeel Hashmi, Syed Abdul Sattar, K. Soundararajan
available either for new services or to expand the existing
ones. To make sure that existing services can continue to
grow and evolve to serve market place needs, and that
new services have a chance to develop, it is important
that the Commission continues to improve efficient
access to and use of the radio spectrum.
The Federal Communications Commission (FCC)
proposed the recommendations in [5] and [6] which
allowed the unlicensed device to suitably sense and
access the licensed spectrum suitably. This
recommendation motivated the study of capacity and
delay scaling laws of cognitive radio networks (CRN)
that considers the coexistence of licensed primary users
(PUs) and the Unlicensed secondary users (SUs). [7]
presents a study on the impact of mobility heterogeneity
of secondary users and static primary users in cognitive
radio network.
In CRN, the spectrum efficiency of the radio unit can
be improved by implementing the method of dynamic
spectrum access approach (DSA). The users in such
network operate as secondary users (SU), which employ
the frequency bands assigned to a primary user (PU).
This kind of spectrum utilization is standardized under
IEEE 802.22 and ECMA-392.
In the perspective of quality improvement, a joint
optimization approach of energy efficiency and spectrum
efficiency for a cognitive wireless network is proposed in
[8]. The problem of spectrum allocation is defined as a
mutual interference model of spectrum efficiency (SE)
and energy efficiency (EE) in cognitive radio networks.
In the CRN approach, the detection of Primary user (PU)
spectrum status is a prime issue.
The remaining spectrum is utilized by the secondary
users to communicate and re-allocate to the primary user
when desired. In the real time scenario, two sensing
errors may occur, the misdetection error and the false
alarm error. In the misdetection error the secondary user
detects the primary user spectrum as vacant, when
actually engaged. Whereas, in false alarm condition, the
user detects a spectrum as engaged, when the spectrum is
free. These two errors minimize the probability of
detection in CRN. The misdetection error, the result of
co-channel interference and false alarm minimizes
spectrum utilization efficiency. A similar approach in [9],
an analysis of SE to EE for CRN, was developed. This
approach has investigated the spectral and energy
efficiency in interference-tolerant CR networks. This
approach defines an additional parameter of link
information to optimize the SE-EE problem. This
approach optimizes the problem of link fading. The
primary user channel interference is considered to bound
the derived interference margin in allocating the sensed
spectrum so that cognitive secondary users (SUs) can
achieve higher spectrum efficiency while limiting their
interference in the PU network. Quality governance in
this case is observed to be high due to the interference
limit of primary user for spectrum allocation. In [10], a
frame structure is proposed for the imperfect spectrum
prediction. The Ideal state condition is used for spectrum
Copyright © 2017 Praise Worthy Prize S.r.l. - All rights reserved
73
sensing in this case. This offers a higher throughput
performance in CRN. A decentralized solution where a
scenario of coexistent heterogeneous CRNs with
collusion-based PUs is discussed in [11]. A new media
access control (MAC) protocol for cognitive Wireless
networks is described in [12] and a distributed multi
channel MAC (MMAC) protocol as enabler for CR
networks was presented in [13]. To achieve the detection
of free PU spectrum, a collision based approach,
applying the concept of Jamming, was suggested. The
effect of jamming on the network throughput was
addressed. However, the fairness metric was evaluated in
terms of network throughput and no concern was given
to the quality of the communicating data. No approach
was suggested to control the data lost in case of observed
distortion due to the propagating channel. The node
positioning in the utilization of resources for spectrum
sensing or spectrum utilization is also not directed. This
paper presents the issue of distortion monitoring and
quality governance w.r.t. spectrum allocation. The global
issue of node position in spectrum sensing is also
addressed in this paper.
To present the stated objectives, this paper is
organized as follows. Section II outlines the issue of
unfairness in a heterogeneous network. The conventional
modelling of decentralized MAC protocol for resource
allocation is presented in section III. Section IV presents
the multi objective coordination proposed approach of
multi objective coordination approach for co-existing
cognitive heterogeneous networks under quality
constraints. In Section V, the proposed solution is
evaluated with simulations and it is shown to improve
performance. Finally, conclusions are given in Section
VI.
II. Unfairness Issue in Heterogeneous
Network [11]
In heterogeneous networks, the existing unfairness is
due to two reasons such as un-coordinated PU detection
and uncoordinated spectrum unit size.
II.1. Uncoordinated PU Detection
Since PU’s utilization determines a SU’s throughput,
the PU detection ability is important for SU’s to measure
the correct PU utilization in the coexistent CRNs
scenario. Since PU utilization depends on the PU-
detection ability of SUs, the unfairness problem occurs in
case of uncoordinated PU-detection abilities between
SUs. The uncoordinated PU-detection ability condition
occurs in coexistent heterogeneous CRNs cases. Thus,
the iniquity of the uncoordinated PU-detection ability
plays a significant role in the assumptive scenario. If it is
assumed that there are two secondary users such as SU1
and SU2 along with a single primary user PU, the
unfairness problem arises if any one of the secondary
users doesn’t have the PU detection ability. For a given
SU1 and SU2, in absence of PU, the channel will be
Int. Journal on Communications Antenna and Propagation, Vol. 7, N. 1
 Syed Shakeel Hashmi, Syed Abdul Sattar, K. Soundararajan
occupied by SU1 whereas SU2 also tries to occupy it.
But due to the non-existence of PU detection ability, it
cannot occupy resulting in unfairness in the throughput
of SU2. In [11], this unfairness problem due to
uncoordinated PU detection is solved through a MAC
layer approach which improves the performance of PU
detection. The main objective of [11] is to identify if the
user who occupies a busy channel belongs to a PU or a
SU from another CRN using a low-overhead mechanism.
It is an assistant function to improve the PU-detection
ability to achieve a better Dynamic Frequency Selection
(DFS) decision.
II.2. Uncoordinated Spectrum Unit Size
The uncoordinated spectrum unit size unfairness
problem is due to the different competitive advantages
between SUs who use the listen-before-transmit strategy
with different spectrum unit sizes, i.e., per-channel
bandwidth. A system that contains a smaller spectrum
unit size has a greater competitive advantage than a
system that contains a larger spectrum unit size.If it is
assumed that there are two secondary users SU1 and
SU2, and their spectrum unit sizes as 1 and 3. Therefore,
for a given traffic, the SU1 can use all the channels
individually, whereas the SU2 has to use three successive
channels at full capacity. During the competition for
channel sharing, the SU2 needs to wait until the three
successive channels get free. But, for SU1, there is no
need to wait; this creates unfairness due to the
uncoordinated spectrum unit size. To address this
unfairness problem, i.e., the uncoordinated spectrum unit
size, a self-blocking mechanism is suggested in [15] to
combine with an SU’s channel access strategy.
III. Decentralized MAC Protocol
In [11], a decentralized MAC approach was proposed
to solve the coexistence problem of heterogeneous
CRNs. This problem is caused in a distributed framework
of CRNs without a centralized component to negotiate
spectrum usages with one another. The system
characteristics of these heterogeneous networks are
different; thus, the fairness issue between CR users will
be raise. To cope up with these problems, a spectrum
underlay model was proposed along with DFS operation.
In [11], SUs from different CRNs are assumed to have
different PU-detection abilities and spectrum unit sizes.
To avoid ambiguity, the CR users employed in the
proposed MAC approach are called SUs, whereas other
users from other CRNs are called third-party SUs
(TSUs).TheTSU group is an aggregate group of SUs that
do not belong to the SU group; thus, users in different
systems. Both the SUs and TSUs are modelled here to
improve spectrum efficiency by solving the unfairness
problems along with the reduction of harmful
interference for PU. Since the first unfairness problem is
due to a lack of PU detection ability for SU’s hardware
capacity, a MAC-layer approach that uses a jamming-
Copyright © 2017 Praise Worthy Prize S.r.l. - All rights reserved
74
based PU-detection mechanism,which is called a
“probing function,” is employed to enhance SUs
abilities.The probing function is a PU-detection
mechanism on the MAC layer without additional
hardware support. It combines with a self-blocking
mechanism for the uncoordinated spectrum unit size
problem.The concept of probing is a trial-and-error
mechanism that uses jamming to identify the user who
occupies a channel illustrated in Fig. 1.
Fig. 1. Probing functioning
If a SU does not know that a channel is occupied by a
PU or a TSU, it jams the channel and observes the user
behaviour for a period of time. At the beginning of the
probing function, a SU jams the traffic on the channel.
After the traffic is jammed, a SU monitors the channel
condition for a period to distinguish the user type of
traffic. As a result, the user type information can be
referred to as the SU’s PU-detection ability in a MAC
layer. Meanwhile, the jamming mechanism can be used
for adapting the competing advantage between the users
who experience unfairness problems concerning the
spectrum unit size. The prerequisite of the probing
function is that the PU and the TSU have different
reactions to a loss event. By the concept of CR
technology, SUs have less transmission priority than
PUs. To avoid the reactive PU problem, the SU should
wait a longer period before retransmission than the PU.
As a consequence, the TSU retransmission period must
be longer than that of a PU for providing higher channel
access priority to a PU. SUs are assumed to know a PU’s
MAC protocol for his/her licensed- band qualification;
the longest period before retransmission should be fixed
and well known.
Due to the jamming, there may be the possibility of a
reduction in PU throughput and also there is a chance in
the occurrence of external interference for PU. In order to
prevent the PU from experiencing harmful interference,
the proposed probing function combines a self-blocking
mechanism; a probing function jams the channel at some
probability of p, where 0 < p <1, p is defined as the
jamming rate in the following paragraph. A SU can
Int. Journal on Communications Antenna and Propagation, Vol. 7, N. 1
 Syed Shakeel Hashmi, Syed Abdul Sattar, K. Soundararajan
control the interference level to a PU from jamming, and
it can improve the PU detection ability via the self-
blocking probing function. The key to implement the
probing function is to find the appropriate p. To deal with
the second unfairness problem of uncoordinated
spectrum unit size, p must be modified. However,
modelling an MC that contains multiple-channel and
multiple-system states with different spectrum unit sizes
is inefficient. Thus, the following equation is used for
translating jamming rate for simplification purposes:
1 − (1 − ) =
where indicates the jamming rate of the system with a
spectrum unit size is equal to n.
IV. Multi Objective Distribution
Function Approach
Cognitive devices were limited to PU and SU.
Recently, it was proposed that the higher spectrum can be
utilized by introducing TSUs from other regions. This
provision builts up the jamming conditions which
introduces delay in the network. In the proposed
approach, the SQL is monitored through delay for the
effective utilization of the TSU.
If the channel is found to be occupied after conducting
a sensing operation, a backoff in time is initiated.
However, if the channel is occupied in repeatedly sensing
operations, then the backoff is also linearly incremented.
On the other hand, if the channel is found to be
‘available’ the next time instance is utilized for
transmission and time resolution is backed-off by unity.
This is a conservative approach since the highest priority
is placed on maintaining the interference to a minimum
level while trying to improve the other performance
metrics. To simplify simulation and analysis, the most
common service quality measure was applied to our
model. In this case, service quality is measured by the
number of packets in unit time. In a given network, ra is
defined as the arrival rate of packets. The value of SQL is
relative to data rate. When the SQL of the packet is not
larger than the offered rate lm, it can be carried out as
follows:
= ( − )
=( − )×
Here, la is the SQL of packet with the allocated rate ra,
e is the proportional coefficient of data rate. rmin is the
minimum data rate used in simulations and rm is the
allocated rate corresponding to lm. When the SQL is
higher than lm, the additional SQL of the service can be
expressed as:
=( − )/( − )
∆ =( − )×
Copyright © 2017 Praise Worthy Prize S.r.l. - All rights reserved
Here, rmax is the maximum offered data rate and ∆ is
the data rate allocation step related to the jamming rate.
Once the data exchange is implemented successfully, the
performance of the application is not basically affected
by its offered services.
The backoff delay arises when more than two nodes
compete for the spectrum resource. This delay will
depend on the number of competing nodes on each
spectrum band. Thus, during spectrum characterization,
the number of SUs in a distributed CRN is important to
estimate the switching delay.
(1) Here, the number of packets for transmission is used
to measure the impact of service on QoS. The packet
delay Ta as well as the data delay per packet , can be
denoted as follows:
= × + (6)
= × = × × (7)
1
Here, the parameter c is the proportional coefficient, d
is a constant that is determined by network status. ×
is the time of packet delivery in one unit (how many
packets for exchange were sent in one unit). At last, the
end-to-end delay can be obtained by:
=( + )/(1 − × ) (8)
where, is the network delay and is the processing
delay i.e. encoding and decoding time that will be
constant. Then can be controlled by i.e. the
spectrum available to a user from its own as well as from
SU and TSU can not be utilized totally if is
increasing due to jamming. To observe the impact of the
exchange process over the transmission operation, an
analysis of the data exchange process of transmission and
reception is proposed.
It is well known that data services can influence SQL
metrics, such as end-to-end delay, call dropping
probability and throughput of communication. In this
paper, the end-to-end delay is approximately taken as
SQL because it is the most important among various
SQL factors. The end-to-end delay is defined as the time
(2) for a packet to be sent from one end to the other. If both
encoding and quality encoding are applied, the time
(3) delay T can be written as:
= + + (9)
In practical application, spectrum sensing is used as a
general way to protect network resources by rejecting
unauthorized spectrum allocation. It is necessary to take
over both quality and throughput techniques at relative
high SQL. lm is defined as the minimal SQL where the
(4) encoding algorithm is deployed. The SQL below lm is
mainly determined by encoding, while the additional
(5) SQL above lm is obtained from the minimum SQL
Int. Journal on Communications Antenna and Propagation, Vol. 7, N. 1
75
 Syed Shakeel Hashmi, Syed Abdul Sattar, K. Soundararajan

between encoding and decoding. This is because both each hope, the node dissipates power based on the IEEE
backoff and encoding can influence the service level, and 802.11 standards for receiving, transmitting, and ideal
weak service from either sides can degrade the SQL conditions. For the developed communication, the
performance. By this means, the final SQL L can be obtained parametric observations are as illustrated in the
expressed as: following figures.
The average throughput for the developed system is
≤ shown in Fig. 3. The average throughput for the proposed
= (10)
+ min(∆ ) > approach of service governed at device nodes results in a
higher throughput as they are communicated with
where, ∆ is the additional increment of rate allocation. minimal delay rate. It was observed that the throughput
for the linear network with energy conservation is also
improved. However, with the increase of number of
V. Experimental Results communication iterations, it was observed that
throughput decrease is due to a congestion of nodes and
For the evaluation of the proposed approach, the
time taken to release the packet. However, the throughput
network parameters used for the simulation are given in
is comparatively observed to improve in case of proposed
Table I.
MDF approach.
TABLE I
NETWORK PARAMETERS USED FOR SIMULATION 140
Linear Network(LT)
Network parameter Characteristic
Random
Node density (Nd) 30,50 120 MAC

Average Network throughput(Bytes/sec)

MDF(proposed)
Network Area Nd × Nd
Communication range 80 Units 100
Mobility Non-static
Topology Random
MAC 802.11 80
Power model IEEE 802.11-NIC card
60
The Network is defined for a randomly distributed
node, comprising nodes with a power conservation unit. 40
The operational time period and data exchange times are
set as of IEEE 802.11 standards [16]. The observations 20
made for the proposed approaches are illustrated below. 1 1.5 2 2.5 3 3.5
Iterations
4 4.5 5 5.5 6

The randomly scattered network topology for

simulation is shown in Fig. 2. Fig. 3. Average throughput with communication iteration

Randomly distributed Network

30 8 The observed network lifetime, for the simulated
18
12
30 network is observed to be improved with the increase in
17
25 5 communication iteration, using the proposed MDF
6
20
21
approach, as shown in Fig. 4.
9
20 25
24
19
Y-Cordinates

15 1200
16 Linear Network(LT)
15 7
27 Random
26
13 1000 MAC
14 MDF(proposed)
10 2
29
11
Network Lifetime (sec)

22 800
28
5 4
3
10
1 600
23
0
0 5 10 15 20 25 30
X-Cordinates 400

Fig. 2. Random scattered Network topology 200

Each node is randomly placed in a network area of

0
30×30, with the number of nodes set as 30. Each node in 1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 6
Iterations
the network is defined by its ID, geographical
coordinates (x and y coordinates) and a randomly defined
Fig. 4. Network lifetime over communication period
power level at each node. These nodes process the
routing protocol and select the optimal route for data The lifetime is computed as the number of nodes
communication using the Multi hoping approach. At retained in the network in active paths for data exchange.

Copyright © 2017 Praise Worthy Prize S.r.l. - All rights reserved Int. Journal on Communications Antenna and Propagation, Vol. 7, N. 1

76
 Syed Shakeel Hashmi, Syed Abdul Sattar, K. Soundararajan

It is observed that the network lifetime is increased by simulated network are presented below. For the
the incorporation of energy conservation at node level. simulation, a network with a node density of 50 nodes is
Power at each node is measured and it is observed shown in Fig. 7. The scattering of nodes in such network
from Fig. 5 that, with the increase in the communication can be seen. Due to higher density, the nodes are very
time period, the power level in each node is minimized close to each other. This leads to more route probability
due to energy dissipation during transmission and and more reliability. However, as the number of nodes is
reception operation. However, due to the incorporation of more, the probability of nodes participating in the data
the conservation approach to the developed network, it is forwarding process also increases, resulting in faster
observed that the power level for active nodes is power drain.
increased. This improvement is higher in the proposed The average throughput w.r.t. variation in node
MDF approach. The Network overhead is observed to be density is observed. It is seen from Fig. 8 that the
minimized in case of the topology preserved with energy throughput for the developed approach is improvised
conservation, as shown in Fig. 6. The concept of energy with an increase in node density. The average node
conservation makes more nodes available in the network, density available for the routing in such case increases
which results in higher throughput. Due to more traffic and due to faster processing and rescheduled
clearance the overhead is observed to be less in the conservation, nodes are processed for higher data
proposed approach. transfer. As the data transfer is higher in such network
the observed quality and the network reliability increases.
100
Linear Network(LT)
Randomly distributed Network
Random 50
32 41
95 MAC 2
5 21
MDF(proposed) 45 20
24 49
9 29
90 40 32 23
7 21
15 16 37
10 1 45
Power (mW)

35 29 28
13 3
18 18
85 4417 6 24 40
30 181112 34
Y-Cordinates

1 19 39 22
291 3635 3014
25 2226 7 35
80 40 28 6
38 39
13 47 14 10
33 20
20 1916 2 31
8 16 11 5
27
10 469 37
26 146
75 15 5 25 12 3 9 15 22 25
1 833 4 258 5 4 4
3 11 8 14 21 1711 19 10 26 13
10 8
15
3 5 2 6 28 2 43 42 31
70
1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 6 5 1 2797 13 30
20
12 24 27
4
16 9 30 3 19
6 18
7 47 17
23 2 50 38
Iterations
0 10 12 15 2023
17 48 36 34
0 5 10 15 20 25 30 35 40 45 50
X-Cordinates
Fig. 5. Power level with communication iteration

13 Fig. 7. A randomly scattered network topology

Linear Network(LT) with Node density of 50 nodes
12 Random
MAC
11 140
MDF(proposed)
Linear Network(LT)
10 130 Random
MAC
Average Network throughput(Bytes/sec)

9 120
MDF(proposed)
Overhead

8 110

7 100

6 90

5 80

4 70

3 60
1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 6
Iterations 50

40
Fig. 6. Network overhead over communication iteration 10 15 20 25 30 35 40 45 50
Node Density

The effect of node density on network performance is

Fig. 8. Average throughput with variant in node density
also evaluated for the simulation model. The variation in
node density by increasing the number of nodes from 30 The network life time is observed to improve in such
to 50 in the network is evaluated. cases as shown in Fig. 9. As the number of nodes is
For the evaluation of variation in node density and its higher, the network sustain increases. In addition, due to
impact over network parameter, node density varies from energy conservation, power is refreshed in a particular
30 to 50. The evaluation parameters observed in the interval.

Copyright © 2017 Praise Worthy Prize S.r.l. - All rights reserved Int. Journal on Communications Antenna and Propagation, Vol. 7, N. 1

77
 Syed Shakeel Hashmi, Syed Abdul Sattar, K. Soundararajan

These features increase the power per node in the improved. In the case of MDF driven power scheduling
network, hence resulting in a longer life time compared approach with energy conservation, the nodes are
to the observation for network life time for fixed node scheduled for sleep and wakeup period, as well the
density, as shown in Fig. 3, this network lifetime gets master node keeps the energy refreshment, which results
increased; due to a large number of nodes, it remains at a in higher power in the network, as observed in Fig. 10.
higher energy level. The Network overhead in such case is observed (in
Fig. 11) to be optimized in case of the topology
800
preserved with energy conservation. The overhead in
Linear Network(LT)
Random such case is reduced, due to a faster data release, due to
700
MAC the availability of more nodes for data exchange
MDF(proposed)
600 compared to its conventional counterparts.
Network Lifetime (sec)

500
VI. Conclusion
400
This paper outlines a Multi Objective distribution
300 Function approach to achieve the objective of fairness in
heterogeneous networks with cognitive radio devices.
200 The network is outlined with different devices of
spectrum sensing with primary users and secondary
100
10 15 20 25 30 35 40 45 50 users. To optimize the free spectrum utilization, a TSU
Node Density
user is defined, which is used to sense free spectrum
from other standing free users from other network
Fig. 9. Network Lifetime over node density
clusters. The objective of spectrum sensing is served via
100 multiple attributes monitoring, and fairness is measured
Linear Network(LT)
Random
in terms of offered service quality with higher
MAC throughput. The offered service quality is observed in
95
MDF(proposed)
terms of service quality level, measured as a parametric
value for the offered service in heterogeneous network.
90 The suggested approach defines the allocation rate
Power (mW)

based on the delay observed and the minimum and

85
maximum offered service level. The system is in
dynamic service level where the nodes would run for
multiple services in one communication cycle, therefore
80 the algorithm becomes a recurrent model. This would
result in processing overhead, which should be explored
75
in the future.
10 15 20 25 30 35 40 45 50
Node Density

References
Fig. 10. Power in the network over Node density
[1] Khan, Muhammad Asad, Supeng Leng, Wang Xiang, and Kun
13
Yang. "Architecture of heterogeneous wireless access networks: A
Linear Network(LT) short survey." In TENCON 2015-2015 IEEE Region 10
12
Random
Conference, IEEE, 2015 Pages 1-6.
11 MAC
MDF(proposed)
DOI: 10.1109/TENCON.2015.7372905
10 [2] Yahia Tachwali, Fadi Basma, and Hazem H. Refai, “Cognitive
Radio Architecture for Rapidly Deployable Heterogeneous
9 Wireless Networks” IEEE Transactions on Consumer Electronics,
Overhead

8
Vol. 56, (Issue 3), August 2010.
DOI: 10.1109/TCE.2010.5606279
7 [3] Shao-Yu Lien, Kwang-Cheng Chen, Yonghua Lin,” Cognitive
6
Radio Resource Management For Future Cellular Networks”.
IEEE Wireless Communication. February 2014. Pages 70-79.
5 DOI: 10.1109/MWC.2014.6757899
4
[4] Anusha, M., Srikanth, V., An Efficient Mac Protocol for
Reducing Channel Interference and Access Delay in Cognitive
3 Radio Wireless Mesh Networks, (2016) International Journal on
10 15 20 25 30 35 40 45 50
Node Density Communications Antenna and Propagation (IRECAP), 6 (1), pp.
14-18.
DOI: 10.15866/irecap.v6i1.7891
Fig. 11. Network overhead with variation in Node density [5] Force, FCC Spectrum Policy Task. "Report of the spectrum
efficiency working group." 2002.
The power consumption of such networks will be https://transition.fcc.gov/sptf/files/SEWGFinalReport_1.pdf
lowered and hence the conserved power per node is [6] “Cognitive radio technologies proceedings” Washington, DC,
USA. No. 03-108. https://www.fcc.gov/oet/cognitiveradio

Copyright © 2017 Praise Worthy Prize S.r.l. - All rights reserved Int. Journal on Communications Antenna and Propagation, Vol. 7, N. 1

78
 Syed Shakeel Hashmi, Syed Abdul Sattar, K. Soundararajan

[7] Yi Qin Ying Zhe et al. “ Near optimal scheme for cognitive radio Dr. Syed Abdul Sattar received his B.E Degree
networks with heterogeneous mobile secondary users”. IEEE in Electronics & Telecommunication
Transactions on Communications, vol 63, (Issue 4), April 2015. Engineering from, B.A.M. University
Pages 1106-1120. Aurangabad, India in 1990. He has obtained M.
DOI: 10.1109/TCOMM.2015.2402055 Tech. in DSCE from JNTU Hyderabad, in 2002,
[8] Shaowei Wang, Chonggang Wang., “Joint optimization of and did his first Ph.D. from Golden State
spectrum and energy efficiency in cognitive radio networks”, University, USA, with Computer Science in
Digital Communications and Networks, vol 1,(issue3) August 2004, and a second Ph.D. from JNTU
2015, Pages 161–170. Hyderabad, India with ECE in 2007. He is currently working as Prof &
10.1016/j.dcan.2015.09.004 Director R&D- NSAKCET, Hyderabad- India. His area of
[9] Fourat Haider, Cheng-Xiang Wang, Harald Haas, ErolHepsaydir, specialization is a wireless communications and image Processing.
XiaohuGe, and Dongfeng Yuan, “Spectral and Energy Efficiency
Analysis for Cognitive Radio Networks”, IEEE Transactions on Dr. K. Soundararajan obtained his engineering
Wireless Communications, Vol. 14, (Issue 6), February 2015, degree from SVU Tirupati and Masters from
pages-2969-2980. JNTU and PhD from IIT Roorkee. He is a
DOI: 10.1109/TWC.2015.2398864 distinguished Professor of ECE with Three
[10] Jian Yang, and Hangsheng Zhao, “Enhanced Throughput of decades of teaching and Research experience,
Cognitive Radio Networks by Imperfect Spectrum Prediction”, including two decades of Senior Professor /
IEEE Communications Letters, Vol. 19,( Issue 10), October 2015 Executive, experience as HOD, Principal, and
Pages 1738-1741. Rector at JNTU Anantapur. Currently he is
DOI: 10.1109/LCOMM.2015.2442571 working as Prof & Dean R&D in Teegala Krishna Reddy Engineering
[11] Yu-Chun Cheng, Eric HsiaokuangWu, and Gen-Huey Chen, “A College Hyderabad India.
Decentralized MAC Protocol for Unfairness Problems in
Coexistent Heterogeneous Cognitive Radio Networks
ScenariosWith Collision-Based Primary Users”, IEEE Systems
Journal, VOL. 10,(Issue 1), March 2016. Pages 346-357
DOI: 10.1109/JSYST.2015.2431715
[12] S. Hu, Y.-D. Yao, and Z. Yang, “MAC protocol identification
using support vector machines for cognitive radio networks,”
IEEE Wireless Commun.,vol. 21, (Issue. 1), Feb. 2014 Pages 52–
60.
DOI: 10.1109/MWC.2014.6757897
[13] M. Timmers, S. Pollin, A. Dejonghe, L. Van der Perre, and F.
Catthoor, “A distributed multichannel MAC protocol for multihop
cognitive radio networks,”IEEE Trans. Veh. Technol., vol.
59,(Issue 1), Jan. 2010, Pages 446–459.
DOI: 10.1109/TVT.2009.2029552
[14] C. Luo, F. R. Yu, H. Ji, and V. C. M. Leung, “Cross-layer design
for TCPperformance improvement in cognitive radio networks,”
IEEE Trans. Veh.Technol., vol. 59, (Issue 5), June 2010, Pages
2485–2495.
DOI: 10.1109/TVT.2010.2041802
[15] X. Yiping, R. Chandramouli, S. Mangold, and N. Sai Shankar,
“Dynamic spectrum access in open spectrum wireless networks,”
IEEE J. Sel. AreasCommun., vol. 24,(Issue 3), Mar 2006 Pages
626–637.
DOI: 10.1109/JSAC.2005.862415
[16] Wireless LAN Medium Access Control (MAC) and Physical
Layer (PHY) Specification, IEEE 802.11, 1999. http://www.di-
srv.unisa.it/~vitsca/RC-0809I/IEEE-802-11.pdf

Authors’ information
Syed Shakeel Hashmi received his B.E. Degree
in Electronics & Telecommunication
Engineering from, B.A.M. University
Aurangabad, India in 1999. He has obtained
M.E. in Electronics & Communication
Engineering from, Osmania University,
Hyderabad, India in 2006. He is pursuing PhD
from JNTU Anantapur. He is currently working
as assistant professor in the dept. of Electronics and Communication
Engineering at ITS, ICFAI Foundation for Higher Education (A
Deemed University) Hyderabad India. He is a member of IEEE. His
areas of interest are Wireless Communication, Heterogeneous wireless
networks and signal Processing.

Copyright © 2017 Praise Worthy Prize S.r.l. - All rights reserved Int. Journal on Communications Antenna and Propagation, Vol. 7, N. 1

79
 Link Cost Optimization for Traffic Controlling in Heterogeneous
Network
Syed Shakeel Hashmi Dr. Syed Abdul Sattar
hashmi@ifheindia.org syedabdulsattar1965@gmail.com
Abstract: Due to the nature of various types of
end-to-end mobile devices in heterogeneous
network, congestion was one of the main
problems in heterogeneous networks. This paper
proposes a congestion aware routing approach
based on the evaluation of weight value as a link
cost index. The link cost evaluation considers the
evaluation of buffer delay, data rate, MAC
overhead and link quality. This approach uses a
multipath routing approach which discovers
multiple disjoint routes from a source to
destination having heterogeneity between each
other. Among the discovered routes, the route
with minimum cost index is selected, which is
based on the node weight of all the in-network
nodes from the source node to the destination
node. By simulation results, the proposed
approach has proved that it attains high packet
delivery ratio, low routing overhead and also
low end-to-end delay.
Keywords: Heterogeneous network, congestion,
packet delivery ratio, routing overhead, End-to-
End delay.
I.INTRODUCTION
Heterogeneous network are formulated by a set of
nodes, which are dynamic in nature and formulated
by a group of nodes, communicating over a
common wireless medium. Such networks are
characterized by dynamic networks, have variable
link capacity with constraint security and resources.
Routing in Heterogeneous networks is analyzed
from a long time. In recent years, various routing
protocol for such network have been proposed [1-
4].In such approaches the method is developed
under the assumption of nodes with homogeneous
property. The homogenous property is defined by a
common value been shared among all nodes in the
network.
However heterogeneous network suffers with
network dynamicity, such as, with the variation in
node density, the performance is highly effected.
In the applications of such network in real time
application, the nodes are basically observed to
have heterogeneity property. In various real time
applications [5-7], the nodes characteristic are
variable with respect to their position, and
utilization. For example, in the battlefield area,
where the solider carries a portable unit, large units
are carries by heavy mobile units, such as vehicle,
tank etc. In such scenario the portable devices are
low resource in terms of power, processing
capacity, transmission rate etc. Wherein in the
978-1-4799-6908-1/15/$31.00 ©2015 IEEE
Dr. K. Soundararajan
principal.kpes@gmail.com
same filed, the large units having high power
transmission, and resource utilization are also
present. Hence, they formulate a heterogeneous
network, which is a integration of multiple
resources at one area. In such network, the basic
problem of communication resources, leads to
heavy traffic congestion, which highly impact the
network performance. The reliability of such
network for communication gets minimized. Hence
to achieve a reliable communication in such
networks.
This paper proposes a congestion aware routing
approach by considering the parameters of
allocated data rate, MAC overhead and delay, by
defining a link quality metric in heterogeneous
network. On considering these parameters, a weight
for a given link is evaluated. Using the weight
factor then routes are derived. The route with
lowest minimum cost is considered for
communication. To present the stated approach this
paper is outlined in 6 sections. Wherein section 2
outlines the conventional approaches of the related
works. Section 3 present the conventional approach
of congestion aware routing. The proposed
approach of link weight based routing is defined in
section 4. Section 5 presents the obtained
simulation observations for the proposed work. The
concluding remarks are presented in section 6.
II. RELATED WORK
Congestion in Heterogeneous networks leads to
transmission Issues, developing delay and packet
loss in heterogeneous environment. The issue of
congestion leads to resource wastage in such
network. By the introduction of routing protocols
which are dynamic with respect to congestion, can
greatly improve the network performance. The
increase in data overhead and, due to issues with
multiple devices having variant characteristic, the
performance is degraded. This is predominant in
the case of mobile users in heterogeneous network.
The mobility concern was referred in past and
various approaches were developed to overcome it.
In [1] smart personal information system (smart
PIN), was proposed. This network uses a
performance over cost to exchange information’s
among users to exchange the data adaptively, using
the network characteristic and users requirements.
In [2] towards a resource monitoring approach, a
battery lifetime optimization using route selection
approaches. In this approach, a vertical handoff
decision was proposed to optimize the offered load
to each node attached to the network. The
integration of various nodes in such network uses
different routing approaches and protocol to define
route selection and load balancing in heterogeneous
network. A stream control transmission protocol
(SCTP) was defined for such network. In [3] a
traffic control protocol based on SCTP was
developed. The protocol was defined for real
network under wired/wireless environment. This
approach improves the throughput factor and jitter
minimization for UDP and TCP communication.
Towards higher throughput achievement WI-FI
based mesh network were used. This approach
provides an approach for providing communication
in wide area network in communities or city
regions. However, the isolation of nodes are the
major obstacles in such application. To achieve this
objective in [4], heterogeneous wireless network
architecture, consisting of Wi-Fi and Wi-MAX was
proposed. In this approach, the network first
constructs an analysis over the existing
heterogeneous nodes. It then integrates the Wi-Fi
and Wi-MAX network to provide a seamless
connectivity. Traditional TCP interprets the packet
loss due to congestion, which results in reducing
the offered traffic rate in TCP communication.
However in the heterogeneous network, this
problem could be overcome, due to the higher rate
availability of multiple units. In [5], a new variant
of TCP Vegas was proposed named Red Vegas. In
Red Vegas the marking of packet at the routers
indicate the traffic load offered and the current
congestion level in the network. On the monitoring
of congestion by the Red Vegas, the traffic is
routed or controlled by the control mechanism to
achieve higher delivery rate in such network. While
using devices for long range communication, such
as the satellite mode communication, long range
propagation delay affects the performance of TCP
in heterogeneous condition. In [6], for long range
communication devices, a modified TCP was
proposed by an adaptive delay and loss response
(TCp-ADaLR) to minimize the effect of such long
range communication. In this approach a adaptive
window and loss recovery mechanism was
proposed to minimize, the TCP performance in
satellite networks. In [4] to optimize the
communication process, a parallel method for
estimating network performance by a set of cluster
approach is proposed. This method at any data
exchange period and any computational or
communication time can predict the
communication delay between any pair of nodes, in
the load conditions, set for specific network model.
Generally available tools that are used for different
applications for heterogeneous modeling and
monitoring are in greater requirement to increase
the number of efficient heterogeneous computing
systems. Open MPI [9] is an implementation tool
used for such application, through a single open
source providing support for a number of
heterogeneity aspects preserving the efficient use
uniform heterogeneous resources. In [10], a simple
protocol was proposed for building a peer-to-peer
(P2P) network. This process joins the processing
and rebuilding process. The basic approach of
combining process is, load balancing and
connection appropriate selecting, to achieve a
random walk for neighbors selection to help
newcomers in P2P network. The Re-processing
approach defines the process under loss of
connections to nodes. In particular the process is
defined as a probabilistic- rebuilding schemes
examining two, adaptive rebuilding schemes. This
approach also presented a detailed analysis of P2P
to investigate under heterogeneous environment. In
[11] with routing a QoS factor is also considered.
The approach defines a QoS aware overlay
construction approach called OCals, for layered
streaming in heterogeneous network. The main
approach and the contribution is achieved by; 1)
under the neighbors selection, with the availability
of network condition, providing node considering
all layers; 2) Ocals maintain the QoS factor and
also enhances existing QoS overlay to a new node.
The ease of implementation and low time factor
gives significances usage of this protocol. In such
approach in [12] Universal Plug and Play (UPnP)
architecture was proposed. This architecture uses
six different phases of operation, dividing the
communication session and services. UPnP was
observed as a friendly interface with users.
However this approach is mainly designed for
wired environment, a feasibility of such protocol
for wireless environment and Heterogeneous is yet
to develop. These approaches are the basic methods
for congestion monitored routing in heterogeneous
network. In these aspects in recent past a
congestion aware routing for heterogeneous
network was presented in [16].
III. CONGESTION AWARE ROUTING
MECHANISM [16]
This approach is based on the link data rate
considering MAC overhead for selection of optimal
routing, under different link data rates. The MAC
overhead and link data rates were used to develop
an efficient congestion aware routing approach. For
the evaluation of link data rates and MAC overhead
the following approach were used:
A. Mismatched Link data rates
In Heterogeneous mobile network, the offered
throughput is constrained by the overall data-rate
offered for the entire available links.

. TMACmin is variable, and if congestion is not
Fig.1. An example of heterogeneous network.
Consider a link between two nodes operating with
different operating systems in the above figure, a
route that does not match the data rate in a route is
termed as, Mismatched Data-rate route (MDRR).
When high traffic application, such as multimedia,
are exchanged over such routes, the advantage of
multi-rate links is diminished. The MDRR route
has the potential for a connection observing
congestion at any node with previous connections
to the slower data rate due to its previously high
data rate nodes. The lower traffic routing results in
long queue, giving higher end-to-end delay. This
protocol computes the latency so as to handle
congestion to selecting paths offering higher data
rate nodes.
B. MAC Overhead
In this approach, the Distributed coordination
function of 802.11 [17], the MAC (DCF was
considered. In this approach the network follows a
standard sequence of packets namely: request-to-
send (RTS), clear-to-send (CTS), and the data
acknowledgment (ACK). The time between
receiving a packet and the next transmission, is
termed as, short inter frame space (SIFS). Hence in
such network, Due to minimum channel occupation
by MAC overhead is defined by,
TMACmin = TRTS + TCTS + 3TS1FS (1)
Where TRTS and TCTS are the time period for a RTS
and CTS respectively, and TSIFS is the time period
for SIFS. The time period for acknowledgment is
not considered. If the channel contention is
considered for the occupation of channel, the MAC
overhead due channel occupation is then given as;
TMACall = TMACmin + Tcgs (2)
whereTcgs (including NAV waiting and back-off
intervals) is defined as the taken time for
contention and re-transmission process. For a
communication, let the delay between nodes i and j
(i, j) be defined as the interval between the nodes
initializing the RTS transmission from i to j and
correctly receiving at the node j. For such case, the
Channel delay is given by
Ti,j = TMACmin + Tdata (3)
whereTdata = Ldata / Ri,j is the data transmission
time for a data length Ldata and Ri,j is allocated data
rate of the link.
The offered MAC overhead dependents on the
contention for the shared medium and the number
of that packet collision. The offered overhead is
observed to be relative for a specific node. Under
minimum access contention, the delay is observed
to be a constant, given as TMACmin + Tdata as given
by (1) and (3). When the channel access
contention or packet retransmissions are included,
controlled. MAC overhead increases and the
capacity of data exchange decrease significantly.
IV. PROPOSED APPROACH
A. Link cost metric evaluation
In this paper, a congestion aware routing protocol
using the routing metrics is been developed. The
quality metric of data-rate, MAC overhead, queue
delay, link quality is considered, giving more
preference to routes with low congestion and high
throughput. This utilization improves the channel
utilization in heterogeneous network. An
aggregated weight for the selected route is
evaluated. An on demand routing protocol to derive
the possible path from a source to destination is
developed. These routes are processed for link cost
index, which is defined as a function of link weight
of all the nodes in the network. The node which
takes part in the exchange of packet is considered
as the link nodes for which weight is computed.
The nodes cost index is computed in the reverse
propagation. The cont index of a next hop node is
derived from the feedback obtained from the next
hop neighbor.
1. Link Quality Estimation
To evaluate the link quality of the network, signal
strength based estimation is used. It is considered
that the signal from one node to other is
communicated using electronic signals. Based on
the measured signal strength, quality of the link is
derived, which intern decides the possibility of
breaking of the link. This is achieved via
monitoring of physical layer data which was
received from the next hop node. Indicating the
node signal power, the node then indicates the
presence of this node in pre-emptive zone. Using
the received signal strength the quality of the link is
derived. A signal with a low strength is then
discarded from the route selection process. While
transmitting the RTS packet, the node also sends a
copy of the transmitting power value Pt. The node
measures the received signal strength and compares
the value with the transmitted power value Pt. The
received signal is derived as;
 ;t 2 4. Estimating Data Rate
Pr = Pt( 4rrd) . Gt. Gr (4)
Where λ is carrier wavelength, d is distance
between sender and receiver; Gt and Gr are unity
gain of transmitting and receiving antennas,
respectively. In this proposed approach the channel
propagation effect of Noise and fading is not
considered, hence the link quality metric is defined
by,
Lq = P r (5)
2. Estimating MAC Overhead
To evaluate the MAC overhead for the developed
approach, the IEEE 802.11 Distributed Co-
ordination Function (DCF) [17] is considered. The
RTS, CTS and ACK packets were used. The short
inter frame space (SIFS), is considered with the
channel occupancy over the MAC overhead. The
MAC contention overhead for the developed is
computed, defined by,
Cocc = tRTS + tCTS + 3tSIFS (6)
Where tRTSand tCTSare the time consumed on RTS
and CTS, respectively and tSIFSis the SIFS period.
While considering the access contention time the
MAC overhead is defined as;
OHMAC = Cocc + tacc (7)
Where, tacc is the access time for channel
contention. The MAC overhead is observed to be
effective for congestion over a node and an
uncontrolled congestion could leads to higher
overhead and reduced the link capacity.
3. Estimating End to End Delay
The delay observed for a communication, is
observed for the Route_Req to Route_Reply
(RREP) for actual data packets. This delay is
computed by introducing a Dummy-RREP while
performing the route discovery. During this process
the source buffers the RREP packets received in a
RREP table. It then extracts the RREP from the
table to generate a dummy data packet in the path it
cover. This dummy packet is generated with the
same packet size, data rate and priority as the real
data packets are considered. The number of hops H
is read from the RREP packet. In each stream of
data the packets used are 2H. During the data
exchange process, the destination node measure the
average delay Davg for all dummy packets
encountered. This average delay is forwarded to the
source via RREP packet. A route is selected only
when the average delay is observed to be within the
limit of the stated application. The source selects a
different route when the delay crosses the required
limit. The source makes out a linear back-off and
forward the dummy packet form this selected route.
In the operation of heterogeneous network, it is
observed that the link throughput is dependent on
the allocated data rate of all the links used. In this
process when the traffic is flown from a higher data
rate node to lower data rate node, a congestion is
observed, leading to long delay of queuing. During
the congestion encounter the effective bandwidth in
link in minimized. The effective data rate of a link
is then defined by,
Drate = Dsize/Cdelay (8)
Where Dsize is the data size and Cdelay is the
channel delay.
B.Weight based Congestion aware routing
protocol (WCARP)
WCARP is an on-demand routing protocol that
aims to create congestion-free routes by making
use of information gathered from the MAC layer.
WCARP employs a combined weight metric in its
standard cost function to account for the congestion
level. For establishing multiple disjoint paths, we
adapt the idea from the Multipath routing approach.
For a given source and destination of
heterogeneous in nature, the possible multiple paths
are computed during the route discovery. Now
calculate the node weight metric NW which assigns
a cost to each link in the network. The node weight
NW combines the link quality Lq, MAC overhead
OHMAC , effective data rate Drate and the average
delayDavg, to select maximum throughput paths,
avoiding the most congested links.For an
intermediate node i with established transmission
with several of its neighbours, the NW for the link
from node i to a particular neighboring node is
given by,
NW = (9)
1. Route Request
Consider the scenario
Let us consider the route
S - Nl - N2 - N3 - D
To initiate congestion-aware routing discovery, the
source node S sends a RREQ. When the
intermediate node N1receives the RREQ packet, it
first estimates all the metrics as described in the
previous section.The node N1 then calculates its
node weight NWNl using (9).
NWNl
RREQNl - N2
N2Then calculates its weight NWN 2 in the same
way and adds it to the weight of N1. N2Then
forward the RREQ packet with this added weight.
NWNl NWN2
RREQN2 - N3
Finally the RREQ reaches the destination node D
with the sum of node weights
NWNl N WN2 N WN3
RREQN3 - D

2. Route Reply
The Destination node D sends the route reply
packet RREP along with the total node weight to
the immediate upstream nodeN3.

NWNl N WN2 N WN3

RREP - N3
Now N3 calculates its cost C based on the
information from RREP as
CN3 = (NWN1 + NWN2 + NWN3 ) - (NWN1 +
NW2) (10)
Proceeding in same manner, all the intermediate
hosts calculate its cost.
On receiving the RREP from all the routes, the
source selects the route with minimum cost value.
Fig.2. packet delivery ratio v/s node mobility
Fig.2 describes the packet delivery ratio of the
proposed approach with varying node mobility.
From the above figure; it is clear that for a
particular node speed, the packet delivery ratio of
the proposed WCARP approach is high compared
to SCTP and CARM.

V. SIMULATION RESULTS
This section gives the details about the
performance evaluation of proposed approach. The
proposed approach is tested for network parameters
of Node mobility speed and packet size. The
proposed WCARP (Weight based congestion aware
routing protocol) is compared with conventional
SCTP [3] and CARM [16] approach.

Case 1: Varying node mobility speed

The simulation parameters for the above case are Fig.3. Routing overhead v/s node mobility
summarized in table 1:
Table 1: Simulation parameters Fig.3 describes routing overhead of the proposed
Parameter approach with varying node mobility. From the
Configuration above figure; it is clear that for a particular node
Values
Simulation Area 1000m X 1000m speed, the routing overhead of the proposed
No. of Nodes 50 WCARP approach is low compared to SCTP and
0, 5, 10, 15, 20,25 CARM.
Mobility Speed
m/s
Source-Destination
15
Pairs
Packet Size 512 bytes
CBR Rates 4 pkts/sec
Mobility RWP
Pause Time (msec) 60

In the first case the node mobility was varied and

the respective packet delivery ratio, routing
overhead and end-to-end delay were measured for
SCTP, CARM and the proposed WCARP. The
respective performance figures are shown in Fig.4. node mobility versus end-to-end-delay
figure.2, figure.3and figure.4 respectively. (msec)
Fig.4 describes the end-to-end delay of the
proposed approach with varying node mobility.
From the above figure; it is clear that for a
particular node speed, the end to end delay of the
proposed WCARP approach is low compared to
SCTP and CARM.
Case 2: Varying packet size Fig.6 describes the routing overhead of the
The simulation parameters for the above case are proposed approach with varying packet size. From
summarized in table 2: the above figure; it is clear that for a particular
packet size, the routing overhead of the proposed
Table 2: Simulation parameters WCARP approach is low compared to SCTP and
Configuration Parameter Values CARM.
Simulation Area 1000m X 1000m
No. of Nodes 50
Mobility Speed 10 m/s
Source-Destination
15
Pairs
500, 600, 700, 800,
Packet Size
900 bytes
CBR Rates 4 pkts/sec
Mobility RWP
Pause Time (msec) 60

In this case the packet size was varied and the

respective packet delivery ratio, routing overhead
and end-to-end delay were measured for SCTP,
CARM and the proposed WCARP. The respective
performance figures are shown in figure.5, figure.6
and figure.7 respectively.
Figure.7.packet size versus end-to-end delay
(msec)
Fig.7 describes the end-to-end delay of the
proposed approach with varying packet size. From
the above figure; it is clear that for a particular
packet size, the end-to-end delay of the proposed
WCARP approach is low compared to SCTP and
CARM.

VI. CONCLUSION

In heterogeneous networks, the end-to-end

Fig.5. packet delivery ratio v/s packet size (Bytes)
Fig.5 describes the details about the packet delivery
ratio of the proposed approach with varying packet
size. From the above figure; it is clear that for a
particular packet size, the packet delivery ratio of
the proposed WACRP approach is high compared
to SCTP and CARM.
Fig.6. Routing overhead v/s packet size (Bytes)
devices are defined with varying characteristics
such as data rate, transmission range, transmission
power etc. congestion occurrence is one of the
main problem in heterogeneous networks. This
paper proposed a congestion aware routing
approach based on the link cost index. This is
termed as weight of the respective link. Buffer
delay, data rate, MAC overhead and link quality are
considered as weight evaluation metrics. The
proposed approach shows efficiency compared to
earlier SCTP and CARM. From the simulation
results it was observed that the proposed approach
having high packet delivery ratio, less routing
overhead and less end-to-end delay.
REFERENCES
[1] Seung-Bum Lee, “User-centric Utility-based
Data Replication in Heterogeneous Networks”,
IEEE, 2008.
[2]SuKyoung Lee, “Vertical Handoff Decision
Algorithms for Providing Optimized Performance
in Heterogeneous Wireless Networks”, IEEE
Transactions on Vehicular Technology, January
2009
[3] Alberto Dainotti, “SCTP performance
evaluation over heterogeneous networks”, Wiley
InterScience, Concurrency and Computation:
Practice and Experience, 2007.
[4]Haiping Liu, Xin Liu, “Heterogeneous Wireless
Access in Large MeshNetworks”, IEEE, 2008.
[5] Yi-Cheng Chan, “Performance Improvement of
TCP Vegas over Heterogeneous Networks”, IEEE,
2004.
[6]Modupe Omueti, “TCP with Adaptive Delay
and Loss Response for Heterogeneous Networks”,
WICON 2007.
[7] Tuan, “TCP BaLDE for improving TCP
performance over heterogeneous networks”, IEEE,
2006.
[8] Dimitrios Katramatos, “A Scalable Method for
Predicting Network Performance in Heterogeneous
Clusters”, IEEE, 2005.
[9] Richard L. Graham, “Open MPI: A High-
Performance, Heterogeneous MPI”, IEEE, 2006.
[10] Kin-WahKwong, “Building Heterogeneous
Peer-to-Peer Networks: Protocol and Analysis”,
IEEE/ACM Transactions on Networking, VOL. 16,
NO. 2, APRIL 2008.
[11] Xin Xiao, “On Constructing High
Performance Overlay for Layered Streaming in
Heterogeneous Networks”, IEEE, 2008.
[12] Jos´e M. S´anchez Santana, “UPNP Service
Discovery for Heterogeneous Networks”, IEEE,
2006.
[13] Marina and Das, "On-demand multipath
distance vector routing in ad hoc networks", Ninth
International Conference on Network
Protocols",pp.14-23, 2001.
[14] Xinsheng Xia, Qingchun Ren and Qilian
Liang, "Cross-layer design for mobile ad hoc
networks: energy, throughput and delay-aware
approach" in proceedings of the IEEE conference
on Wireless Communications and Networking,
vol.2, pp. 770-775, 2006.
[15] Ming Yu, Aniket Malvankar, Wei Su and
Simon Y. Foo, "A link availability-based QoS-
aware routing protocol for mobile ad hoc sensor
networks", Computer Communications, Vol.30,
pp.3823–3831, 2007.
[16] Xiaoqin Chen, Haley M. Jones†, A .D .S.
Jayalath, "Congestion-Aware Routing Protocol for
Mobile Ad Hoc Networks" in proceedings of IEEE
conference on Vehicular Technology,pp.21-25,
2007, Doi.10.1109/VETECF.2007.21.
[17] “IEEE STD 802.11 Wireless LAN Medium
Access Control (MAC) and Physical Layer (PHY)
Specifications,” 1999.
Syed Shakeel Hashmi
received his B.E. Degree in
Electronics &
Telecommunication
Engineering from, B.A.M.
University Aurangabad,
India in 1999. He has
obtained M.E. in Electronics & Communication
Engineering from, Osmania University, Hyderabad,
India in 2006. He is pursuing PhD from JNIAS-
JNTU Anantapur. He is currently working as
assistant professor in the dept. of Electronics and
Communication Engineering at FST, ICFAI
Foundation for Higher Education (A Deemed
University) Hyderabad India. He is a member of
IEEE. His areas of interest are Wireless
Communication, Heterogeneous wireless networks
and signal Processing.
Dr. Syed Abdul Sattar is
presently working as a Dean
of Academics & Professor of
ECE department, RITS,
Chevella, Hyderabad. He has
completed his B.E. in ECE in
1990 from Marathwada
University Aurangabad, M.
Tech. in DSCE from JNTU Hyderabad, in 2002,
and did his first Ph.D. from Golden state University
USA, with Computer Science in 2004, and second
Ph.D. from JNTU Hyderabad, A. P. India with
ECE in 2007. His area of specialization is wireless
communications and image Processing.
Dr. K. Soundararajan obtained
his engineering degree from
SVU Tirupati and Masters from
JNTU and PHD from IIT
ROORKEE. He is a
distinguished Professor of ECE
with Three decades of Teaching
and Research experience
including two decades of Senior Professor /
Executive experience as HOD, Principal, and
Rector. Currently he is working as Principal and
professor at KPES.