Accepted Manuscript

Regular paper

Energy Efficient Cross Layer based Adaptive Threshold Routing Protocol for
WSN

Ramnik Singh, Anil Kumar Verma

PII: S1434-8411(16)30621-5
DOI: http://dx.doi.org/10.1016/j.aeue.2016.12.001
Reference: AEUE 51741

To appear in: International Journal of Electronics and Communi-

cations

Received Date: 27 August 2016

Revised Date: 19 October 2016
Accepted Date: 4 December 2016

Please cite this article as: R. Singh, A. Kumar Verma, Energy Efficient Cross Layer based Adaptive Threshold
Routing Protocol for WSN, International Journal of Electronics and Communications (2016), doi: http://dx.doi.org/
10.1016/j.aeue.2016.12.001

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers
we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and
review of the resulting proof before it is published in its final form. Please note that during the production process
errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.
Energy Efficient Cross Layer based Adaptive Threshold Routing Protocol for
WSN
Ramnik Singh1, Anil Kumar Verma2
1
Research Scholar,ECED, Thapar University, Patiala
2
Group Lead – Mobile Computing and Communication (MC2) Group
Associate Professor, CSED, Thapar University Patiala

Abstract- Wireless Sensor Networks (WSNs) perform an important part in modern day
communication as it can sense the various physical and environmental parameters by employing
low cost sensor devices. The growth of the networks due to scientific advancements have
altogether made it possible to create an energy efficient cross layer network that can improve its
lifespan. In this paper, a routing protocol is proposed for the networks which are heterogeneous
and are based on the adaptive threshold sensitive distributed energy efficient cross layer routing
protocol. The concept of weighted probability is used to assign the CH (Cluster Head) of the
network cluster. The proposed algorithm is simulated, tested and compared with previously
established routing protocols and has shown enhanced results and prolonged network lifespan.
In the proposed protocol, a combination of the proactive and reactive network is considered for
effective data transmission.
Keywords- WSNs, Clustering, Routing Protocols, Network Lifespan, Network Stability.
1. Introduction
Wireless Sensor Network (WSN) is evidently one of the most rapidly evolving networks which
have led to the advancements in the field of communications. The reason behind this can be
bestowed upon the development of sophisticated, reduced and cheaper sensor devices that
exhibits the ability to sense different types of environmental and physical parameters, processing
it, and transmitting the data wirelessly. A WSN comprises of spatially distributed independent
sensors that can be used to observe environmental or physical conditions, such as, pressure,
vibration, acoustic parameters and temperature parameters to synchronically authorize their data
through the prime location, i.e. the base station (BS) across the network. Generally, WSNs
consists of huge number of nodes which are having a power resource with limited energy. Since
the energy needed to impart sensed data packets to the BS is large, so a routing protocol which is
energy efficient is required. The routing protocols are required to build the paths for
communication between the sensor nodes and the BS. Thus, to securely and efficiently transmit
the data from nodes to BS becomes the utmost critical job of these sensor networks. Lately,
various routing protocols have been proposed that use the resources efficiently, conclusively
improving the network lifespan.
The cross layer technique [14, 15] is used to achieve optimal QoS (Quality of Services)
parameters. It combines various layers of the communication protocol to exchange information
in a non-hierarchical manner. This technique is thus suited for better communication of the

1
information with reduced optimal energy consumptions [17]. The cross layer concept is depicted
in Figure1.

Applications

Presentation

Session

Transport (Connection Establishment)-TRS

Network
Data Link Capacitive Assignment-MAC

Physical (Adaptive Modulation)-PHS

