AG Kommunikationstheorie


Clustering in Wireless Ad-Hoc Networks Using Graph Theoretical Algorithms


The present correspondence deals with the theoretical graph represent the wireless ad-hoc mobile networks by used geometrical mapping model. And using theoretical maximal weight independent set (MWIS)algorithms to organize the infrastructure of the ad-hoc wireless networks. We first used the distance geometrical model, the undirected graph represent the bi-directional communication of the wireless nodes. in the graph the nodes were assign with the real number weighted, then using MWIS algorithms to partition the node in to the graph as the cluster by select the clusterhead with the suitable weighted, the other node will joint the cluster as ordinary member. This solution is used to build the main infrastructure for the communication in the network related to the maximal independent set will coordinate over all the area of the network.

zurück zur Terminübersicht