Providing early resource allocation during emergencies: The mobile triage tag

Quick response is critical during an emergency situation. This paper describes a system based on mobile electronic triage tags that makes victim information available at the base of operations as soon as possible, thus allowing an early medical resource allocation and immediate action. The cornerstone of the system is mobile agent technology, which allows information to be transported asynchronously and reliably from terminal to terminal and not requiring any network infrastructure at all. This novel approach is ready to be used in the worst case scenario, where only small handheld devices carried by the emergency personnel are available, but also integrates well when synchronous connections are possible, for instance when a mesh network can be created. The system has been successfully implemented, showing the feasibility of the proposal. By using this low-budget system, the number of casualties during the triage stage of an emergency is expected to drop off.     

Discrete-event simulation for efficient and stable resource allocation in collaborative mobile cloudlets

The deployment of highly interactive, media-rich applications on mobile devices is hindered by the inherent limitations on compute power, memory and battery capacity of these hand-held platforms. The cloudlet concept, opportunistically offloading computation to nearby devices, has proven to be a viable solution in offering resource-intensive applications on mobile devices. In this paper, we propose to extend the cloudlet concept with collaborative scenarios, in which not only hardware resources for processing are shared between all cloudlet users, but also the data computed.In a cloudlet, the resource demand should be spread over all available cloudlet nodes. User mobility and fluctuations in wireless bandwidth will cause the optimal resource allocation to vary over time. The cloudlet middleware must continuously balance the performance gain of reallocating components with the operational costs in terms of user experience and management complexity. In this paper, we formulate this optimization problem based on a theoretical cloudlet model capturing the infrastructure, application structure and user behavior.In order to solve this problem, two heuristic allocation algorithms based on Steepest Descent (SD) and Simulated Annealing (SA) are described. Besides optimality of the found solution, it is also important to limit the number of reallocations at runtime. To evaluate the performance and stability of the algorithms, we propose a discrete-event model for cloudlet simulation. For multiple application scenarios, we observe that SD performs 4 times less reallocations than SA. By introducing hysteresis, the number of reallocations by SA can be nearly halved without any significant degradation of application performance.     

Energy constrained resource allocation optimization for mobile grids

A mobile grid incorporates mobile devices into Grid systems. But mobile devices at present have severe limitations in terms of processing, memory capabilities and energy. Minimizing the energy usage in mobile devices poses significant challenges in mobile grids. This paper presents energy constrained resource allocation optimization for mobile grids. The goal of the paper is not only to reduce energy consumption, but also to improve the application utility in a mobile grid environment with a limited energy charge, ensuring battery lifetime and the deadlines of the grid applications. The application utility not only depends on its allocated resources including computation and communication resources, but also on the consumed energy, this leads to a coupled utility model, where the utilities are functions of allocated resources and consumed energy. Energy constrained resources allocation optimization is formulated as a utility optimization problem, which can be decomposed into two subproblems, the interaction between the two sub-problems is controlled through the use of a pricing variable. The paper proposes a price-based distributed energy constrained resources allocation optimization algorithm. In the simulation, the performance evaluation of our energy constrained resources allocation optimization algorithm is conducted.     

协同移动边缘计算分层资源配置机制

针对车联网（IoV）中存在大量的车辆卸载任务计算需求,而本地端边缘服务器运算能力有限的问题,提出一种移动边缘计算分层协同资源配置机制（HRAM）。所提算法以多层式的架构合理分配与有效利用移动边缘计算（MEC）服务器的运算资源,减少不同MEC服务器之间的数据多跳转发时延,并优化卸载任务请求时延。首先构建IoV边缘计算系统模型、通信模型、决策模型和计算模型;然后利用层次分析法（AHP）进行多因素综合考虑以确定卸载任务迁移的目标服务器;最后提出动态权值的任务路由策略,调用整体网络的通信能力以缩短卸载任务的请求时延。仿真实验结果表明,HRAM算法相较于任务卸载单层式资源分配（RATAOS）算法和任务卸载多层式资源分配（RATOM）算法,分别降低了40.16%和19.01%的卸载任务请求时延;且所提算法在满足卸载任务最大可容忍时延的前提下,能够满足更多卸载任务的计算需求。     

Securing dynamic itineraries for mobile agent applications

