Geometrical Shape Based Multipath Routing in WSNs

IPASJ International Journal of Electronics & Communication (IIJEC)
Web Site: http://www.ipasj.org/IIJEC/IIJEC.htm

Email: editoriijec@ipasj.org
ISSN 2321-5984
A Publisher for Research Motivation........
Volume 4, Issue 9, September 2016
Geometrical Shape Based Multipath Routing in

WSNs
Smt. Sunita S. Khanapur
Department of Electronics and Communication Engineering, Basaveshwar Engineering College, Bagalkot-587102, INDIA
ABSTRACT
Wireless Sensor Networks (WSNs), multipath routing facilitates energy efficient routes and reliable for critical information
delivery to the sink node from an event occurrence node. In this paper employ a set of static and mobile agents for developing
Geometrical Shape Based Multipath Routing in WSNs (GSBMR). Each sensor node is assumed to know the location
information of the sink node and event node. In the proposed work Event node computes arbitrary distance, Straight Route
Special Intermediate Nodes (SRSINs), Special Top and Bottom nodes (STN and SBN) and shortest distance between event node
and sink node by using location information. In GSBMR mobile agent migrate from one node to another along the straight
above the reference axis and below reference axis. During the traversal each mobile agent gathers the node information (node
id, location information, residual energy, available bandwidth, neighbors connectivity the partial topology information) and
delivers it to the sink node. Using the partial topology information, Sink node compute node disjoint multiple routes and route
weight factor by using energy ratio, link efficiency and hop distance for all route discovered by the mobile agent. Depending on
the criticalness of event the sink node selects a single route for emergent data delivery or multiple routes for reliable data
delivery. To validate the proposed scheme, we have simulated the scheme for various performance parameters.
Keywords: Geometrical shape, event detection, multipath routing, mobile agent.
1. INTRODUCTION
In WSNs, building sensors has been made possible by the recent advances in Micro- Electro Mechanical System
(MEMS) technology. Each sensor nodes has limited transmission range so they cannot send their data directly to the
base station or sink, so they make use of multi-hop communication to send their data to the base station or sink [1].
Sensor nodes are used in application such as earthquake monitoring, military, fire detection, habitat monitoring, under
water surveillance radars and environmental monitoring which require unattended operations.
WSN has some characteristics and constraints such as production cost, lifetime, communication paradigm, flexibility
and security etc. [2]. A sensor network design is manipulated by many issues such as scalability, power consumption,
node deployment and sensor network topology, etc. [1], [3], and [4]. Some of the applications in WSNs are military
application, home care monitoring and fire detection etc. [1].
Recent advances in WSNs introduce many protocols specially designed for sensor networks. Routing mechanisms
consider the inherent features of WSNs and the application requirement. The main target is to design an effective and
energy aware protocol in order to enhance the network lifetime. To minimize energy consumption, routing techniques
proposed for WSNs has some well-known routing strategy they are Flooding and Gossiping are the two classical
mechanisms to relay data in sensor networks without the need for any routing algorithms [5]. Deployment of flooding
is very easy. To over this problem routing protocols became necessary in WSNs. Routing protocols has some of the
advantages and disadvantages are as follows [6]. There are two types of routing techniques in WSNs i.e. single path
routing and multiple path routing. Single path routing is simple because it route the path between sources and sink
node, single path routing approach is unable to provide efficient high data rate transmission in WSNs. These problems
can be overcome by the multipath routing techniques, this routing approach is used to construct several paths from
individual sensor nodes towards the destination or sink node whenever node or link fails.
The main objective of the proposed work is to improve the quality of WSN with concerned to some challenging issues
by location aware and multipath routing which are; Contribution of proposed work: Deployment of straight route
special intermediate nodes for the route (SRSINs), special top and bottom nodes (STN, SBN) for the three routes
connecting event and sink node. By using STN and SBN location information computing the arrival and leaving angle.
Page 1


