Você está na página 1de 8

Imperial Journal of Interdisciplinary Research (IJIR)

Vol-3, Issue-8, 2017


ISSN: 2454-1362, http://www.onlinejournal.in

Searching Cuts in Wireless Sensor Network


Mani Sharma1 & Dr Sunil. J. Wagh2
1
M.Tech Student, MGM COET, Noida
2
Principal, MGM COET, Noida, India

Abstract: Wireless sensor network is suffering from data transmission. This inactivation state is node
the problem of cut. Limited battery life of sensor failure. Node failure results in division of wireless
nodes and harsh environment where sensors nodes sensor network into various components which
are deployed results in node failure which divides forms cut.
the wireless sensor network into various connected
components. This division forms cut in wireless The graph given below describes a partitioned
sensor network. In this research paper, we are wireless sensor network.in the graph, S is source
focusing towards our objective of identifying cuts node or we call it base station and D is destination
and their location in wireless sensor network. We node. The bold lines shows the connected path
are presenting our approach in this research between the nodes in wireless sensor network. The
paper. In our approach, nodes which are near to nodes which are in green colour, are the active
inactive nodes will search the cut’s location. The nodes. They perform normal operation in sensor
failure message will be send to base station so that network. The red colour nodes displayed in graph
it will take necessary action to solve this problem. are the failed nodes and they reached inactivation
The approach is optimized to reduce time delay. state due to certain environmental factors. During
We hope that our approach will surely identify cuts inactivation state, working of sensor node gets
in wireless sensor network. affected as its performance gets decreases. So, they
gets unable to perform their normal operation. As a
INTRODUCTION result, these nodes gets disconnected from their
neighbour nodes. Hence, cut is formed due to
The problem of cut in wireless sensor network has disconnection of path in wireless sensor network.
become common now-a -days. During inactivation The dashed lines shows the disconnected path
state of node, it performance goes down. It between failed node and active node. The cut area
performs differently from its normal operation. The along with failed nodes is also shown in the graph
energy efficiency of node gets low. As a result, it given below.
gets unable to forward data to another node during

Graph showing cut vertices and cut area in wireless sensor network
Limited battery life of sensors and unsuitable results in loss of data packets, loss of precious
environmental conditions where sensors are energy of nodes, loss of operational reliability etc.
deployed, are the major causes of node failure. Cut

Imperial Journal of Interdisciplinary Research (IJIR) Page 461


Imperial Journal of Interdisciplinary Research (IJIR)
Vol-3, Issue-8, 2017
ISSN: 2454-1362, http://www.onlinejournal.in

Cut detection is phenomenon of finding the Reason behind small size is that our
presence of cuts in wireless sensor network. Cut objective to check accuracy and
detection is basic procedure and fundamental step performance of our approach by starting
in the process of network’s connectivity from small size. After this, we can
restoration. Identifying cuts will increases the increase the size according to our
opportunities of restoring the connectivity of sensor requirement.
network. Hence, by detecting cuts, network
recovery is possible. Starting from small size to large size, we
are focusing on the issue that whether our
Various techniques implemented by researchers to approach is dependent on network size or
identify cuts faces the issue of time delay and not.
energy efficiency. In our opinion, no such
technique is implemented so far to detect cuts Assigning ID to each Node: A unique ID
accurately and completely in wireless sensor will be assigned to each node for its
network. The main reason behind limitations of unique identification in wireless sensor
these techniques is that base station and other network.
nodes have no information about node failure.
Node details Assignment: Node details
Our approach will overcome this limitation. In our will be entered such as parameters
approach, nodes which are near to cut location will associated with each node such as initial
detect the cut and send message to base station. energy, qlength, communication, etc will
Hence, base station receive message about node be entered according to our requirement.
failure and immediately takes necessary action for
connectivity restoration. Node Positioning: Alignment of node in
their location takes place. When nodes
In this paper, we are presenting our approach to aligned to their fix position, they will send
detect cuts. The main objective of this research WAKEUP message to base station for
paper it to identify the existence of cuts in wireless informing about their positioning.
sensor network. This research paper describes our
algorithm to detect cuts in sensor network. Update Nearest Neighbour Data: Nodes
nearest neighbour data will be updated in
This research paper is divided into three sections.
First section describes our approach in detail. routing table for each node. This is
Second section describes our algorithm. Third necessary to prevent data loss during
section describes working of our approach. Rest of transmission.
the paper describes conclusion, future work,
2. Detection of Cut vertices and cut area phase:
acknowledgement and references. To detect cut vertices and cut area, a file is
transferred through wireless sensor network. Active
nodes have the capability of forwarding file to
PROPOSED METHOD other nodes whereas inactive nodes does not have
the capability of forwarding data packets because
Our approach is divided into two phases: their performance decreases during inactivation
state.During inactivation state, node does not have
• Phase-1 Initialization
sufficient energy to forward data packet to another
• Phase-2 Detection of cut vertices and cut node. As a result, data transmission is blocked.
area Two cases will be arise due to file transfer
operation:

