Entity

Time filter

Source Type


Gu X.,Qufu Normal University | Yu J.,Qufu Normal University | Yu J.,Key Laboratory for Intelligent Control Technique of Shandong Province | Yu D.,University of Hong Kong | And 2 more authors.
Computers and Electrical Engineering | Year: 2014

Clustering for wireless sensor networks (WSNs) is an effective scheme in utilizing sensor nodes energy and extending the network lifetime, while coverage preservation is one of the most essential issues to guarantee the quality of service (QoS). However, the coverage problem has not been well understood so far. For mission-critical applications of networks, it is crucial to consider coverage requirements when we select cluster heads and routing nodes for the clustering topology. In this paper, we propose the ECDC (Energy and Coverage-aware Distributed Clustering Protocol), an integrated protocol involving both energy and coverage, which is different from previous clustering protocols. For different practical applications, we design corresponding coverage importance metrics and introduce them into the clustering algorithm. Theoretical analysis and simulation results show that our protocol is effective in improving network coverage performance, reducing nodes energy dissipation and extending the network lifetime. © 2013 Elsevier Ltd. All rights reserved.


Yu J.,Qufu Normal University | Yu J.,Key Laboratory for Intelligent Control Technique of Shandong Province | Deng X.,Qufu Normal University | Yu D.,University of Hong Kong | And 2 more authors.
AEU - International Journal of Electronics and Communications | Year: 2013

One of the most important issues for wireless sensor networks is to get a long network lifetime without affecting either communication connectivity or sensing coverage. Many sensors that are deployed randomly in a dense sensor network in a redundant way waste a lot of energy. One effective way to save energy is to let only a subset of sensors work at any given time. In this paper, we mainly consider such a problem. Selecting the minimum number of connected sensor nodes that can provide k-coverage (k ≥ 1), i.e., selecting a subset S of working sensors, such that almost every point in the sensing region can be covered by at least k sensors and the sensors in S can form a connected communication subgraph. We propose a connected k-coverage working sets construction algorithm (CWSC) based on Euclidean distance to k-cover the sensing region while minimizing the number of working sensors. CWSC can produce different coverage degrees according to different applications, which can enhance the flexibility of the sensor network. Simulation results show that the proposed algorithm, which can conserve energy and prolong the lifetime of the sensor network, is better than the previous algorithms. © 2013 Elsevier GmbH.


Yu J.,Qufu Normal University | Yu J.,Key Laboratory for Intelligent Control Technique of Shandong Province | Wang N.,Qufu Normal University | Wang G.,Shandong University | Yu D.,University of Hong Kong
Computer Communications | Year: 2013

Topology control is a fundamental issue in wireless ad hoc and sensor networks. Due to intrinsic characteristic of flatness, hierarchical topology can achieve the scalability and efficiency of a wireless network. To solve this problem, one can construct a virtual backbone network by using a connected dominating (CDS) set of a wireless network. In past few years, efficiently and fast construct a CDS in a wireless network as a virtual backbone has been the main research problem in hierarchical topology control. In this paper, we give a comprehensive survey for CDSs and related problems with various network models and specific applications. To conclude, some open problems and interesting issues in this field are proposed. © 2012 Elsevier B.V. All rights reserved.


Yu J.,Qufu Normal University | Yu J.,Key Laboratory for Intelligent Control Technique of Shandong Province | Wang N.,Qufu Normal University | Wang G.,Shandong University
Journal of Parallel and Distributed Computing | Year: 2012

Motivated by cooperative communication in ad hoc networks, Wu et al. proposed extended dominating set (EDS) where each node in an ad hoc network is covered by either a dominating neighbor or several 2-hop dominating neighbors, and defined two types of dominating sets: extended strongly connected dominating set (ECDS) and extended weakly connected dominating set (EWCDS), according to the success of a broadcast process. An EWCDS is an effective method for clustering. In this paper, we extend the dominative capabilities of nodes such that each forward node dominates not only itself and its regular neighbors fully, but also its quasi-neighbors partly. Based on this extension, three novel algorithms to find EWCDSs in ad hoc networks are proposed. The correctness and performance of our algorithms are confirmed through theoretical analysis and comprehensive simulations. © 2011 Elsevier Inc. All rights reserved.


Yu J.,Qufu Normal University | Yu J.,Key Laboratory for Intelligent Control Technique of Shandong Province | Zhang Q.,Qufu Normal University | Yu D.,University of Hong Kong | And 2 more authors.
Journal of Network and Computer Applications | Year: 2014

In wireless sensor networks, rotating dominating sets periodically is an important technique, for balancing energy consumption of nodes and hence maximizing the lifetime of the networks. This technique can be abstracted as the domatic partition problem, hich partitions the set of nodes in networks into disjoint dominating sets. Through rotating each dominating set in the domatic partition periodically, the energy consumption of nodes can be greatly balanced and the lifetime of the network can be prolonged. In order to solve the domatic partition problem, e present a Cell Structure hich is constructed as follos. Firstly, the network is divided into clusters, and then a clique is constructed in each cluster. Based on the Cell Structure, e propose a ne constant-factor approximation algorithm for domatic partition using the property of the skyline of uniform radius disks. The algorithm is called distributed nucleus algorithm (DNA). In addition, e sho that DNA can be implemented in constant rounds in the congest model. © 2013 Elsevier Ltd.

Discover hidden collaborations