A suboptimal joint bandwidth and power allocation for cooperative relay networks＂ a cooperative game theoretic approach

In commercial networks, user nodes operating on batteries are assumed to be selfish to consume their resources (i.e., bandwidth and power) solely maximizing their own benefits (e.g., the received signal-to-noise ratios (SNRs) and datarates). In this paper, a cooperative game theoretical framework is proposed to jointly perform the bandwidth and power allocation for selfish cooperative relay networks. To ensure a fair and efficient resource sharing between two selfish user nodes, we assume that either node can act as a source as well as a potential relay for each other and either node is willing to seek cooperative relaying only if the datarate achieved through cooperation is not lower than that achieved through noncooperation (i.e., direct transmission) by consuming the same amount of bandwidth and power resource. Define the cooperative strategy of a node as the number of bandwidth and power that it is willing to contribute for relaying purpose. The two node joint bandwidth and power allocation (JBPA) problem can then be formulated as a cooperative game. Since the Nash bargaining solution (NBS) to the JBPA game (JBPAG) is computationally difficult to obtain, we divide it into two subgames, i.e., the bandwidth allocation game (BAG) and the power allocation game (PAG). We prove that both the subgames have unique NBS. And then the suboptimal NBS to the JBPAG can be achieved by solving the BAG and PAG sequentially. Simulation results show that the proposed cooperative game scheme is efficient in that the performance loss of the NBS result to that of the maximal overall data-rate scheme is small while the maximal-rate scheme is unfair. The simulation results also show that the NBS result is fair in that both nodes could experience better performance than they work independently and the degree of cooperation of a node only depends on how much contribution its partner can make to improve its own performance.     

Normalized Efficient Routing Protocol for WSN

WSNs （wireless sensor networks） consist of thousands of tiny nodes having the capability of sensing, computation, and wireless communications. Unfortunately these devices are limited energy devices, that is means we must save energy as much as possible, to increase network life time as long as possible. In this paper we introduce NEER--normalized energy efficient routing protocol that increases network life time through switching between AODV protocol that depends on request-reply routing, and MRPC that depends on residual battery in routing.     

Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies

In this paper, we propose a distributed agent model that applies belief-desire-intention (BDI) reasoning and negotiation for addressing the linear assignment problem (LAP) collaboratively. In resource allocation, LAP is viewed as seeking a concurrent allocation of one different resource for every task to optimize a linear sum objective function. The proposed model provides a basic agent-based foundation needed for efficient resource allocation in a distributed environment. A distributed agent algorithm that has been developed based on the BDI negotiation model is examined both analytically and experimentally. To improve performance in terms of average negotiation speed and solution quality, two initialization heuristics and two different reasoning control strategies are applied, with the latter yielding different variants of the basic algorithm. Extensive simulations suggest that all the heuristic-algorithm combinations can produce a near optimal solution soon enough in some specific sense. The significance and applicability of the research work are also discussed.     

1-多交互协议本体的描述

基于本体的共享与重用性以及谈判过程的动态性,提出谈判协议过程本体,将语义Web应用到自动谈判中,利用描述逻辑和本体编辑器Protégé 3.2.1对1-多交互协议本体进行形式化描述,并得到相应的OWL文件。     

基于知识本体的协商Agents模型研究

知识本体具有知识共享,再利用和规则推理的能力,基于知识本体构建协商Agent模型,使协商Agent与特定的协商语言．协商协议和协商议题分离,解决异构Agent之间协商问题。     

基于JADE平台的Multi-Agent协商的设计与实现

Multi-Agent协商是目前研究的一个热点,而从底层开发出一个Multi-Agent协商系统是非常复杂和困难的。该文在研究JADE仿真平台技术的基础上,对基于JADE仿真平台的Multi-Agent协商进行了设计与实现,为研究Multi-Agent协商有着重要的意义。     

基于SNMP的VPN集中管理若干关键技术研究

广域网环境下,基于SNMP的远程集中管理可对中、大规模VPN网络实现高效安全的管理.为解决网管系统在拓扑发现方面存在的缺陷,提出了采用设备代理主动注册的解决办法.基于SNMPv3安全特性的分析,引入了公钥认证的机制,详细介绍了密钥协商的具体流程,较好地解决了网络管理协议在身份认证及加密传输方面的不足.针对基于无连接传输服务的SNMP数据传输无法保证其可靠性和实时性的不足,给出了基于XML的集中配置实现策略,实验结果表明了该策略的可行性和有效性.     

多维QoS在基于MOM的QoS管理模型中的应用

服务质量QoS管理是满足分布式环境中端到端QoS需求的关键,而中间件是一种分布式系统中的主要交互平台.首先对中间件和QoS的相关概念进行介绍,在分析传统QoS管理模型的基础上,提出一种基于消息中间件(MOM)的QoS管理模型,重点分析多维QoS在该模型中的应用,最后结合一个实例说明多维QoS在实际系统中的应用.     

轮腿式机器人倾覆稳定性分析与控制

对于运动在不平坦地形中的移动机器人而言,其倾覆稳定性非常关键．设计了一种结构对称的轮腿式机器人,它有4个独立的轮腿运动单元,能够变化多种构形．采用动态能量稳定锥方法和倾覆稳定性指数对机器人的稳定性进行综合评价,建立了一个模糊神经网络自适应控制系统．根据稳定性指数值,该系统可以实时改变机器人的构形和速度,保证其倾覆稳定性．正弦路面上的仿真结果表明,该系统所产生的动作实时性好、可靠性高,能够降低机器人自主越障过程中的危险．     

Denial of service attacks and defenses in decentralized trust management

Trust management is an approach to scalable and flexible access control in decentralized systems. In trust management, a server often needs to evaluate a chain of credentials submitted by a client; this requires the server to perform multiple expensive digital signature verifications. In this paper, we study low-bandwidth Denial-of-Service (DoS) attacks that exploit the existence of trust management systems to deplete server resources. Although the threat of DoS attacks has been studied for some application-level protocols such as authentication protocols, we show that it is especially destructive for trust management systems. Exploiting the delegation feature in trust management languages, an attacker can forge a long credential chain to force a server to consume a large amount of computing resource. Using game theory as an analytic tool, we demonstrate that unprotected trust management servers will easily fall prey to a witty attacker who moves smartly. We report our empirical study of existing trust management systems, which manifests the gravity of this threat. We also propose a defense technique using credential caching, and show that it is effective in the presence of intelligent attackers. A preliminary version of this paper was presented at the Second IEEE International Conference on Security and Privacy in Communication Networks, Baltimore, MD, USA, August 2006.