![]() ![]() Then it discusses the weak points that found in these researches and how to solve it to improve the Mobile Agent system performance. Additionally, it presents a state-of-art of using the Mobile Agent within the five network management applications. The objective of the research is to study the effective of using the Mobile Agent to overcome the limitations of the centralized SNMP structure. In fact, Mobile Agent technology offers new solutions of the problems that presented by the centralized model. Thus, the code is transferred to the data location instead of moving the entire data to the manager. The Mobile Agent has the ability to autonomously move between network elements to perform the required tasks locally. All these problems suggest using the Mobile Agent technology as a solution to distribute the management functionality over the network elements. ![]() The process of data collection and analysis typically involves huge transfers of management data to the manager which cause considerable network throughput and bottlenecks at the manager side. The traditional centralized network management approach presents severe efficiency and scalability limitations in large scale networks. Simulation tests verify the performance gain attained by our algorithmic methods against alternative itinerary planning approaches which involve multiple MAs. Furthermore, we propose algorithmic solutions for 2 realistic settings which have not been investigated in the past: firstly, the employment of multiple sinks that share the responsibility of MA-based data fusion tasks across the sensor field, and secondly, the consideration of heterogeneous sensor networks comprising nodes powerful enough to host the runtime environment required to execute MA code as well as “ordinary” nodes which lack these resources. ![]() We apply alternative optimization criteria which aim either at minimizing the overall energy expenditure over all derived MA itineraries or prolonging the network lifetime. We adopt a method based on iterated local search to construct the itineraries (ie, visiting sequences of source nodes) assigned to multiple traveling MAs. In this article, we present a novel algorithmic approach for efficient itinerary planning of MA objects undertaking data fusion tasks. Deriving an efficient itinerary for each MA to follow is of high importance, because itineraries determine to a large extent the overall performance of data fusion tasks. Mobile agent (MA)-based middleware has been thoroughly investigated in the past few years as a means to address the efficiency, scalability, and reliability issues of data fusion applications on wireless sensor networks. The algorithm implementation has been integrated into our mobile agent framework research prototype and tested in real network environments, demonstrating significant cost savings. The algorithm not only suggests the optimal number of mobile agents that minimize the overall cost but also constructs optimal itineraries for each of them. To that end, we have designed and implemented an algorithm that adapts methods usually applied for addressing network design problems in the specific area of mobile agent itinerary planning. The work presented herein aspires to address these issues. This is of particular importance when MAs itineraries span multiple subnets. This is because they lack mechanisms that guarantee optimization of agents' itineraries so as to minimize the total migration cost in terms of the round-trip latency and the incurred traffic. However, these architectures fail to address scalability problems, when distributed tasks requiring the employment of itinerant agents is considered. Several distributed architectures, incorporating mobile agent technology, have been recently proposed to answer the scalability limitations of their centralized counterparts. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |