VGDRA Protocol for Mobile Sink in WSN

International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395 -0056 Volume: 03 Issue: 10 | Oct-2016

www.irjet.net

p-ISSN: 2395-0072

VGDRA Protocol for Mobile Sink in WSN Ricky Devi and Maninder Singh Ricky Devi is a student of M.Tech. in ECE, HEC, Jagadhari Maninder Singh is Assistant Professor in ECE Department, HEC, Jagadhari ---------------------------------------------------------------------------***----------------------------------------------------------------------------was used in previous VGDRA scheme. While maintaining Abstract – Recently, a virtual Grid-based dynamic nearly our scheme aims to minimize the routes routes adjustment scheme for mobile sink-based wireless reconstruction cost of sensor nodes. In this approach sensor networks is introduced. This paper presents the energy model for reducing energy consumption of nodes proposed implementation of VGDRA and its comparative is used, which will improves lifetime and also reduce analysis, in which we are discussing the approach of cost consumption, avoiding straight line communication efficient data delivery using communication of distance which was used in previous VGDRA schme. priority i.e. avoiding straight line communication which Optimal routes to mobile sink’s latest location. sink, which reduces the communication cost.

Index terms - wireless sensor networks, distance priority, energy model, mobile sink, routes reconstruction.

1.1 Related work Various virtual structure based data dissemination protocols have been introduced in WSN. In this paper, we will discuss some of the previously introduced protocols and compare them with our proposed approach. This paper considers the uncontrolled sink mobility which means that the speed and/or direction of the mobile sink is not controlled. In this type of sink mobility, sink makes its next move freely in terms of direction and speed, whereas in controlled sink mobility scheme, the speed and /or direction of the sink is operated and controlled by an external observer or according to network dynamics. Virtual Circle Combined Straight Routing (VCCSR) scheme was introduced by Chen et al. [1] which is the converge-cast tree algorithm.

It forms a virtual structure containing virtual circles and straight lines. A set of nodes are chosen as cluster heads along these virtual circles and straight lines, which forms a virtual backbone network. VCCSR scheme reduces the routes reconstruction cost in managing the sink mobility due to its set of communication rules, but, the clusterhead being the centerpiece in routes re-adjustment process, depletes its energy much earlier. Another scheme called Hexagonal cell-based Data Dissemination (HexDD) was proposed in [2] which makes a hexagonal grid structure for real-time data delivery. In this, the dynamic conditions of multiple mobile sinks are considered.

This scheme results in high energy consumption mainly at higher sink’s speeds but it creates early hot-spot problem.

Oh et al. proposed a scheme based on data dissemination

1.INTRODUCTION Wireless sensor network (WSN) consists of nodes with computation, sensing and communication capabilities.

These nodes can communicate either among each other or directly to an external mobile sink. A larger number of sensor nodes allows for sensing over larger geographical area with greater accuracy. WSN has been widely used in various environments. E.g. in Disaster management system, a rescuer can check for any survivor around the affected area using a PDA device. In an intelligent transport system (ITS), sensor nodes placed at various places like car parks, area admitting to falling rocks, can provide early warnings to drivers (mobile sink) at an earlier time than their physical approach. Also in an area where a battle is fought, a commander can acquire information about trespass of enemies, attacks etc via field sensor on the move. In this approach, dynamic network topology is used as the mobile sink keeps on changing its location therefore for efficient data delivery, nodes need to keep the track of latest location of mobile sink. In virtual structure, only a set of nodes covered in the sensor field participates in making a track of mobile sink’s location. This scheme reduces collisions and retransmissions like in other data dissemination protocols e.g. The sensor field is divided into k equal sized cells. Nodes which are close to the cell’s centers are chosen as cell headers. These cell headers comprises virtual backbone network. The aim of this virtual structure is to reduce energy consumption by minimizing the routes read, Using This scheme, only a small group of cell headers take part in routes readjustment according to the latest location of mobile

© 2016, IRJET

|

Impact Factor value: 4.45

|

ISO 9001:2008 Certified Journal

|

Page 309

International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395 -0056 Volume: 03 Issue: 10 | Oct-2016

www.irjet.net

energy depletion of nodes as in above schemes. This approach also reduces the overall network lifetime.

Another approach called Virtual grid based Two-Tier Data Dissemination (TTDD) in [9] dedicatedly creates a uniform per source node virtual grid structure approaching the entire sensor field. TTDD even though avoids the flooding of the sink’s topological updates, but, the per source virtual grid construction reduces the network lifetime.

Geographical Cellular-like Architecture (GCA) in [10] makes a cellular-like hierarchical hexagonal virtual structure to handle sink mobility. GCA however avoids flooding of location information of sink, but there is increase in latency and packet loss ratio because of nonideal data delivery paths. Hierarchical Cluster-based Data Dissemination (HCDD) in [21] approaches a hierarchical cluster architecture in which the second level cluster-heads of the mobile sink are chosen as routing agents which are responsible for maintaining the track on latest location of mobile sink. In high sink mobility, nodes which are using HCDD suffer from high energy consumption. In this approach, high latency is there because the data delivery paths are not optimal.

