CLUSTERING ALGORITHMS FOR AD HOC WIRELESS NETWORKS

摘要: An ad hoc network is a multihop wireless communication supporting mobile users without any existing infrastructure. To become commercially successful, the technology must allow networks to support many users. A complication that addressing and routing in does not scale up as easily Internet. By introducing hierarchical addresses networks, we can effectively address this complication. Clustering provides method build maintain networks. Here, survey several clustering algorithms, concentrating on those are based graph domination. In addition, describe results show building clustered hierarchies affordable algorithms also be used virtual backbones enhance quality of service.