Qadori Huthiafa Q, Zulkarnain Zuriati A, Hanapi Zurina Mohd, Subramaniam Shamala
Department of Wireless and Communication Technology, Faculty of Computer Science and Information Technolog, University Putra Malaysia, Serdang 43400, Malaysia.
Sensors (Basel). 2017 Jun 3;17(6):1280. doi: 10.3390/s17061280.
Mobile agent (MA), a part of the mobile computing paradigm, was recently proposed for data gathering in Wireless Sensor Networks (WSNs). The MA-based approach employs two algorithms: Single-agent Itinerary Planning (SIP) and Multi-mobile agent Itinerary Planning (MIP) for energy-efficient data gathering. The MIP was proposed to outperform the weakness of SIP by introducing distributed multi MAs to perform the data gathering task. Despite the advantages of MIP, finding the optimal number of distributed MAs and their itineraries are still regarded as critical issues. The existing MIP algorithms assume that the itinerary of the MA has to start and return back to the sink node. Moreover, each distributed MA has to carry the processing code (data aggregation code) to collect the sensory data and return back to the sink with the accumulated data. However, these assumptions have resulted in an increase in the number of MA's migration hops, which subsequently leads to an increase in energy and time consumption. In this paper, a spawn multi-mobile agent itinerary planning (SMIP) approach is proposed to mitigate the substantial increase in cost of energy and time used in the data gathering processes. The proposed approach is based on the agent spawning such that the main MA is able to spawn other MAs with different tasks assigned from the main MA. Extensive simulation experiments have been conducted to test the performance of the proposed approach against some selected MIP algorithms. The results show that the proposed SMIP outperforms the counterpart algorithms in terms of energy consumption and task delay (time), and improves the integrated energy-delay performance.
移动代理（MA）作为移动计算范式的一部分，最近被提出用于无线传感器网络（WSN）中的数据收集。基于移动代理的方法采用两种算法：单代理行程规划（SIP）和多移动代理行程规划（MIP），以实现节能数据收集。提出MIP是为了通过引入分布式多移动代理来执行数据收集任务，从而克服SIP的弱点。尽管MIP有诸多优点，但确定分布式移动代理的最佳数量及其行程仍被视为关键问题。现有的MIP算法假定移动代理的行程必须从汇聚节点开始并返回汇聚节点。此外，每个分布式移动代理都必须携带处理代码（数据聚合代码）来收集传感数据，并将累积的数据返回给汇聚节点。然而，这些假设导致移动代理迁移跳数增加，进而导致能量和时间消耗增加。本文提出了一种生成多移动代理行程规划（SMIP）方法，以减轻数据收集过程中能源和时间成本的大幅增加。所提出的方法基于代理生成，使得主移动代理能够生成其他具有从主移动代理分配的不同任务的移动代理。已经进行了广泛的模拟实验，以测试所提出的方法相对于一些选定的MIP算法的性能。结果表明，所提出的SMIP在能量消耗和任务延迟（时间）方面优于同类算法，并提高了综合能量延迟性能。
