Performance Analysis of Set Routing in Heterogeneous Mobile Wireless Sensor Networks

M.S.Godwin Premi1
1

K.S.Shaji2

Department of ETCE, Sathyabama University, Chennai -119 godwinpremi@yahoo.com 2 Rajas International Institute of Technology for Women, Nagercoil-1 shajibritto@yahoo.co.in
Abstract Current advancements in wireless technology leads the academicians and industry people to use the technologies with higher mobility. Many applications use mobile nodes as well as mobile sinks in wireless sensor networks. When the wireless sensor network uses the mobile sensor nodes and or sinks then it become a mobile wireless sensor network. Protocols which are used in static wireless sensor networks cannot be employed directly in mobile wireless sensor networks due to many challenges and issues. Among the various protocols, routing protocols plays a vital role in energy efficiency. One of the energy efficient routing protocols used in mobile wireless sensor networks is a set routing technique. In this paper, we proposed the same technique for heterogeneous nodes. The performance of set routing in heterogeneous network was compared with homogeneous network with respect to the achieved simulation results using Matlab. It is seen that set routing holds good even for heterogeneous nodes and the energy efficiency is almost maintained.

Key Words: energy, heterogeneous nodes, master nodes I. INTRODUCTION Wireless Sensor Network is a collection of large number of tiny sensor nodes comprising of power, memory, computing and communication units. When the mobility module is included then the sensor node is able to move around and the network becomes mobile wireless sensor networks. Based on where we employed the network, wireless sensor networks are broadly classified as terrestrial networks, underground networks and underwater networks. Based on the types of sensor nodes used, wireless sensor networks are classified as homogeneous and heterogeneous networks. In homogeneous networks, all the sensor nodes are same and in heterogeneous networks different types of nodes are used. In many applications related with monitoring and control it will be better to select heterogeneous networks. Logically the wireless sensor networks can be understood with a five layer protocol stack and six management planes. The five layers are the physical layer, data link layer, network layer, transport layer and application layer. The six management planes are task management plane, mobility management plane, power management plane, location management plane, topology management plane and synchronization plane. Main characteristics of wireless sensor networks are data centric, application specific, self organizing, and scalable. One of the important design goals of WSNs is to prolong the

lifetime of the network and to prevent loss of connectivity by employing aggressive energy management techniques. Despite the innumerable applications of WSNs, these networks have several restrictions, which should be considered when designing any protocol [4] for these networks. Some of these limitations are limited energy supply, limited computation and communication. In a large-scale system of systems, the hardware and networking technologies used in the underlying wireless sensor network may differ from one subsystem to another. This is true because of the lack of relevant standards dedicated to wireless sensor network and hence commercially available products often have disparate features. This platform heterogeneity makes it very difficult to make full use of the resources available in the integrated system. Consequently, resource efficiency cannot be maximized in many situations. In addition, the platform heterogeneity also makes it challenging to achieve real-time and reliable communication between different nodes. Typically, WSNs contain hundreds or thousands of these sensor nodes, and these sensors have the ability to communicate either among each other or directly to an external base station. A greater number of sensors allows for sensing over larger geographical regions with greater accuracy. Sensor nodes are usually scattered in a sensor field, which is an area where the sensor nodes are deployed. Sensor nodes coordinate among themselves to produce high-quality information about the physical environment. Each sensor node bases its decisions on its mission, the information it currently has, and its knowledge of its computing, communication, and energy resources. Each of these scattered sensor nodes has the capability to collect and route data either to other sensors or back to an external base stations. A sink node or the base station may be a fixed or mobile node capable of connecting the sensor network to an existing communications infrastructure or to the Internet where a user can have access to the reported data. II. RELATED WORK Studies related to mobile sensor nodes generally attempt to prolong the lifetime of the network. Due to the mobility, the consumed energy will be more [1], [3] and [5]. With energy efficient algorithms mobile nodes can be used which are addressed in the previous studies [2]. Previous works handle the mobility with the property of homogeneity. But here we addressed the problem with heterogeneity.

III. SYSTEM DESCRIPTION Our sensor network is considered as, all the sensor nodes are equipped with mobility and they form a mobile heterogeneous network. Three different types of sensor nodes with different functionalities and energy properties are used with a single base station or a sink node. In two different scenarios the performance of the network is explained and compared with homogeneous network. In the first scenario similar nodes are grouped together and in the second scenario each set or group of nodes contains different types of nodes. For both the scenarios set routing technique is employed and the difference in the performance is seen. Set routing is one among the routing techniques which is to be used in mobile wireless sensor networks. In which array of nodes are selected with a minimum criterion of at least one node in each hop as a set. The network setup for the first scenario is explained below. The mobile wireless sensor network was set up with a 90 mobile sensor nodes and a single sink node.ie. In each type 30 nodes were selected and deployed. In the first scenario the routing was explained with the three processes. They are formation of sets, efficient route discovery and route maintenance with new route establishment i.e.; initially sets of nodes were setup. After that the efficient route was discovered. At last the route was maintained or new route was established for data delivery.