ISSN 2321-5984
Usage of mobile agent, consideration of joint measures, and computation of the node disjoints routes based on partial
topology information available around the event and sink nodes. Prioritizes the node disjoints routes.
The rest of the thesis is organized as follows. 2 describe related works. 3 depict the software agents and mobile agents.
Proposed work is presented in 4 which comprises of network environment, the various models used, agency, proposed
algorithm and agent interaction. 5 present the simulation models, performance parameters and simulation procedure
and present the results and discussions. 6 conclude proposed work and some future directions to continue the further
work.
2. RELATED WORK
The work given in [7] describes a GPS localization scheme based on connectivity metric, the connectivity metric uses
the Radio Frequency (RF) communication capabilities of wireless devices. A fixed number of reference points are used
for localization with overlapping coverage regions and transmit periodic beacon signals. Nodes use a simple
connectivity metric to localize themselves to nearest reference points.
The congestion control in WSNs based multipath routing in priority rate adjustment technique protocol is presented in
[8]. The congestion in WSNs needs to be controlled to prolong the lifetime of network and to avoid packet loss. It is
required to improve the fairness and provide better QOS. The efficient multipath protocol for WSNs describes a
multipath routing algorithm based on direct diffusion that reinforces multiple paths with link quality and low latency
[9]. It improves the energy efficiency and scalability.
The work given in [10] presents the awareness of QoS and energy efficiency by multipath routing which increases the
network lifetime in WSNs. It establishes a trade-off between energy and QoS to improve the network performance.
Relax multipath routing protocol for WSNs is presented in [11]. This protocol uses battery relaxation period to improve
the network lifetime and reliability. The relaxation period is used to recover the battery from its lost capacity to increase
the battery life, which increase the lifetime of entire network.
3. SOFTWARE AGENTS
Agents are the autonomous programs which sense the environment and acts upon the environment using its knowledge
to achieve their goals. Software agent technology is emerging as a new paradigm in area of artificial intelligence and
computing that facilitates growth of software development with features like flexibility, scalability, customization, and
reduced network bandwidth [12]. The orthogonal properties provide strong notion of agents [13].
Software agents are classified into types namely single agent systems (SAS), while performing a task, an agent may
communicate with a user and local or remote system resources and multi- agents system (MAS) may extensively
cooperate with each other to achieve their individual goals, and also may interact with users and system resources.
Without communication, different agents cannot know from each other who is doing what and how they can cooperate.
Therefore agents need to communicate; they must individually understand some agent communication language
(ACL) [14] is a must if we want to set up useful MAS.
A mobile agent is a type of software agent, with the feature of autonomy, social ability, learning and mobility. Mobile
agent is a process that can transport its state from one network to another, with its data intact, and be capable of
performing appropriate task in the new network. Mobile agents decide when and where to move. Mobile agents must
contain the following models [15]: security model, communication model and navigation model. The mobile agent
approach grew out of three earlier technologies: process migration, remote evaluation and mobile objects.
4. PROPOSED SCHEME
In this section, we present complete model of the proposed work. Firstly describe about network environment and then
depicts different agencies and interaction is describe.
4.1 Network Environment
It comprise of tiny sensor nodes with heterogeneous data sensing capability and a sink node which is shown in figure 1.
Sensor nodes are geographically distributed. We assume that sensor nodes and sink node in the network are static.
Whenever the event is detected in the sensor node, they send the data to sink node by using wireless multi-hop
communication. During implementation phase, all sensor nodes have same energy. Network environment is assumed
that sensor nodes have ability to reconfigure the transmission power. In the proposed Geometrical Shape Based on
Page 2

ISSN 2321-5984
Multipath Routing in WSNs (GSBMR) work, we assume that only few sensor nodes with GPS are deployed and
remaining sensor nodes use localization techniques to locate their positions.
Using the GPS information sensor nodes estimate their approximate location. This process reduces the cost of the
proposed system. Practically, GPS sensor nodes achieve relative position and movement of individual nodes within the
network has accuracy. Each sensor node comprises of an agent platform with security features to organize the interagent communication. A sensor node (active nodes) participates in gathering if and only if the sensed values in a
particular time window change by a given threshold.
Figure 1
Network Environment
4.2 Agency
In this section, we discuss node agency and sink node agency
4.2.1
Node agency
It consists of Node Manager Agent (NMA), Route Discovery Agent (RDA) and Node Knowledge Base (NKB) for interagent communication. NMA is static agent, whereas RDA is the mobile agent. The components of the node agency and
their interactions are depicted in figure 2
Node Knowledge Base (NKB): It is the knowledge base which can be read and updated by agents. It consists of node
id, sink node id, active/sleeping mode, residual energy, STN ids, SBN ids, location informations of STN and SBN,
location information of sink node, distance between the neighbor nodes, event sensing time, available bandwidth,
distance between itself and sink node, signal strength, arrival and leaving angles. It also maintains the neighbor nodes
information such as node id and GPS location information and weight factor. The event sensor node maintains the
route(s) information from itself to sink node as presented by the sink node agency.
Figure 2 Node Agency
Page 3