In this paper we present a novel mechanism for the protection of dynamic itineraries for mobile agent applications. Itineraries that are decided as the agent goes are essential in complex applications based on mobile agents, but no approach has been presented until now to protect them. We have conceived a cryptographic scheme for shielding dynamic itineraries from tampering, impersonation and disclosure. By using trust strategically, our scheme provides a balanced trade-off between flexibility and security. Our protection scheme has been thought always bearing in mind a feasible implementation, and thus facilitates the development of applications that make use of it. An example application based on a real healthcare scenario is also presented to show its operation.     

An efficient resource allocation scheme for multimedia applications in MANET

A Mobile Adhoc Network (MANET) is collection of mobile nodes and communicates using wireless network without having any fixed infrastructure. This paper proposes an algorithm used to allocate the resources for multimedia applications using mobile agent technology in MANET. In addition to that, it allocates the resources for hand-off applications and new applications.     

面向群业务的移动互联网自适应资源分配机制

现有的移动互联网资源分配机制大多面向单一业务,无法高效支持群业务。针对这一问题,提出一种面向群业务的自适应资源分配机制。综合考虑动态变化的异构网络环境、群业务特征和用户需求,采用吸引子选择模型来计算备选网络的优先级;在此基础上,运用逼近理想接入网络法对备选网络进行多属性判决,为群业务选择适宜的接入网络。仿真结果表明,该机制显著提高了用户体验和网络资源的利用率。     

Fair resource allocation and stability for communication networks with multipath routing

Multipath networks allow that each source-destination pair can have several different paths for data transmission, thus they improve the performance of increasingly bandwidth-hungry applications and well cater for traffic load balancing and bandwidth usage efficiency. This paper investigates fair resource allocation for users in multipath networks and formulates it as a multipath network utility maximisation problem with several fairness concepts. By applying the Lagrangian method, sub-problems for users and paths are derived from the resource allocation model and interpreted from an economic point of view. In order to solve the model, a novel rate-based flow control algorithm is proposed for achieving optimal resource allocation, which depends only on local information. In the presence of round-trip delays, sufficient conditions are obtained for local stability of the delayed algorithm. As for the end-to-end implementation in Internet, a window-based flow control mechanism is presented since it is more convenient to implement than rate-based flow control.     

A mobile agent platform for distributed network and systems management

The mobile agent (MA) technology has been proposed for the management of networks and distributed systems as an answer to the scalability problems of the centralized paradigm. Management tasks may be assigned to an agent, which delegates and executes management logic in a distributed and autonomous fashion. MA-based management has been a subject of intense research in the past few years, reflected on the proliferation of MA platforms (MAPs) expressly oriented to distributed management. However, most of these platforms impose considerable burden on network and system resources and also lack of essential functionality, such as security mechanisms, fault tolerance, strategies for building network-aware MA itineraries and support for user-friendly customization of MA-based management tasks. In this paper, we discuss the design considerations and implementation details of a complete MAP research prototype that sufficiently addresses all the aforementioned issues. Our MAP has been implemented in Java and optimized for network and systems management applications. The paper also presents the evaluation results of our prototype in real and simulated networking environments.     

支持QoS确保的存储服务器服务资源分配算法

在电子商务、工业制造领域中,具有海量存储与高I/O吞吐能力的数据存储服务器得到了广泛应用。数据存储服务器提供QoS支持对应用需求而言很重要,但是实践中却很少有数据存储服务器提供了QoS支持。提出了一种支持服务质量区分并对高优先级用户提供服务质量保证的存储服务区服务资源分配算法,由于对高优先级用户请求与低优先级用户请求采用了可变服务质量区分因子,因而算法在提供服务优先级区分与确保高优先级请求服务质量的同时,减小了低优先级请求的请求丢弃率,同时最大化了服务资源利用率。     

Multicast routing in mobile ad hoc networks by using a multiagent system

