WSN in Disastrous Area Management

International Journal of Computer Networking,
Wireless and Mobile Communications (IJCNWMC)

ISSN(P): 2250-1568; ISSN(E): 2278-9448
Vol. 4, Issue 5, Dec 2014, 13-24
TJPRC Pvt. Ltd.
WSN IN DISASTROUS AREA MANAGEMENT

VENKATRAMANA BHAT P1, SHRIDHAR AITHAL2 & SUDHAKARA G3
1
Research Scholar, Department of Computer Science & Engineering, MIT, Manipal University, Manipal, Karnataka, India
2
Advanced Tech. Consultant, Canada, Research Guide, Manipal University, Manipal, Karnataka, India
3
Professor, Department of Mathematics, MIT Manipal, Karnataka, India
ABSTRACT
Wireless Sensors have been often used in many situations to collect ambient information and transport it to a
control center for analysis and further action. A Mobile Wireless Sensor Network in which a mobile control center gathers
the data from the Wireless Sensor Network may be implemented in the applications like disastrous area management.
In such case large number of sensor nodes may be deployed and a mobile control center moving outside the boundary of
disastrous area may be used to gather the data and take remedial action. As the sensor nodes are energy constrained,
the protocols used in the communication should be energy efficient. This article proposes a clustering approach based on
the residual energy of the sensor nodes and to utilize the mobility benefit by the control center to increase the efficiency
and the network overall life-time by keeping the energy consumption of nodes uniform.
KEYWORDS: Mobile WSN, Leader, Follower, Mediator, Clustering in WSN

1. INTRODUCTION
A Mobile Wireless Sensor Network (MWSN)[1] may have either mobile sink or mobile sensor nodes within the
Wireless Sensor Network (WSN). By providing controlled mobility to the mobile sensors we can enhance the coverage
area and increase the network lifetime [2]. In general a static WSN [3, 4] uses multi-hops for data communication from
sensor node to sink. Hence, sensor node closer to the sink is always heavily loaded and its energy gets exhausted quickly
breaking the link to sink which results in whole network collapse. A Mobile sink can solve this problem. As sink position
changes nodes close to the sink also changes. By providing mobility to the sink node, all nodes in turn can take a role of
being close to the sink. This can reduce number of hops to sink from a node, thereby reducing the errors in communication.
In data gathering process from a disastrous area, large numbers of static sensor nodes are deployed in disastrous area and a
mobile sink agent who moves outside the boundary in the predefined path gathers information. In this case sink node is
working as mobile access point. For large area having thousands of sensors, we can consider more number of mobile sinks
to increase channel capacity. We may propose a two layer architecture, where a set of stationary nodes can communicate
with some mobile nodes and those mobile nodes report to the central station. The applications such as monitoring the
situations, providing support and service to the people in the area hit by some calamity can use this approach.
The basic idea here is that, nodes which has sensed information to communicate to other destination node starts
forming the clusters [5]. A cluster is the collection of nodes, with each cluster having a node identified as cluster head,
called as leader and some neighboring nodes called as followers. Communication among the nodes or a central station is
through the cluster leader. Since every node in clustered network is connected to a cluster leader, the route discovery
process among cluster leaders is sufficient to establish feasible route in the network. For large sensor network, clustering
www.tjprc.org
editor@tjprc.org
14
Venkatramana Bhat P, Shridhar Aithal & Sudhakara G
will simplify the multi-hop route discovery process and limit the number of transmissions compared to non-clustered
network. The clustering also support the load balancing and in fault tolerance [6].
We propose an algorithm in which overlapping of cluster heads is eliminated. To avoid overlapping of cluster
heads, among the followers of group, select one of the followers as mediator node which is farthest from its cluster head
(CH) and select next level CH which is at the farthest distance from that mediator node but within transmission range of
that mediator node. The mediator node is used to link the clusters. Thus, in the proposed algorithm nodes are portioned into
Leaders-Followers-Mediators (LFM).
R. Nagpal and Daniel Coore have proposed a club algorithm [5] for formation of groups in which many identical
processing elements are grouped relying on local broadcast mechanism. This idea of forming groups may be extended for
sensor grouping with additional considerations like residual energy of nodes.
In an energy efficient hierarchical clustering algorithm [7], each sensor node becomes cluster head with
probability of p and advertises its candidacy to nodes that are no more than k-hops away from cluster head. For effective
data communication the cluster heads should be organized. A logical approach of cluster heads organization using a
suitable data structure can be implemented to route data to the sink and also between sensor nodes considering important
issues like energy efficiency and band width.
Maintaining connectivity and maximizing the network lifetime in WSN can be achieved by equipping Mobile
platforms with the sensor nodes. The different approaches in exploiting mobility for data collection in WSNs are Mobile
base station (MBS)-based solutions, Mobile data collector (MDC)-based solutions, Rendezvous-based solutions for
maintaining connectivity and maximizing the network lifetime [8]. Hence, we may consider that the nodes are mobile to
meet some real scenario.
Two clustering protocols that converge completely in a fixed number of iterations, regardless of the size of the
nodes population are the Low Energy Adaptive Clustering Hierarchy (LEACH) [9,10,11,12] and Decentralized Energy
Efficient cluster Propagation (DEEP) [12,13, 14] protocol and the constant convergence time algorithms are suitable for
networks with large number of nodes.
The fast drainage of battery by switching over between single hop and multi-hop methods may be better handled
by rotating cluster head method in which re-clustering has to be done at regular intervals [15].
The Network Simulator NS-2 [16, 17, 18] is a freeware and open software that is generally used in network
simulation.
In [19] paper titled Implementing a New MANET Unicast Routing Protocol in NS2 by Francisco J. Ros and
Pedro M. Ruiz, authors have given the step by step procedure for implementation of new routing protocol inNS2.
This article is organized into four sections. Clustering procedure and the design and implementation of our LFM
protocol in network simulator NS-2 given in the section 2. Results and discussion with Snapshots of simulated results of
our LFM grouping algorithms for disaster area management using a Mobile sink and observations made on comparing with
AODV protocol for data transfer is given in the section 3. In Section 4, conclusions drawn are given. The article ends with
the list of references made.
Impact Factor (JCC): 5.3963
Index Copernicus Value (ICV): 3.0
15
WSN in Disastrous Area Management
2. CLUSTERING PROCEDURE
This section deals with the design of LFM clustering protocol and implementation using network simulator NS-2
for the data transfer. The Flow Chart of the Clustering process used is shown in figure 1.
Figure 1: Clustering Process

