|
DRUM >
College of Computer, Mathematical & Physical Sciences >
Computer Science >
Technical Reports of the Computer Science Department >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1903/3325
|
| Title: | The Overlapped K-hop (OK) Clustering Algorithm |
| Authors: | Youssef, Adel
Youssef, Moustafa
Younis, Mohamed
Agrawala, A. |
| Type: | Technical Report |
| Issue Date: | 9-Feb-2006 |
| Series/Report no.: | UM Computer Science Department
CS-TR-4735 |
| Abstract: | Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Clustering algorithms are mostly heuristic in nature and aim at generating the minimum number of disjoint clusters. In this report, we formulate the overlapping multi-hop clustering problem as an extension to the k-dominating set problem. Then we propose a fast, randomized, distributed multi-hop clustering algorithm (OK) for organizing the sensors in a wireless sensor network into overlapping clusters with the goal of minimizing the overall communication overhead, and processing complexity. OK assumes a quasi-stationary network where nodes are location-unaware and have equal significance. No synchronization is needed between nodes. OK is scalable; the clustering formation terminates in a constant time regardless of the network topology or size. The protocol incurs low overhead in terms of processing cycles and messages exchanged. We analyze the effect of different parameters ... |
| URI: | http://hdl.handle.net/1903/3325 |
| Appears in Collections: | Technical Reports from UMIACS
Technical Reports of the Computer Science Department
|
Files in This Item:
| File |
Description |
Size | Format | No. of Downloads |
|---|
| OK-TR.pdf | | 739Kb | Adobe PDF | 504 | View/Open |
|
Show full item record
All items in DRUM are protected by copyright, with all rights reserved.
|
