Abstract

The increased dynamics and complexity of wireless sensor networks (WSNs) raises higher requirements on the flexibility and applicability of data collection algorithms. Therefore, a novel distributed optimization framework for data collection with energy harvesting in duty-cycle (DC) WSNs is developed in this article, which employs the mobile collector (called SenCar) to collect data from the selected sensors (called anchors) to circumvent the bottlenecks caused by the variations of energy distribution. In order to guarantee the optimality of mobile data collection, it is divided into two steps: Firstly, a method for calculating the optimal number of anchors is developed and then an adaptive anchor selection algorithm is proposed to determine those anchors. Secondly, the mobile data collection problem of DC WSNs is formulated as a delay optimization problem constrained by flow conversation, congestion control and energy balance. Then, we focus on designing the distributed algorithm to resolve that optimization problem, in which each sensor node only needs to communicate with its neighbors to make decisions without any global information and can locally adjust the information weight of its neighbors. Besides, the accelerated distributed algorithm with the uncoordinated step size is also proposed to improve the convergence rate. Furthermore, the explicit convergence analysis of the proposed algorithm is provided in this paper. Finally, the numerical results show that our algorithm can quickly converge to the optimal solution and has obvious superiority in adjusting link flow, storing energy, and extending network lifetime.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call