International Journal of Computer Trends and Technology (IJCTT) - volume4Issue4 April 2013

Improvement in Qos using sink mobility in WSN

Chandni1, Kanika Sharma2
E.C.E Department National Institute for Technical Teachers Training and Research(NITTTR) NITTTR Sector 26 Chandigarh, INDIA Several researches are made in the area of routing in WSN towards improving the network lifetime, focusing on static applications. Recently, the sink was considered by [1] to be mobile to improve the lifetime of the network. Other protocols which supports mobile sink are Improved Energy Efficient Ant Based Routing algorithm (IEEABR) [2], Flooded Forward ant routing FF [3], Ad-hoc On-demand Distance Vector (AODV) [4], and Sensor-driven and Cost-aware ant routing (SC) [3] among others. Several researches based on swarm intelligence are adopted in [2], and honey bees [5] to improve the lifetime of network. The study of termite behavior has obtained remarkable achievements in the communication capabilities as compared to ants and honey bees. In [6], termite agents [7] were modeled for mobile wireless ad-hoc networking (MANET). In [9] the sink is considered to be mobile using termites but speed of sink is random.

Abstract: A wireless sensor network consists of large number of sensor nodes possessing the ability of sensing, computing and transmitting data from the harsh environment. The sensor node closer to the sink has to forward the data of the farther nodes along with its own. As a result of which the nodes lying near to the sink gets depleted in terms of energy than the other nodes which are lying farther from the sink. It results in network isolation or results in HOT SPOT problem. We have proposed an algorithm which will overcome the problem of average packet delivery rate in the network. This proposed algorithm has improved this factor to a significant extent. In this algorithm the position of the sink is optimized by applying ACO. The results of our extensive experiments on MATLAB demonstrated that our proposed routing algorithm was able to enhance the networks throughput to a large extent. Keywords-sink mobility; routing algorithm; wireless sensor network; swarm intelligence.

I.INTRODUCTION Wireless sensor networks (WSNs) consists of large number of compact-size, relatively inexpensive computational nodes that measure local environmental conditions, or other parameters and forward data to a central point for appropriate processing. Many applications of sensor networks deals with the static nature of nodes which in most cases sense their environment and then send the measured values to a central base station through diagonal routing, hence leading to rapid reduction of energy around the sink (base station). The issue is that, sensor nodes around the sink tend to deplete faster in energy than those that are farther away. This is mainly because, besides forwarding their own traffic, they forward the traffic of the other sensor nodes that are located farther away from the sink.
Figure 1 Termites nest [11]

ISSN: 2231-2803

http://www.ijcttjournal.org

Page 1

International Journal of Computer Trends and Technology (IJCTT) - volume4Issue4 April 2013
In our approach, we have considered sink in mobile scenario. We have used ACO to optimize the position of the sink. This approach has improved the average packet delivery rate and energy consumption of the sensor network to a significant level. The simulation is done in MATLAB simulator. The rest of the paper is organized as follows. Section II surveyed related work. In Section III, we have discussed our proposed algorithm. Experimental results are discussed in Section IV. II. RELATED WORK There are few routing protocols which supports sink mobility. Thanigaivelu et al. [1] investigated the effect of sink mobility in two scenarios in WSNs by using random way point mobility and random walk mobility. Marta et al. [8], propose a solution to decide sinks movements when the paths are not predetermined in WSNs supporting multihop communication. Luo et al. [9], proposed a routing protocol for WSNs which can predict a path using a mobile sink to prolong the network lifetime. The work in [10] is extended to use multiple mobile sinks to solve the problem of network growth. The drawback of all the surveyed work is that, they tend to sacrifice network average packet delivery rate in order to balance the network lifetime. III. PROPOSED ROUTING ALGORITHM The proposed algorithm is simulated by MATLAB. The methodology includes following steps: Initialization of parameters. Deployment of sensor nodes. Deployment of sink. Selection of a sensor node to communicate with the sink. Sink position optimization using ACO. Sink movement with speed. Data Transmission. A. ASSUMPTIONS Assume that the maximum range of sink is 60m i.e it can communicate only with the nodes that are lying in this range. The sensor nodes are randomly deployed in the wireless sensor network of dimension 200m * 200m. The initial energy of each node is 30 joules and minimum energy of each sensor node is assumed to be 5 joules. B. INITIALIZATION OF PARAMETERS The simulation is carried out using MATLAB software version R2011b. The simulation parameters are shown in table. Sensor nodes are randomly deployed in the network area. The simulation takes place for 100 seconds. The batteries of nodes are initialized with 30 joules. The participating nodes are stationary in nature. The sink is working in mobile scenario. The protocol which monitors and carries out the data transmission is diagonal routing.
TABLE I Simulation Parameters

