Abstract
Large and dense mobile ad hoc networks often meet scalability problems, the hierarchical structures are needed to achieve performance of network such as cluster control structure. Clustering in mobile ad hoc networks is an organization method dividing the nodes in groups, which are managed by the nodes called cluster-heads. As far as we know, the difficulty of clustering algorithm lies in determining the number and positions of cluster-heads. In this article, the subtractive clustering algorithm based on the Akaike information criterion is proposed. First, Akaike information criterion is introduced to formulate the optimal number of the cluster-heads. Then, subtractive clustering algorithm is used in mobile ad hoc networks to get several feasible clustering schemes. Finally, the candidate schemes are evaluated by the index of minimum of the largest within-cluster distance variance to determine the optimal scheme. The results of simulation show that the performance of the proposed algorithm is superior to widely referenced clustering approach in terms of average cluster-head lifetime.
Highlights
A mobile ad hoc network (MANET) is a selforganizing and self-configuring multi-hop wireless network consisting of a group of mobile nodes which can move freely and mutually cooperate to send relaying packets on behalf of one another.[1]
Akaike information criterion (AIC) is proposed to calculate the optimal clustering number, a theoretical analysis is made for solving the contradiction between compactness of clustering and the increased number of clusterheads
Related works are reviewed in section ‘‘Related work.’’ Subtractive clustering algorithm based on Akaike information criterion (SCAA) in MANETs is proposed and described in detail in section ‘‘SCAA.’’ The simulations conducted to evaluate the performances of SCAA and lowest ID clustering method are presented in terms of average cluster-head lifetime in section ‘‘Simulation.’’ the conclusion and the future work of the research are outlined in section ‘‘Conclusion.’’
Summary
A mobile ad hoc network (MANET) is a selforganizing and self-configuring multi-hop wireless network consisting of a group of mobile nodes which can move freely and mutually cooperate to send relaying packets on behalf of one another.[1]. As a key issue of MANET and its applications, the importance of the clustering can be summarized in two aspects.[2] First, clustering is the most efficient method to manage hundreds of mobile nodes to solve the scalability problems faced in the flat network infrastructure as the network scale increases. The difficulty of clustering lies in how to determine the number and positions of cluster-heads optimally,[6] which is a non-deterministic polynomial-time (NP)-hard problem.[7] In this article, Akaike information criterion (AIC) is proposed to calculate the optimal clustering number, a theoretical analysis is made for solving the contradiction between compactness of clustering and the increased number of clusterheads. Related works are reviewed in section ‘‘Related work.’’ Subtractive clustering algorithm based on Akaike information criterion (SCAA) in MANETs is proposed and described in detail in section ‘‘SCAA.’’ The simulations conducted to evaluate the performances of SCAA and lowest ID clustering method are presented in terms of average cluster-head lifetime in section ‘‘Simulation.’’ the conclusion and the future work of the research are outlined in section ‘‘Conclusion.’’
Sign-in/Register to view highlights & summary 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 callMore From: International Journal of Distributed Sensor Networks
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.
