Clustering of Wireless Ad Hoc Networks An Efficient Probabilistic Technique
Mohammed Shafakhatullah Khan, Mourad M.H Henchiri · Zenodo (CERN European Organization for Nuclear Research) · 2013
Now a day’s the emergence of the wireless devices and the usage of wireless ad-hoc Networks, is increased. Almost all the wireless device have option to connect to wireless ad hoc Network to access data or information (resource sharing) from other devices, to share resources from the wireless ad-hoc Network they need a connectivity to the network. The smart/advanced devices contains a Wi-Fi connectivity and Wi-Fi hotspot tools built-in, which get connection from network services as well as provides network service to other devices by converting the device as router(using Wi-Fi Hotspot). Major problems identified in wireless ad hoc networks are organizing, scalability and routing, which affects the commercial success of MANET. Clustering of mobile nodes among separate domains has been proposed in many papers as the successful approach to solve those problems. In this work we introduce sophisticated and dynamic technique of organizing nodes into clusters in wireless ad hoc network. This technique is reliable and more efficient than the well-known algorithm WCA (Weighted Clustering Algorithm) [1]. Here we have developed new algorithm for the implementation of Probabilistic Weighted Clustering Algorithm (PWCA) with the help of Weighted Clustering Algorithm (WCA).