Matrix Based Energy Efficient Routing in Static Wireless Sensor Networks

International Journal of Sensor and Related Networks (IJSRN)
ISSN 2320-5571, Volume.2,Issue.1 , May 2014

1

MATRIX BASED ENERGY EFFICIENT
ROUTING IN STATIC WIRELESS SENSOR
NETWORKS
Ronald David. J
#
, Niranjan. R
#
, Natraj. P
#,
Dr. K. Batri
#
#
Electronics and Communication Engineering, PSNA College of Engineering and Technology
Dindigul, India.
1
ronaldtaffy92@gmail.com
3
natraj.sweet@gmail.com
2
niranj92@gmail.com

Abstract recent developments in the area of micro-sensor
devices have accelerated advances in the sensor networks field
leading to many new protocols specifically designed for
wireless sensor networks. Wireless sensor networks with
hundreds to thousands of sensor nodes can gather
information from an unattended location and transmit the
gathered data to a particular user, depending on the
application. These sensor nodes have some constraints to their
limited energy storage capacity and computing power. There
are also some problems of interference when the sensors are
placed in a cluster. And this project gives the brief idea about
static routing in wireless sensor networks by scheduling and
minimizing the traffic by routing protocols, timing the sensors
based on the available sensor network and minimizing the
interference sensed, by using our defined algorithm and
calculating the throughput, packet delivery ratio, packet loss
and energy consumption by comparing the existing model and
our proposed model. Thus making this system interference-
free and energy efficient.

Keywords matrix, energy efficient, interference, wireless
sensor networks, sleep and awake.
.
I. INTRODUCTION
A wireless sensor network (WSN) of spatially
distributed autonomous sensors to monitor physical or
environmental conditions, such as temperature, sound,
pressure, etc. and to cooperatively pass their data through
the network to a main location. The more modern networks
are bi-directional, also enabling control of sensor activity.
The development of wireless sensor networks was
motivated by military applications such as battlefield
surveillance; today such networks are used in many
industrial and consumer applications, such as industrial
process monitoring and control, machine health
monitoring, and so on.
The WSN is built of "nodes" from a few to several
hundreds or even thousands, where each node is connected
to one (or sometimes several) sensors. Each such sensor
network node has typically several parts: a radio
transceiver with an internal antenna or connection to an
external antenna, a microcontroller, an electronic circuit for
interfacing with the sensors and an energy source, usually a
battery or an embedded form of energy harvest3ing. A
sensor node might vary in size from that of a shoebox
down to the size of a grain of dust, although functioning
"motes" of genuine microscopic dimensions have yet to be
created. The cost of sensor nodes is similarly variable,
ranging from a few to hundreds of dollars, depending on
the complexity of the individual sensor nodes. Size and
cost constraints on sensor nodes result in corresponding
constraints on resources such as energy, memory,
computational speed and communications bandwidth. The
topology of the WSNs can vary from a simple star network
to an advanced multi-hop wireless mesh network. The
propagation technique between the hops of the network can
be routing or flooding.
http://ijsrn.info/article/IJSRNV2I101.pdf
2

Figure 1: Multi-hop wireless sensor network
Recent advances in semiconductor, networking and
material science technologies are driving the ubiquitous
deployment of large-scale wireless sensor networks
(WSNs). Together, these technologies have combined to
enable a new generation of WSNs that differ greatly from
wireless networks developed and deployed as recently as 5
to 10 years ago. Todays state-of-the-art WSNs have lower
deployment and maintenance costs, last longer and are
more rugged. They are finding their way into numerous
applications in our homes, work places and beyond,
bringing new sources of information, control and
convenience to our personal and professional lives.
While the market demand for WSNs was strong,
moving beyond these limited applications proved to be a
challenge. The military, science/technology and heavy
industrial applications of previous decades were all based
on bulky, expensive sensors and proprietary networking
protocols. These WSNs placed a premium on
functionality and performance, while other factors such as
hardware and deployment costs, networking standards,
power consumption and scalability fell to the wayside.
The combination of high cost and low volume prevented
the widespread adoption and deployment of WSNs into a
broader range of applications.
The main characteristics of a WSN include:
1. Power consumption constraints for nodes using batteries or
energy harvesting
2. Ability to cope with node failures
3. Mobility of nodes
4. Communication failures
5. Heterogeneity of nodes
6. Scalability to large scale of deployment
7. Ability to withstand harsh environmental conditions
8. Ease of use

II. LITERATURE SURVEY
A 2-level hierarchical routing protocol (LEACH)
which attempts to minimize global energy dissipation and
distribute energy consumption evenly across all nodes. The
purpose of the network is to collect data through sensing at
an axed rate (i.e. there is always something to send) and
convey it to the base station. The raw data is too much and
must be locally aggregated into a small set of meaningful
information. [1].
The major energy efficiency issues in ad-hoc networks
(not only sensor networks) which are dened as
infrastructure less networks that require multiple hops for
connecting all the nodes to each other. A useful distinction
presented in the paper refers to whether energy is treated as
a cost function or as a hard constraint. In the former case,
the objective of the designer is to minimize the amount of
energy per communication task, treating energy as an
expensive but inexhaustible resource. However, when
energy is a hard constraint, the designer must keep in mind
that it is a limited resource that will be exhausted. In this
case, the designers task is more complicated since he has
to satisfy convicting objectives: maximizing the longevity
of the network vs communication performance
(throughput, total data delivered, etc.). [2].
Sensor networks to be deployed in an ad hoc fashion,
with individual nodes remaining largely inactive for long
periods of time, but then becoming suddenly active when
something is detected. S-MAC uses three novel techniques
to reduce energy consumption and support self-
configuration. To reduce energy consumption in listening
to an idle channel, nodes periodically sleep. Neighbouring
nodes form virtual clusters to auto-synchronize on sleep
schedules. On a source node, an 802.11-like MAC
consumes 26 times more energy than S-MAC for traffic
load with messages sent every 110s. [3].

A protocol for node sleep scheduling that guarantees a
bounded-delay sensing coverage while maximizing
network lifetime. The framework is optimized for rare
event detection and allows favourable compromises to be
3

achieved between event detection delay and lifetime
without sacrificing (eventual) coverage for each point. a
connectivity maintenance protocol is proposed to minimize
the delay of multi-hop delivery to a base-station. The
resulting sleep schedule achieves the lowest overall target
surveillance delay given constraints on energy
consumption. [4].

In most of the cases whenever data exchange is not
required we put the low power radio transceiver in
Sleep Mode, which is an effective energy-conserving
operation. But in ideal case the system should be
switched off as soon as there is no communication
(data transfer) and should be resumed as soon as a
new data packet becomes ready to transmit or receive. In
this way nodes fluctuate between active and sleep mode
depending upon the network activity. This behaviour is
termed as Duty Cycling. However this technique is
unconscious of the data that are sampled by the sensor
nodes. [5].

III. PROBLEM DESCRIPTION
Now, after the developments in their size and cost,
now we face the major problem in handling these tiny
sensors more efficiently. This includes the way in which
we handle these wireless sensor networks. Their energy
consumption, interference, packet data loss, packet delivery
ratio, throughput and their routing process, are the main
considerations for using these sensor networks more
efficiently.
Now we propose a solution for making these wireless
sensor networks more efficient and subtle for all purposes.
This solution is based on the matrix based proposal for
making the wireless sensor networks energy efficient and
interference free. This helps in making the wireless sensor
networks more efficient as the interference, packet loss are
reduced completely. This proposal also helps in energy
consumption as the nodes in these sensor networks are not
awake for the complete process, instead only very few
nodes are active during a process and the other nodes in the
sensor network will be in the sleep state, considering the
process in account.
Now we define an algorithm based on the sensor
placements.
Arrangement of sensor in a perfect square form.
(I.e. so that they place sensor is in the form of m*m, where
m=n)
Co-ordinate and separate the sensors for a 3*3 matrix
formation among the given m*n sensor placement.
Define the sensors for awake and sleep state with respect to
time.
Calculate and compare the interference in the proposed
system and the existing model.
Now, as soon as the sensors are coordinated and
separated based on the 3*3 formation, name the nodes to
stay awake and to sleep.
As soon as the nodes are named , the system is
supposed to make the impact as the algorithm makes the
system interference- free and make the system energy
efficient as not all the nodes in the sensor system is ON.
A. Descriptive diagram for algorithm explanation for
9*9(81) sensors
In figure 1 we see that the 1
st
sets of nodes are in
wakeup state and all other nodes are in sleep state. As only
here 9 sensors are ON the energy consumption is low and
also it is interference-free.

Figure 2. 1
st
sets of active nodes
4

In figure 2 we see that the 2
st
sets of nodes are in
wakeup state and all other nodes are in sleep state.

Figure 3: 2
nd

Figure 4: Last

Similarly in figure 3 we see that the last sets of nodes
are in wakeup state and all other nodes are in sleep state.

B. NAMING OF NODES:
Here, we have the possibilities of certain exception
cases so we tend to name the nodes with respect to the
matrix terminology.
The first sets of nodes which are made to be awake are
termed as S1.
The other nodes which are made to be awake
simultaneously after the first set of nodes are named
respectively as S2, S3. S9.

C. EXCEPTIONAL CASES:
Here we explain about the best case and the worst case
scenarios that our system implies us. Even though we name
the exceptions as the worst case scenario, we tend to say
that as the best when compared with the current existing
system.
The possible cases:
1. The matrix formation with the multiple of 3.
2. The matrix formation which doesnt form a
perfect square formation or result in the multiples
of 3.
3. The matrix formation with a perfect square
formation but not aligned with the multiple of 3.

(Note: point 1 makes up for the best case scenario and
points 2 & 3 for the worst case scenario.)

Best case scenario:

5

Figure 5: 3*3 Matrix formation
Worst case scenario :

1. Case 1:

Figure 6: matrix which is neither a perfect square nor a multiple of 3.

2. Case 2:

Figure 7: a perfect square formation without the multiples of 3.
There are few exceptional cases that have to be
considered while naming the nodes in a worst case
scenario.
i. Case A:
In this case we see about the sensor placement
where there is a possibility of void matrix formation
which is neither a perfect square or a multiple of 3.
For this case we tend to name the nodes carefully for
the nodes to be awake and sleep with the preferred
algorithm. (With respect to the 3*3 group, we name
the 4
th
column as, C1=C4, C2=C5, etc. respectively
w.r.to 3*3 formation.)

Figure 8: matrix which is neither a perfect square nor a multiple of 3.

ii. Case B:

When the sensor placement is not in the multiples of 3,
few set of nodes will be neglected as the perfect square
sensor format is grouped based on 3*3 matrix
terminology.
So, when we face these problems we tend to name the
first set of nodes that are not grouped with as the
column elements of the first set of 3*3 matrix.
(i.e. C1 = C10 and C1*T= R10)
(C2=C11 and C2*T = R11, etc. with respect to the 3*3
matrix formation)

6

FIGURE 9: 10*10 SENSOR PLACEMENTS

D. RESULTS AND DISCUSSION

I. Result-1

Figure 10: Result of 1
st
set of active nodes

The simulation result has been shown in the above
figure as per our defined algorithm. The above figure is the
network animator result of 1
st
set of active nodes where the
nodes 90, 89, 88, 87, 86, 85, 84, 83, and 82 are active and
the other nodes are in the sleep state. And here the routing
is also performed from node 90 to 89, 89 to 88, 88 to 9 and
so on.

II. Result-2

Figure 11: Result of last set of active nodes
The above figure is the network animator result of last
set of active nodes where the nodes 18, 17, 16, 15, 14, 13,
12, 11, and 10 are active and the other nodes are in the
sleep state. And here the routing is also performed from
7

node 18 to 15, 15 to 12, 12 to 9 and similarly from 17 to
13, 13 to 11, 11 to 9 and so on.

III. Performance analysis
Below figures shows the graphical representation of
the simulation result. The below are the graphs obtained for
Throughput vs. Time, Packet loss vs. Time, Packet
Delivery Ratio (PDR) vs. Time, and Energy vs. Time. And
in these graphs the green line indicates the proposed model
and the red line indicates the existing model.

A. Graph-1: Packet loss vs. Time

Figure 12: Packet loss vs. Time
In the above graph, we see that there are packet losses
in the existing system and no packet losses in the proposed
system.
B. Graph-2: Throughput vs. Time

Figure 13: Throughput vs. Time
In this graph we see that the throughput is maximum in
the case of proposed system than it is in the existing
system.
C. Graph-3: Energy vs. Time

8

Figure 14: Energy vs. Time
In this graph we see that the energy consumption is
minimum in the case of proposed system than it is in the
existing system.

D. Graph-4: Packet Delivery Ratio(PDR) vs. Time

Figure 15: Packet Delivery Ratio vs. Time
In this graph we see that there are drop of packets in
the proposed system and this is rectified in our proposed
system where there are no packet drops.
So, from these graphs we see that there are no
interference between the nodes and energy efficient routing
has been carried out.

IV. CONCLUSION
In this paper we had provided a solution to the real
fundamental problem in wireless sensor networks regarding
the occurrence of interference and energy consumption. We
had proposed an algorithm which efficiently makes the
wireless sensor networks to be interference-free and energy
efficient based on the deployment of matrix formation in
WSN. We have shown that this approach can also make the
wireless sensor networks have the packet data loss to a
minimum state thus making a valuable contribution in
packet delivery ratio.

The feasibility of our proposal has been demonstrated
in a simulated platform showing that the real deployment
of a wireless sensor networks in an indoor localization
system. In addition, we had explained the comparison
between the existing system and our proposed system so as
to make our contribution to the real world applications.
This mechanism is quite useful for an optimized
localization system in indoor mobile robots.

We believe that this work represents a significant
milestone towards the real use of our proposed matrix
based routing in static wireless sensor networks in the
current contemplate scenarios of WSN which are bugged
with interference and energy consumption, which was an
open issue in standard. To our best knowledge, this barrier
has not been overcome in previous studies.