Parameters Routing Protocols

Values Advance Termite Hill Routing Algorithm, Termite-hill Routing Algorithm 9 nodes 100 Seconds 30Joules 5Joules 200m x 200m 64 bytes 60m MATLAB R2011b software 802.15.4

Number of Nodes Simulation Time Nodes Energy Minimum Battery power Simulation area Packet size Transmission range of Sink Simulator Protocol

C. DEPLOYMENT OF SENSOR NODES The sensor nodes are randomly deployed in the network area and have uniform density and random location throughout the network. There are 9 sensor nodes and they are randomly deployed in an area of 200m X 200m. D. DEPLOYMENT OF SINK The sink is deployed after the sensor nodes. The transmission range of sink is assumed to be 60mIt is considered to be in mobile scenario. Initially it is static. When it finds a suitable position then it moves towards that location. E. SELECTION OF A SENSOR NODE TO COMMUNICATE WITH THE SINK The range of the sink is assumed to be 60m. Firstly it checks the nodes that whether they are in its range or not. If no neighbor is found then pit flag is set to 1. If some neighbors are found then the sink will check their battery values that whether their battery values

ISSN: 2231-2803

http://www.ijcttjournal.org

Page 2

International Journal of Computer Trends and Technology (IJCTT) - volume4Issue4 April 2013
are above some threshold value or not. If they are below the minimum value then pit flag is set to1 otherwise the node with shortest distance from the sink gets selected to communicate with the sink. F. SINK POSITION OPTIMIZATION USING ACO The sink is lying anywhere in the target field initially. The ants are also lying at that position. The range of ants is assumed to be 100m. After a short time period the ants starts searching the area. They intimate the sink about the new location. If the current position is best suited than new location only then it will not move. G. SINK MOVEMENT WITH SPEED The sink will move only if it finds a new location with higher energy than the current position. If the distance between the new location and current location is large then the sink will move at a higher pace by increasing the step size. If the distance between the two positions is not large enough then the sink will move at a slower pace by reducing the step size. H. DATA TRANSMISSION Data Transmission takes place through diagonal routing i.e. if the node is lying in the range of sink then it will directly sends its data to sink. But if it is not lying in the range of the sink then it will check for its nearest neighbor in terms of distance from the sink. In this way the data is routed towards the sink. I. ENERGY CONSUMPTION MODEL We have considered the signal to be a DPSK modulated and Rayleigh fading channel is assumed. For such modulation schemes, the Eb/N0 required for a given BER performance in a Rayleigh fading channel can be found out through simulation studies. For the system under consideration, the following equations apply: Pt = [pr x (4 )2 dn x ML x NF]/(Gt Gr 2) (1) Pr= E/NoNoRb (2) Et (d)= pt/Rb (3) Erece(k)= Eelect x k (4) Etrans(k,d)= Eelect x k + Et(d) x k (5) Pt- transmitted power. Pr - received power. ML - link margin compensating the hardware. NF- receiver noise figure. N0 - single sided thermal noise power spectral density. Gt - gain of the transmitter. Gr - gain of the receiver. k -length of the message (bits) to be transmitted. - wavelength of the signal. Etrans and Erece are the transmitting cost and receiving cost respectively, n is path-loss exponent typically ranges from 2 5. For our simulation purpose we take n as 2 and Gt and Gr as unity. Eelec is the energy dissipation to run the transmitter or receiver circuitry and Et(d) is the energy dissipation for the transmission amplifier for single bit.

