DESIGN AND IMPLEMENTATION ISSUES OF CLUSTERING IN

WIRELESS SENSOR NETWORKS

ASHWINI V R
Ece Department, Don Bosco Institute Of Technology, Kumbalgud, Mysore Rd,
Bangalore, Karnataka 560074, India

MAMATHA U
Ece Department, Don Bosco Institute Of Technology, Kumbalgud, Mysore Rd
Bangalore, Karnataka 560074, India

ABSTRACT: Recent advances in semiconductor, networking and material science technologies

are driving the deployment of large-scale wireless sensor networks (WSNs).The energy issue has
been tackled in the project by using k means clustering algorithm which takes into consideration
the nodal residual energy during cluster head election. This increases the lifetime of a network.
Besides prolonging the network lifetime, fulfilling security requirements is vital as wireless sensor
networks are generally applied in crucial applications where security plays a major role. The data
from the cluster head has been encrypted using Slepian wolf coding. Encrypted data transmission
also plays an important role in an energy constrained Wireless sensor networks. An attempt has
been made to increase data efficiency by increasing network lifetime. The experimental results of
the project, reduces the energy consumption by 40% and the delay can be minimized up to 0.47bps
which increases data transmission by 15%.

KEYWORDS: Slepian-Wolf coding, transmit power adaptation, rate allocation, transmission

duration, circuit power consumption, optimization, residual energy

INTRODUCTION

A wireless sensor network (WSN) consists of spatially distributed autonomous sensors which are
capable of monitoring physical or environmental conditions, such as temperature, sound, pressure,
etc. and then passing their data[1]through the cluster head to a trusted authority which is a base
station (BS). Sensor networks contain battery powered wireless devices. The WSN has several
characteristics such as they should be scalable to large scale of deployment, be able to withstand
harsh environmental conditions, ease of use, power consumption constraints for nodes using
batteries or energy harvesting. The outcome of this is the power minimisation and the bit rate is
increased due to increased number of transmissions. Slepian wolf coding finds its applications in
weather forecast, monitoring temperature[2], for image and video compression for mobile
telephones and image processing A sample image is taken as a reference, since the image size is
large, the imagetransformations is carried out so that the data is transmitted in the form of packets
to the nodes. The nodes communicate with the cluster head. Encryption is performed at cluster
head by Slepian wolf coding technique. The outcome of this is the decreased file size, support for
more number of transmissions and a higher bit rate.
Clustering Algorithm
It is a vector quantization method, used for clustering analysis in data mining. k-means clustering
[3] goal is to partition groups into l clusters in which each group belongs to the cluster with the
nearest mean, serving as a prototype of the cluster.

Figure 1 k means algorithm [4]

Slepian Wolf Coding

The Slepian-Wolf theorem deals with the lossless compression of two or more correlated data
streams. The individual correlated stream is encoded separately and then the compressed data from
all these encoders are jointly decoded by a single decoder as shown in The systems are said to use
Slepian-Wolf coding [3], which is a distributed source coding. In lossless compression, the source
outputs can be constructed from the compression version with arbitrarily small probability of error
by suitably choosing a parameter in the compression scheme used.

Figure2 Slepian Wolf coding

DESIGN

Large systems can be divided into smaller subsystems that provide related set of services. The
design process of identifying these subsystems and establishing a base work[5] for system control
and communication is named an architectural design and the outcome of this design process is the
software architecture description. The design process of architecture establishes a basic framework
for a system which is included in identifying the major components of the system and
communication between the different components in a system[6].

The figure 3 shows the blocks required for the project. Each block represents a module that is to be
developed. Each module is a function [7] that is to be performed and it comprised of system
smaller tasks.

347
Figure 3 System Architecture of Energy Efficient Data Maximization Using Slepian Wolf Coding

System Set Up
A system is been installed with operating system: Windows 7, 64-bit version and the tool is Mat
Lab10A and above.

Network Initialization
It means that a network is created by initializing random number of nodes in a sensor environment.
The nodes created have the information about the identity, distance of the neighboring nodes and
the distance to the cluster. It mainly deals with the number of nodes and the cluster head.

Cluster Formation
Once if the nodes identity and distance of the neighboring nodes are taken into account for the
cluster head selection, the value is displayed in an array. If the value stored in an array is greater
than the mean value, the cluster head is selected. This is basically done from a group of randomly
deployed sensor nodes. Each of these cluster heads carry the information which has to be
encrypted and transmitted to the sink.

Data Transfer
The information is transmitted in the form of packets [26] to the cluster head. The packets are
equally divided and distributed to each of the cluster head. Slepian wolf coding is been performed
to encrypt the data stored in a cluster head. With the joint decoder the data is decoded and the
information is transmitted to the sink.

