This document discusses approaches to improve reliability in wireless sensor networks. It proposes a dynamic sectoring scheme where the network area is divided into sectors with a sensor node assigned as sector head for each. When an event occurs, only that sector is activated, reducing congestion and energy use. This is expected to enhance packet delivery ratio and reduce losses. Prior work on using data fusion and opportunistic flooding algorithms to improve reliability is also reviewed. The dynamic sectoring approach aims to reliably transmit data with low congestion and energy usage.

1. Cyber Times International Journal of Technology & Management
Vol. 7 Issue 1, October 2013 – March 2014
49
INTENSIFYING RELIABILITY USING
DYNAMIC SECTORING SCHEME IN
WIRELESS SENSOR NETWORK
Praful P. Maktedar
MIT College of Engineering Pune, India
Prafulmaktedar8@gmail.com
Vivek S. Deshpande
Associate Professor, MITCOE Pune,India
vsd.deshpande@gmail.com
ABSTRACT
Wireless Sensor Network (WSN) is fastest growing field. It is used in numerous applications.
It creates an interest among the researchers. Sensor nodes are used for gathering the
information from the surrounding. These sensor nodes are capable of detecting an event;
collect the information about that event and it to the base station. At the base station
information is composed, analyzes and used. Reliability is a quality of service parameter of
WSN. It ensures that the numbers of data packets sends from a source node must be
completely received at the sink node. So that we can get correct information and thus
reliability achieved. But there may be packet loss occurred during data transmission process,
so we need to retransmit the data packets. As number of packets received at destination
increases, reliability increases. Reliable data transport is one of the important issues in
WSN. In this paper, we discuss reliability in WSN and proposed a dynamic sectoring scheme
used to increasing reliability of given system with low congestion in given network and
minimum usage of energy by the system.
KEYWORDS: Congestion, Data Transmission Process, Packet Size, Reliability, Wireless
Sensor Network
I. INTRODUCTION
Wireless Sensor Network consists of sink
nodes called base station with unlimited
energy and multiple sensor nodes have
limited energy. Out of them sink node is
secured and sensor nodes are unsecured [1].
In WSN, sensor nodes are randomly
distributed in given environment to collect
the information about the changes occurred
in the atmosphere like temperature,
pressure, humidity, soil content, etc. and
these noted readings to the base station [2].
Seismic, magnetic, thermal, infrared,
acoustic, and radar are types of sensor
nodes. WSN are required low set up cost
than wired networks and it also have an
advantage that sensor nodes are easily
replaceable in case of damage. Sensor nodes
are sends data packets to the sink node [3].
Then that received packet at sink node sends
an acknowledgement to the source node.
But there may be chance of packet loss
during transmission process. In that case, we
have to resend the packet to sink node
which increase reliability of system [4].
There are many applications of WSN such
as military applications, Environmental
applications like Tsunami detection,
volcano predictions, weather forecasting,

2. Cyber Times International Journal of Technology & Management
Vol. 7 Issue 1, October 2013 – March 2014
50
vehicle tracking, and medical applications
and so on. Reliability is important quality
of service parameter of WSN. It is measures
in terms of consistency in calculating
results. If any system producing consistently
similar results then we can say that it is a
reliable system [5].
A WSN system must be contains some
properties as it should be fault tolerant
means it is strong in a case of node failure.
WSN system supports multiple sensor nodes
to perform various applications. Sensor
nodes are reprogrammable so that it helps in
improving flexibility. It has low cost and a
long life [6].
Figure 1: Wireless Sensor network
WSN is most widely used in real world
applications such as weather forecasting,
tsunami detection, volcano sensing, and
earthquake predictions and so on. It is a
simple and valuable solution to various
applications. Since it is used in great extent
from last few years it will also useful in
future works. It introduced a new way to
perform our jobs within specific time
durations. It can establish a connection
between different sensor nodes across the
network [7].
II. RELATED WORK
“A Probabilistic and opportunistic flooding
algorithm in wireless sensor networks” [8]
states that flooding is the mechanism in
which a message send by source node
propagates throughout the complete
network. The fundamental aim of flooding
mechanism is to ensure that all the nodes
present in given network must take delivery
of that same message. This paper proposed
‘a probabilistic and opportunistic flooding
algorithm’ (POFA) which is used to control
rebroadcast and retransmission of data
packets in order to attain superior target
reliability. In this method a given node will
selects only the subsets of its one hop
neighboring nodes called as “multipoint
relays” (MPR) to rebroadcast the same
message. While selecting the eligible
neighbors to rebroadcast link error rate take
into concern. The number of retransmissions
will control by the sender by knowing the
present states of message reception at its
neighbors [9]. Let R is network wide
reliability of node, the node who had
received the message will forward that
message to its one hop as well as two hop
neighboring nodes for which nodes will
select “Reliability aware Multi point relays”
(RA-MPR) nodes. Suppose that all of one-
hop away neighboring nodes from sink node
are elected as RA-MPRs in this subsection.
The first sender who is to broadcast a
message will calculate an expected delivery
probability (EDP). The EDP is the ratio of
the expected number of ‘‘close neighbors’’
that will receive the message
probabilistically to the number of all ‘‘close
neighbors’’.
“Data fusion with desired reliability in
wireless sensor networks” [10] states that in
wireless sensor network reliable and energy
efficient data transmission process is
necessary for which we used data fusion
process In this the combination of data
packets into large packet will takes placed
which contains more correct and abundant
information than individual packets. In data
fusion tree, each node fuses all its incoming
packets into a single packet by its own and
then forwards it to its parent node. Here we
use different topologies of data packets such