ISSN 2321-5984
Node Manager Agent (NMA): It is a static agent that resides in all the sensor nodes of WSNs. It maintains the
information available such as signal strength, transmission range, time stamp, and residual energy. The parameters
link efficiency, minimum - maximum residual energy, and distance are computed by NMA. It checks for event
detection, if an event is detected, it computes the straight route special intermediate nodes between event node and sink
node, STN and SBN with the reference axis between the event node and the sinks node. It also computes the arrival and
leaving angle for agent movement. NMA creates RDA and NKB. NMA uses NKB to update the route information. If
there is decrease in residual energy, then NMA sends the status of the energy to its nearest sensor node. NMA gets the
neighbouring node information such as node id, location, and updates the NKB.
Route Discovery Agent (RDA): whenever an event is detected, NMA of the event node triggers a RDA (mobile agent)
from event node. Three clones of RDA are sent for the route discovery. A clone is copy of the parent agent. While
migrating, RDA collects the route information such as residual energy of STN and SBN, distance between the sensor
nodes and the hop count; it also collects the entire neighbours information. RDAs traverse network in three directions.
First RDA traverses with almost zero degree until it reaches the sink node. The second RDA traverses until it reaches
the STN node with arrival angle and from STN node, it migrates with leaving angle to reach the sink node. The third
RDA traverses until it reaches the SBN node with leaving angle and from SBN node, it migrates with arrival angle to
reach the sink node. Finally, RDAs deliver the collected partial topology information to the sink node.
4.2.2 Sink node agency
The sink node agency consists of Sink Manager Agent (SMA), Route Setup Agent (RSA), and Sink Knowledge Base
(SKB) for interagent communication. The components of the sink agency and their interactions are depicted in figure
3.
Sink Knowledge Base (SKBB): It is the knowledge base that can be read and updated by SMA, RDA, and RSA. It
stores the network related information such as hope count, hop distance, available bandwidth, channel capacity,
residual energy, minimum - maximum value of the residual energy of each route, number of available routes to the
event node, route weight factor, etc.
Figure 3 Sink node Agency

Sink Manager Agent (SMA): It is a static agent residing in sink node that records the network related information
such as number of active nodes, all sensor nodes id and available route information to reach event node. Based on the
aggregated information such as residual energy, hope distance, available bandwidth and hop count for each route, it is
responsible to compute the node disjoint routes from sink node to the event node. It computes route weight factor of
each route. Depending on the type of event, it decides to choose more than one route. Prioritization of multiple routes is
based on route weight factor. Finally evaluates the criticalness of event, based on this it selects a single or multiple
routes to event node and triggers the RSA to establish the routes to event node. To reduce the overheads, we have
considered maximum of three best disjoint routes.
Route Setup Agent (RSA): It is the mobile agent triggered by the SMA. It gets the route information from the SKB
and traverse to the event node to verify the nodes on the route for the considered parameters. After reaching the event
node, it updates the NKB with route information.
Page 4


ISSN 2321-5984
4.3 Agent Interaction

This section presents the operation of the proposed scheme to realize some of the application interactions. Sample agent
interaction is shown in the figure 4. It comprises of sensor nodes, event node (S1), sink node (S4), straight route special
intermediate nodes (S2 and S3) and STN and SBN (STN11 and SBN12). The operation sequence is as follows:
1. NMA of the event node computes arbitrary distance between S1 and S4, event node selects the S2 and S3 from
event to sink node with three equal distances.
2. Whenever an event is generated at the sensor node S1, NMA of the event node initiates the route discovery process
to the sink node.
3. NMA generates RDA; RDA generates three clones of RDA and their angle of traversal; clones 1, 2, and 3 traverses
until they reach the sink node, STN11 and SBN12, respectively. During RDA migration, it collects the partial
topology information.
4. From Special Top and Bottom nodes STN11 and SBN12, RDA clones 2 and 3 change their angle of traversal.
They deliver route information to the sink node.
5. SMA computes the route weight factor and identifies the node disjoint routes and prioritizes them.
6. SMA triggers the RSA on the best route considering noncritical event, which migrates to event node.
Figure 4 Agent interaction
5. SIMULATION AND RESULTS

