期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2011
卷号：11
期号：6
页码：45-52
出版社：International Journal of Computer Science and Network Security
摘要：Mobile ad hoc computational grid enables resource sharing between mobile nodes in an ad hoc networks for completing specific tasks. To maximize utilization of sharing resources in such grid, an effective resource allocation algorithm that is suitable with the environment, plays a key role. In this paper, we investigate the performance of resource allocation scheme EERA that has been designed for mobile ad hoc computational grid in RPGM and Gauss-Markov node mobility model. We perform the simulation in NS2. The result shows that accumulative application completion times for the scheme using Gauss-Markov mobility nodes is 45% up to 350% greater than using RPGM model. Increasing the maximum node's speed will increase the accumulative application completion times. Meanwhile the average end-to-end delay and the number of drop packet for Gauss-Markov is lower compare to RPGM in maximum speed of 5m/s.
关键词：resource allocation; mobile ad hoc computational grid; node mobility