Fig. 1. TRS-MAC-PHS cross layer interactions
The various WSNs routing protocols are classified[1] and depicted in Figure 2. The routing
protocols might be categorized into hierarchical and flat types, based upon the network structure.
In flat routing protocols, each sensor node has to perform the same role thus minimizing the
network overhead. It also achieves energy effectiveness, scalability, and stability when a network
structure is enforced. In the hierarchical routing protocols, the nodes are segregated into clusters
and the cluster head (CH) is a node in the cluster with higher residual energy.
Further, the communication model routing protocols can be categorized into query based
protocols or coherence protocols. In the formal, a node requests a query from another sensor
node(s). The coherence protocols can be further divided based on the coherent strategy and non-
coherent strategy of routing whereas in the non-coherent strategy, the information which is
sensed is treated before being transmitted to another nodes for additional processing, whereas in
coherent routing protocols the data which is sensed is moved to the aggregators directly. The
negotiation based routing protocol uses a meta-negotiation technique to reduce the transmission
overhead.
The topology based protocols consist of two algorithms, namely mobile agent-based, and
location-based algorithms. The mobile agent based routing make use of agent-based
programming paradigm, and in location-based routing, the actual position information (maybe by
using GPS) is used.
The reliable routing protocols can handle route failures. This resilience is achieved by
maintaining an equilibrium between the loads or by supporting the QoS matrices[1] comprising

2
of various parameters such as bandwidth utilization, delay, and throughput. The multipath based
reliable routing makes use of multiple paths to overcome route failures, whereas QoS-based
routing strive for a balance between the data quality and the energy expenditure.
The routing protocols generally employ a clustering technique, in which sensor networks are
divided into small convenient units. The funding idea to employ clustering method is to advance
the scalability of the network, but it also attains energy efficient routing protocol for transmission
of the information. The additional features include the conversation of transmission bandwidth
between the clusters, localization of an energy efficient route system between the clusters, and
prevention of redundant data transfer among the nodes.
The clustering method LEACH has been proposed by Heinzelman et al. in [3] which shared the
energy load amongst the sensor nodes equally. The LEACH approach is based on the random
rotation of the cluster coordinate theory and utilizes the localized coordinates to enable
ruggedness and scalability in the dynamic networks. It also includes data aggregation which is
used to reduce the content of information passed to the base station. It has also added the
advantage of increasing the network lifespans. Another clustering method, known as HEED is
presented in [4], makes use of residual energy as the probability to select the CH.
The work has been further extended, as multihop-LEACH and energy-LEACH[5]. Energy-
LEACH, known as E-LEACH, is devoted to the reduction of overall consumption of the
network’s energy by enhancing the criteria of the choice for the CH. Multihop-LEACH, known
as M-LEACH protocol acts on the mode of communication by initiating single to multihop
communication across sink and CH. In 2013, Javaid et al. [6] introduced EDDEEC, a routing
system based upon clustering for Wireless Sensor Networks which are hetrogeneous. The
funding idea lies in the effect and dynamic change on the Cluster head election probability. The
algorithm shows enhancement in stability period, network lifespan and enhanced bypassing of
effective signals to BS in heterogeneous conditions as compared to Energy-Efficient
Heterogeneous Clustering (EEHC) scheme, Distributive Energy-Efficient Clustering (DEEC),
Developed Distributive Energy-Efficient Clustering (DDEEC), and Enhanced Developed
Distributive Energy-Efficient Clustering (EDDEEC). All of the above mentioned approaches
enhance the energy efficiency and the lifespan of the network by distributing network energy
consumption uniformly. To code and control multiple video streams simultaneously in multihop
wireless networks, a novel cross layer framework is proposed in [7]. In this, a scheme is
proposed known as cross layer distributed flow control, an optimal transmission rate from source
to destination for wireless communications is achieved. Another analytical coding approach
known as - rate-distortion optimized joint source-channel is employed to chose the coding
strategy of the channel optimally given that the optimal transmission rate is acquired from the
prevailing channel condition and the proposed flow control scheme.
An optimum routing for cross layer is also proposed for wireless mesh networks based on the
principle of adaptive spatial TDMA[8]. The authors in [9] surveys various cross-layer designs,
especially for MANETs.

3
 Flat Protocols
Network
Structure
Hierarchical
Protocols

Query based
Protocols

Communication Coherent based

Model Protocols

WSN Routing Negotiation

Protocols based Protocols

Mobile Agent
based Protocols
Topology Based
Location based
Protocols

QoS based
Protocols
Reliable Routing
Multipath based
Protocols

Fig. 2. Routing Protocols for Wireless Sensor Networks (WSNs) [1].

