International Journal of Engineering Trends and Technology (IJETT) – Volume 12 Number 7 - Jun 2014
Efficient Network Reorganization to Reduce
Delay in Data Collection
Mahadevi1 Sanjay Kumar C.K2
1
1,2
Student, 2 Asst.prof
Dept. of CSE, National Institute of Engineering, Mysore, Karnataka, India
Abstract
Wireless sensor network consists large numbers of wireless sensor nodes. Nodes are used to collect information from their sensing
areas. In this paper, efficient network reorganization to reduce delay in data collection is proposed. The objective is to reduce the delays in
the data collection processes of wireless sensor networks. A network formation algorithm is used to reorganize network structure while
keeping communication distances among sensor nodes. Simulation results shows the network formation algorithm improve data collection
rate in wireless sensor network.
Keywords: Wireless sensor network, communication distance, network formation algorithm, data collection rate.
Introduction
Wireless sensor network (WSN) refers to a group
of sensors nodes for monitoring and recording the physical
conditions of the environment and organizing the collected
data at a central location. WSNs measure environmental
conditions like temperature, sound, pollution levels,
humidity, wind speed and direction, pressure, etc. Figure 1
shows a block diagram of a sensor node [10].
P
O
W
E
R
S
O
U
R
C
E
Transceivers
NODE
1
Micro-controller
ADC
External memory
NODE
2
Fig 1: Block Diagram of Sensor Node
A sensor node is a node in a wireless sensor network that is
capable of performing some processing, gathering sensor
information and communicating with other connected nodes
in the network. The controller performs tasks, processes
data and controls the functionality of other components in
ISSN: 2231-5381
the sensor node. While the most common controller is
a micro controller. The functionality of both transmitter
and receiver are combined into a single device known as
a transceiver. The operational states are transmitted, receive,
idle, and sleep. Memory are the on-chip memory of a
microcontroller
and Flash
memory—off-chip RAM is
rarely, Flash memories are used due to their cost and storage
capacity[10]. Sensors are hardware devices that produce a
measurable response to a change in a physical condition like
temperature or pressure. Sensors measure physical data of
the parameter to be monitored. The continual analog
signal produced by the sensors is digitized by an analog-todigital converter and sent to controllers for further
processing. A sensor node should be small in size, consume
extremely low energy. Energy consumption of the network
with proposed algorithm is also simulated.
LEACH is one of the most popular clustering
algorithms used in WSNs to increase the network lifetime
.LEACH is an adaptive, self organizing and clustering
protocol. It introduces the concept of Rounds. LEACH
assumes that the BS is fixed and located far from the
sensors, all sensor nodes are homogenous and have limited
energy source, sensors can sense the environment at a fixed
rate and can communicate among each other, and sensors
can directly communicate with BS. The idea of LEACH is
to organize the nodes into clusters to distribute the energy
among the sensor nodes in the network, and in each cluster
there is an elected node called a cluster head (CH)[5].
http://www.ijettjournal.org
Page 337
International Journal of Engineering Trends and Technology (IJETT) – Volume 12 Number 7 - Jun 2014
Data collection process
Step 3:
Once the distance is known, distance can be compare with
Sensors nodes are light weighted and require
range; if it less than then connection link is established and
battery power to operate. Data collection process means
time slot is allocated. Otherwise it is discarded.
collecting data from all the sensor nodes [4]. A sink or base
Step 4:
station acts like an interface between users and the network.
Timeslot is allocated sequentially from base station to the
Whenever there is an event occur the data will be sent to
node that is directly connected. The other nodes are
base station with the minimum delay. The path may be
connected to the clustering and assign the time slot from
created from base station to sensor node. In fig 2 shows the
initial value but the cluster to node assigned timeslot cannot
multiple data processes, the base station will collect the data
be allotted for the cluster members.
packets from the sensor nodes with minimum delay [3].
Example: consider a network of 10 sensor nodes and the
communication range is 300.
12345
n=10 range 300
6
3
5
1
2
BS
t=6
t=8
9
4
t=1
t=3
3
Base station
1
t=2
t=7
t=5
Sensor Node
2
Fig 2: Data collection process
To reduce the delay in communication among consecutive
sensor nodes we use the following algorithm. In this paper
two
1. Network formation algorithm [1].
2. DADCNS algorithm [2].
t=4
7
5
t=1
4
Methodology
Network formation algorithm
The energy consumption of an ordinary wireless sensor
node is a function of its communication distance. The
objective of the network formation algorithm is to construct
the proposed network structure while keeping
communication distances among connected nodes short [1].
The idea of the proposed network formation algorithm is to
first consider the network as a fully connected network and
then construct the proposed network structure by removing
unnecessary edges. The procedures of the network
formation algorithm as follows
Step 1:
Consider a network of n number of nodes and give the
commutation range as inputs.
Step 2:
According to given data first we find distance between node
to base station and node to node. Euclidean Distance
between nodes is computed as and distance is stored in
matrix. For finding the distance we use a formula
Distance = ( 1 − 2) + ( 1 − 2)
ISSN: 2231-5381
8
Fig 3 example of network formation
DADCNS algorithm
A network with DADCNS (bottom up Approach) will be
organized into several clusters. A cluster with a cluster head
(CH) of a rank p can accommodate a maximum of 2p-1
cluster members (CMs).
Step 1:
Consider a network of n number of nodes and give the
commutation range as inputs.
Step 2:
According to given data first we find distance between node
to base station and node to node. Euclidean Distance
between nodes is computed as and distance is stored in
matrix. For finding the distance we use a formula
Distance = ( 1 − 2) + ( 1 − 2)
http://www.ijettjournal.org
Page 338
International Journal of Engineering Trends and Technology (IJETT) – Volume 12 Number 7 - Jun 2014
Step 3:
Simulation Results
Once the distance is known, distance can be compare with
range, if it less than then connection link is established and
In this section the network formation algorithm is
time slot is allocated. Otherwise it is discarded.
compared with DADCNS (a Delay aware data collection
data collection network structure).A wireless sensor network
Step 4:
having n number of nodes and it can be deployed randomly.
Timeslot is allocated sequentially from base station to the
The distance between base station to a node and cluster to
node that is directly connected. the other nodes are
node can be calculated using the communication range.
connected to the cluster to node and assign the time slot
from continuously.
Data collection duration of network with the
proposed network formation algorithm and DADCNS as
Example: consider a network of 10 sensor nodes and the
shown in figure (5).
communication range is 100.
A wireless sensor node can be considered as a
device built up of three major units, namely the microcontroller unit (MCU), the transceiver unit (TCR), and the
sensor board (SB). Each of these units will consume a
Example: n=10 range=300
certain amount of energy while operating. Energy
consumption of network with the proposed network
formation algorithm and DADCNS as shown in figure (6).
t=8
t=6
BSS
9
6
t=1
t=3
3
1
t=2
t=7
t=5
2
t=4
7
5
Fig 5 data collection period
t=9
4
8
Fig 4 example of DADCNS
Implementation
Implementation phase should perfectly map the
design document in a suitable programming language in
order to achieve the necessary final and correct product.
Often the product contains flaws and gets ruined due to
incorrect programming language chosen for implementation.
In this project, for implementation purpose Java is chosen as
the programming language. Netbean is a multi-language
software development environment comprising an integrated
development environment (IDE) and an extensible plug-in
system. It is written primarily in Java and can be used to
develop applications in Java. The Java Foundation Classes
(JFC) consists of five major parts: AWT, Swing, and
Accessibility, Java 2D, and Drag and Drop. Java 2D has
become an integral part of AWT, Swing is built on top of
AWT, and Accessibility support is built into Swing.
ISSN: 2231-5381
Fig 6 energy consumption
Conclusion
Without degrading the duration of single data collection
network formation algorithm can take up more data as
compare to delay aware data collection network structure
given the same period of time and network formation
algorithm can keep the communication distances among
sensor nodes as short as possible. Thus reducing the energy
consumption of the overall network.
http://www.ijettjournal.org
Page 339
International Journal of Engineering Trends and Technology (IJETT) – Volume 12 Number 7 - Jun 2014
Reference
[1] Chi-tsun cheng, chi k.tse, fellow, G. Eason, B. Noble, and I. N.
Sneddon, “A delay-aware network structure for wireless sensor networks
with consecutive data collection processes,” IEEE Sensors Journal, vol. 13.
No. 6, June 2013.
[2] C.-T. Cheng, C. K. Tse, and F. C. M. Lau, “A delay-aware data
collection network structure for wireless sensor networks”. IEEE Sensors
J., vol. 11, no. 3, pp. 699–710, Mar. 2011.
[3] R. Elavarasan1, A. Perpectual Steffi2 “Energy Efficient Data
Collections Structure for Wireless Sensor Networks” International Journal
of Science and Research (IJSR) ISSN (Online): 2319-7064
[4] Ms.Aruna.G.R1, Mr.SivanArulSelvan2. “A Survey on Delay-Aware
Network Structure for Wireless Sensor Networks with Consecutive Data
Collection Processes” International Journal of Engineering Trends and
Technology (IJETT) – Volume 7 Number 4- Jan 2014
[5] “An application specific protocol architecture for wireless micro
sensor networks,” W. B. Heinzelman, A. P. Chandrakasan, and H.
Balakrishnan
[6] Chao Wang, Huadong Ma, Member, IEEE, Yuan He, Member, IEEE,
and Shuguagn Xiong,“ Adaptive Approximate Data Collection For
Wireless Sensor Networks,”. IEEE Trans.J.vol.26, no.6, June 2012.
[7] C.-T. Cheng, C. K. Tse, and F. C. M. Lau, “An energy aware scheduling
scheme for wireless sensor networks,” IEEE Trans. Veh. Technol., vol. 59,
no. 7, pp. 3427–3444, Sep. 2010.
[6] H. R. Karkvandi, E. Pecht, and O. Yadid-Pecht, IEEE Sensors J., vol.
11, no. 12, pp. 3359–3367, Dec. 2011.“Effective lifetime-aware routing in
wireless sensor networks”.
[9] Mohammad Hosseien Anisi, Abdullah, Shukor Abd Razak,” Energy
efficient data collection in wireless sensornetworks” October 2011.
[10] http://en.wikipedia.org/wiki/Sensor_node
Author profile
Mahadevi is an M.Tech student in the department of
computer science in NIE, Mysore affiliated by visvesvaraya
Technological University. Her area of intersect is wireless
sensor networks.
Sanjay Kumar is an assistant professor in the department of
Computer science in NIE, Mysore affiliated by Visvesvaraya
Technological University.
ISSN: 2231-5381
http://www.ijettjournal.org
Page 340