Proposed work is simulated in Turbo C, by considering area as 100X100 meters, number of nodes is varying from 40200, communication range is 300- 500 meters, and nodes energy is 1Kjoules. Nodes are deployed in random manner in
the network; size of sensed data is 5Kbytes.
The following performance parameters are assessed.
1. Packet delivery ratio: It is a ratio of packets received to packets sent.
2. Energy consumption: It is the total energy consumed for the route discovery, route setup and sending data from
event node to sink node. It is expressed in terms of mille Joules.
3. Latency: It is the total time taken to transmit the data from event node to sink node. It is expressed in terms of
milliseconds.
4. Number of routes: It is the total number of node disjoint routes between the event node and the sink node.
5. Overhead: It is the additional code which acquires the communication channel.
Figure 5 presents packet delivery ratio (PDR) for given number of nodes involved in transmission and the
communication range. As the number of transmitting nodes increases with increase in communication range, PDA
decreases. However, GSBMR exhibits good PDR. The amount of data generated increases with increase in number of
transmitting nodes; this causes more bandwidth requirements. PDR in GSBMR is better with higher transmission range
due to reduction in number of individual nodes.
Page 5


ISSN 2321-5984
Figure 5 Packet delivery ratio vs.

Number of transmitting nodes
Figure 6 explains the energy consumption for the given number of transmitting nodes and the transmission range. With
increase in the number of nodes and communication range, the energy consumption increases. Energy consumption is
due to gathering of partial topology information, route computation, route information transmission, and reception. The
proposed GSBMR scheme exhibits less energy consumption because it uses partial topology, hop distance factor, and
energy information (energy efficiency) gathering for route computation.
Figure 6 Energy consumption in MilliJoules vs.

Figure 7 describes the latency for the given number of transmitting nodes and transmission range. As the number of
transmitting nodes and the communication range increase, time required to gather and compute the multiple disjoint
routes will also increase. GSBMR takes less time in computing routes. As the proposed work uses only partial topology
information for finding the routes, the latency involved will be less. The route distance between the event node and sink
node is computed using the special top and bottom nodes, route distance is less.
Page 6


ISSN 2321-5984
Figure 7 Latency in milliseconds vs.

Figure 8 shows the number of available node disjoint routes with given number of nodes in the network and the
transmission range. The disjoint routes increase with increase in number of nodes and transmission range. This is done
due to agents moving in three different directions and collects the third degree neighbour information. Higher the
degree of neighbours, probability of getting more disjoint routes increases.
Figure 8 Number of routes vs. Number of nodes

Figures 9 and 10 present the overhead with the given number of nodes and communication range for critical and noncritical data communication. Increase in transmission range and the number of nodes the overhead increases. With
increase in the number of nodes and transmission range, the number of computations and transmission increase. For
critical information communication, GSBMR uses multipath routing in order to achieve the reliable communication,
whereas single route with highest weight factor is chosen for non-critical information. As the proposed GSBMR uses
agents movement in restricted directions to get partial topology information, the number of transmission for finding
the multiple routes is reduced.
Page 7


ISSN 2321-5984
Figure 9 Overhead in percentage vs.

Number of nodes (critical)
Figure 10 Overhead in percentage vs.

