International Journal of Reviews in Computing

© 2009-2010 IJRIC& LLS. All rights reserved. IJRIC

www.ijric.org E-ISSN: 2076-331X

A REVERSE TRANSMISSION APPROACH FOR MULTI-HOP

ROUTING IN WIRELESS SENSOR NETWORK
1
NILAYAM K KAMILA, 2PRASHANTA K PATRA, 3PRBODHA K PRADHAN, 4PRASANT K PATTNAIK,
1
I.T. Analyst, TATA Consultancy Services, Bangalore, Karnataka, India-560066
2
Professor & Head, Department of Comp. Sc & Engg. CET, Bhubaneswar, India -751003
3
Asst. Prof., Department of Comp. Sc & Appl., Regional College of Mgmt., Bhubaneswar, India -751023
4
Professor & Head, Department of Comp. Sc & Engg., KIST, Bhubaneswar, India -752050

E-mail: nilayam.kamila@gmail.com, hodcomputer@yahoo.co.in, pradhan_pk@yahoo.com,

pattnaikprasant@gmail.com,

ABSTRACT

Sensor network nodes are spreaded over specific area with limited battery energy, low computational
capacity and restricted communication bandwidth. In Sensor networks, the cluster-based routing algorithms
are used to reduce the energy consumption of nodes and prolong the network lifetime [4, 5, 6, 7]. In most
cluster-based algorithms, a predefined number of clusters or cluster heads is required. In some cases the
nodes’ density and distribution significantly affect clustering techniques applied in wireless sensor
networks. In this work , we propose a routing approach namely as Reverse Transmission Approach
(RTRA) where we have established a reverse transmission for some intermediate node which are located in
the path of the cluster head to base station. Again, the mathematical analysis gives a suitable threshold
value for intermediate nodes. The proposed scheme is compared with existing related works through the
simulation studies.
Keywords: Sensor Networks, Multi-Hop, Hierarchical routing

1. INTRODUCTION sensor nodes in its network. Sensor nodes sense

The recent technological advances in micro-
sensor and wireless communication make it
possible to deploy a low power, inexpensive sensor
in large scale. The Networking among themselves
has revolutionized the information gathering and
processing.
Base Station
Internet
User
Figure 1. Structural view of Sensor Network
The base station typically serves as a gateway to
some other networks. It provides powerful data
processing, storage unit, and an access point to the
their environment for specific targets, collect data
and transmit/receive to/from the base station as
shown in figure 1. Moreover, they have only short-
range transmission. The nodes must be capable of
self organize and be able to constantly maintain
their connectivity within the network. Especially in
Sensor network, the nodes are resource-constrained
devices and participate in the network until their
battery has not been depleted. When all sensors die,
the network is no more available. Due to small size
and random deployment of Sensor nodes, it
becomes difficult to repair or maintain these nodes
periodically. Hence the traditional routing protocols
deployed in wired networks and ad hoc networks
are not suitable for the sensor networks.
Sensor 2. REVIEW OF RADIO MODEL OF WSN
Target AND ANALYSIS OF EXISTING RELATED
ROUTING PROTOCOLS
2.1 Radio model of WSN nodes
A typical wireless sensor networks (WSN) node
may constitute of four units such as data processing
unit, sensor unit, wireless communication unit and
power unit [20].We consider the radio model [18]

1
 International Journal of Reviews in Computing