1. Initialization Phase: In initialization phase,


firstly network size will be entered. Then details
• File reaches successfully to its
associated with each node will be entered.
destination. It means that there is no
cut in sensor network. Then
Steps of initialization phase are:
procedure gets finished.
• Entering Network's size: Initially • Else file does not reaches to its
network size will be entered that is enter destination. It means that there exists
the total number of sensor nodes needed to a cut in sensor network. Then
construct the sensor network. We are procedure of cut detection will be
taking small size such as from 5 to 7.
started.

Imperial Journal of Interdisciplinary Research (IJIR) Page 462


Imperial Journal of Interdisciplinary Research (IJIR)
Vol-3, Issue-8, 2017
ISSN: 2454-1362, http://www.onlinejournal.in

Cut detection phase: In this phase, nodes which location. When Base Station receives message of
are near to inactive nodes will track the location of node failure, it takes necessary action to eliminate
cut and inactive nodes in wireless sensor network. cut in wireless sensor network.
Nodes which are close to the cut area sends
message to Base Station about node failure and cut We have described our approach with the help of
block diagram which is given below:

Block Diagram showing the working of our approach

Requirement Analysis: The minimum hardware Coding Language : JAVA


and software needed to perform the operation of
cut detection in wireless sensor network are given We have implemented our project in java language.
below: In implementation, we have performed the coding
of each operation of our approach. The series of
In requirement analysis, there are two requirements operations used during coding are given below:
needed to complete this project:
• Node Initialization
1. Hardware Requirements:
• File Transfer
Processor: Intel(R) Core(TM)i3 CPU M380 @
• Node's details Updation
2.53GHz 2.53GHz
• Detect Cut Vertices and Cut Area
RAM: 3.00 GB
• Message Sending Function

2. Software Requirements:
In this research paper, we are focusing on file
Operating System : Windows 7 Linux Edition transfer operation of our project. Rest of the
2014 operations descriptions are the part of our
future work

Imperial Journal of Interdisciplinary Research (IJIR) Page 463


Imperial Journal of Interdisciplinary Research (IJIR)
Vol-3, Issue-8, 2017
ISSN: 2454-1362, http://www.onlinejournal.in

ALGORITHM for File Transfer Operation


// Finding position of node failure//
INPUT:
node[7][4]= {101,1,1,1
110,2,1,1
111,3,1,0
100,4,1,1
121,3,1,1
131,2,1,1
141,1,1,1 };
OUTPUT:
Location of cut

PROCEDURE:

BEGIN:
Consider loc=location of cut
ac= active state
iac=inactive state
FindLoc()
{
for(i=0,j=3;i<l;i++)
{
if(node[i][j]==ac)
{
Print(" node is in active state, position:" +m);
Print("pass data to next node");
m+=1;
}
else
{
print("node is not in active state as its initial energy is zero");
loc=m;
print(" position of inactive node is" +loc);
m=m+1;
}
}
if(loc==0)
{
print("file transmission is successful, no cut exists");
print("finish procedure");
}
else
{
print("cut exists in wireless sensor network");
print("location of cut:" +loc);
}
return loc; }
FINISH

Algorithm description: The above algorithm INPUT: In input, we have taken 2-D matrix to
describes the file transfer operation of our represent nodes and its associated parameters. In 2-
approach. The process of file transfer takes place D Matrix, rows represent the number of nodes in
among the nodes in wireless sensor network to wireless sensor network and columns represent the
check the initial energy level of each node. parameters associated with each node.

Imperial Journal of Interdisciplinary Research (IJIR) Page 464


Imperial Journal of Interdisciplinary Research (IJIR)
Vol-3, Issue-8, 2017
ISSN: 2454-1362, http://www.onlinejournal.in

In 2-D Matrix representation: • Third column represents Communication


Factor.
• First column represents NodeId.
• Fourth column represents Initial Energy
• Second column represents Qlength. Level.

2-DIMENTIONAL MATRIX REPRESENTATION OF WSN

1. 3-digit code has been taken for unique 0-> Represents the lower energy level.
identification of each node in first column of
matrix. 1-> Represents the higher energy level.