Number of nodes (non-critical)
6. CONCLUSION
We proposed the Geometrical shape based on multipath routing in WSNs scheme by employing localization technique,
set of static and mobile agents. In the proposed scheme a event node triggers the route discovery mechanism by
determining the special top and bottom nodes between event and sink node. The set of mobile agents are used to carry
the partial topology information like node id, residual energy, hop distance and hop count etc. from event node to sink
node through special top and bottom nodes by using location information. The partial topology information is used in
computing the node disjoint routes by sink node. For node disjoint routes, the sink node computes the route weight
factor based on the route efficiency, energy ratio and hop distance factor. For critical data, routing scheme assures in
time data delivery by multiple routes; if non-critical then a single route with highest weight factor is established to
assure reliable data transmission.
REFERENCES
[1] Ian F, Akyildiz W, Su W, Sankarasubramaniam Y., Cayirci E. Wireless sensor networks: a
survey,
Communication magazine, IEEE, Vol. 40, No. 8, 2002, pp. 10214.
[2] Singh, Shio Kumar and Singh M. P. and Singh D. K., Routing protocols in wireless sensor networks A
survey , International Journal of Computer science and engineering Survey (IJCSES), Vol. 1, No. 2, 2010, pp.
63-83.
[3] Akyildiz, Ian F. and Su. Weilian and Sankarasubramaniam, Yogesh and Cayirci Erdal, Wireless sensor
networks: a survey , Computer networks, Vol. 38, No. 4, 2002, pp. 393-422.
Page 8


ISSN 2321-5984
[4] Puccinelli, Daniele and Haenggi, Martin, Wireless sensor networks: applications and challenges of ubiquitous
sensing , Circuits and Systems Magazine, IEEE, Vol. 5, No. 3, 2005, pp. 19-31.
[5] S. Hedetniemi, A. Liestman, A survey of gossiping and broadcasting in communication networks, Networks Vol.
18, No. 4, 1988, pp. 319349.
[6] D. Bhattacharyya, T. Kim, S. Pal, A Comparative Study of Wireless Sensor Networks and Their Routing
Protocols, MDPI Journal on Sensor, 2010, vol. 10, pp. 10506-10523.
[7] Bulusu, Nirupama and Heidemann, John and Estrin, Deborah, GPS-less low-cost outdoor localization for very
small devices , Personal Communications, IEEE, Vol. 7, No. 5, 2000, pp. 28-34.
[8] Malar, R. Then, Congestion Control in Wireless Sensor Networks Based Multi-Path Routing In Priority Rate
Adjustment Technique", proceedings of International Journal of Advanced Engineering & Applications, 2010, pp
28-33.
[9] Li, Shuang, et al., Efficient multi-path protocol for wireless sensor networks", International Journal of Wireless
and Mobile Networks 2.1, 2010, pp 110-130.
[10] Rasouli Heikalabad, Saeed and Rasouli, Hossein and Nematy, Farhad and Rahmani, Naeim, QEMPAR: QoS
and Energy Aware Multi-Path Routing Algorithm for Real- Time Applications in Wireless Sensor Networks ,
2011.
[11] Devisri R. and Archana Devy R. J., Reliable and power relaxation multipath routing protocol for wireless sensor
networks , Proceedings of international conference on advancement in information technology, 2011.
[12] Orhan Dagdeviren, Ilker Korkmaz, Fatih Tekbacak and Kayhan Erciyes, A Survey of Agent Technologies for
Wireless Sensor Networks, VOL 27, 2010, pp 1-17.
[13] R. A. Brooks, A Robust Layered Control System for A Mobile Robot , IEEE Journal of Robotics and
Automation, Vol. 2, No. 1, 1986, pp. 14-23.
[14] M. P. Singh, Agent Communication Languages: Rethinking the Principles , Communication in Multiagent
Systems, Springer, Lecture Notes in Computer Science, Vol. 2650, 2003, pp. 377-390.
[15] K. Rothermel and M. Schwehm, Mobile Agents , Encyclopedia for Computer Science and Technology, A.
Kent and J. G.Williams (Eds.), Supplement 25, M. Dekker Inc., New York, Vol. 40, 1999.
AUTHOR
Smt. Sunita S. Khanapur received the B.E. in Instrumentation Technology and part-time M.Tech. in
Digital Electronics and Communication Engineering from Basaveshwar Engineering College, Bagalkot,
Karnataka, INDIA in 2010 and 2014, respectively. Since from 2011 working as part-time Lecturer in
Govt. Polytechnic college, Vijayapur .
Page 9

Geometrical Shape Based Multipath Routing in WSNs

Diunggah oleh

Informasi Dokumen

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Geometrical Shape Based Multipath Routing in WSNs

Diunggah oleh

Hak Cipta:

Format Tersedia

IPASJ International Journal of Electronics & Communication (IIJEC)

Web Site: http://www.ipasj.org/IIJEC/IIJEC.htm

A Publisher for Research Motivation........

Volume 4, Issue 9, September 2016