International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 5 Issue: 6 1317 1319

_______________________________________________________________________________________________
Geographic Routing in Clustered Wireless Sensor Network

Shaziya Parveen Umar Khan Dr. A. S. Khan

Associate Professor, Electronics & Telecommunication
Student, Electronics & CommunicationDepartment
Anjuman College of Engineering & Technology
Anjuman College of Engineering & Technology
Nagpur,India
Nagpur,India
e-mail: acetsajjadsir@yahoo.co.in
e-mail: shaziazeem1992@gmail.com

AbstractA WSN is a network of gadgets that is known as nodes. It consists of sensor nodes distributed over a geographical area. The
main task of a sensor node is to sense and collect data from certain domain, process them and transmit it to the sink where the application lies.
Clustering provides a productive way to prolong the lifetime of WSN. In this paper, we first propose a distributed technique called energy
efficient homogenous clustering technique that selects cluster heads to create a connected backbone network. EHC selects CHs on the basis of
their residual energy and utility of sensor to its neighbors. Then we propose a route optimization technique in WSNs to make the best use of
routing path among obstacles using Dijkstras shortest path algorithm. The simulation results show a reduction in average hop count, packet
delay, and energy consumption of WSNs.

Keywords-Clustering, geographic routing, network lifetime.

__________________________________________________*****_________________________________________________

I. INTRODUCTION EHC
Technique
A Wireless Sensor Network (WSN) is a network comprising
large number of wirelessly connected heterogeneous sensors
which are spatially distributed across an interested field.
WSNs have their utility in many fields such as plant
Residual Utility of the
monitoring, battlefield surveillance, fire detection and gas sensor to its
Energy
detection. The important issue in WSNs is to minimize the neighbors
energy consumption along with network connectivity as the
nodes are battery powered. Researchers investigated Cluster-
based routing to get network scalability, which prolongs
Select Cluster
network lifetime [2]-[4]. Clustering facilitates distribution of
Head
control over the network. Each cluster has a cluster head (CH)
which acts as a co-ordinator and transmits the data to sink
node. If all the sensors in the FOI can reach to the sink then Collect data
the network is said to be connected. In geographic routing, a from members
sensor can make routing decision based on the location of
itself and its neighbors.
In this paper, we propose an energy efficient homogeneous Send data to sink
clustering scheme and a route optimization scheme in WSNs
among obstacles. Following are the contributions in this area:
Route Optimization
1] We propose Energy-efficient Homogenous Clustering
Technique
technique, which is a distributed technique that selects CHs to
form connected network. In this technique, a sensor becomes a
CH if utility of the sensor is higher than its neighbors. Use Dijkstras shortest
2] We propose a Route Optimization Technique in clustered path algorithm
WSNs among obstacles. ROT utilize Dijkstras shortest path
algorithm to provide an energy efficient path between CHs and
Reduce the energy consumption
sink.
Fig: Flow Chart of proposed technique

1317
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 1317 1319
_______________________________________________________________________________________________
II . MODULE DESCRIPTION III. RESULT AND SIMULATION
Module 1: Topology Formation In this section, comparison of performance of our proposed
In this module, wireless sensor nodes are deployed over a system with existing system is given in detail. We have
region where some phenomenon is to be monitored. Each node implemented our work on network simulation tools i.e. NS2.
in the Wireless Sensor Network maintains the details of Fig 1 shows the simulation graph of packet loss. It shows that
neighbor node. by using Energy efficient Homogeneous Clustering (EHC)
technique packet loss during data transfer is reduced when
compared with existing technique.
In the graph the green part shows the packet loss without EHC
technique, whereas the red part shows that packet loss is
reduced with EHC technique.

Module 2: Cluster Formation

In this module, Nodes are formed as clustered WSN using the
EHC technique. We elect more CHs to ensure that the CHs
can form a connected network.

Fig 1: Packet Loss

Fig 2 shows the simulation graph of end to end delay. It

shows that by using Energy efficient Homogeneous Clustering
(EHC) technique end to end delay during data transfer is
reduced when compared with existing technique.

Module 3: Geographic Routing

Data routing between source and destination using route
optimization technique among obstacles.

Fig 2: End to End Delay

Fig 3 shows the simulation graph of throughput. It shows

that by using Energy efficient Homogeneous Clustering (EHC)
technique throughput is increased when compared with existing
technique.

1318
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication
Volume: 5 Issue: 6
_______________________________________________________________________________________________
Fig 3: Throughput
Fig 4 shows the simulation graph of packet delivery ratio
(PDR). It shows that by using Energy efficient Homogeneous
Clustering (EHC) technique packet delivery ratio during data
transfer is reduced when compared with existing technique.
ISSN: 2321-8169
1317 1319
REFERENCES
[1] J. H. Lee,T. Kwon, and J. Song, Group connectivity
model forindustrial wireless sensor networks,IEEE Trans.
Ind. Electron., vol. 57,no. 5, pp. 18351844, May 2010.
[2] Z. Ha, J. Wu, J. Zhang, L. Liu, and K. Tian, A general
self-organizedtree-based energy-balance routing protocol for
wireless sensor network,IEEE Trans. Nucl. Sci., vol.61,
no. 2, pp. 732740, Apr. 2014.
[3] D. C. Hoang, P. Yadav, R. Kumar, and S. Panda,
Real-time imple-mentation of a harmony search
algorithm-based clustering protocol for energy-efficient
wireless sensor networks, IEEE Trans. Ind. Informat.,vol.
10, no. 1, pp. 774783, Feb. 2014.
[4] M. Tarhani, Y. S. Kavian, and S. Siavoshi, SEECH:
Scalable energyefficient clustering hierarchy protocol in
wireless sensor networks,IEEE Sensors J. , vol. 14, no. 11,
pp. 39443954, Nov. 2014.
[5] P. T. A. Quang and D.-S. Kim, Enhancing real-time
delivery ofgradient routing for industrial wireless sensor
networks,IEEE Trans. Ind. Informat, vol. 8, no. 1, pp. 61
68, Feb. 2012.

Fig 4: Packet Delivery Ratio

Comparison Table of EHC technique with Existing

Technique

Sr.No Parameters Time With Without

(sec) EHC EHC

1 Packet 15 67 73
Loss
(units)
2 Delay 15 13 17
(ms)
3 Throughput 20 9.7 5.5
(kbps)
4 PDR 5 1 0.9
(%)

IV. CONCLUSIONS
We examined the need of clustering and routing in wireless
sensor network.From results, it is concluded that the proposed
technique reduces average hop count,packet delivery ratio,
delay and energy consumption.

1319
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________