called Backbone-based Virtual Infrastructure (BVI) in [3] that creates use of single-level multi-hop clustering. It points to minimize the total number of clusters. it employs HEED [4] for clustering in which priority is given to residual energy level of nodes for electing the CH nodes. The multi-hop clustering is a good approach to minimize the number of clusters, on the other hand, the root node which is the centerpiece in routes adjustments generates early energy depletion which reduces the network lifetime. Multiple Enhanced Specified-deployed Sub-sinks (MESS) in [5], makes a virtual strip in the centre of sensor field. An identical approach has been proposed in Line-Based Data Dissemination (LBDD) [6] which creates a vertical line by partitioning the sensor field into two same sized blocks. Along with this, another comparable approach was found in [7], which points a virtual rail (RailRoad) in the centre of the sensor field.

The main disadvantage of MESS, LBDD, and RailRoad is the early energy depletion of nodes near to the virtual structure.

Quadtree-based Data Dissemination (QDD) scheme was proposed by Mir and Ko in [8], which also results in early

Fig 2. Proposed approach showing the selection of cluster head on the basis of shortest distance between next clusters choosen for communication or the nearest cluster.

Fig 1. VGDRA approach showing straight line communication.

1. Conclusion

Virtual Grid based Dynamic Routes Adjustment (VGDRA) in [11], creates a virtual backbone network and uses straight line communication but in our proposed approach, In this approach use of distance priority communication is there which will reduce energy consumption and improves the network lifetime.It is noticed that better data deliveryperformance can be attained at the expense of more energy consumption. The main aim of this paper is to improved data delivery performance which reduces the energy consumption and improves the network lifetime.

Š 2016, IRJET

|

Impact Factor value: 4.45

p-ISSN: 2395-0072

In this paper, the comparison of various techniques with VGDRA is studied. Now, the main objective of a proposed approach is the selection of cluster head is based on shortest distance between next clusters choose to communication or nearest cluster. We are also considering energy model to reduce energy dissipation.

This approach will improve energy consumption and data delivery performance. Lifetime of the network will also be improved.

|

ISO 9001:2008 Certified Journal

|

Page 310

International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395 -0056 Volume: 03 Issue: 10 | Oct-2016

www.irjet.net

p-ISSN: 2395-0072

2. References [1]

[2]

T.-S. Chen, H.-W. Tsai, Y.-H. Chang and T.-C. Chen, “Geographic converge cast using mobile sink in wireless sensor networks,” Comput. Commun., vol. 36, no. 4, pp. 445–458, Feb. 2013.

A. Erman, A. Dilo, and P. Havinga, “A virtual infrastructure based on honeycomb tessellation for data dissemination in multi-sink mobile wireless sensor networks,” EURASIP J. Wireless Commun. Netw., vol. 2012, no. 17, pp. 1–54, 2012.

[3]

S. Oh, E. Lee, S. Park, J. Jung, and S.-H. Kim, “Communication scheme to support sink mobility in multi-hop clustered wireless sensor networks,” in Proc. 24th IEEE Int. Conf. Adv. Inf. Netw. Appl., Apr. 2010, pp. 866–872.

[4]

O. Younis and S. Fahmy, “HEED: A hybrid, energyefficient, distributed clustering approach for ad hoc sensor networks,” IEEE Trans. Mobile Comput., vol. 3, no. 4, pp. 366–379, Oct. 2004.

B. Tang, J. Wang, X. Geng, Y. Zheng, and J.-U. Kim, “A novel data retrieving mechanism in wireless sensor networks with path-limited mobile sink,” nt. J. Grid Distrib. Comput., vol. 5, no. 3, pp. 133– 140, 2012.

[5]

[6]

E. B. Hamida and G. Chelius, “A line-based data dissemination protocol for wireless sensor networks with mobile sink,” in Proc. IEEE Int. Conf. Commun., May 2008, pp. 2201–2205.

[7]

J.-H. Shin and D. Park, “A virtual infrastructure for large-scale wireless sensor networks,” Comput.

Commun., vol. 30, nos. 14–15, pp. 2853–2866, Oct. 2007.

[8]

Z. H. Mir and Y.-B. Ko, “A quadtree-based data dissemination protocol for wireless sensor networks with mobile sinks,” in Proc. Personal Wireless Commun., 2006, pp. 447–458.

H. Luo, F. Ye, J. Cheng, S. Lu, and L. Zhang, “TTDD: Two-tier data dissemination in large-scale wireless sensor networks,” Wireless Netw., vol.

11, nos. 1–2, pp. 161–175, Jan. 2005.

[9]

[10]

X. Chen and M. Xu, “A geographical cellular-like architecture for wireless sensor networks,” in Proc. Mobile Ad-Hoc Sensor Netw., 2003, pp.

249–258.

[11]

Abdul Waheed Khan, Abdul Hanan Abdullah, Mohammad Abdur Razzaque, and Javed Iqbal Bangash, “VGDRA: A Virtual Grid-based dynamic routes adjustment scheme for mobile sink-based wireless sensor networks, Ieee Sensors Journal, Vol. 15, No. 1, January 2015.

© 2016, IRJET

|

Impact Factor value: 4.45

|

ISO 9001:2008 Certified Journal

|

Page 311