An Efficient Mobile-Sink Trajectory Design in a Wireless Sensor Network

Abstract

Abstract

An Efficient Mobile-Sink Trajectory Design in a Wireless Sensor Network Saim Ghafoor Prof. Park, Sung-Han Department of Computer Science & Engineering Graduate School of Engineering Hanyang University, South Korea

The aim of wireless sensor network is to gather the data from the environment and route the data to the base station. In this perspective firstly the need of Mobile?Sink Trajectory has gain tremendous importance. Secondly the full coverage of network and deployment of sensor nodes become the associated issues for designing an efficient trajectory for mobile sink. Finally the accumulated data dissemination in a timely manner has its own importance in parallel with the overall network life time. In this regard, proposed herein is an algorithm for mobile-sink trajectory to cover the entire target area efficiently and to collect the data from whole network in a timely manner. The proposed algorithm for mobile sink trajectory is based on Hilbert Space Filling Curve with curve-order selection, according to network density. In this work, firstly, we investigate the mobile sink trajectory based on hilbert curve order that depends upon size of the network, to gather the data from randomly deployed sensor nodes in the network. Secondly, we develop the same hilbert curve order based trajectory for collecting the data from sensor nodes deployed on the basis of expected network density. Finally, we show the impact of network density on the hilbert curve order for re-dimensioned trajectory design. Results show that our proposed re-dimensioned trajectory design for mobile sink efficiently deals with the aforementioned issues. Also we can get the full network coverage in terms of increasing number of nodes. We perform several simulations by taking different number of nodes. Our proposed algorithm is fair enough to support the scalability; results confirm that our proposed approach is 100% scalable. To the best of our knowledge we are the first to propose the Hilbert Curve order based trajectory design that depends upon the network density of network. The simulation results also show that better results can be achieved in comparison with Original Hilbert Curve, in terms of Network Coverage (i.e. 100%) and Packet Delivery Ratio (i.e. 20%) even in high network density. Aforementioned can be achieved simply by re-dimensioning the hilbert curve on the basis of network density.