One of the main challenging issues in WSN designing is energy consumption. Thus, various
routing protocols are there to attain energy efficiency. Of these, LEACH is representative and
utilizes random rotation of the CHs to uniformly distribute the energy load across all the nodes.
However, an energy efficient model can be developed as it solely depends on a probability
model. A new ASLPR (application specific low power routing protocol) came into existence [10]
which takes into consideration the few parameters from sensor nodes while selecting the optimal
cluster heads. Also, advancement in disruptive technologies, such as the research in high-speed
wireless and optical transmission and P2P content distribution and research in the virtualization
of systems has provoked fundamental discussions to design the future Internet [11]. In [12], in
multiuser diversity system a cross-layer framework is investigated using rate compatible STBC
(Space-Time Block Codes ) and LDPC (Low-Density Parity-Check )codes.

4
One of the primary problems faced for definitive multicast transmissions across wireless
networks is the dynamic nature of the wireless link. Vien et al. [13] proposed a network coding
to improve the overall network throughput. A new cross-layer optimization framework to design
the network topology is introduced which optimizes the multicast rate of the wireless networks,
the energy supply, the data flow of the wireless links, and node lifespan available bandwidth.
ElAttar et al. [14] optimize these goals while considering the effects of various network design
parameters like node spatial density, data rate, and traffic load by investigating the minimum
transmitted power. The authors of [15] provides a distinctive categorization of cross-layer QoS
approaches in Wireless Sensor Networks which permits to survey numerous studies with
maximum clarity. Indumathi et al. [16] proposed a new Adaptive Cross-Layer Scheduler design,
which outperforms the previous techniques by lessening a prescribed cost function which
contains the delays states and the current channel of the packet in the queue according to both
user throughput and packet delay. In [17], a novel cross-layer mobility aware MAC protocol for
cluster-based cognitive radio sensor network is proposed, the primary focus being formation and
maintenance of clusters.

In this paper, a novel method is introduced that employ a cross layer technique through the
various layers (refer figure1). This method proves to be very effective for the construction of
WSNs for optimized energy consumptions. For adaptive threshold sensitive distributed cross
layer energy-efficient routing, the Cluster head is selected with respect to the weighted
probability, which is based upon factor i.e. the mean energy of the whole network divided by
residual energy of every single node. The results shows the improved stability and prolonged
network lifespan when compared to DEEC, EEHC, and EDDEEC.

2. Proposed Work
The proposed routing protocol employs two models, namely the Network model, and the Radio
energy model. The Network Model concentrates on cluster formation and CH selection, whereas,
the Radio Energy model focuses on calculating the energy expended during transmission,
reception, and accumulation of data. The network is modeled as a square field of uniformly
distributed random nodes. It is considered that every single one of the sensor nodes become static
once the deployment gets over, i.e. every sensor node become steady and accumulate data from
the field which is based upon some sensed features and make it bypass to the base station. It is
named as ATEER in order to justify the Energy Efficiency based on Adaptive Threshold
concept.
It is presumed that WSN comprises of heterogeneous nodes which have the separate levels of

normal node, having
 (1 + ),
 (1 + ), and
 initial energies respectively. It is also taken
nodal energy, thus classifying sensor nodes into super-advanced node, advanced node, and

into consideration that the sensor nodes are not rechargeable and have limited battery life. Thus,
they have the tendency to merge all the redundant data which in turn, saves the energy.
The communication between the cluster member and its corresponding CHs is carried out
through single-hop communication. It is also assumed that the relative distance is approximated
based upon the input signal strength and the network doesn’t have access to GPS navigation.

5
 Start

Initialization of
Parameters

Sensor nodes deploy-

ment in Test Area

Node Eres(i)
No Node is not alive.
Residual
Energy > 0 Dead = Dead + 1

Yes

Evaluate Probability
P(i) for each node

Evaluate Probability
P(i) for each node

If Rn <= No Node check for nearby

T(Sa) clusters
Yes
No Yes
Become A Cluster Head Is Min_dst
and Send a Message Become a Cluster
CH Member

Aggregation of data by CH
and send To Base Station
No If CV > HT
Base Station
Sleep CV – SV >=
ST

Fig. 3. Flowchart of proposed protocol.

Yes

Become A Cluster Head

and Send a Message
6
As illustrated in fig. 3, the following steps are performed to carry out the proposed protocol
algorithm: initialization, deployment, CH selection, Cluster creation and member nodes
followed by transmission of sensed data.
The initialization of the parameters comprises the first phase of the proposed algorithm. The
simulation parameters essential for simulating results for the proposed protocol are listed in
Table1, which include parameters like the total number of nodes present in a system, network
area, reception and transmission energies, packet size, the proportion of super advanced nodes
and advanced nodes etc.
Table 1: Wireless Sensor Networks Simulation parameters.

