Please use this identifier to cite or link to this item:
|Title:||Connected k-hop clustering in ad hoc networks|
Gateways (computer networks)
|Publisher:||IEEE Computer Society|
|Source:||ICPP 2005 : International Conference on Parallel Processing : 14-17 June 2005, Oslo, Norway, p. 373-380 How to cite?|
|Abstract:||In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k-hop neighborhoods and finding gateway nodes to connect clusterheads. Therefore, the number of nodes to be flooded in broadcast related applications could be reduced. In this paper, we study the localized solution for the connectivity issue of clusterheads with less gateway nodes. We develop the adjacency-based neighbor clusterhead selection rule (A-NCR) by extending the "2.5" hops coverage theorem  and generalizing it to k-hop clustering. We then design the local minimum spanning tree  based gateway algorithm (LMSTGA), which could be applied on the adjacent clusterheads selected by A-NCR to further reduce gateway nodes. In the simulation, we study the performance of the proposed approaches, using different values for parameter k. The results show that the proposed approaches generate a connected k-hop clustering network, and reduce the number of gateway nodes effectively.|
|Rights:||© 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Appears in Collections:||Conference Paper|
Show full item record
Citations as of Apr 10, 2016
Checked on Oct 16, 2016
Checked on Oct 16, 2016
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.