Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The emergence of mobile ad hoc sensor networks hasbrought new challenges to traditional network design. Thispaper compares the performance of two distributed computingparadigms, the client/server-based paradigm and themobile-agent-based paradigm, through mathematical modelingand simulation. Previous works have shown that themobile-agent-based paradigm is more appropriate to handlecomputations in ad hoc sensor networks. However, nosimulation work has been done to quantitatively measurethe performance. This paper first describes how computingis accomplished in the mobile-agent-based paradigm.It then presents a modified mathematical model and usesthe execution time as a metric to measure the performance.Eight experiments are designed to show the effect of differentparameters to the performance of the paradigms. Experimentalresults show that in the context of mobile adhoc sensor networks with hundreds or even thousands ofnodes, unreliable communication links, and reduced bandwidth,the mobile-agent-based computing provides solutionsto low network latency and reliable data processing.