DETAILED IMPLEMENTATION

This section discusses the implementation details of the project. The setting up of network,
clustering and data transfer implementation details has been discussed.

Set Up of Network
This explains the nodes are generated in the network depending on the node information and
distance of the neighboring nodes. The sensor nodes are randomly distributed in a network, each of

348
these nodes have the identity and x y locations. These are stored in an array. It specifies the
random number of nodes present in a network.

Clustering and Data Transfer

It describes the clustering and data transfer process which follow after the set up parameters have
been distributed by the base station. A group of nodes which has the id and node information is
transmitted to the cluster head. A cluster head is selected based on the comparison between the two
mean values. If it matches with the old variable then a cluster head is been selected. A sample
image [25] is taken as a reference; It has to be converted to gray image, resized to 512*512 bits.
These bits are transmitted in the form of a packets to each of the cluster head which is been
selected. The encryption is carried out at each of these cluster head. The data has to be decoded
and hence the data transmissions take place through the sink.

EXPERIMENTAL RESULTS

Evaluation Metric
The main metric to evaluate performance is the data received at the base station from the sensor
nodes. Higher data rate is achieved for less number of nodes. Delay is minimised for the given set
of nodes. Another important metric is the number of times a node is selected as a cluster head.
This shows the fair distribution of cluster heads among all the sensor nodes.

Performance analysis
The figure 4 shows a single hop scenario in which data is transmitted through the network by
considering 5 cluster heads. The data transmission takes place from the cluster head to the base
station.

Figure 4 A single hop transmission to a base station.

The project has implemented energy efficient network in which the amount of energy available at
each number of nodes are specified. As the nodes increases the energy consumption also increases.
This gives the comparison of SW encoding and the normal encoding carried out at each nodes.

349
 Figure 5 Overall energy cost in the network

The project has implemented that the power can be minimised for a given set of nodes. The Figure
5 shows a comparison between Slepian Wolf encoding and encoding as the number of nodes
increases, the delay also increases. The delay is minimised to 0.47bps. The average delay is
measured as the ratio of fixed packets length to the time taken.

CONCLUSION

This work addresses the important issue of energy efficient data maximization in an otherwise
wireless sensor network. In k means algorithm, a node with a small amount of energy has the same
probability of becoming a cluster as that of a node with high energy. Slepian wolf coding is a
powerful coding technique to increase the data rate. The project enhances security which is very
crucial in hostile environments such as battlefield scenarios in WSNs. It can be used in banking
systems etc. this is achieved by using Slepian wolf coding. The project employs the spatial
correlation algorithm to minimise the redundant data.

Future Enhancements
Cluster head selection module can be enhanced to avoid election of multiple cluster heads.

The project can be extended for real world applications using actual sensors, Many other strong
encryption algorithms like AES, DES, RS can be used alternately.

The project can be enhanced to measure the actual energy of nodes and use this for better mean
values.

350
REFERENCES

D. Rodenas-Herraiz, A.J. Garcia-Sanchez, F. Garcia-Sanchez, J. Garcia-Haro, (2013)Current

Trends in Wireless Mesh Sensor Networks: A Review of Competing Approaches Sensors, pp.
5958-5995.
Zhenz Hong Huang ; Jun Zheng(2012) A Slepian-Wolf coding based energy-efficient clustering
algorithm for data aggregation in wireless sensor networks International Conference on
Computer Communications, china, ISSN : 1550-3607, pp.198-202.
Mehta, R., Pandey, A. and Kapadia, P (2012).Reforming Clusters using C- LEACH in Wireless
Sensor Networks, International Conference on Computer Communication Informatics,
Coimbatore, India, Vol. 6, pp.1-4.
Li, F., Di Zhong, and Takagi, T.(2012),Practical Identity Based Signature for Wireless Sensor
Networks,IEEE Wireless Communication Letters, Vol. 6, pp. 637-640.
Ying Li, Liping Du, Guifen Zhao, Feiduan,(2012) Research on Lightweight Digital Signature
Scheme in Wireless Sensor Network,2 nd International Conference on Computer Science and
Network Technology, Changchun, pp.1154-1157
M. Hussaini, H. Bello-Salau, A. F. Salami, F. Anwar, A. H. Abdalla, Md. Rafiqul Islam,
(2012)Enhanced Clustering Routing Protocol for Power-Efficient Gathering in Wireless
Sensor Network, IJCNIS :International journal of communication networks and information
security IJCNIS, vol. 4, No.1, pp. 18-28
Pradeepa K., Anne W. R., and Duraisamy S.,(2012) Design and Implementation Issues of
Clustering in Wireless Sensor Networks,International Journal of Computer Applications,
Vol.47, pp.1188-1191.

351