© 2009-2010 IJRIC& LLS. All rights reserved.
www.ijric.org
where the power consumed in transmitting a k-bit
message through a distance d-unit is calculated by
Equation (1), while power consumed in receiving a
k-bit message is calculated by Equation (2).
Etr ( pd , d ) = ε te pd + ε ta pd d 2
Er ( pd ) = ε r pd
Where ε te and ε r means the power dissipated to
run the transmitter or receiver circuitry and ε ta is
the power for the transmit amplifier.
2.2 LEACH[18]
LEACH is a protocol based on clustering hierarchy
architecture. In this protocol, nodes are organized
into different clusters each of which has a cluster-
head and each cluster-head fuses data from its
members before transmitting them to the base
station. Sensors elect themselves to be local cluster-
heads at any given time with a certain probability.
In order to avoid cluster-heads dissipating too much
power, cluster-head election and network
rebuilding run periodically. And LEACH is built on
the following two assumptions: 1) the base station
is fixed and is far from the sensors; 2) All nodes in
the network are homogeneous and energy-
constrained. The operation of LEACH is broken up
into rounds, where each round begins with a set-up
phase, when the clusters are organized, followed by
a steady-state phase, when data transfers to the base
station occur. In set-up phase, cluster-heads are
selected randomly and the randomicity ensures the
high energy-consumption for data transmitting
between cluster-heads and the base station is
distributed among all nodes in the network evenly.
As a node is elected to be cluster-head, it
broadcasts an advertisement message which
contains the information qualifying for the cluster-
head. The other non-cluster-head nodes decide
which cluster to join according to the strength of
the advertisement signal. And the cluster-head
advertisement heard with the largest signal strength
is the cluster-head to which it belongs. Then it
transmits a message back to the cluster-head to
inform that it will be a member of the cluster.
2.3 PEGASIS[10]
Power-Efficient Gathering in Sensor Information
Systems (PEGASIS) is a near optimal chain-based
protocol. The basic idea of the protocol is that in
order to extend network lifetime, nodes need only
communicate with their closest neighbors and they
take turns in communicating with the base-station.
IJRIC
E-ISSN: 2076-331X
When the round of all nodes communicating with
the base-station completes, a new round will start
and so on. This reduces the power required to
transmit data per round as the power draining is
spread uniformly over all nodes. Hence, PEGASIS
(1) has two main objectives. First, increase the lifetime
of each node by using collaborative techniques and
(2) as a result the network lifetime will be increased.
Second, allow only local coordination between
nodes that are close together so that the bandwidth
consumed in communication is reduced. Unlike
LEACH, PEGASIS avoids cluster formation and
uses only one node in a chain to transmit to the BS
instead of using multiple nodes.
2.4 Issues Related to LEACH and
PEGASIS [23]
LEACH and PEGASIS are two popular protocols
under hierarchical based routing techniques.
LEACH has an improvement in energy
consumption over direct communication [24], and
having the following issues.
1. Unbalanced energy load and large
unnecessary energy dissipation.
2. Redundant data transmission in network,
to/from intermediate nodes to cluster
heads
PEGASIS has better performance over LEACH and
is also having the following issues [10].
1) PEGASIS avoids energy dissipation of cluster-
rebuilding, but each node should be aware of the
energy remaining status of its neighbors
2) Data of those nodes far away from the leader
will be forwarded many times through the chain
and it will cause long time delay.
3. OUR PROPOSED REVERSE
TRANSMISSION(RTRA) SCHEME
In existing related works [10, 18], the Sensor nodes
collect data and transmit the data to the cluster
head, and the cluster head, in turn, transmit the data
towards the base station either directly or through
other cluster head. The cluster head also takes the
help of some intermediate nodes to transmit the
data to the base station or other cluster head in a
multi-hop communication as shown in figure 2. In
this approach, we propose, the intermediate node
(probably a set of nodes) which is (are) involved in
data transmission from respective cluster head to
the base station or other cluster head, should
reverse transmit the data towards the path of base
station .i.e. these intermediate nodes must transmit
the sensed data towards the next cluster head,
2
 International Journal of Reviews in Computing
© 2009-2010 IJRIC& LLS. All rights reserved. IJRIC
www.ijric.org E-ISSN: 2076-331X

instead of sending the data towards the recent
cluster head as shown in figure 3.
The reverse transmission decision is to be taken by
the intermediate nodes based on the residual energy
and the distances between the nodes and the
respective cluster heads. Also the decision function
depend on the packet size. The intermediate nodes
are to be informed regarding this reverse
transmission formalism after the first round of data
transmission completed by the respective cluster
head.
Hence the redundant data transmission is
minimized and the energy dissipation is reduced in
the proposed scheme.
The process flow for the RTRA approach is shown
in figure 4.The intermediate nodes, which are
located on the path between a cluster head and base
station, calculate the critical distance factor
∆ cc ' (Ref equation (5) of section 4).This value is
compared with a Threshold value ( ξ ), based on
which the intermediate node forwards the data
packets to its own cluster head or to the nearest
neighbour towards the base station.
Assumptions:

d cj : Distance between cluster head and the jth-node

d cj : Distance between cluster head c and next hup
cluster head c’ towards the base station.
n : Total number of nodes in a cluster under
consideration.
Cluster head
Target

Base Station Network Setup and

cluster head selection
Figure 2: Traditional Approach for data transmission

The objective of RTRA approach is to minimize the Calculate the distances

dic and dic’
energy dissipation during the data transmission to
these special intermediate nodes. In this proposed
RTRA scheme, the redundant transmission between
the intermediate nodes to cluster head and again Calculate the critical distance
from cluster head to the same intermediate nodes disfference ∆ cc '
for data transmission towards the base station is
avoided.

Is No
∆ cc ' < ξ ?

Send data to Send data to nearest

current cluster cluster head(ch’)
Yes

Cluster head Aggregate Data to forward

to nearest cluster head ch’
Target

Base Station
Combine Data to forward to next
Figure 2: Data Transmission using proposed cluster head or base station
RTRA Approach Figure 4: RTRA Approach – A typical process flow

3
 International Journal of Reviews in Computing
© 2009-2010 IJRIC& LLS. All rights reserved. IJRIC
www.ijric.org E-ISSN: 2076-331X

ε te , ε ta : Transmitter energy and transmitter nil in lth cluster in set ΘlA .The path Set Ξ A
amplifier power of Sensor radio contains all the paths from intermediate node i to its
ε r : Receiver energy of Sensor radio respective cluster head and the nearest neighbor’s
cluster head. The processRTRA() is executed for all
pd , pcd and pcd ' : Size of a single data packet , (n- cluster and for each nodes in the respective
1) aggregated data packet and (n-2) aggregated data cluster.The ∆ cc ' is calculated using equation 5 and
packet respectively.
is compared with the a value ξ as calculated in
Ψ tf , Ψ rf and Ψ f : Energy dissipated for
equation (6). Based on the values of ∆ cc ' , the
transmitting, receiving and both, for flooding based
routing. packets will be either routed via its own cluster
head or the neighbours’ cluster head which is in the
Ψ tRTRA , Ψ rRTRA and Ψ kRTRA : Energy dissipated for path towards the base station as discussed in our
transmitting, receiving and kth-node’s energy proposed approach. However the message
consumption in RTRA scheme. aggregation is taken care at each cluster head as
Ψ RTRA : Total energy consumed in RTRA presented in the above algorithm.
scheme.
4. MATHEMATICAL ANALYSIS
Algorithm: processRTRA() Let us consider a randomly deployed network with
multiple numbers of clusters formed. Each cluster
Initialization: Θ = {n l
A
l
i ε >ζ}
ni
r nodes are responsible to elect their respective cluster
Path = {Intermediate
c
nodes for path from node i to head. Let us assume in a typical mth cluster formed
i
in a network, there are n-number of sensor nodes
cluster head c}
and each node sense the physical environment and
Ξ A = { Pathic ∃ P ath from ith node to cluster head c }
send the data packet of size pd to the respective
for(each l) cluster head. In multi-hop communication the
for(each ni ∈ ΘlA ) shortest distance calculation is being executed with
the help of popular Dijkstra's algorithm where the
if( path( ni , c ) ∈ Ξ A and path( ni , c ') ∈ Ξ A ) minimum distance is calculated by.
for(eachk ∈ Pathic ∩ Pathic ' ) d cj = Min(d cj , dck + d kj ), ∀k
Calculate d ck and d kc ' The energy dissipated by all non-cluster head nodes
by sending the pd sized data packet to the cluster
Calculate ∆ cc ' = d kc2 ' − d ck2 head is given by
< ξ ) then
if( ∆ cc ' Ψ tf = ε te pd + ε ta pd ∑ d cj2
j ≠c
send ( ni , c ', mi )
The energy consumed by the cluster head in
else receiving n-1 number of pd sized data packets and
send ( ni , c, mi ) sending the aggregated pcd sized data packet to
end if nearest cluster’s head is given by
end for Ψ rf = (n − 1) pd ε r + ε te pcd + ε ta pcd d cc2 '
end if
Again in muti-hop communication
send ( ni , c, mi )
d cc ' = Min(d cc ' , d ck + d kc ' ); ∀k , k ≠ c, c '
M c = U mi So the total energy consumed by all nodes in the
i mth cluster is
end for
Ψ f = Ψ tf + Ψ rf
send (c, c ', M c )
end for = pd ε d' + pcd ε cd'' (3)

Figure 5. Algorithm for RTRA process in Sensor

Where εd' = [εte + εta ∑dcj2 + (n −1)εr ] and
j ≠c
network
ε cd'' = [ε te + ε ta d cc2 ' ] .
The algorithm is to be initialized with all nodes Now in proposed RTRA approach the energy

4
 International Journal of Reviews in Computing
© 2009-2010 IJRIC& LLS. All rights reserved. IJRIC
www.ijric.org E-ISSN: 2076-331X

dissipation by (n-2) non-cluster head nodes is given parameters to simulate the flooding based routing
by protocol vs RTRA scheme based routing. The
Ψ tRTRA = ε te (n − 2) pd + ε ta pd ∑d
j ≠ c ,k
2
cj
simulation is carried over 100 nodes in 50X50
square unit area (Figure 6(a) ) and 200 nodes in
And the energy consumed by the cluster head to 120X120 square unit area.
1: each node has an initial power of 1 J
receive the data, aggregates and tranmit to another
cluster head c’ is given by 2: ε r =50nJ/bit means the power dissipated to run
Ψ rRTRA = (n − 2) pd ε r + ε te pcd ' + ε ta pcd ' d cc2 ' the transmitter or receiver circuitry to process 1
th bit information
Here we need to consider the k -node’s energy to
transmit data to the nearest cluster head instead of 3: ε ta = 100pJ/ bit / m2 means the power for the
sending the sensed data to it’s own cluster head is transmit amplifier
given by 4: base station location (x,y)=(random(),random())
Ψ kRTRA = ε te pd + ε ta pd d kc2 '
So the total energy consumed by a cluster is given
by
Ψ RTRA = Ψ tRTRA + Ψ rRTRA + Ψ kRTRA
= pd ε drtra + pcd 'ε cd' (4)
Where
ε drtra = ε te (n − 1) + ε ta ( ∑ d cj2 + d kc2 ' ) + (n − 2)ε r
j ≠c,k

So the energy difference between Ψf and

Ψ RTRA is given by
∆Ψ = Ψ f − Ψ RTRA
In order to ∆Ψ > 0 , we must have
1
∆ cc ' < [δ pcd ' (ε te + d cc2 ' ) − δε te,r ] (5)
ε ta Figure 6(a):Residual Energy Vs Network life time
for Flooding and RTRA for 100 nodes over
Where 50X50 square unit area
δ pcd
∆ cc ' = d kc2 ' − d ck2 , δ pcd ' = ,
pd
δ pcd = pcd − pcd ' and δε te , r = (ε te − ε r )
So the ∆ cc ' factor of intermediate nodes, which is
the difference in distance square between the
intermediate node to their own cluster head and to
the nearest cluster head(which is on the way
towards base station), should be less than the factor
⎡1 ⎤
ξ =⎢ [δ pcd ' (ε te + d cc2 ' ) − δε te ,r ]⎥ . (6)
⎣ ε ta ⎦
Based on this value, the intermediate nodes
involved in data transmission to base station from
cluster head, either transmit the data to its
respective cluster head or to the nearest cluster head
as mentioned in the algorithm shown section 3. Figure 6(b):Residual Energy Vs Network life time
for Flooding and RTRA for 200 nodes over 120X120
square unit area
5. SIMULATION STUDY
In simulation study we have taken the following

5
 International Journal of Reviews in Computing
© 2009-2010 IJRIC& LLS. All rights reserved.
www.ijric.org
5: Size of the data packets pd =1000 bits
6:Size of the combined packet
pcd = random() < (n − 1).1000 and
pcd ' = random() < (n − 2).1000
7: Wireless coverage of each node=7.23 unit
The nodes are distributed randomly. For cluster
formation, we have consider the wireless coverage
and find the cluster head for flooding based routing
protocol.
The residual energy of the nodes vs the network life
time is plotted on the graph shown in figure 6(a)
and 6(b).In both the scenario we found that our
proposed RTRA scheme is providing more life time
to the network.
Figure 7(a):Residual Energy Vs Network life time for
LEACH and RTRA for 80 nodes over 50X50
square unit area
Figure 7(b):Residual Energy Vs Network life time for
LEACH and RTRA for 200 nodes over 75X75
square unit area
6
IJRIC
E-ISSN: 2076-331X
Similary in case of LEACH, we have 80 nodes
deployed over 50X50(Figure 7(a)) square unit area
and 200 nodes deployed over 75X75 square unit
area, and out of which 4 and 10nodes respectively
are randomly selected (5% of total nodes) and
included in the cluster head list. The simulation
depicts that our proposed scheme is providing a
better performance in terms of extended life time
over LEACH protocol.
6. CONCLUSION
Sensor network constitutes a set of independent
Sensor nodes deployed over a specific area to sense
and transmit the environmental data. Different
flooding and cluster based routing technique are
attempted to reduce the energy consumption.
However, there is a loss of energy in redundant data
transmission in the network. The RTRA scheme is
an attempt to reduce this redundant data
transmission so as to increase the network life time.
Our mathematical observation for the factor ∆ cc '
provides the information to the intermediate nodes
for taking further decisions for routing. The
simulation study provides a better performance for
the energy conservation over the flooding based
routing and the cluster based LEACH protocol. The
frequent cluster head election and control
mechanism for traffic load is still a challenge and
left for the future scope of the work.
I. REFRENCES:
[1] Ian F. Akyildiz, Weilian Su, Yogesh
Sankarasubramaniam, and Erdal Cayirci, “A
Survey on Sensor Networks,” IEEE
Communications Magazine, 40(8) 102-114,
August 2002.
[2] M Liu et al. “An Energy aware Routing
protocol in Wireless Sensor Networks”
Sensors Vol 9, 2009, pages 445- 462.
[3] G. J. Pottie, W. J. Kaiser, “Embedding the
Internet: Wireless Integrated Network
Sensors,” Communication of ACM, vol.43,
no.5, pp. 51-58, May 2000.
[4] C.R. Lin and M. Gerla, “Adaptive Clustering
for Mobile Wireless Network,” IEEE J.
Select. Area Commun., vol 15, pp. 1265-
1275, Sept 1997.
[5] J. H. Ryu, S. Song, and D. H. Cho, “Energy-
Conserving Clustering Scheme for
Multicasting in Two-tier Mobile Ad-Hoc
Networks,” Elec-tron. Lett., vol. 37, pp. 1253-
1255, Sept 2001.
 International Journal of Reviews in Computing
© 2009-2010 IJRIC& LLS. All rights reserved.
www.ijric.org
[6] T. C. Hou and T. J. Tsai, “Distributed
Clustering for Multimedia Support in Mobile
Multihop Ad Hoc Network,” IEICE Trans.
Commun., vol. E84B, pp. 760-770, Apr 2001.
[7] Wendi Rabiner Heinzelman, Anantha
Chanfrakasan, and Hari Balakrishnam,
“Energy-Efficient Communication Protocol
for Wireless Microsensor Networks,” 2000
IEEE The Hawaii International Conference on
System Sciences Proceeding, January 2000.
[8] Huseyin O. Tan and Ibrahim K. Lu, “Power
Efficient Data Gathering and Aggregation in
Wireless Sensor Networks,” ACM SIGMOD,
pg. 66-71, 2003.
[9] A Abdolreza et al. “A Neural Network approach
for wireless sensor network power
management” IEEE International Symposium
on Reliable Distributed Systems 2009
[10]Stephanie Lindsey and Cauligi S.
Raghavendra, “PEGASIS: Power-Efficient
Gathering in Sensor Information Systems,”
2002 IEEE Aerospace Conference
Proceeding, March, 2002.
[11]Ossama Younis and Sonia Fahmy, “Distributed
Clustering for Scalable, Long-Lived Sensor
Networks”, In the 9th Annual International
Conference on Mobile Computing and
Networking, ACM MobiCom, San Diego,
CA, September 2003.
[12]M. Ettus, “System capacity, latency, and power
consumption in multihop-routed SS-CDMA
wireless network,” Radio and Wireless
Conference (RAWCON’ 98) Proceeding, 55-
58, August 1998.
[13]T. Shepard, “Channel access scheme for large
dense packet radio network,” ACM
SIGCOMM Proceeding, 219-230, August
1996.
[14] Ruchuan Wang et al. “A multipath Routing
Algorithm based on Traffic prediction in
wireless Mesh Network” Communication and
Network Vol 1, 2009, pages 82-90.
[15]P. Tillapart, T. Thumthawatworn, P.
Pakdeepinit, T. Yeophantong, S.
Charoenvikrom and J. Daengdey, “Method
for Cluster Heads Selection in Wireless
Sensor Network,” Proc. of the 2004 IEEE
Aerospace Conference, Big Sky, Montana,
USA, 2004.
[16] I.Akyildiz,W.Su, Y.Sankarasubramaniam,
E.Cayirci. "A survey on Sensor Networks,
IEEE Communications Magazine" [J]. 2002,
40(8): 102-114
[17] Qiangfeng Jiang, Manivannan D. "Routing.
Protocols for Sensor Networks"[A]. In:
IJRIC
E-ISSN: 2076-331X
Consumer Communications and Networking
Conference[C]. 2004. 93-98
[18] Wendi Rabiner Heinzelman, Anantha
Chandrakasan, Hari Balakrishnan. "Energy-
Efficient Communication Protocol for
Wireless Microsensor Networks"[A]. In:
Proceedings of the 33rd Hawaii International
Conference on System Sciences[C].2000.1-10
[19] Stephanie Lindsey, Cauligi Raghavendra.
"Data Gathering Algorithms in Sensor
Networks Using Energy Metrics"[J]. IEEE
Transactions on Parallel and Distributed
Systems, 2002, 13(9): 924-935
[20] Siva D. Muruganat han et al. "A Centralized
Energy-Efficient Routing Protocol for
Wireless Sensor Networks" IEEE Radio
Communications, 2005, 43(3): 8-13
[21] Shi Cheng. "Research and Realization of the
Key Iechnology of Wireless Sensor Network".
Nan Jing: Southeast University Radio
Engineering Department, 2006
[22] Jamal N. Al-Karaki, Raza Ul-Mustafa, Ahmed
E. Kamal, "Data Aggregation in Wireless
Sensor Networks – Exact and Approximate
Algorithms'", Proceedings of IEEE Workshop
on High Performance Switching and Routing
(HPSR), Phoenix, Arizona, USA 2004, April
18-21, 2004.
[23] Al-Karaki “Routing techniques in wireless
sensor networks: a survey” IEEE Wireless
Communication Vol 11 issue 6, 2004, pp 6-
28.
[24] C. Intanagonwiwat, R. Govindan, and D.
Estrin, "Directed diffusion: a scalable and
robust communication paradigm for sensor
networks," Proceedings of ACM MobiCom
'00, Boston, MA, 2000, pp. 56-67.
[25] Yi Feng Zhu et al. “Localization using Neural
Network in Wireless Sensor Network” ACM
International Conference Mobiware, 2009
[26] Zhihao Guo et al. “Mobile Adhoc Network
Proactive Routing with delay prediction using
neural network” Wireless Network Springer
Science 2009.