2. Qlength of each node has been taken in In loop, we are checking if energy level of a node
matrix according to distance of each node from is 0, then it has no sufficient energy for file transfer
base station. to other neighbour nodes. Hence, it will be declared
as failure vertex of wireless sensor network. If
3. Communication factor is one for each node initial energy level of node is 1, it means that node
in matrix. has sufficient energy to pass data to other
neighbour nodes. Hence, it will be declared as
4. Initial Energy Level has been taken either 0 active node in wireless sensor network. Location of
or 1 according to energy capacity of each node. cut will be the output of this algorithm.
In this algorithm, we are checking the last column Steps of the file transfer operation to detect cut is
of matrix (Initial Energy Level ) in order to shown with the help of diagram.
examine the capacity of each node to pass data to
other neighbour nodes. We are assuming the values
of initial energy level as 0 or1.

Imperial Journal of Interdisciplinary Research (IJIR) Page 465


Imperial Journal of Interdisciplinary Research (IJIR)
Vol-3, Issue-8, 2017
ISSN: 2454-1362, http://www.onlinejournal.in

Imperial Journal of Interdisciplinary Research (IJIR) Page 466


Imperial Journal of Interdisciplinary Research (IJIR)
Vol-3, Issue-8, 2017
ISSN: 2454-1362, http://www.onlinejournal.in

OUTPUT OF ALGORITHM:

CONCLUSION AND FUTURE WORK REFERENCES


We have described our approach in detail in this [1] N. Shrivastava, S. Suri, and C. Toth, “Detecting
research paper. In intialization stage of our cuts in sensor networks,” ACM Transactions on
approach, small size of sensor network has been Sensor Networks, vol. 4, no. 2, pp. 1–25, 2008.
taken to check its accuracy. We have performed
file transfer operation so that cut area and cut [2] P. Barooah, H. Chenji, R. Stoleru, and T.
vertices can be easily identified. Our approach is Kalmar-Nagy, “Cut detection in wireless sensor
highly optimized. Hence, it reduces time delay networks,” IEEE Transactions on Parallel and
factor which are suffered by most of the Distributed Systems, vol. 99, no. PrePrints, 2011.
techniques. It overcomes the limitations of existing
techniques as it includes a process through which [3] M. Won and R. Stoleru, “Destination-based cut
base station receives message about node failure in detection in wireless sensor networks,” in
sensor network. Comparison of our approach with Proceedings of IEEE/IFIP International
other existing techniques is a part of our future Conference on Embedded and Ubiquitous
work. Computing (EUC), 2011
ACKNOWLEDGEMENT [4] Shuguang Xiong and Jianzhong, “An Efficient
We are expressing our pleasure and thanks to all Algorithm for Cut Vertex Detection in Wireless
teachers of computer science department who have Sensor Network”, International Conference on
cooperated us in this project. We are happy to Distributed Computing system, 2010
express thanks to those people who have directly or
indirectly helped us to complete this research [5] Izzet F.Senturk, Kemal Akkaya and Sabri
paper. Yilmaz, “Distributed Relay Node Positioning for
Connectivity Restoration in Partitioned Wireless
Sensor Network” ,2012

Imperial Journal of Interdisciplinary Research (IJIR) Page 467


Imperial Journal of Interdisciplinary Research (IJIR)
Vol-3, Issue-8, 2017
ISSN: 2454-1362, http://www.onlinejournal.in

[6] P. Barooah, “Distributed cut detection in sensor


networks,” in Proceedings of IEEE Conference on
Decision and Control and European Control
Conference (CDC), 2008.

[7] Ms. Rini Mathew and Mrs. Annadevi. E


“Artificial Routing Protocol for Cut Detection of
Cut Vertices” vol. 9, 2012

[8] T. H. Cormen, C. E. Leiserson, R. L. Rivest and


C. Stein, “Introduction to Algorithms (Second
Edition)”, The MIT Press, 2002

[9] D. B. West, “Introduction to Graph Theory


(Second Edition)”, Prentice Hall, 2001.

[10] B. Milic and M. Malek, “Adaptation of the


Breadth First Search Algorithm for Cut-edge
Detection in Wireless Multihop Networks”, in
ACM International Workshop on Modeling
Analysis and Simulation of Wireless and Mobile
Systems (MSWiM), 2007.

[11] X. Liu, L. Xiao, A. Kreling and Y. Liu,


“Optimizing Overlay Topology by Reducing Cut
Vertices”, in ACM Workshop on Network and
Operating System Support for Digital Audio and
Video (NOSSDAV), 2006.

[12] M. Won, M. George, and R. Stoleru,


“Towards robustness and energy efficiency of cut
detection in wireless sensor networks,” Elsevier Ad
Hoc Networks, vol. 9, no. 3, pp. 249–264, 2011.

[13] Prof. Prashant P. Rewagad and Harish Prakash


Patil, " DCD Algorithm in Wireless Sensor
Networks with enhance security mechanism",
IJLTET, vol-3, Issue-2, Nov-2013.

Imperial Journal of Interdisciplinary Research (IJIR) Page 468

Você também pode gostar