Wu Shuai

TL;DR: A tree-cluster-based data-gathering algorithm for WSNs with a mobile sink that can significantly balance the load of the whole network, reduce the energy consumption, alleviate the hotspot problem, and prolong the network lifetime is proposed.

TL;DR: In this article, an intelligent terminal field roll calling system and a roll calling method based on a wireless network environment is presented. But the roll calling is carried out on the intelligent handheld device without the need of a special collection device.

TL;DR: In this paper, the authors proposed a mobile sink data collection method for a wireless sensor network based on a tree cluster, which comprises the steps of establishing a distributed tree cluster; calculating node weights by taking surrounding energy and density information of nodes into comprehensive consideration; selecting suitable root nodes as resident points RPs of a mobile Sink through distributed information exchange of a local range; accessing all RPs by the mobile sink for data collection in a stable data collection stage; providing a new conditional re-clustering method; setting data collection number of rounds; and selecting new RPs for

TL;DR: In this article, a wireless sensor network mobile data collecting method based on an arborescence cluster structure is proposed, where each node selects a maximum weighted node as a father node along the neighbor nodes in the jump range, after a tree is completed, a root node with the maximum weighted on each tree conducts rendezvous point (RP); based on a hop count and a flow current which are distanced from the root node, the segmentation is carried out on the tree, and the sub-rendezvous point (SRP) in the tree is selected; the RP

TL;DR: In this paper, a mobile sink data collection method applied to a wireless sensor network and used for node internal-memory resource sharing is described, where the mobile sink moves along a preset track at a constant speed, stops RP points uniformly distributed in the network and collects node data in a K jump generation tree formed by taking the RP point as a root.