Parameters Symbol Values


Network Area 100×100

Initial Nodal Energy 0.5 J


Total number of nodes present in a system 100


Fraction of super nodes amidst advanced nodes 0.6


Energy factor of Super node 3


Fraction of advanced sensor nodes amidst normal nodes 0.4


Threshold distance 70 m


Energy factor of Advanced node 2


Energy dispersed per bit 50 nJ/bit

_
Data packet aggregation energy 5 nJ/bit/message

Transmitter amplify if  ≥   
Predetermined percentage of CH 0.05

Transmitter amplify if  ≤  
0.0013 pJ/bit/m4


10 pJ/bit/m2
Message size or Data packet 512 bytes

The distribution of the nodes all over the test area of network is uniform, and location of the
nodes are explained arbitrarily. Sensor nodes that are placed is assumed to be 100 in number and
having the field area of 100×100 m2 in which they are deployed.
The Cluster Heads are elected on the basis of characteristic i.e. Node weighted probability. The
probabilities are determined with the factor i.e. the mean energy of the whole network divided by
the residual energy of each sensor node. The rotating epoch for every single one of the sensor
node is unique when the initial and final residual energy is calculated. The CH per round during
each epoch is selected from the sensor nodes which have highest residual energy. In this
algorithm, every single one of the node generates a random number which should be present in
the range of 0-1.
The threshold function ( ) is defined for the cluster head selection. When the number
generated is much less than the threshold function, then that node will become the CH, otherwise
it will not. The new CH is chosen during every round based upon this threshold function that
results in the distribution of load of energy consumption across the sensor nodes and CHs.

7
 % &'
# , 23 5 67
( ) = 1 −  )* ∗ , -1. =
$ &' &' /0
#
(1)

" 0 , ,9ℎ;*<2;

In eq. (1) _ is the optimal number of Cluster Heads , * represents the current round count,
7 represents sensor nodes group that had not been chosen as CHs in the last 1.
_
rounds
with respect to the given threshold function.

Thus, it is appropriate to consider a certain value _ as a reference. In real scenarios, the
It is considered that all the sensor nodes in a homogeneous WSNs possess similar initial energy.

nature of the Wireless Sensor Networks is heterogeneous, i.e. they have more than one type of

initial energy value. Hence, it is obvious to replace _ with > according to the type of node,
sensor node implies the reference value of each node should be specific in accordance to its

namely super sensor node, advanced node and normal node is given by:
_
>
% ) 0 23 5 > 2 B,*C B,;
#(1 +  . ( +  . ))
@A
#
&' (1 + )
> =
> = ) 0 23 5 > 2 DBE; B,;
$(1 +  . ( +  . ))
@A
(2)
# &' (1 + )
>
# ) 0 23 5 > 2 FG;* B,;
" (1 +  ( +  . ))
@A

In eq. (2)
@A is the mean energy of the whole sensor network and
> represents the sensor

lifespan and the total energy of the network. Thus, at *  roundthe average energy
@A of a
node's residual energy. Originally, every sensor node requires prerequisite knowledge of the

sensor network can be estimated by:

1 *

@A(H) = ∗
  -1 − /

I
(3)
In this, I indicates the total number of rounds i.e. I is the total number of rounds estimated
across the network when all the sensor nodes expire at the same time. If
  represents the
initial total energy of network, then I can be determined by:

 
I =

HJKL (4)

For every sensor node in association with initial energy or the residual energy, the new threshold

device is putting value of > from eq. (2) in eq. (1), the expression becomes:
for CH selection, related with residual energy or initial energy of every single one of the sensor

8
Algorithm: A routing protocol based on the adaptive threshold sensitive distributed energy
efficient routing protocol

: Total Number of nodes in a system

Input:

 : Fraction of advanced sensor nodes amidst normal nodes

 : Fraction of super nodes amidst advanced nodes
: Energy factor of Advanced node
: Energy factor of Super node
:Network Area
_ :Predetermined percentage of Cluster Head

 :Initial Nodal Energy