IV. EXPERIMENTAL RESULTS

Figure 2 Data transmission through diagonal routing Figure 3 Throughput V/s Speed of sink

ISSN: 2231-2803

http://www.ijcttjournal.org

Page 3

International Journal of Computer Trends and Technology (IJCTT) - volume4Issue4 April 2013
Throughput: It is the average rate of successful packets delivered over the network. It is measured in data packets per second. The improvement in the throughput of network for proposed algorithm results from the implementation of ACO to find the best suited location for the sink. The throughput is improved to a significant level as shown in the comparison graphs. The maximum value of throughput of proposed algorithm is 26kbps when the speed of sink is 40m/s while the value is 4kbps at a speed of 20m/s in case of termite Hill routing algorithm. V. CONCLUSION We simulated our routing algorithm in MATLAB considering the sink to be mobile. In this paper, we have investigated the impact of sink mobility on different parameters of the network. Nodes near the sink get depleted faster in terms of their energy which might creates holes in the network thus resulting in network isolation. With the mobility of sink, the nodes around the sink always changes, thus reducing the energy consumption in the network. Our proposed algorithm is able to improve the throughput of the network as seen in the graph. REFERENCES
[1] K. Thanigaivelu, and K. Murugan, Impact of Sink Mobility on Network Performance in Wireless Sensor Networks, In: First IEEE International Conference on Networks & Communications, pp. 7-11, 2009. [2] A. M. Zungeru, L. -M. Ang, S. R. S. Prabaharan, and K. P. Seng, Ant Based Routing Protocol for Visual Sensors, ICIEIS, part II, CCIS252, pp. 250-264, 2011. [3] Y. Zhang, L.D. Kuhn, and M.P.J. Fromherz, Improvements on Ant Routing for Sensor Networks, Ant Colony Optimization and Swarm Intelligence, LNCS, 3172, pp. 289-313, 2004. [4] C. Perkins, and E. Royer, Ad-hoc on-demand distance vector routing, in: Proceedings of Second IEEE Workshop on Mobile Computing Systems and Applications, 1999. [5] M. Saleem, and M. Farooq, Beesensor: A bee-inspired power aware routing algorithms, Proc. EvoCOMNET, LNCS 3449, pp. 136-146, 2005. [6] M. Roth, and S. Wicker, Termite: ad-hoc networking with stigmergy, GLOBECOM 03, IEEE Global Telecommunications Conference, vol. 5, pp. 2937-2941, 2003. [7] Termites 2011; [Accessed 18 October 2011], [online] Available at: < http://en.wikipedia.org/wiki/Termite> [8] M. Marta, and M. Cardei, Using Sink Mobility to Increase Wireless Sensor Networks Lifetime, In: Proceedings of the Ninth IEEE Intl Symp.World of Wireless, Mobile and Multimedia Networks, pp. 1- 10, 2008. [9] A.M. Zungeru, Li-Minn Ang, Kah Phooi SengTermite-hill: Routing Towards a Mobile Sink for Improving Network Lifetime inWireless Sensor Networks,Third IEEE International Conference on Intelligent Systems Modelling and Simulation, pp. 622-627, 2012 [10] J. Luo, J. Panchard, M. Piorkowski, M. Grossglauser, and J. Hubaux, MobiRoute: Routing towards a Mobile Sink for Improving Lifetime in Sensor Networks, In: Proceedings Second IEEE/ACM Intl Conf. Distributed Computing in Sensor Systems, pp. 480-497, 2006. [11] M. Dorigo, Thomas Sttuzle, Ant Colony Optimization, MIT press, pp. 356-360, 2004.

ISSN: 2231-2803

http://www.ijcttjournal.org

Page 4