移动网格中基于时间优化的任务调度研究
|
摘要
网格将网络上分散在不同部门的资源组织在一起,构成一台虚拟的超级计算机,实现异构资源的全面共享和协同解决问题。它充分利用了网络上的闲置资源,提高了资源的利用率。而移动网格是近年来兴起的新技术研究热点,它是在传统固定网格中加入移动设备,如移动电话、PDA、Laptop等构成,是移动计算技术与网格技术相结合的产物。在移动网格中,目前大多数研究都是将移动设备作为与网格系统交互的接口,用户通过移动设备向网格请求服务,利用网格资源来完成任务,并从网格中获得任务执行结果；但随着移动设备性能的不断增强,移动设备也逐渐作为网格的资源参与到网格任务中,作为网格服务的提供者,本文重点研究后者。
现有的网格任务调度算法要么只为实现任务执行时间最小,要么只为达到能量消耗最少,基于时间和能量同时考虑的算法研究不多。在移动网格中,移动资源具有能量受限和移动性等特征,在调度算法中有必要在能量优化的同时也考虑时间优化。在研究移动网格自身以及现有调度算法特征的基础上,基于移动网格资源多方面约束,本文将能量优化放在移动资源管理模型中考虑,而任务调度算法的主要目标是实现时间优化。
本课题的主要研究工作及创新性体现在以下几个方面：
1)移动资源管理模型的研究。移动网格系统不适合采用单一的集中式管理模式,因为集中式管理容易引起单点故障；而全分散式需要各个资源之间频繁的通信,消耗移动资源大量的电池能量,因此也不可取。移动网格中资源不会一直停留在某个固定位置,但是它注册的服务在一段时间内是不变的,基于移动网格这两个方面的特征,本文提出一种新的网格资源管理模型——三层组织模型。该模型的特征表现在两个方面：一是尽量减少移动资源不必要的能量消耗,如位置更新和查找工作由专门代理完成；二是实现移动设备与其注册的服务分离,即所有移动设备注册的服务都组织在资源信息层,资源选择和任务调度都在该层进行,而移动资源的实际物理位置对于调度者来说是透明的。
2)根据资源移动的局部性特征,提出利用带阀值的指针推进策略对移动资源的位置进行管理。该策略一方面能减少频繁地进行位置更新带来的能量消耗；另一方面能减少任务调度时查找资源的时间。
3)深入分析Min-Min算法在移动网格应用中的不足之后,提出一种新的基于时间优化的移动网格任务调度算法,即MG-Min-Min算法,目标是实现任务调度完成时间的最小化。算法中重新定义Makespan为任务提交时资源查找时间+任务执行时间+任务执行后的资源查找时间,忽略网络传输时间。算法中考虑到移动资源能量有限,在任务完成时,由分配任务时的域代理主动发送移动代理去寻找目标资源并取回任务执行结果,这样节省了移动资源发送任务执行结果的能量和时间消耗。
4)对移动网格仿真的研究。分析了典型的网格仿真工具及其特点并选择NS2作为本研究的仿真平台,对典型Min-Min算法和本文提出的MG-Min-Min算法进行仿真,通过几组对比实验,对这两种算法从多角度进行分析和比较,结果证明本文提出的MG-Min-Min算法在移动网格中的优越性。
本论文得到了国家自然科学基金(批准号：60970064.60773211),湖北省杰出青年人才基金(批准号：2008CDB335),教育部新世纪优秀人才支持计划(批准号：NCET-08-0806),国家软件开发环境重点实验室开放基金课题(批准号：SKLSDE-2009KF-2-02),霍英东高校青年教师基金基础性研究课题(批准号：121067),武汉市科技攻关项目(批准号：201010621207)的资助。
The grid integrates all the resources that come from different departments into one huge "virtual machine" in order to provide an excellent infrastructure and platform for resource sharing and cooperation among distributed computers. So make the best use of the idle resources of network and improve the resource's utilization rate. Mobile grid is a new technology research hotspot sprung up in recent years, which is composed of mobile devices, such as mobile telephone, PDA, Laptop and so on. It dedicates to the sharing and scheduling of mobile resources. Currently, there is litter research focus on mobile devices as resource provider in mobile grid environment, almost all the researches pay attention to use mobile device as an access point to grid system, grid user can ask for grid service by mobile device and receive the task execute result from grid. However, with the performance of the mobile device begin higher and higher, taking the mobile device as mobile grid resource and taking part in grid task is getting too impatient to wait. The thesis will focus on the research about mobile device as a grid service provider.
Among all of scheduling algorithm, some work focus on energy consumption, some work focus on deadline constrained scheduling, few work in grid scheduling consider both energy and deadline as constraints. This thesis will not only deal with energy constraining but also deal with the deadline problem in mobile grid. Its primary objective is to minimize the total battery energy in the resource management model as well as to optimize the scheduling time in the task scheduling algorithm.
The main research and innovation of this thesis is included in the following areas:
Firstly, the idea of Mobile Grid and related infrastructure are proposed and described, which is dedicated to the sharing of mobile resources. Because the centralized manager can result in single trouble and the decentralized manager may consume a lot of battery energy, so these two kinds of management mode are not suitable for mobile grid resource management. This thesis introduced a new kind of mobile resource management——Three Levels Resource Organization Mode, which is suitable for mobile grid environment.
Secondly, based on the characteristics of the resources in mobile grid, a novel location management strategy——K steps Pointer Advanced strategy was proposed. On one hand, the strategy can reduce energy consuming caused by updating the resource's location frequently; on the other hand, it can reduce the resource looking up time during task scheduling.
Thirdly, based on the limitation of typical Min-Min algorithm, a new algorithm is proposed in this thesis, which named as MG-Min-Min algorithm, the algorithm redefines the Makespan as the sum of the expected completed time and the finding resource's time, and it ignores the network transmission time. The main objective of the algorithm is to minimize the Makespan; the energy optimization will be reflected in the resource management model.
Finally, a series of experiments were designed and study the effect on the MG-Min-Min algorithm and the Min-Min algorithm based different parameters, then compare the simulation results with theoretical analysis, as the results show, the MG-Min-Min algorithm turned out to be more suitable for the mobile grid environment because it has considered the mobility of the grid resource and it can get less Makespan than Min-Min algorithm.
This thesis is supported by National Natural Science Foundation of China (No:60773211,60970064), the National Science Foundation of HuBei Province under Grant No.2008CDB335, New Century Excellent Talents in university (No:NCET-08-0806), Open Fund of the State Key Laboratory of Software Development Environment(No:SKLSDE-2009KF-2-02), Fok Ying-Tong Education Foundation for Young Teachers in Higher Education Institutions of China (No:121067), NSF of Wuhan Municipality (No:201010621207).
现有的网格任务调度算法要么只为实现任务执行时间最小,要么只为达到能量消耗最少,基于时间和能量同时考虑的算法研究不多。在移动网格中,移动资源具有能量受限和移动性等特征,在调度算法中有必要在能量优化的同时也考虑时间优化。在研究移动网格自身以及现有调度算法特征的基础上,基于移动网格资源多方面约束,本文将能量优化放在移动资源管理模型中考虑,而任务调度算法的主要目标是实现时间优化。
本课题的主要研究工作及创新性体现在以下几个方面：
1)移动资源管理模型的研究。移动网格系统不适合采用单一的集中式管理模式,因为集中式管理容易引起单点故障；而全分散式需要各个资源之间频繁的通信,消耗移动资源大量的电池能量,因此也不可取。移动网格中资源不会一直停留在某个固定位置,但是它注册的服务在一段时间内是不变的,基于移动网格这两个方面的特征,本文提出一种新的网格资源管理模型——三层组织模型。该模型的特征表现在两个方面：一是尽量减少移动资源不必要的能量消耗,如位置更新和查找工作由专门代理完成；二是实现移动设备与其注册的服务分离,即所有移动设备注册的服务都组织在资源信息层,资源选择和任务调度都在该层进行,而移动资源的实际物理位置对于调度者来说是透明的。
2)根据资源移动的局部性特征,提出利用带阀值的指针推进策略对移动资源的位置进行管理。该策略一方面能减少频繁地进行位置更新带来的能量消耗；另一方面能减少任务调度时查找资源的时间。
3)深入分析Min-Min算法在移动网格应用中的不足之后,提出一种新的基于时间优化的移动网格任务调度算法,即MG-Min-Min算法,目标是实现任务调度完成时间的最小化。算法中重新定义Makespan为任务提交时资源查找时间+任务执行时间+任务执行后的资源查找时间,忽略网络传输时间。算法中考虑到移动资源能量有限,在任务完成时,由分配任务时的域代理主动发送移动代理去寻找目标资源并取回任务执行结果,这样节省了移动资源发送任务执行结果的能量和时间消耗。
4)对移动网格仿真的研究。分析了典型的网格仿真工具及其特点并选择NS2作为本研究的仿真平台,对典型Min-Min算法和本文提出的MG-Min-Min算法进行仿真,通过几组对比实验,对这两种算法从多角度进行分析和比较,结果证明本文提出的MG-Min-Min算法在移动网格中的优越性。
本论文得到了国家自然科学基金(批准号：60970064.60773211),湖北省杰出青年人才基金(批准号：2008CDB335),教育部新世纪优秀人才支持计划(批准号：NCET-08-0806),国家软件开发环境重点实验室开放基金课题(批准号：SKLSDE-2009KF-2-02),霍英东高校青年教师基金基础性研究课题(批准号：121067),武汉市科技攻关项目(批准号：201010621207)的资助。
The grid integrates all the resources that come from different departments into one huge "virtual machine" in order to provide an excellent infrastructure and platform for resource sharing and cooperation among distributed computers. So make the best use of the idle resources of network and improve the resource's utilization rate. Mobile grid is a new technology research hotspot sprung up in recent years, which is composed of mobile devices, such as mobile telephone, PDA, Laptop and so on. It dedicates to the sharing and scheduling of mobile resources. Currently, there is litter research focus on mobile devices as resource provider in mobile grid environment, almost all the researches pay attention to use mobile device as an access point to grid system, grid user can ask for grid service by mobile device and receive the task execute result from grid. However, with the performance of the mobile device begin higher and higher, taking the mobile device as mobile grid resource and taking part in grid task is getting too impatient to wait. The thesis will focus on the research about mobile device as a grid service provider.
Among all of scheduling algorithm, some work focus on energy consumption, some work focus on deadline constrained scheduling, few work in grid scheduling consider both energy and deadline as constraints. This thesis will not only deal with energy constraining but also deal with the deadline problem in mobile grid. Its primary objective is to minimize the total battery energy in the resource management model as well as to optimize the scheduling time in the task scheduling algorithm.
The main research and innovation of this thesis is included in the following areas:
Firstly, the idea of Mobile Grid and related infrastructure are proposed and described, which is dedicated to the sharing of mobile resources. Because the centralized manager can result in single trouble and the decentralized manager may consume a lot of battery energy, so these two kinds of management mode are not suitable for mobile grid resource management. This thesis introduced a new kind of mobile resource management——Three Levels Resource Organization Mode, which is suitable for mobile grid environment.
Secondly, based on the characteristics of the resources in mobile grid, a novel location management strategy——K steps Pointer Advanced strategy was proposed. On one hand, the strategy can reduce energy consuming caused by updating the resource's location frequently; on the other hand, it can reduce the resource looking up time during task scheduling.
Thirdly, based on the limitation of typical Min-Min algorithm, a new algorithm is proposed in this thesis, which named as MG-Min-Min algorithm, the algorithm redefines the Makespan as the sum of the expected completed time and the finding resource's time, and it ignores the network transmission time. The main objective of the algorithm is to minimize the Makespan; the energy optimization will be reflected in the resource management model.
Finally, a series of experiments were designed and study the effect on the MG-Min-Min algorithm and the Min-Min algorithm based different parameters, then compare the simulation results with theoretical analysis, as the results show, the MG-Min-Min algorithm turned out to be more suitable for the mobile grid environment because it has considered the mobility of the grid resource and it can get less Makespan than Min-Min algorithm.
This thesis is supported by National Natural Science Foundation of China (No:60773211,60970064), the National Science Foundation of HuBei Province under Grant No.2008CDB335, New Century Excellent Talents in university (No:NCET-08-0806), Open Fund of the State Key Laboratory of Software Development Environment(No:SKLSDE-2009KF-2-02), Fok Ying-Tong Education Foundation for Young Teachers in Higher Education Institutions of China (No:121067), NSF of Wuhan Municipality (No:201010621207).
引文
[1]DaeWon Lee, HwaMin Lee, Kwang Sik Chung.et al. The Idle Mobile Resource Discovery and Management Scheme in Mobile Grid Computing Using IP-paging. Ubiquitous Information Technoloqies & Applications,2009[C]. ICUT'09.Proceedings of the 4th International Conference on. Fukuoka:2009, pp.1-6.
[2]Li Chunlin, Li Layuan. Energy constrained resource allocation optimization for mobile grid[J].Parallel Distrib.Comput.homepage:www.elsevier.com/locate/jpdc.2010,pp.245-258.
[3]Phan T, Huang L, Dulan C. Challenge-integrating mobile wireless devices into the computational grid[C].In Porceedings of the8 th ACM Intenrational Conference on Mobile Computing and Networking(MobiCom'02)Atlanta,G A.2002.
[4]Saha D, Mukherjee A. Pervasive computing:A paradigm for the 21st century[J]. Computer Institute of Electrical and Electronics Engineers Computer Society.2003, vol.36(3):25-31.
[5]Kurkovsky, Bhagyavati S. Wireless grid enables ubiquitous computing[C].In 16th International Conference on Parallel and Distributed Computing Systems (PDCS 2003). 2003,pp.399-404.
[6]夏琪.MobiGrid-移动网格的研究[D].上海：上海交通大学计算机体系结构学院,2006.
[7]都志辉,陈渝,刘鹏.网格计算[M].北京：清华大学出版社,2002：23-66.
[8]Foster I, Kesselman C, Tsudik G, et al. A Security Architecture for Computational Grids[C]. Proceedings of the 5th ACM Conference on Computer and Communications Security Conference.Chicago:IEEE Press,1998,pp.83-92.
[9]Frankhauser P, Kracher M, Erich J. et al, Semantic vs Structural Resemblance of Classes [J]. Global Grid Forum Draft Recommendation,2002,17(3):31-42.
[10]S.H.Srinivasan. Pervasive wireless grid architecture. In:Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services.2005, pp.1-6.
[11]Konstantinos Katsaros, George C. Polyzos. Optimizing Operation of a Hierarchical Campus-Wide Mobile Grid. In:The 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'07),2007, pp.1-5.
[12]罗红,慕德俊.网格计算中作业调度研究综述[J].计算机应用研究,2005(5)：16-19.
[13]Kulik, L. Mobile Computing Systems Programming:A Graduate Distributed Computing Course[C]. Distributed Systems Online, IEEE.2007, vol.8(5):4-4.
[14]朱艺华.无线移动网络的移动性管理[M].北京：人民邮电出版社,2005,10-11.
[15]廖建新.移动智能网技术的研究现状及未来发展[J].电子学报2003,31(11)：1725-1731.
[16]Gruhn Volker, Richter Thomas. A general model of mobile environments:Simulation support for strategic management decisions[C].7th International Conference on Grid and Cooperative Computing, GCC. Shenzhen, China.2008, pp.753-764.
[17]Syed Naqvi, Michel Riguidel, Dynamic Access Control for Pervasive Grid Applications[C]. International Conference on Computational Intelligence and Security, CIS 2005. Part Ⅱ, 3802 LNAI. pp.348-355.
[18]Reddy,Y.V. Pervasive ComputingImplications:Opportunities and Chanlleges for Society[C]. Pervaive Computing and Applications,2006 1st International Symposium on. Urumqi. 2006,pp.5-6.
[19]Ohta K, Yoshikawa T, Nakagawa T, et al.Design and Implementation of Mobile Grid Middleware for Handsets[C].Proceedings of the 11th International Conference on Parallel and Distributed Systems. Washington D.C.USA:IEEE Computer Society,2005, pp.679-683.
[20]V.C.M. Borges, A.G.M. Rossetto e M.A.R. Dantas, An Architecture for Handling Disconnections in Workflow Applications in Mobile Grid Environments. IEEE LATIN AMERICA TRANSACTIONS,2009,Vol.7(6):681-687.
[21]Xu Zhiwei, Li Wei. The research on vega grid architecture[J]. Journal of Computer Research and Development.2002. vol.39(8):923-929.
[22]Zhihong Xu, Xiangdan Hou, Jizhou Sun. Ant algorithm-based task scheduling in grid computing[C]. In:Electrical and Computer Engineering,2003. IEEE CCECE 2003. Canadian Conference on May 2003, Vol 2:1107-1110.
[23]Mobile Analyser:Overview of Mobile Analyser, http://wikihip.cem.ch/twiki/bin/view/grid/ mobile analyzer.2010-4.
[24]Karakostas, Bill1; Fakas, George2. An architecture for reliable mobile workflow in a grid environment [C].2009 4th International Conference on Internet and Web Applications and Services, ICIW 2009, Venice, Mestre, Italy,2009,pp.499-504.
[25]金海,袁平鹏,石柯.网格计算(第二版)[M].北京：电子工业出版社,2004.21-32.
[26]Haahr M, Cunningham R, Cahill V. Supporting corba applications in a mobile environment[C]. In Proceedings of the 5th Intenrational Conference on Mobile Computing and Networking(ACM Mobi Com'99).1999,pp.36-47.
[27]Racz, P., Burgos, J.E., Inacio, N., Morariu, C, et al. Mobility and QoS Support for a Commercial Mobile Grid in Akogrimo. Mobile and Wireless Communications Summit, 2007.16th IST, pp.1-5.
[28]Yau S S, Karim F. A context-sensitive middleware for dynamic integration of mobile devices with network in frastructures[J]. Parallel Distrib.Comput.2004, vol.64:301-317.
[29]Kim SoonGohn, Ko Eung Nam.An adaptive dynamic window binding model for RCSM [C]. 3rd International Conference on Intelligent Computing, ICIC 2007.Qingdao,China 2007, pp.371-380.
[30]Noh-sam Park, Gil-haeng Lee. Agent-based Web services middleware[C]. Global Telecommunications Conference.GLOBECOM'03.IEEE.2004, vol.6:3186-3190.
[31]Huang L, Wu Z, Pan Y. scalable and effective architecture for grid services'discovery[C]. In Proceedings of SemPGRID'03.2003.vol 5:156-171.
[32]Kim, J S;Nam, Beomseok. Resource discovery techniques in distributed desktop grid environments.7th IEEE/ACM International Conference on Grid Computing,2006, pp.9-16.
[33]Xia Q, Yang R J, Wang W N. Autonomous job scheduling using genetic algorithm[C].In Intenrational Conference on Network and ServiceModel.Shanghai,China.2005,pp.100-105.
[34]Sun Jun-zhao,Jaakko. Mobility and mobility management:a conceptual framework[C]. Proceedings of the 10th IEEE International Conference on Networks,2002, pp.205-210.
[35]王金龙,王呈贵等.Ad Hoc移动无线网络[M].北京：国防工业出版社,2004,79-83.
[36]Akyildiz I.F, McNair J, Ho J.S.M, et al. Mobility management in next-generation wireless systems[C]. Proceedings of the IEEE,1999,87(8):1347-1384.
[37]蒋亮.移动资源管理系统的研究与实现[D].北京：北京邮电大学信息网络中心学院,2006.
[38]E.Pitoura, GSamara. Locating objects in mobile computing[C]. IEEE Transaction On Knowledge and Data Engineering,2001,13(4):571-592.
[39]Y Fang. Movement-based mobility management and trade off analysis for wireless mobile networks [J].IEEE Trans on Computers,2003,52(6):791-803.
[40]朱艺华,朱帆,罗和治.基于移动的位置管理策略中最优寻呼研究[J].计算机研究与发展,2007,44(7)：1199-1204.
[41]M Satyanarayanan. Pervasive computing:vision and challenges[C].IEEE Personal Communications,2001, vol.8(4):10-17.
[42]Chang Chin-Chen, Lin Iuon-Chang. The strategy of reducing the location update traffic using forwarding pointers in virtual layer architecture [J].Computer Standards and Interfaces.2003,vol.25(5):501-513.
[43]罗宁平.基于Min-Min改进后的网格调度算法[J].微电子学与计算机,2009,26(3)：87-92.
[44]曾文英,赵跃龙,宋玮等.移动网格体系结构及其资源选择方法[J].计算机工程,2008,34(20)： 93-95.
[45]李腊元,李春林.多Qos约束的多播路由协议[J].软件学报,2004,2(15)：256-259.
[46]张澜.网格环境下Min-Min调度算法的改进与实现[D],武汉,武汉理工大学信息工
程学院,2008.
[47]Zhang Qian,Li Zhen. Design of Grid Resource Manangement System Based on Divided Min-Min Scheduling Algorithm[C]. Education Technology and Computer Science, 2009.ETCS'09. First International Workshop on, hubei,wuhan.2009,3(3):613-617.
[48]He Xiaoshan, Xian-He Sun, Gregor von Laszewski. A QoSGuided Scheduling Algorithm for Grid Computing[C]. Journal of Computer Science and Technology 2003.18(4):442-451.
[49]Di Wu, Ning Tong, Keqiu Li. Mobile Grid Routing Algorithm in Mobile Ad Hoc Networks with Obstacles[C]. Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (SKG'06), Guilin, Guangxi, China, Nov.2006,pp.12-18.
[50]朱艺华,高济,周根贵.带门槛的指针推进移动性管理策略研究[J].计算机研究与发展,2002,39(5)：557-560.
[51]Guangbin Fan, Jingyuan Zhang. A muti-layer location management scheme that bridges the best static scheme and the best dynamic scheme[C]. Proceedings.2004 IEEE International Conference on Mobile Data Management,2004, pp.125-132.
[52]Ng C, Chan H W. Enhanced distance-based location management of mobile communication systems using a cell coordinates approach[C]. IEEE Transactions on Mobile Computing, Jan-Feb 2005,vol.4(1):41-55.
[53]Y.Xiao. A parallel shuffled paging strategy under delay bounds in wireless systems[C]. IEEE Communications Letters,2003,vol.7(8):367-369.
[54]杨疆湖,高传善,黄昌来等.一种基于虚拟截止时间制导的改进的Min-Min元任务调度算法[J].计算机科学,2006,33(8)：72-75.
[55]Sanjay, H.A; Vadhiyar, Sathish. A Performance modeling of parallel applications for grid scheduling [J]. Journal of Parallel and Distributed Computing.2008, vol.68(8):1135-1145.
[56]Rajkumar Buyya and Manzur Murshed. GridSim:A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing[J]. The Journal of Concurrency and Computation:Practice and Experience, Wiley Press,2002, vol.14:13-15.
[57]颜昕,李腊元.NS的仿真机制与协议扩展[J].武汉理工大学学报,交通科学与工程版,2004,28(2)：182-185.
[58]Anguswamy, R; Thiagarajan, M.Dagli, C.H. Systems Methodology and Framework for problem definition in Mobile ad hoc networks[C].Systems Conference,2008 2nd Annual IEEE. Montreal, Que.April 2008,pp.1-7.
[59]W.S.Jeon,D.G.Jeong. Performance of improved probabilistic location update schema for cellular mobile networks[C].IEEE Trans.OnVehicularTechnology,2000.vol.49(6): 2164-2173.
[2]Li Chunlin, Li Layuan. Energy constrained resource allocation optimization for mobile grid[J].Parallel Distrib.Comput.homepage:www.elsevier.com/locate/jpdc.2010,pp.245-258.
[3]Phan T, Huang L, Dulan C. Challenge-integrating mobile wireless devices into the computational grid[C].In Porceedings of the8 th ACM Intenrational Conference on Mobile Computing and Networking(MobiCom'02)Atlanta,G A.2002.
[4]Saha D, Mukherjee A. Pervasive computing:A paradigm for the 21st century[J]. Computer Institute of Electrical and Electronics Engineers Computer Society.2003, vol.36(3):25-31.
[5]Kurkovsky, Bhagyavati S. Wireless grid enables ubiquitous computing[C].In 16th International Conference on Parallel and Distributed Computing Systems (PDCS 2003). 2003,pp.399-404.
[6]夏琪.MobiGrid-移动网格的研究[D].上海：上海交通大学计算机体系结构学院,2006.
[7]都志辉,陈渝,刘鹏.网格计算[M].北京：清华大学出版社,2002：23-66.
[8]Foster I, Kesselman C, Tsudik G, et al. A Security Architecture for Computational Grids[C]. Proceedings of the 5th ACM Conference on Computer and Communications Security Conference.Chicago:IEEE Press,1998,pp.83-92.
[9]Frankhauser P, Kracher M, Erich J. et al, Semantic vs Structural Resemblance of Classes [J]. Global Grid Forum Draft Recommendation,2002,17(3):31-42.
[10]S.H.Srinivasan. Pervasive wireless grid architecture. In:Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services.2005, pp.1-6.
[11]Konstantinos Katsaros, George C. Polyzos. Optimizing Operation of a Hierarchical Campus-Wide Mobile Grid. In:The 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'07),2007, pp.1-5.
[12]罗红,慕德俊.网格计算中作业调度研究综述[J].计算机应用研究,2005(5)：16-19.
[13]Kulik, L. Mobile Computing Systems Programming:A Graduate Distributed Computing Course[C]. Distributed Systems Online, IEEE.2007, vol.8(5):4-4.
[14]朱艺华.无线移动网络的移动性管理[M].北京：人民邮电出版社,2005,10-11.
[15]廖建新.移动智能网技术的研究现状及未来发展[J].电子学报2003,31(11)：1725-1731.
[16]Gruhn Volker, Richter Thomas. A general model of mobile environments:Simulation support for strategic management decisions[C].7th International Conference on Grid and Cooperative Computing, GCC. Shenzhen, China.2008, pp.753-764.
[17]Syed Naqvi, Michel Riguidel, Dynamic Access Control for Pervasive Grid Applications[C]. International Conference on Computational Intelligence and Security, CIS 2005. Part Ⅱ, 3802 LNAI. pp.348-355.
[18]Reddy,Y.V. Pervasive ComputingImplications:Opportunities and Chanlleges for Society[C]. Pervaive Computing and Applications,2006 1st International Symposium on. Urumqi. 2006,pp.5-6.
[19]Ohta K, Yoshikawa T, Nakagawa T, et al.Design and Implementation of Mobile Grid Middleware for Handsets[C].Proceedings of the 11th International Conference on Parallel and Distributed Systems. Washington D.C.USA:IEEE Computer Society,2005, pp.679-683.
[20]V.C.M. Borges, A.G.M. Rossetto e M.A.R. Dantas, An Architecture for Handling Disconnections in Workflow Applications in Mobile Grid Environments. IEEE LATIN AMERICA TRANSACTIONS,2009,Vol.7(6):681-687.
[21]Xu Zhiwei, Li Wei. The research on vega grid architecture[J]. Journal of Computer Research and Development.2002. vol.39(8):923-929.
[22]Zhihong Xu, Xiangdan Hou, Jizhou Sun. Ant algorithm-based task scheduling in grid computing[C]. In:Electrical and Computer Engineering,2003. IEEE CCECE 2003. Canadian Conference on May 2003, Vol 2:1107-1110.
[23]Mobile Analyser:Overview of Mobile Analyser, http://wikihip.cem.ch/twiki/bin/view/grid/ mobile analyzer.2010-4.
[24]Karakostas, Bill1; Fakas, George2. An architecture for reliable mobile workflow in a grid environment [C].2009 4th International Conference on Internet and Web Applications and Services, ICIW 2009, Venice, Mestre, Italy,2009,pp.499-504.
[25]金海,袁平鹏,石柯.网格计算(第二版)[M].北京：电子工业出版社,2004.21-32.
[26]Haahr M, Cunningham R, Cahill V. Supporting corba applications in a mobile environment[C]. In Proceedings of the 5th Intenrational Conference on Mobile Computing and Networking(ACM Mobi Com'99).1999,pp.36-47.
[27]Racz, P., Burgos, J.E., Inacio, N., Morariu, C, et al. Mobility and QoS Support for a Commercial Mobile Grid in Akogrimo. Mobile and Wireless Communications Summit, 2007.16th IST, pp.1-5.
[28]Yau S S, Karim F. A context-sensitive middleware for dynamic integration of mobile devices with network in frastructures[J]. Parallel Distrib.Comput.2004, vol.64:301-317.
[29]Kim SoonGohn, Ko Eung Nam.An adaptive dynamic window binding model for RCSM [C]. 3rd International Conference on Intelligent Computing, ICIC 2007.Qingdao,China 2007, pp.371-380.
[30]Noh-sam Park, Gil-haeng Lee. Agent-based Web services middleware[C]. Global Telecommunications Conference.GLOBECOM'03.IEEE.2004, vol.6:3186-3190.
[31]Huang L, Wu Z, Pan Y. scalable and effective architecture for grid services'discovery[C]. In Proceedings of SemPGRID'03.2003.vol 5:156-171.
[32]Kim, J S;Nam, Beomseok. Resource discovery techniques in distributed desktop grid environments.7th IEEE/ACM International Conference on Grid Computing,2006, pp.9-16.
[33]Xia Q, Yang R J, Wang W N. Autonomous job scheduling using genetic algorithm[C].In Intenrational Conference on Network and ServiceModel.Shanghai,China.2005,pp.100-105.
[34]Sun Jun-zhao,Jaakko. Mobility and mobility management:a conceptual framework[C]. Proceedings of the 10th IEEE International Conference on Networks,2002, pp.205-210.
[35]王金龙,王呈贵等.Ad Hoc移动无线网络[M].北京：国防工业出版社,2004,79-83.
[36]Akyildiz I.F, McNair J, Ho J.S.M, et al. Mobility management in next-generation wireless systems[C]. Proceedings of the IEEE,1999,87(8):1347-1384.
[37]蒋亮.移动资源管理系统的研究与实现[D].北京：北京邮电大学信息网络中心学院,2006.
[38]E.Pitoura, GSamara. Locating objects in mobile computing[C]. IEEE Transaction On Knowledge and Data Engineering,2001,13(4):571-592.
[39]Y Fang. Movement-based mobility management and trade off analysis for wireless mobile networks [J].IEEE Trans on Computers,2003,52(6):791-803.
[40]朱艺华,朱帆,罗和治.基于移动的位置管理策略中最优寻呼研究[J].计算机研究与发展,2007,44(7)：1199-1204.
[41]M Satyanarayanan. Pervasive computing:vision and challenges[C].IEEE Personal Communications,2001, vol.8(4):10-17.
[42]Chang Chin-Chen, Lin Iuon-Chang. The strategy of reducing the location update traffic using forwarding pointers in virtual layer architecture [J].Computer Standards and Interfaces.2003,vol.25(5):501-513.
[43]罗宁平.基于Min-Min改进后的网格调度算法[J].微电子学与计算机,2009,26(3)：87-92.
[44]曾文英,赵跃龙,宋玮等.移动网格体系结构及其资源选择方法[J].计算机工程,2008,34(20)： 93-95.
[45]李腊元,李春林.多Qos约束的多播路由协议[J].软件学报,2004,2(15)：256-259.
[46]张澜.网格环境下Min-Min调度算法的改进与实现[D],武汉,武汉理工大学信息工
程学院,2008.
[47]Zhang Qian,Li Zhen. Design of Grid Resource Manangement System Based on Divided Min-Min Scheduling Algorithm[C]. Education Technology and Computer Science, 2009.ETCS'09. First International Workshop on, hubei,wuhan.2009,3(3):613-617.
[48]He Xiaoshan, Xian-He Sun, Gregor von Laszewski. A QoSGuided Scheduling Algorithm for Grid Computing[C]. Journal of Computer Science and Technology 2003.18(4):442-451.
[49]Di Wu, Ning Tong, Keqiu Li. Mobile Grid Routing Algorithm in Mobile Ad Hoc Networks with Obstacles[C]. Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (SKG'06), Guilin, Guangxi, China, Nov.2006,pp.12-18.
[50]朱艺华,高济,周根贵.带门槛的指针推进移动性管理策略研究[J].计算机研究与发展,2002,39(5)：557-560.
[51]Guangbin Fan, Jingyuan Zhang. A muti-layer location management scheme that bridges the best static scheme and the best dynamic scheme[C]. Proceedings.2004 IEEE International Conference on Mobile Data Management,2004, pp.125-132.
[52]Ng C, Chan H W. Enhanced distance-based location management of mobile communication systems using a cell coordinates approach[C]. IEEE Transactions on Mobile Computing, Jan-Feb 2005,vol.4(1):41-55.
[53]Y.Xiao. A parallel shuffled paging strategy under delay bounds in wireless systems[C]. IEEE Communications Letters,2003,vol.7(8):367-369.
[54]杨疆湖,高传善,黄昌来等.一种基于虚拟截止时间制导的改进的Min-Min元任务调度算法[J].计算机科学,2006,33(8)：72-75.
[55]Sanjay, H.A; Vadhiyar, Sathish. A Performance modeling of parallel applications for grid scheduling [J]. Journal of Parallel and Distributed Computing.2008, vol.68(8):1135-1145.
[56]Rajkumar Buyya and Manzur Murshed. GridSim:A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing[J]. The Journal of Concurrency and Computation:Practice and Experience, Wiley Press,2002, vol.14:13-15.
[57]颜昕,李腊元.NS的仿真机制与协议扩展[J].武汉理工大学学报,交通科学与工程版,2004,28(2)：182-185.
[58]Anguswamy, R; Thiagarajan, M.Dagli, C.H. Systems Methodology and Framework for problem definition in Mobile ad hoc networks[C].Systems Conference,2008 2nd Annual IEEE. Montreal, Que.April 2008,pp.1-7.
[59]W.S.Jeon,D.G.Jeong. Performance of improved probabilistic location update schema for cellular mobile networks[C].IEEE Trans.OnVehicularTechnology,2000.vol.49(6): 2164-2173.