A mobile sink path planning for wireless sensor networks based on priority-ordered dependent nonparametric trees

Abstract

The professional design of the routing protocols with mobile sink(s) in wireless sensor networks (WSNs) is important for many purposes such as maximizing energy efficiency, increasing network life, and evenly distributing load balance across the network. Moreover, mobile sinks ought to first collect data from nodes which have very important and dense data so that packet collision and loss can be prevented at an advanced level. For these purposes, the present paper proposes a new mobile path planning protocol by introducing priority-ordered dependent nonparametric trees (PoDNTs) for WSNs. Unlike traditional clustered or swarm intelligence topology-based routing methods, a topology which has hierarchical and dependent infinite tree structure provides a robust link connection between nodes, making it easier to reselect ancestor nodes (ANs). The proposed priority-ordered infinite trees are sampled in the specific time frames by introducing new equations and hierarchically associated with their child nodes starting from the root node. Hence, the nodes with the highest priority and energy that belong to the constructed tree family are selected as ANs with an opportunistic approach. A mobile sink simply visits these ANs to acquire data from all nodes in the network and return to where it started. As a result, the route traveled is assigned as the mobile path for the current round. We have performed comprehensive performance analysis to illustrate the effectiveness of the present study using NS-2 simulation environment. The present routing protocol has achieved better results than the other algorithms over various performance metrics.