The initial process was purely how the grouping of nodes is made in the network. In set routing, grouping of nodes was made by sink with the concept of relative neighborhood. Here, all the similar nodes were considered to be a group. So each group initially contains 30 nodes. These groups of nodes were subdivided into sets with a condition that at least one node in one hop, two hops and three hops distance. Also maximum number of nodes in a set was limited to nine. Again the formation of set is done by sink since the network follows set routing. The condition for set formation is given below. S is the set which contains the collection of single hop(1H), two hop(2H) and three hop(3H) nodes. N is the total number of nodes in S defined by the sink. S= {I1H, J2H, K3H} where I, J and K = at least 1 N= (I1H + J2H + K3H) 9 The total number of sets in each group will be 4 to 10. Thus the total number of sets in our network will be 12 to 30. Actually the first process is executed by the sink node with the help of low cost localization and naming algorithm. The second process was the route discovery. In this process in each set one master node was selected with a condition that the node who has maximum energy. All the data generated and received in the set was transmitted or forwarded through master node. Master node transmits the data in the forward path towards the sink node. Efficient route is discovered based on the algorithm given below. Different types of sensor nodes

M5 M1

M6 M10 Sink

M2 M9
Fig.1. WSN master nodes with sample route

Different types of master nodes

RREQ, n+1

RREQ, n+2

RREQ, n+3

RREQ, n+4

Sink RREQ, n

1H Master Nodes RREQ, n+1

2H Master Nodes RREQ, n+2

3H Master Nodes

4H Master Nodes

RREQ, n+3

RREP, id, T, e

RREP, id, T, e

RREP, id, T, e

RREP, id, T, e

RREP, id, T, e

RREP, id, T, e

RREP, id, T, e

RREP, id, T, e

Fig.2.Message flow for route discovery

Sink node broadcasted the route request (RREQ) message. All the nodes including master nodes which reside in single hop distance received the route request message. Only the master nodes re-broadcasted the message and all other ordinary nodes just discard the message. The route request message contains the request and the hop count. Whenever the message is rebroadcasted the hop count is incremented by one. If the message is received again by the 1H master node during rebroadcast, then the master node checks the hop count and discards the message. But at the same time the 2H master nodes received the request and continue the same process till the last hop master nodes receives. After some time interval the master nodes starts receiving route reply messages from higher hop master nodes. The route reply message contains route reply packet (RREP) with master nodes id, total hop distance from sink (T) and energy available in the master node (e). This depicted in fig.2. Based on the received reply messages the master node selects the lowest hop count with higher available energy as the first priority route. This route selection message is informed to the particular master node with the help of its id. The third process starts with the help of the database after the completion of one cycle. One cycle in set routing consists of eight stop points. For one complete cycle the same node will be considered as master node. Thus for one complete cycle the same route is followed in all eight stop points unless the route fails or critical. New route selection is done with the help of the connectivity database which is maintained by the master nodes. For every new cycle the new master node will be selected based on the higher available energy within the set and the same master id and connectivity database are given to the new master node of the set and the old master node becomes an ordinary node. For an example, in the first scenario, consider M1, M2, M3, , M12 are master nodes. Let M1, M2, M3 and M4 are the master nodes of the type1 sensor nodes, M5 to M8 are the master nodes of the type2 sensor nodes and M9 to M12 are the master nodes of the type3 sensor nodes. Using the above processes the route is determined. One sample path is M1M5M10M6sink which is shown in fig.1. SET ROUTING Set routing [2] is the technique which is proposed for mobile wireless sensor networks. The grouping of nodes are decided and executed by the sink node. Initially all the nodes are static. The START message is given to all the nodes by sink node. Once the START message is received by the sensor node then all the sensor nodes in the set starts moving.

