Abstract

Intelligent mobile agents are sent between routers to carry out a set of required tasks. Mobile agents can carry algorithms and information to various routers they visit. Critical information that all mobile agents should carry includes: timer, navigation algorithm, network information, stability of the network, and load traffic of the network. By clustering intelligent mobile agents, It is possible to minimize the cost of time for each agent to travel to its required routers and the number of intelligent mobile agents. Each router has certain capability and hence an only process certain requests of each intelligent agent. The problem is to group the intelligent mobile agent into a number of clusters such 1h.t that each cluster has similarity in responding to a group of routers. This can significantly decrease the demand imposed upon a network for a set of required task be he performed. In this paper, we present the problem of multiple criteria clustering of intelligent mobile agents where the decision is to cluster mobile agents such that a group of similar intelligent mobile agents will visit a group of similar routers. This grouping will decrease the total number of visits and the total number of agents, decreasing demand on the network.

Full Text
Paper version not known

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.