In future works, we intend to use the results of this
work to evaluate the real worst-case performance of our
proposed algorithm for WSN and compare them to
theoretical results. In addition, we are currently working to
9

make this still more energy efficient by calculating the time
of the sensors which have to be awake and to be in sleep
state with respect to the maximum speed of the robots
which are used in the dynamic ultrasonic hybrid
localization system for indoor mobile robots.

REFERENCE:
[1] Energy-efcient communication protocol for wireless
microsensor networks,W.R. Heinzelman, A. Chandrakasan, H.
Balakrishnan , IEEE Hawaii International Conference on
System Sciences, 2000
[2] Energy concerns in wireless networks, Ephremides, IEEE
Wireless Communications, Aug 2002.

[3] 3.An Energy-Efficient MAC Protocol for Wireless Sensor
Networks, Wireless Sensor Network, 2008, 1, 1-69,Published
Online June 2008 in
SciRes,(http://www.srpublishing.org/journal/wsn/). Copyright
2008 SciRes. Wireless Sensor Network, 2008, 1, 1-69, Wei
YE1, John HEIDEMANN1, Deborah ESTRIN2 Information
Science Institute, University of Southern California, Los
Angeles, USA Computer Science Department, University of
California, Los Angeles, USA.
[4] Towards Optimal Sleep Scheduling in Sensor Networks for
Rare-Event Detection Qing Cao, Tarek Abdelzaher, Tian He,
John Stankovic, Department of Computer Science, University
of Virginia, Charlottesville, VA 22904
[5] Delay Efficient Sleep Scheduling in Wireless Sensor
Networks, Gang Lu, Narayanan Sadagopan, Bhaskar
Krishnamachari, Ashish Goel, Department of Electrical
Engineering Department of Computer Science,University of
Southern California, Los Angeles, 90089 Department of
Management Science and Engineering,Stanford University,
Stanford CA.
[6] AN MAN Standards Committee of the IEEE Computer
Society, Wireless LAN Medium Access Control (MAC) and
Physical Layer (PHY) Specification, IEEE, NewYork, NY,
USA, IEEE Std 802.11, 1997 edition, 1997.
[7] M. Stemm and R.H. Katz, Measuring and Reducing Energy
Consumption of Network Interfaces in Hand- Held
Devices, IEICE Transactions on Communications, vol. E80-
B, no. 8, pp. 11251131, August 1997.
[8] 8.O. Kasten, Energy Consumption, Eldgenossische
Technische Hochschule Zurich,
http://www.inf.ethz.ch/~kasten/research/bathtub/energy_consu
mption.html.
[9] G.J. Pottie and W.J. Kaiser, Embedding the Internet: Wireless
Integrated Network Sensors, Communications of the ACM,
vol. 43, no. 5, pp. 5158, May 2000.
[10] C. Intanagonwiwat, R. Govindan, and D. Estrin, Directed
Diffusion: A Scalable and Robust Communication Paradigm
for Sensor Networks, in Proceedings of the ACM/IEEE
International Conference on Mobile Computing and
Networking, Boston, MA, USA, pp. 5667, ACM, August
2000.
[11] .Cunha A (2007) On the use of IEEE 802.15.4/ZigBee as
federating communication protocols for wireless sensor
networks. Master thesis, July. Available at
http://www.hurray.isep.ipp.pt/ART-WiSe.
[12] Cunha A, Alves M, Koubaa A (2007a) Implementation details
of the time division beacon frame scheduling approach for
zigbee cluster-tree networks, IPP-HURRAY Technical Report
TR070102. http://www.open-zb.net
[13] Cunha A, Kouba A, Severino R, Alves M (2007b) Open-ZB:
an open-source implementation of the IEEE 802.15.4/ZigBee
protocol stack on TinyOS. In: Proc of the 4th IEEE
international conference on mobile ad-hoc and sensor systems
(MASS07), Pisa, Italy, October 2007.
[14] Cunha A, Severino R, Pereira N, Kouba A, Alves M (2008)
ZigBee over TinyOS: implementation and experimental
challenges, to be published at the 8th Portuguese conference on
automatic control CONTROLO2008, Invited session on
real-time communications: from theory to applications, Vila
Real, Portugal, July 2008.
[15] Daintree Networks (2006) Sensor network analyser.
http://www.daintree.net.


Matrix Based Energy Efficient Routing in Static Wireless Sensor Networks

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Matrix Based Energy Efficient Routing in Static Wireless Sensor Networks

Загружено:

Авторское право:

Доступные форматы

International Journal of Sensor and Related Networks (IJSRN)

ISSN 2320-5571, Volume.2,Issue.1 , May 2014

Вам также может понравиться