Discrete Mathematics - Topics on domination
Multicluster, mobile, multimedia radio network
Wireless Networks
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Propagation and Leader Election in a Multihop Broadcast Environment
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Wireless Sensor Networks: To Cluster or Not To Cluster?
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
The coverage problem in a wireless sensor network
Mobile Networks and Applications
A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs
IEEE Transactions on Mobile Computing
A constant-factor approximation for d-hop connected dominating sets in unit disk graph
International Journal of Sensor Networks
Hi-index | 0.00 |
In the past few yeas, wireless sensor networks (WSNs) have been widely used in many areas. In these applications, sensors are remotely deployed to gather related environmental information for further analysis. To support higher scalability and better data aggregation, sensor nodes are often grouped into disjoint and mostly non-overlapping clusters. All nodes in a cluster can send their data to the cluster head within d-hop distance, and the head should communicate with other cluster heads and pass all data to base station. For better communication between these cluster heads, lower maintenance cost and easier management, it is necessary to make the number of the clusters as small as possible. Moreover, in many environments like mountainous area or underwater monitoring, node deployment is often not flat, resulting in a high dimensional network. In this paper, we focus on proposing a scheme to select cluster heads for a homogenous network in three-dimension situation. The scheme meets two requirements: The number of cluster heads is minimum; and the head nodes can communicate with each other. These requirements can be formed as an NP-complete problem named d-hop connected dominating set. Correspondingly, we proposed a distributed approximation algorithm, and proved its approximation ratio as (d + 1)β, where β is a calculated parameter w.r.t. d. We also analyzed the performance of our algorithm with corresponding numerical experiments.