3. Cyber Times International Journal of Technology & Management
Vol. 7 Issue 1, October 2013 – March 2014
51
as star, tree, and chain [11]. If the packet
size of fused packet is either smaller or
larger than the size of original data packet
then this type of fusion is called as “partial
fusion”. If the packet size of fused data is
equal to original data packet then this type
of fusion is called as “full fusion”.
Information weight of a fusion node is sum
of all information weights of received
packets including its own weight [12]. We
study the difficulty of ‘minimum energy
reliable information gathering’ (MERIG)
with unreliable data fusion structure. The
basic idea is to allocate dissimilar
transmission reliability to the packets
having different information weight. We
also use multiple transmissions without
acknowledgments which minimize latency
of data packet delivery and promise the
desired transmission reliability [13].
Voronoi-based coverage improvement
approach for wireless directional sensor
networks” [14] states that in directional
wireless sensor networks sensing angle and
directionality of sensors are the two
significant characteristics in order to
calculate sensing coverage area. To study
this, we use properties of Voronoi cell
diagram and direction adjustable sensing
angle [15]. The Voronoi cell is geometrical
structure having special properties. These
Voronoi cells can be constructed by drawing
a perpendicular bisector of a line which
joins each sensor pair. These bisector lines
forms Voronoi cells boundaries are called as
“Voronoi Edges” and endpoints of these
edges are called as “Voronoi Vertices”. We
study distributed greedy algorithm to find
near optimal solution [16]. The
directionality of sensors is selected and
adjusted based on three criteria’s as firstly,
to increase the area inside the Voronoi cell.
Secondly, to minimize the overlapped
coverage area between the sensor and its
neighboring cells. Finally, to reduce the
sensing coverage area outside the sensing
field [17].
III. PROPOSED SCHEME
In this paper we are proposing a dynamic
sectoring scheme to increase reliability of a
given system. During the data transmission
process, source nodes will send data packets
to sink node. When these data packets
received at sink node they send an
acknowledgement to a source node. But due
to congestion in given network area there
may be chance of packet loss in that case
source node will resend data packets to sink
node. Our major task is to find a way so that
we are able to increase packet delivery ratio
with minimum packet loss ratio and low
energy consumption. Here we try to
proposed dynamic sectoring scheme for
intensifying reliability in wireless sensor
network.
Figure 2: Dynamic Sectoring Scheme
Figure 2 shows dynamic sectoring scheme.
A given area is divided into 8 sectors by
considering sink node as its center position.
The nodes which are close to the sink node
are assigns as sector head. When an event is
occurred in a sector then we only activate
that current sector. All other sectors remain
in idle condition so that they neither send
data packets nor receive them. It is useful to
minimize network congestion as well as
energy is consumed by sensor nodes.

