The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions.
Mobile-edge computing (MEC) has emerged as a promising computing paradigm in the 5G architecture, which can empower user equipments (UEs) with computation and energy resources offered by migrating workloads from UEs to the nearby MEC servers. Although the issues of computation offloading and resource allocation in MEC have been studied with different optimization objectives, they mainly focus on facilitating the performance in the quasistatic system, and seldomly consider time-varying system conditions in the time domain. In this article, we investigate the joint optimization of computation offloading and resource allocation in a dynamic multiuser MEC system. Our objective is to minimize the energy consumption of the entire MEC system, by considering the delay constraint as well as the uncertain resource requirements of heterogeneous computation tasks. We formulate the problem as a mixed-integer nonlinear programming (MINLP) problem, and propose a value iteration-based reinforcement learning (RL) method, named $Q$ -Learning, to determine the joint policy of computation offloading and resource allocation. To avoid the curse of dimensionality, we further propose a double deep $Q$ network (DDQN)-based method, which can efficiently approximate the value function of $Q$ -learning. The simulation results demonstrate that the proposed methods significantly outperform other baseline methods in different scenarios, except the exhaustion method. Especially, the proposed DDQN-based method achieves very close performance with the exhaustion method, and can significantly reduce the average of 20%, 35%, and 53% energy consumption compared with offloading decision, local first method, and offloading first method, respectively, when the number of UEs is 5.
With the rapid developments in edge devices and wireless technologies, Underwater Wireless Sensor Networks (UWSNs) are in process of vigorous development. In the UWSNs, traditional multi-hop data collection methods have some disadvantages such as high power consumption, severe unbalance in power consumption. In recent years, mobile edge elements (such as Autonomous Underwater Vehicle, AUV) are widely used in underwater data collection to solve energy consumption imbalance problems. However, the existing methods do not fully consider the efficient mobile edge computing and the real mobility model of AUV in the underwater environment. In this paper, we propose a data collection scheme based on a mobility model of mobile edge elements under water. In this model, the mobility direction and velocity are fully considered, which are close to the mobility characteristic of AUVs in the stable 3D environment. By using computing, storage and mobility abilities of AUVs, a target selection algorithm is designed to calculate the mobility path of data collection for AUV. Theoretical analysis and experimental results show that the proposed method improves the efficiency of data collection, reduces power consumption of nodes and extends the network lifetime.
Load balance is a vital goal for battery-powered wireless sensor networks (WSNs). In this letter, we propose a novel load balancing strategy for data transmission of WSNs, namely, super links-based data drainage, which makes full use of the advantages of super nodes with more powerful hardware and greater communication capacity to realize data traffic redistribution. Being different from conventional passive late-remedy approaches, this is a positive and early-intervention strategy. Specifically, an evaluation function is designed to select appropriate start points and end points of super links, and the core idea is to transfer data from locations relatively far from the sink with a jump of data traffic to those near the sink with little data traffic. Extensive simulations are conducted to validate the effectiveness and advantages of the new strategy.
5 November 2021 in IEEE/ACM Transactions on Networking
In this paper, we study the deployment of Unmanned Aerial Vehicles (UAVs) to collect data from IoT devices, by finding a data collection tour for each UAV. To ensure the ‘freshness’ of the collected data, the total time spent in the tour of each UAV that consists of the UAV flying time and data collection time must be no greater than a given delay $B$ , e.g., 20 minutes. In this paper, we consider a problem of deploying the minimum number of UAVs and finding their data collection tours, subject to the constraint that the total time spent in each tour of any UAV is no greater than $B$ . Specifically, we study two variants of the problem: one is that a UAV needs to fly to the location of each IoT device to collect its data; the other is that a UAV is able to collect the data of an IoT device if the Euclidean distance between them is no greater than the wireless transmission range of the IoT device. For the first variant of the problem, we propose a novel 4-approximation algorithm, which improves the best approximation ratio $4\frac {4}{7}$ for it so far. For the second variant, we devise the very first constant factor approximation algorithm. We also evaluate the performance of the proposed algorithms via extensive experiment simulations. Experimental results show that the numbers of UAVs deployed by the proposed algorithms are from 11% to 19% less than those by existing algorithms on average.
17 June 2020 in IEEE Transactions on Mobile Computing
Data collection with mobile elements can improve energy efficiency and balance load distribution in wireless sensor networks (WSNs). However, complex network environments bring about inconvenience of path design. This work addresses the network environment issue, by presenting an objective-variable tour planning (OVTP) strategy for mobile data gathering in partitioned WSNs. Unlike existing studies of connected networks, our work focuses on disjoint networks with connectivity requirement and serves delay-hash applications as well as energy-efficient scenarios respectively. We first design a converging-aware location selection mechanism, which macroscopically converges rendezvous points (RPs) to lay a foundation of a short tour. We then develop a delay-aware path formation mechanism, which constructs a short tour connecting all segments by a new convex hull algorithm and a new genetic operation. In addition, we devise an energy-aware path extension mechanism, which selects appropriate extra RPs according to specific metrics in order to reduce the energy depletion of data transmission. Extensive simulations demonstrate the effectiveness and advantages of the new strategy in terms of path length, energy depletion, and data collection ratio.