文章基本信息

标题：Optimizing and Generating Dynamic intricate Cluster construction in MANETs using Integer Linear Programming with Rough set (ILPR) Model Technique
本地全文：下载
作者：S.R.M. Krishna ; M. N. Seeta Ramanath ; V. Kamakshi Prasad 等
期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2014
卷号：5
期号：6
页码：8022-8026
出版社：TechScience Publications
摘要：MANETs are wireless, self-organizing networks consisting of nodes with limited resourceble residual energy levels. So one of the main Challenges in MANETs are saving the Outlay of energies with various features of nodes as much as possible. So one technique we proposed that Mobile ad-hoc networks uses clustering methods to allow fast connection ,better routing and topology management which meets the above challenging tasks with minimum time complexity. In that process one main problem here in mobile ad-hoc network is selecting the most suitable node as Master cluster head, cluster head, ensuring that all regular nodes are connected to it, such that the lifetime of the network is maximized through ILP with Rough Set Model. So Integer Linear Programming (ILP) model with Rough sets have been applied to solve reallife optimized dynamic clustering problems. To test and meet the optimized results can be done by Rough set tools like Rosetta, Rose2, and 4eMka2[17] for classification of nodes with Boolean rules in efficient manner, for optimizing cluster topology and identifying cluster heads with minimum time complexity by ampl solvers like CPLEX, BSOLO, MINOS, and SCIP.
关键词：Mobile ad-hoc network (MANETs);clustering;Integer Linear Programming (ILP); Rough sets ;Data Solvers.