:Data packet or message size
 :Transmitter amplify if  ≤ 
  :Transmitter amplify if  ≥ 

 :Energy dispersed per bit

 :Data packet aggregation energy
 :Threshold distance

MN>K  : Cluster Head of Wireless Sensor Network

Output:

begin

for2 = 1 to 2 O
Initiate the parameters

if
H (2 ) > 0
Deploy sensor nodes in Test Area

calculate probability (2) of each node

ifIK ≤ (5 )
Become a Cluster Head MN>K  and send a Message
CH Aggregate data and send to Base Station

if threshold distance  = minimum distance

else check for nearby clusters

ifMQ > N
Become a Cluster Member

MQ − 5Q ≥ 5
Become a Cluster Head MN>K  and send a Message
else sleep
end
end

else
H (2 ) < 0
end

The node is dead

end
end

9
 % >
# , 23 5 6 7
( > ) = 1 − > )* ∗ , S1. T0 =
$ >
#
(5)

" 0 , ,9ℎ;*<2;

The new threshold values are calculated by eq. (5), once the CH is elected. The CH node
broadcasts a message which contains various parameters. Thus, every single one of the normal
node picks to join the nearby Cluster Head which is based upon the value of input signal strength
of the message presented by Cluster Head node during the cluster formation phase. After that,
every CH node is notified by the sensor node that they might be a member of cluster and then it
sends a concise joining message return to CH node. Thus, every single one of the CH nodes have
to hold their receiver entity on. Conclusively, every one of the CH generates a TDMA schedule
that inform every node of the cluster member that when they can impart data which is based on
the total number of nodes in a particular cluster. Every single one of the CH then chooses a
CDMA code and then distribute this code to all the members of cluster. The funding idea for
utilizing CDMA code is to minimize inter-cluster interference.
Once clusters has been created and TDMA schedule gets fixed, the member nodes which are
active imparts sensed data for the first time, as the data transmission phase begins, in which if the
parameters received from physical attribute suite come to its Hard Threshold (HT) value then the
sensed value is deposited in the variable of sensor or an internal register. Next time, the sensor
will only impart when the physical parameter that are sensed is greater than Hard Threshold
(HT) and current value minus PSV is greater than Soft Threshold (ST) value. During this phase,
the active cluster members send the data to Cluster Head (CH). The CH will aggregate that
received data and imparts the aggregated packets to the Base Station.
3. Results and Discussions
The evaluation and examination of the performance for hierarchical protocols, the basic used
matrices are total data packets received at Base Station, network residual energy, and the number
of nodes alive.
The proposed model is tested in a fixed area for a particular number of sensor nodes. The
proposed hybrid protocol (ATEER) is simulated with EDDEEC, DEEC, and EEHC protocols
based on performance metrics.
It is evident from figure 3, that the network lifespan and stability period for proposed scheme,
ATEER, has enhanced network lifespan in comparison to the old techniques. As the lifespan
increases , energy efficiency of the proposed algorithm is also improved. The network lifespan of
the protocols EEHC, DEEC, ATEER and EDDEEC are 5995, 2890, 7123, and 5403 rounds
respectively.

10
 (a) (b)
Fig. 4. Performance evaluation of network lifespan of protocols in terms of (a) Nodes which are

( = 0.08,  = 0.4,  = 0.6,  = 2, Y = 3, N = 200, 5 = 4, and I = 80 *,FB)

alive, and (b) Nodes which are dead.

The proposed algorithm is analyzed for data packet transmission to the Base Station in different
protocols. The following comparison curve is obtained.

( = 0.08,  = 0.4,  = 0.6,  = 2, Y = 3, N = 200, 5 = 4, and I = 80 *,FB)

Fig. 5. Analysis of Data Packet transmitted to Base Station.

11
It is demonstrated that the proposed approach, ATEER, lessens the amount of transmissions by
allowing sensor nodes to only impart once the physical value, that is sensed is in the given range.
ST reduces amount of the imparted data packets by limiting needless transmissions that become
apparent when there is minor variation in the sensed values. The total data packets received by
Base Station in the case of , EEHC, DEEC, ATEER and EDDEEC are 189894, 165556,256774
and 249355 respectively.
The proposed algorithm is tested and simulated by taking different cases of ATEER based on
parameters which are defined as in table 2. The proposed scheme is simulated and compared for
all the four cases with a large number of dead and alive nodes. The respective comparison curves
obtained are shown in figure 5.