The data are collected by the sensor nodes when they are mobile and the data are transmitted to the sink node when they are static. The directions of movement of sensor nodes are based on the rule, LEFT LEFT DOWN DOWN RIGHT RIGHT UP UP. At regular interval of time all the nodes are static in order to forward or transmit the data. The 8 stop points or data collection points around the sink node are shown in fig.3. IV. CONDITIONS CONSIDERED The considered wireless sensor network is to have heterogeneous sensor nodes. There are no collisions between sensor nodes and also with the sink during the movement of mobile sensor nodes. All the sensor nodes move with a fixed velocity and are mobile and static with regular intervals. All the nodes are generating the packets at regular intervals. V. EVALUATION METRICS We used the same radio model as stated in [1] with Eelec=50nj/bit as the energy being dissipated to run the transmitter or receiver circuits and Eamp=100pJbit/m2 as the energy dissipation of the transmission amplifier. The energy cost of transmission and reception for common sensor nodes is calculated as shown below .

with d as the length of the message in bits, d as the distance between transmitter and receiver node and as the path- loss exponent. The energy spent for mobility calculated as,

where F is the force in Newton, v is the velocity in m/s and t is the time taken in seconds. The energy spent for every new route establishment is given by where n is the total number of nodes, br is the total number of routing bits stored, k is the Boltzmzns constant and T is the temperature of the medium. VI. SIMULATION RESULTS The performance of the homogeneous and heterogeneous networks with set routing technique is checked with the help of the parameters such as remaining energy available in the network, number of packets transmitted, number of packets received and lifetime using Matlab. Simulations for the first scenario is carried out with the total number of sensor nodes in one type, N=30, v=10 m/min, side length of the sensing field, L=500m with maximum coverage of a node=175m. The node deployment in the homogeneous and heterogeneous pattern is shown in fig.4 and fig.5 respectively.

1 8 7

3 4

Fig.3. Eight positions of a set nodes around sink

In the fig.4 the big triangle indicates the sink node and the small circle indicates the sensor nodes. The dotted line shows the wireless connectivity with the neighboring nodes and the sink.
Homogeneous Node deployment 500 Width of the sensing field (m)

points show the node/ network failure. Middle line shows the homogeneous nodes grouping and upper and lower line show the heterogeneous nodes grouping with high and low energy levels respectively.
E eg aa b o th n twr ( c c ) n r y v ila ility f e e ok 1 y le 9 .5 Hm oo H teoH e r- E H teoL e r-E

400
R emaining Energy (J)

300

8 .5

200

100

Fig.6.
0 0 100 200 300 Length of the sensing field (m) 400 500

7 .5

7 1

Fig.4. WSN Deployment with homogeneous nodes

Remaining complete cycle

1 0 8 R aining Energy (J) em 6 4 2 0 2

4 5 Dtac lle tio p in a o c n o ts

energy during one

Simulations for the second scenario is carried out with the total number of sensor nodes, n=30, v=10 m/s, L=500m and h=10nJ. But three different types of nodes are used. In each type 10 nodes are selected. The node deployment in the second scenario is shown in fig.
Heterogeneous Node Deployment 500 Width of the sensing field (m)

Eeg aa b oth ntwr nr y vilaility f e e ok

400

300

4 6

200

4 N. oc c s o f y le

1 0

Fig.7. Lifetime of the network

100

CONCLUSION From the results it is understood that irrespective of the types of nodes used in the network the energy characteristics of the mobile WSN remains same whenever set routing technique is employed in the network. REFERENCES

100 200 300 400 Length of the sensing field (m)

Fig.5. WSN Deployment with heterogeneous nodes

500

In the fig.5 the big triangle indicates the sink node and the small triangle, small circle and small star indicates the different types of sensor nodes. The triangle nodes are defined with 1.25J of initial energy, the circle nodes are defined with 1J of initial energy and the star nodes are defined with 0.75J of initial energy. From the fig. 6 it is seen that whether the grouping is made either with the homogeneous nodes or with heterogeneous nodes with varying energy level, the characteristics of the network remains same whenever set routing is employed. From the fig.7 it is seen that the lifetime of the network varies depends on grouping. The triangle data

[1] [2]
[3] [4] [5]

M.S.Godwin Premi, K.S.Shaji, MMS Routing for Wireless Sensor Networks, IEEE Computer Society, Feb.2010. M.S.Godwin Premi, K.S.Shaji, Set Routing for Mobile Wireless Sensor Networks, Conference Proceedings of RTCSP, Mar.2011 M.S.Godwin Premi, K.S.Shaji, MMS Routing to Enhance Lifetime in Wireless Sensor Networks, Conference Proceedings of Wireless Communication and Sensor Networks, Dec.2009. Jamal Al-Karaki, Ahmed E.kamal, Routing Techniques in Wireless Sensor Networks, IEEE Wireless Communications. Dec.2004. Jun Luo, JeanPierre Hubaux, Joint Mobility and Routing for lifetime Elongation in Wireless Sensor Networks, IEEE INFOCOM, 2005.