4. Cyber Times International Journal of Technology & Management
Vol. 7 Issue 1, October 2013 – March 2014
52
IV. CONCLUSION
In this paper, for increasing reliability of a
system we propose a dynamic sectoring
scheme. According to scheme, we are able
to enhance the packet delivery ratio and
reduce packet loss ratio. With the help of
dynamic sectoring scheme we succeed in
reducing network congestion as well as
energy used by system.
REFERENCES
[1] Praful P. Maktedar, Vivek S.Deshpande,
2013,”Interpretation of Reliability in Wireless
Sensor Networks”, 2013 IEEE CUBE
International Conference on Cloud and
Ubiquitous Computing and Emerging
Technologies (CUBE), 104-107
[2] F.Akyildiz, W.Su,Shankarasubramaniam,
E.Caryirci, 2001,”Wireless Sensor Networks:a
survey”, Elsevier Computer Networks, vol. 38,
393-422
[3] Mohammadreza Balouchestani, Kaamran
Raahemifar and Sridhar Krishnan, 2011,”
Increasing the Reliability of Wireless Sensor
network With new Testing Approach Based on
Compressed Sensing Theory”, 1-4,
[4] Praful P. Maktedar, Vivek S. Deshpande,J. B.
Helonde, V. M. Wadhai, , 2013,” Performance
Analysis of Reliability in Wireless Sensor
Networks”, InternationalJournal of Innovative
Technology and Exploring Engineering
(IJITEE), vol 2, issues 4, 299-302
[5] R.R.Rout, S.K. Ghosh, S. Chakrabarti,
2012,”Cooperative routing for Wireless Sensor
Network using Network Coding”, vol. 2, issues
2, 75-85
[6] Hamed Youse_, Ali Movaghar, Mohammad
Hossein Yeganeh, Naser Ali naghipour,
2011,”Structure Free Real Time Data
Aggregation in wireless sensor networks”,
Elsevier Computer Communication, 1132-1140
[7] Gajendra S. Vyas, Vivek S. Deshpande, ,
2013”Performance Analysis of Congestion in
Wireless Sensor Networks”, 2013 IEEE 3rd
International Advanced Computing Conference
(IACC), 254-257
[8] Dukhyun Chang, Kideok Cho, Nakajung Choi,
2012, “A Probabilistic and opportunistic
flooding algorithm in wireless sensor networks”
C Computer Communication, vol 35, 500-506
[9] Dawie Gong, Yuanyuan yang, Zhexi Pan,
2013,”Energy Efficient Clustering in Lossy
Wireless Sensor Networks”, Elsevier Computer
Communication, pp. 1323-1336
[10] Hong Luo, Huixiang Tao, Huadong Ma, Sajal K.
Das,2011,“Data fusion with desired reliability in
wireless sensor networks”, IEEETransaction on
parallel and Distributed Systems,vol 22, 501-513
[11] Gajendra Sanjay Vyas, Vivek S. Deshpande,
2013,”Performance of Congestion in Wireless
Sensor Networks Using Redundant Nodes”,
2013 IEEECUBE International Conference on
Cloud and Ubiquitous Computing and Emerging
Technologies (CUBE), 73-76
[12] Hung Ta Pai, 2010, “Reliability Based Adaptive
Distributed Classification in Wireless Sensor
Network”, vol 59, issues9, 4543-4545
[13] Sudip Misra, P. Dias Tho masinous, , 2010,“A
Simple, least Time, and energy efficient routing
protocol with one level Data Aggregation in
wireless sensor networks”, Journal of System
and Software, Elsevier Computer
Communication, 852-860
[14] Tien wen sung , Chu Sing yang, 2013“Voronoi-
based coverage improvement approach for
wireless directional sensor networks” Elsevier
Journal of Network and Computer
Application,1-12
[15] Swati D. Kadu, Vivek S. Deshpande,
2013,”Characterization of Throughput in
Wireless Sensor Networks for MAC and
Routing Protocol”, 2013 IEEE CUBE
International Conference on Cloud and
Ubiquitous Computing and Emerging
Technologies (CUBE), 108-111
[16] Giuseppe Campobello, Alessandro Lenardi and
Sergio Palazzo, 2012” Improving Energy Saving
and Reliability in Wireless Sensor Network
Using Simple CRT Based Packet Forwarding
Solution”, vol 20, issues 1, 191- 205
[17] Swati D. Kadu, Vivek S. Deshpande,
2012,”Handling Throughput in Wireless Sensor
Networks”, 2012 IEEE International Conference
on Computational Intelligence and Computing
Research (ICCIC), 1-4