Table 2: The effect of threshold and count time on proposed protocol ATEER.

 = 0.08,  = 0.4,  = 0.6,  = 2, Y = 3, N = 200, 5 = 4, for Reactive

Cases Parameters

response whereas I = [\ ]^_`ab for Proactive response.

CASE 1

 = 0.08,  = 0.4,  = 0.6,  = 2, Y = 3, N = 200, 5 = 4, for Reactive

response whereas I = c\ ]^_`ab for Proactive response.
CASE 2

 = 0.08,  = 0.4,  = 0.6,  = 2, Y = 3, N = 200, 5 = 12 for Reactive

response whereas I = [\ ]^_`ab for Proactive response.
CASE 3

 = 0.08,  = 0.4,  = 0.6,  = 2, Y = 3, N = 200, 5 = 12 for Reactive

response whereas I = c\ ]^_`ab for Proactive response.
CASE 4

(b)
(a)
Fig. 6. The performance of ATEER taking four different cases changing ST and RT for (a) alive
nodes, and (b) dead nodes.

12
4. Conclusions
The basic advancement of proposed hybrid technique ATEER is because of the consideration of
all the three levels of node heterogeneity. The CHs have been selected in accordance to the ratio
calculated from the average energy of entire network and residual energy of the sensor node. The
technique shows better results for heterogeneous networks even when compared to homogeneous
networks.
The employment of both reactive and proactive network concepts, has turned fruitful in
improving the stability period and network lifespan. The unnecessary transmission of data has
been reduced by application of both HT and ST, and the application of count time provided an
exact estimate of the network at the periodical interval to the user.
The simulation results provide the conclusion that the proposed scheme outperforms DEEC,
EDDEEC, and EEHC by 47.84%, 38.30%, and 66.67% respectively, demonstrating the
improved energy efficient WSN and a long network lifespan. The employment of the proposed
technique along with reactive and proactive network concepts, and considering the heterogeneity
of network while selecting the cluster head, has increased the network lifespan and has improved
the load balancing throughput of the network.
The threshold function  can be optimized for selection of CHs or a method can be introduced
to make the WSN more energy efficient increasing its lifespan. A modified TDMA or integration
of CDMA, and TDMA schedule can be employed to prevent the interference of signals from
nodes to CHs, while transmitting data from sensor nodes to the BS.
REFERENCES
[1] Pantazis, N. A., Nikolidakis, S.A., and Vergados, D. D. (2013), “Energy-Efficient
Routing Protocols in Wireless Sensor Networks: A Survey”, IEEE Communications
Survey & Tutorials, vol. 15, 2, pp. 551-591.
[2] Mitra, R., and Nandy, D. (2012), “A Survey on Clustering Techniques for Wireless
Sensor Networks”, International Journal of Research in Computer Science, vol. 2, 4,
pp.51-57.
[3] Heinzelman, W. R., Chandrakasan, A. P., and Balakrishnan, H. (2000), “Energy-
Efficient Communication Protocol for Wireless Microsensor Networks,” in Proceedings
of the 33rd Annual Hawaii International conference on System Sciences, Maui, HI,
USA, pp. 3005-3015.
[4] Younis, O., and Fahmy, S. (2004), “HEED: A Hybrid Energy-Efficient Distributed
Clustering Approach for Ad Hoc Sensor Network”, IEEE Transactions on Mobile
Computing, vol. 4, 3, pp. 366-376.
[5] Xiangning, F., and Yulin, S., (2007), “Improvement on LEACH Protocol of Wireless
Sensor Networks”, in Proceedings of International Conference on Sensor Technologies
and Applications, SensorComm, Valencia, Spain, pp. 260-264.
[6] Javaid, N., Qureshi, T. N., Khan, A. H., Iqbal, A., Akhtar, E., and Ishfaq, M. (2013),
“EDDEEC: Enhanced developed distributed energy-efficient clustering for
heterogeneous Wireless Sensor Networks”, Procedia Computer Science, vol. 19, pp.
914-919.