Multicast routing in mobile ad hoc networks (MANETs) poses several challenges due to inherent characteristics of the network such as node mobility, reliability, scarce resources, etc. This paper proposes an Agent Based Multicast Routing Scheme (ABMRS) in MANETs, which uses a set of static and mobile agents. Five types of agents are used in the scheme: Route manager static agent, Network initiation mobile agent, Network management static agent, Multicast initiation mobile agent and Multicast management static agent. The scheme operates in the following steps: (1) to identify reliable nodes; (2) to connect reliable nodes through intermediate nodes; (3) to construct a backbone for multicasting using reliable nodes and intermediate nodes; (4) to join multicast group members to the backbone; (5) to perform backbone and group members management in case of mobility. The scheme has been simulated in various network scenarios to test operation effectiveness in terms of performance parameters such as packet delivery ratio, control overheads and group reliability. Also, a comparison of proposed scheme with MAODV (Multicast Ad hoc on-demand Distance Vector) protocol is presented. ABMRS performs better than MAODV as observed from the simulation. ABMRS offers flexible and adaptable multicast services and also supports component based software development.     

Promoting the development of secure mobile agent applications

In this paper, we present a software architecture and a development environment for the implementation of applications based on secure mobile agents. Recent breakthroughs in mobile agent security have unblocked this technology, but there is still one important issue to overcome: the complexity of programming applications using these security solutions. Our proposal aims to facilitate and speed up the process of implementing cryptographic protocols, and to allow the reuse of these protocols for the development of secure mobile agents. As a result, the proposed architecture and development environment promote the use of mobile agent technology for the implementation of secure distributed applications.     

GMAC: An overlay multicast network for mobile agent platforms

The lack of proper support for multicast services in the Internet has hindered the widespread use of applications that rely on group communication services such as mobile software agents. Although they do not require high bandwidth or heavy traffic, these types of applications need to cooperate in a scalable, fair and decentralized way. This paper presents GMAC, an overlay network that implements all multicast related functionality–including membership management and packet forwarding–in the end systems. GMAC introduces a new approach for providing multicast services for mobile agent platforms in a decentralized way, where group members cooperate in a fair way, minimize the protocol overhead, thus achieving great scalability. Simulations comparing GMAC with other approaches, in aspects such as end-to-end group propagation delay, group latency, group bandwidth, protocol overhead, resource utilization and failure recovery, show that GMAC is a scalable and robust solution to provide multicast services in a decentralized way to mobile software agent platforms with requirements similar to MoviLog.     

用于高速列车移动网络的资源分配实时算法

误码率高、频繁中断的高速列车移动场景宜采用多宿主容迟网络。但其资源分配计算复杂,实时性较差。基于效用差分法设计初始化过程资源分配算法,以保证过程中每一步的效用单调不减,算法时间复杂度降至O(n)。     

一个移动Agent安全旅行协议

本文提出了一种保护移动Agent不受Agent平台攻击的旅行协议。该协议基于Agent旅行的历史记录,在一定的条件下允许Agent所有者检测对Agent代码、状态和执行流的非法篡改。这个协议具有很高的安全性能,能够检测旅行途中的Agent平台对Agent数据的篡改,能够防止重播攻击。     

P2P网络中应用移动Agent进行资源搜索的研究

P2P网络中的搜索是P2P应用领域中最为广泛的。在研究现有P2P搜索发现机制的基础上,提出了在P2P网络中建立区域结构,并引入移动Agent技术来执行资源搜索的任务,从而实现搜索的灵活性、全面性和有效性,同时实现了一个文件搜索系统的应用。     

Triangle-based routing for mobile ad hoc networks

Routing protocols for Mobile ad hoc networks (MANETs) have been studied extensively in the past decade. Routing protocols for MANETs can be broadly classified as reactive (on-demand), proactive, hybrid and position-based. Reactive routing protocols are attractive because a route between a source and a destination is established only when it is needed. Such protocols, unlike proactive protocols, do not have high overhead for route maintenance and are especially suitable for networks in which not all nodes communicate frequently. One problem with existing reactive routing protocols is the propagation of redundant route request messages during route discovery. In this paper, we present a low-overhead reactive routing protocol which reduces propagation of redundant route request messages. We also compare its performance with the well-known reactive routing protocol AODV.     

WSN中基于Stateless Weight的移动代理路由设计

为了使移动代理的路由不再过分依赖于网络结构,提出了一种应用在无线传感器网络（WSN）中的移动代理的路由设计（SWR-MA）。在SWR-MA中,引入了一个与节点位置有关的参数Weight,通过比较Weight值,移动代理可以自主的确定自己的路径。SWR-MA可以应用在拓扑改变的网络中,比如带有移动Sink节点的网络中。最后,对该路由算法进行了仿真评价。