Abstract

The structure and constraint of MANETS influence negatively the performance of QoS, moreover the main routing protocols proposed generally operate in flat routing. Hence, this structure gives the bad results of QoS when the network becomes larger and denser. To solve this problem we use one of the most popular methods named clustering. The present paper comes within the frameworks of research to improve the QoS in MANETs. In this paper we propose a new algorithm of clustering based on the new mobility metric and K-Medoid to distribute the nodes into several clusters. Intuitively our algorithm can give good results in terms of stability of the cluster, and can also extend life time of cluster head.

Highlights

  • Ad hoc wireless networks (MANETs) are a new architecture of wireless networks, where a set of mobiles can be deployed in a minimum configuration, with free movement and without the existence of the centralized device

  • The mobility metric allows to study the motion of the nodes, it allows to quantify the dynamic topology of the nodes in the Manets

  • In this article we propose a new stability metric that refines the degree of mobility, taking into account any type of motion in a coverage area of a mobile node, this metric will be the basis of a cluster building algorithm by using k-medoid to create the groups of mobile, this new approach can generate the more stable cluster and cluster head

Read more

Summary

Introduction

Ad hoc wireless networks (MANETs) are a new architecture of wireless networks, where a set of mobiles can be deployed in a minimum configuration, with free movement and without the existence of the centralized device It allows a user with a terminal to access to information at any time and from any place. The clustering has a hierarchical structure that makes it possible to group geographically the nodes that are neighbors. Research has not ceased to have efficient protocols that can support this type of network and structure. These metrics will be the basis for the clustering construct algorithms integrated in the routing protocols in order to optimize and improve them.

Related Work
Problem Formulation
Clustering
Distance
Novel Metric of Stability
VIII. Novel Approach of Clustering
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.