13
[7] Zhou L., Zheng B., Geller B, Wei A., Cui J. (2009), “Joint QoS control for video
streaming over wireless multihop networks: a cross-layer approach”, AEU-
International Journal of Electronics and Communications, vol. 63, no. 8, pp. 638-647.
[8] Elhakeem A. K. (2011), “Cross layer design using adaptive spatial TDMA and optimum
routing for wireless mesh networks”, AEU-International Journal of Electronics and
Communications, vol. 65, no. 1, pp.44-52.
[9] Pease S. G., Guan L., Phillips I., Grigg A. (2011), “Cross-layer signaling and
middleware: A survey for inelastic soft real-time applications in MANETs”, Journal of
Network and Computer Applications, vol. 34, no. 6, pp. 1928-1941.
[10] Shokouhifar M., Jalali A. (2015),“A new evolutionary based application specific routing
protocol for clustered wireless sensor networks”, AEU-International Journal of
Electronics and Communications, vol. 69, no. 1, pp. 432-441.
[11] Tutschku K., Tran-Gia P., Andersen F. U. (2008), “Trends in network and service
operation for the emerging future Internet”, AEU-International Journal of Electronics
and Communications, vol. 62, no. 9, pp. 705-714.
[12] Zhang Y, He W. (2010),“Cross-layer design in multiuser diversity system” in
Proceedings of International Conference Signal Processing Systems (ICSPS), vol. 3, pp.
V3-631.
[13] Vien Q. T., Tu W., Nguyen H. X., Trestian R. (2014), “Cross-layer optimisation for
topology design of wireless multicast networks via network coding” in Proceedings of
39th Annual IEEE Conference on Local Computer Networks, pp. 466-469.
[14] ELAttar H., Abdelaty H., ElRamly S. H., Aboul-Dahab M. A. (2011), “PHY-MAC
Cross Layer Issues for QoS Provisioning in Wireless Ad-Hoc Networks”, in Proceedings
of Information Technology: New Generations (ITNG), Eighth International Conference,
pp. 100-105.
[15] Al-Anbagi I., Erol-Kantarci M., Mouftah H. T. (2014), “A Survey on Cross-Layer
Quality-of-Service Approaches in WSNs for Delay and Reliability-Aware Applications”,
IEEE Communications Surveys & Tutorials, vol. 18, no. 1, pp. 525-552.
[16] Indumathi G., Murugesan K. (2007), “Throughput Maximization in Wireless Systems
Using an Adaptive Cross Layer Scheduling”, in Proceedings of International Conference
on Computational Intelligence and Multimedia Applications, vol. 4, pp. 388-392.
[17] Zareei M., Islam A. M., Mansoor N., Baharun S., Mohamed E. M., Sampei S. (2015),
“Cross-layer mobility-aware MAC protocol for cognitive radio sensor network” in
Proceedings of International Conference on Informatics, Electronics & Vision (ICIEV),
pp. 1-6.

14
Energy Efficient Cross Layer based Adaptive Threshold Routing Protocol for
WSN
Ramnik Singh1, Anil Kumar Verma2
1
Research Scholar,ECED, Thapar University, Patiala
2
Group Lead – Mobile Computing and Communication (MC2) Group
Associate Professor, CSED, Thapar University Patiala

Ramnik Singh is currently working as an Assistant Professor in the department of Computing Science and Engineering at DAV Institute of
Engineering and Technology, Jalandhar, India. He is currently pursuing his PhD. degree from Thapar University Patiala. His work areas of interest
are Wireless Sensor Networks and MANETs.

8.ramnik@gmail.com

Anil Kumar Verma is currently working as Associate Professor in the department of Computer Science and Engineering at Thapar University,
Patiala in Punjab (INDIA). He received his B.S. M.S. and PhD. in 1991, 2001 and 2008 respectively, majoring in Computer Science and
Engineering. He has worked as Lecturer at M.M.M. Engineering College (now, MMM University of Technology), Gorakhpur from 1991 to 1996.
From 1996 he is associated with the same University. He has been a visiting faculty to many institutions. He has published over 150 papers in
refereed journals and conferences (India and Abroad). He is member of various program committees for different International/National
Conferences and is on the review board of various International journals. His area of interest is Adhoc networks, Wireless sensor networks and
security .

akverma@thapar.edu

15