2. 1 Implementation
Implementation of the routing protocols may be done in three phases viz.
Clustering Phase: Two stages of this phase are
Design of control packets to form the clusters. The header format of the control packets are defined in this
phase.
Organization of nodes as Clusters to get the route from the source node to the destination nodes.
Route discovery for forwarding of data packets.
Data transfer phase.

The following five control packets are defined to form the clusters.
G_Request, N-Response, M_Select, C_Reset, R_Set

The different fields defined in the control packets to form the clusters to support the data transfer is given in the
Table 1.
www.tjprc.org
editor@tjprc.org
16
Table 1: Control Packets and Fields

Control Packets
G_request
N_response
M_Select
C_Reset
R_Set
Fields
Pkt_type, Pkt_id, Src_nodeid, Status, Mflag, Hop_count, Timestamp
Pkt_type, Pkt_id, Src_nodeid, Dest_nodeid, Posx, Posy, Timestamp
Pkt_type, Pkt_id, Src_nodeid, Dest_nodeid, Link, Timestamp
Pkt_type, Pkt_id, Src_nodeid, Timestamp
Pkt_type, Pkt_id, Src_nodeid, Dest_nodeid, Timestamp
2. 2 State -Transition Diagram of the Nodes

The different states the node acquires in the clustering procedure are shown in the state-transition diagram in the
figure 2.
Figure 2: State-Transition Diagram

