Tyck till om SwePub Sök
här!
Search: WFRF:(Zhu Xiaofeng)
> Conference paper >
A distributed appro...
A distributed approximation for multi-hop clustering problem in wireless sensor networks
-
- Zhu, Xudong (author)
- Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University
-
- Li, Jun (author)
- Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University
-
- Gao, Xiaofeng (author)
- Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University
-
show more...
-
- Wu, Fan (author)
- Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University
-
- Chen, Guihai (author)
- Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University
-
- Vasilakos, Athanasios (author)
- Luleå tekniska universitet,Datavetenskap
-
show less...
-
(creator_code:org_t)
- Piscataway, NJ : IEEE Communications Society, 2016
- 2016
- English.
-
In: 2015 IEEE Global Communications Conference (GLOBECOM). - Piscataway, NJ : IEEE Communications Society. - 9781479959525
- Related links:
-
https://urn.kb.se/re...
-
show more...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- In wireless sensor networks (WSNs), there is no predefined infrastructure. Nodes need to frequently flood messages to discover routes, which badly decreases the network performance. To overcome such drawbacks, WSNs are often grouped into several disjointed clusters, each with a representative cluster head (CH) in charge of the routing process. In order to further improve the efficiency of WSNs, it is crucial to find a cluster partition with minimum number of clusters and the distance between each node to its corresponding CH can be bounded by a constant number of hops. Finding such a partition is defined as minimum d-hop cluster head set (d-MCHS) problem, which is proved to be NP-hard. In this paper, we propose a distributed approximation algorithm, named d^2-Cluster, to address d-MCHS problem and prove that the approximation ratio of d^2-Cluster under unit disk graph (UDG) is a constant factor \lambda which is related to d. To the best of our knowledge, it is the first constant approximation ratio for d-MDS problem in UDG
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Medieteknik (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Media and Communication Technology (hsv//eng)
Keyword
- Mobile and Pervasive Computing
- Distribuerade datorsystem
Publication and Content Type
- ref (subject category)
- kon (subject category)
Find in a library
To the university's database