To organize nodes as clusters, the following routines are written.
Send G_Request: This function broadcasts the group request (G_request) packet.
Send N_Response: Sending response to the received G_request is defined in this function. The function sends
response (Send N_Response) packet from the nodes which have received G_request packet to the node which has
broadcasted G_request packet.
Send M_Select: This function sends mediator select (M_select) packet to the follower nodes of the cluster to
continue clustering process. The detailed explanation is given in the algorithm in the succeeding section.
Send C_Reset: This function sends C_Reset packet to reset the node attributes.
Send R_Set: This function sends R_Set packet to set path from destination to source in the clusters formed.
Receive: This function checks whether received packet is lfmp control packet. If it is lfmp packet, it transfers
control to the Receive lfmp function, otherwise control goes to Receive data function.
17
Receive lfmp: This function checks for type of lfmp control packet and it transfers control to the corresponding
receive function depending on the type of the control packet received.
Receive lfmp_greq: This function facilitates copying the source of G_request packet to send response.
Receive lfmp_nresp: This function maintains list of followers in the cluster head.
Receive lfmp_msel: This function receives mediator select signal sent from cluster head and supports to continue
to form next level cluster.
Receive lfmp_C_Reset: This function receives C_Reset signal and resets the nodes for every re-clustering.
Initially all the nodes are set with the initial energy. After clustering is formed and data transfer takes place the
residual energy of nodes decreases. For the next time, when re-clustering is done for data transfer the node
attributes except its present residual energy has to be reset to form the new clusters. This is taken care by this
function.
Receive lfmp_R_Set: This function receives R_Set signal to set path from the destination to the source in the
cluster formed.
2. 3 The LFM Algorithm to get LFM Tree where a Mobile Node Moves Outside the Boundary of Restricted Area to
Gather the Information from a Sensor Node
Input: Mobile destination node id, Source node _id
Depending on the residual energy level of the nodes, nodes are said to be in active (MODE 2), follower (MODE
1) or dead (MODE 0) mode.
Step 1: If the Source node has energy above or equal to threshold (MODE 2), it is set as the Leader.
Else go to step 11.
Step 2: Leader broadcasts G_Request packet.
Step 3: If no Nodes within transmission range of that Leader, go to step11.
Else
Nodes which are within transmission range of that Leader, which is not the member of any cluster and has the
energy above the minimum threshold (MODE 1) to become the follower and has least hop distance from source,
will set Rink of those nodes to Leader and respond by sending the N_Response packet.
Step 4: Leader receives N_Response packets and register that nodes as the followers of that group and checks for
destination
If destination is found, go to step11.
Step 5: For every follower of that group, Leader node sends mediator Select (M_Select) packet, ties are broken at
random.
Step 6: Nodes which receive that M_Select packet broadcast G_Request packet.
Step 7: Nodes which receive that packet and neither the leader nor the follower of any cluster and has the energy
www.tjprc.org
editor@tjprc.org
18
above the
minimum threshold (MODE 1) and has least hop distance from source, will set Rink of that nodes to mediator and
respond by sending the N_Response packet.
Step 8: Mediator receives N_Response packet and checks for destination node.
If destination is found, go to step11.
Step 9: Mediator sends L_Select packet to the nodes responded that has higher energy level (MODE 2), calling it
as the Leader, ties are broken at random.
Step 10: Nodes which receive that L_Select packet becomes the Leader.
Go to the Step 2.
Step11: Stop.
2.4 LFM Tree
The LFM clustering algorithm forms a tree structure for the deployed nodes and we call it as LFM tree.
The mobile destination node should be within the transmission range of at least one node. Consider 25 sensor nodes
arranged as 5X5 grid, with each node having transmission and reception range to its neighbor (one hop distance) and full
residual energy. The mobile destination node (node no. 25) is outside the grid but the neighbor of node no.20. The source
node is 4. The Scene is shown in figure 3. On applying LFM clustering procedure, starting from the source node 4 to the
destination node 25, the tree structure formed (LFM tree) is shown in figure 4.
Figure 3: 5X5 Grid with Node 25 Outside Grid
Figure 4: LFM Tree
19
The path finding procedure given above enables the data communication between sources and destination.
In LFM grouping algorithm, a node becomes follower of only one of the leader. Hence this grouping algorithm yields
acyclic graph with the nodes represented as vertices and the links by edges.
3. SIMULATED RESULTS
3.1 Demonstration of Working of LFMP Using NS-2
To demonstrate working of the LFMP, 25 sensor nodes deployed as 5 5 grid in 125 meters X 125 meters
disastrous area is considered. A mobile destination node which can move outside the boundary of restricted area collects
the information. For testing the working of our LFM grouping protocol and to compare with AODV, it is implemented
using NS-2 and post analysis is made from trace file. The controlled mobility to the destination node can be obtained by
either Bon motion tool [20] or node-movement generator available under ~ns/indep-utils/cmu-scen-gen/setdest.
Initial residual energy to all nodes is set to 1Joule. The nodes are assumed in MODE 2 if the residual energy is
greater than or equal to 0.5 Joule, MODE 1 if the residual energy is above 0 but less than 0.5Joule, MODE 0 if the residual
energy is 0. Initially all nodes are in MODE 2 state represented in green color. As simulation proceeds, energy of the nodes
consumes. When energy comes below 0.5Joule (MODE 2 state), the color of nodes change to yellow and such nodes are
not selected as leader and they can be the follower in the next clustering instance. If node energy comes to 0 (MODE 0
state) joule, node color changes to red and such nodes cannot participate in next clustering process and they are said to be
dead.
3. 2 Observations Made
The mobile sink moving outside a boundary and static sensor node deployed inside the boundary for data
gathering from a disastrous area is considered. A snapshot taken during simulation after clusters formed is shown in figure
5 to observe the LFM tree formed. The data transfer path at different instances for different location of a mobile sink is
shown in Figures 6.
Figure 5: Clustering Initiated from the Node 4 to link the Mobile Destination Node 25
www.tjprc.org
editor@tjprc.org
20
(a)
(b)
(d)
(c)
(e)
(f)
st
Figure 6: Data Transfer from Source Node 4 to Mobile Node 25 (a) 1 Instance (b) 2nd Instance
(c) 3rd Instance (d) 4th Instance (e) 5th Instance (f) No Path, Node 20 is Dead
Same scenario was run with AODV protocols. Simulations generated trace files lfmp.tr for LFMP and aodv.tr for
AODV protocols. From trace files the informations are extracted and parameters are obtained using awk scripts. Results
are shown in table 2. Graph showing comparison for different parameters for 25 nodes deployed in 125meters X 125
meters 5X5 Grid topology for a two way data transfer case are given in figure 7.
Table 2: Comparison of LFMP with AODV
Parameters
Packets sent
Packets received
PDF
Routing pkts
Throughput
No. of dropped data (packets)
LFMP
405
354
87.41
572
39.41
28
AODV
405
229
56.54
435
25.91
176
Figure 7: Graph Showing Comparison of LFMP with AODV

21
3. 3 Comparison of LFMP with AODV for different Grid Topologies

The tables 3 shows the simulation results obtained for different network parameters on running LFMP and AODV
protocols for different number of nodes in grid topologies. Graphs plotted for different network parameters are shown in
the Figures 8.
Table 3: Summary of the Comparison of LFMP with AODV
(a)
(c)
(b)
(d)
Figure 8: Graph Plotted for Number of Nodes Versus (a) PDF (b) Number of
Routing Packets Generated (c)Throughput (d) Packets Dropped
4. CONCLUSIONS AND FUTURE WORK

It has been observed from simulation that by using mobile node, energy conservation is possible there by over all
network life time improves. Also coverage area will increase due to mobility. If all the deployed nodes and control center
are static, we should take more care while deploying sensors to cover whole area. Channel capacity can be improved by
using more number of mobile sink nodes.
www.tjprc.org
editor@tjprc.org
22
In large scale networks, the objective of the clustering of the nodes is to conserve energy by limiting the number
of participating nodes in the data transfer process. In case of densely deployed sensors in a WSN, data sensed may be
redundant which will unnecessarily overload the media. Cluster heads can avoid redundant data transfer. In our article,
clustering is initiated by the source that has some sensed information which is to be sent to a remote destination
(control center). But the sensor nodes transmitter capacity is limited. A simple multi-hop method carries redundant data
and more number of nodes may get involved. Hence, we have opted clustering of nodes in which one of the members of
the cluster is chosen as mediator that propagates control packets to form next neighboring clusters. The mediator chosen
should be within the communication range of two cluster head to establish inter-cluster path. The cluster heads and
mediators take part in the propagation of data.
The current work can be improved further in the following aspects.
To maintain the energy consumption uniform re-clustering at different instances may be performed for same
position of mobile control center, when the energy of any participating node comes bellow certain threshold
value.
Bandwidth optimization for the sensor nodes is another question that may arise. This problem may be addressed
by logically arranging nodes as FAT tree, the links of varying bandwidth.
Security is another concern, when the sensors are placed in open place, tampering of sensitive information may
happen easily, particularly when multiple mobile sinks are gathering sensed data which is to be sent to stationary
control center where 3-teir architecture is used.
REFERENCES
1.
I. F. Akyldiz, W. Su etal, (2002) A Survey on Sensor Networks, IEEE CommunicationsMagazine, Vol.40, Issue
8, pp102-114.
2.
I. F. Akyldiz, W. Su etal, (2002) Wireless sensor networks: a survey, Computer Networks 38, pp 393422.
3.
I. F. Akyldiz, H. Ismail, Kasimoglu, (2004) Wireless sensor and actor networks: research challenges, Ad Hoc
Networks 2, pp351367.
4.
R. Nagpal, Daniel Coore, (1997), An algorithm for group formation in Amorphous Computer AI Memo 1026,
MIT Artificial Intelligence Laboratory, Cambridge. U.S.A.
5.
Bandyopadhyay, S and coyle, E. J. (2003),An energy efficient hierarchical clustering algorithm For Wireless
Sensor Networks, Twenty second Annual Joint Conf. of the IEEE Computer and Commun. Soc, Vol. 3,
pp 1713-1723.
6.
S. R. Gandham et al, (2003), Energy Efficient Schemes for Wireless Sensor Networks with Multiple Mobile
Base Stations, Proc. IEEE GLOBECOM.
7.
Saad Ahmed Munir, Biao Ren, Weiwei Jiao, Bin Wang, Dongliang Xie, Jian Ma, (2007), Mobile Wireless
Sensor Network: Architecture and Enabling Technologies for Ubiquitous Computing, IEEE 21st International
Conference on Advanced Information Networking and Workshops (AINAW'07) 0-7695-2847-3/07, IEEE
Computer Society.
23
8.
Eylem Ekici, Yaoyao Gu, and Doruk Bozdag, Ohio State University,(2006), Mobility-Based Communication in
Wireless Sensor Networks, IEEE Communications Magazine, pp56-62.
9.
Ameer Ahmed Abbasi, Mohamed Younis, (2007),A survey on clustering algorithms for wireless sensor
networks, Computer Communications 30, pp 28262841.
10. Laiali Almazaydesh, Eman Abdelfattah, Manal AL-Bzoor and Amer Al-Rahayfch, (2010), Performance
Evaluation of Routing Protocols in Wireless Sensor Networks, International Journal of Computer Science and
Information Technology, Volume 2, Number 2, pp64-73.
11. Jichuan Zhao, Ahmet T Erdogan and Tughrul Arslan, (2005), A Novel Application Specific Network Protocol
for Wireless Sensor Networks, IEEE, pp 5894-5897.
12. W. Rabiner Hienzelman, Ananth Chandrashekaran and Hari Balakrishna, (2000), Energy Efficient
Communication Protocol for Wireless Sensor Networks, Hawaii International Conference on system sciences.
13. Nader F. Mir, (2007), Computer and Communication Networks, Pearson Education.
14. MarziehVeyseh, Belle Wei and Nader F. Mir (2005),An Information Management Protocol to control Routing
and Clustering in Sensor Networks, Journal of computing and information Technology CIT 13, pp 53-68
15. M. Bani Yassein, A. Al-Zoubi, Y. Khamayesh & W. Mardini,(2009) Improvement on Leach Protocol of
Wireless Sensor Network (VLEACH), International Journal of Digital content Technology and its application,
Volume 3, Number 2, pp132-136.
16. Kevin Fall and Kannan Varadhan Editors, (2009), The ns Manual (formerly ns Notes and Documentation)
The VINT Project A collaboration between researchers at UC Berkeley, LBL, USC/ISI, and Xerox PARC.
17. Teerawat Issariyakul, Ekram Hossain, (2009) Introduction to Network Simulator NS2 2009 Springer Science
Business Media, LLC.
18. Marc Gray Tutorial for the network simulator NS.
19. Francisco J. Ros, Pedro M. Ruiz, (2004), Implementing a New Manet Unicast Routing Protocol in NS2 Dept. of
Information and Communications Engineering University of Murcia, pp1-35.
20. A manual of Bonn Motion- A Mobility Scenario Generation and Analysis Tool, Institute of Computer Science
IV, University of Bonn.
AUTHORS DETAILS
Venkatramana Bhat P. is currently the Professor and HOD, Department of Computer Science Engineering,
Vivekananda College of Engineering Technology, and Puttur (D. K) affiliated to VTU, Belgaum. He obtained his Bachelor
www.tjprc.org
editor@tjprc.org
24
of Engineering from Mysore University. He received his Masters degree in Computer Science and Engineering from
Manipal Institute of Technology, Manipal and presently pursuing Ph.D. in Computer Science and Engineering under
Manipal University.
Dr. Shridhar Aithal, Advanced Tech. Consultant in Canada is an Experienced Systems Engineer & Educator
was the Professor in T. A. Pai Management Institute Manipal, having tweleve Years of Industrial Experience and fourteen
years of Academic experience, obtained PhD in Energy Sciences, Masters in engineering physics from Canada, Diploma in
Computer Systems Technology and PMI certified PMP (Project Management Professional). He is also an approved
Research Guide in Manipal University Manipal. His subject of intrest mainly includes Wireless Sensor Network, Software
Engineering, Management Information System.
Dr. Sudhakara G, M. Sc, M. Phil, Ph. D, Professor, Department of Mathematics having 25 Years of teaching and
15 years of research experience, did his Ph.D in Graph Theory. His area of interest Graph Theory Self complementary
graphs, Algebraic graph theory, Combinatorics and working in Algebraic graph Theory. His area of interest includes
Combinatorics.

WSN in Disastrous Area Management

Caricato da

Informazioni sul documento

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

WSN in Disastrous Area Management

Caricato da

Copyright:

Formati disponibili

International Journal of Computer Networking,

Wireless and Mobile Communications (IJCNWMC)