检索结果-内蒙古大学图书馆

2010第六届全国多智能体系统与控制学术年会

作者： Li Dequan Liu Qipeng Wang Xiaofan Shanghai JiaoTong University Dongchuan Road 800Shanghai 200240China

Recently,there has been an increasing research interest in the quantized average consensus problem of multiagent systems,which just amounts to confining agents to evolve on the balanced information *** paper takes a further step toward the integration of information topology and quantized information in the distributed setting,and focuses on the consensus problem for a grrup of agents by sharing information on strongly connected and nonbalanced information graphs with data rate constraints,in which the agents's states are communicated through logarithmic *** this relaxed restriction on the information topology,we derive conditions concerned with the quantization precision to guarantee the weighted average preservation of the whole network,that is all agents are finally driven to the convex hull,not necessarily the centroid of the initial *** obtained result therefore extends related quantized average consensus investigations to a broader class of networks.

关键词： weighted average consensus distributed algorithm quantization nonbalanced information graph

来源：评论

学校读者我要写书评

暂无评论

A contract net based multi-UAV target assignment algorithm in a ring

A contract net based multi-UAV target assignment algorithm i...

引用

2010 4th International Conference on Intelligent Information Technology Application (IITA2010)

作者： Jia Sheng-de College of Mechatronics Engineering and Automation National University of Defense Technology Changsha,P.R.China Zhu Hua-yong College of Mechatronics Engineering and Automation National University of Defense Technology Changsha,P.R.China

Contract net algorithm has been used to solve the distributed problem *** this paper,a contract net based algorithm is suggested for multi-UAV target assignment problem in the synchronous ring network,The one with the highest price is the *** algorithm is distributed,each node just communicates with the neighbor two nodes,needn't to know the global *** end,an example has been given to validate the algorithm.

关键词： component contract net distributed algorithm multi-UAV target assignment

来源：评论

学校读者我要写书评

暂无评论

A distributed minimum restrictive connectivity maintenance algorithm

引用

IFAC Proceedings Volumes 2009年第16期42卷 365-370页

作者： Jay Wagenpfeil Adrian Trachte Takeshi Hatanaka Masayuki Fujita Oliver Sawodny Institute for System Dynamics University Stuttgart 70569 Stuttgart Germany Department of Mechanical and Control Engineering Tokyo Institute of Technology Tokyo 152-8552 Japan

Abstract The dynamic character of autonomous mobile multi-agent networks makes the control of the individual agent's movement a challenging task when certain properties or conditions concerning the global network state must be fulfilled. Many distributed algorithms require that the communication topology of the regarded multi-agent network is connected at all times to execute properly. Since particularly motion control algorithms directly influence the connectivity itself, the fundamental question how connectivity of the network can be maintained is raised. As an additional difficulty, individual agents often have only access to local information, whereas connectivity is a property of the global network. In this work, a distributed hybrid connectivity maintenance algorithm is proposed, which guarantees global connectivity of the network based on local information. The algorithm is divided in two components: First, a discrete topology control algorithm determines periodically the structure of a minimum cost spanning tree on the network communication graph. Second, a continuous connectivity motion control algorithm constrains the location of each individual agent such that the determined spanning tree is preserved. This combined algorithm effectively maintains connectivity under the presence of any finite-valued primary motion control law.

关键词： connectivity maintenance distributed algorithm local information dynamic shortest path search multi-agent networks motion coordination

来源：评论

学校读者我要写书评

暂无评论

distributed multicast routing algorithm with dynamic performance in multimedia networks

引用

中国工程科学（英文版） 2009年第3期7卷 28-34页

作者： Zhu Baoping Zhang Kun School of Computer Science and technology Nanjing University of Science & Technology Nanjing 210094 China

Tbe delay and DVBMT problem is known to be NP-complete. In this paper, an efficient distributed dynamic multicast muting algorithm was proposed to produce muting trees with delay and delay variation constraints. The pro-posed algorithm is fully distributed, and supports the dynamic reorganizing of the muhicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and muting success ratio as compared with other existing algorithms, and performs excellently in delay variation performance under lower time complexity, which ensures it to support the requirements of real-time multimedia communications more effectively.

关键词： multicast muting distributed algorithm dynamic performance delay and delay variation-bounded multi-media networks

来源：评论

学校读者我要写书评

暂无评论

distributed multicast routing algorithm with dynamic performance in multimedia networks

引用

Engineering Sciences 2009年第3期7卷 28-34页

作者： Zhu Baoping Zhang Kun School of Computer Science and technology Nanjing University of Science ＆ Technology Nanjing 210094 China

The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The proposed algorithm is fully distributed,and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and routing success ratio as compared with other existing algorithms,and performs excellently in delay variation performance under lower time complexity,which ensures it to support the requirements of real-time multimedia communications more effectively.

关键词： multicast routing distributed algorithm dynamic performance delay and delay variation-bounded multimedia networks

来源：评论

学校读者我要写书评

暂无评论

Risk profiles and distributed risk assessment

引用

COMPUTERS & SECURITY 2009年第7期28卷 521-535页

作者： Chivers, Howard Clark, John A. Cheng, Pau-Chen Cranfield Univ Dept Informat Syst Cranfield MK43 0AL Beds England Univ York Dept Comp Sci York YO10 5DD N Yorkshire England IBM Watson Res Ctr Hawthorne NY USA

Risk assessment is concerned with discovering threat paths between potential attackers and critical assets, and is generally carried out during a system's design and then at fixed intervals during its operational life. However, the currency of such analysis is rapidly eroded by system changes;in dynamic systems these include the need to support ad-hoc collaboration, and dynamic connectivity between the system's components. This paper resolves these problems by showing how risks can be assessed incrementally as a system changes, using risk profiles, which characterize the risk to a system from subverted components. We formally define risk profiles, and show that their calculation can be fully distributed;each component is able to compute its own profile from neighbouring information. We further show that profiles converge to the same risks as systematic threat path enumeration, that changes in risk are efficiently propagated throughout a distributed system, and that the distributed computation provides a criterion for when the security consequences of a policy change are local to a component, or will propagate into the wider system. Risk profiles have the potential to supplement conventional risk assessments with useful new metrics, maintain accurate continuous assessment of risks in dynamic distributed systems, link a risk assessment to the wider environment of the system, and evaluate defence-in-depth strategies. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Risk management Security distributed systems Security model distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Throughput Maximization in P2P VoD Applications

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2009年第3期11卷 509-522页

作者： He, Yifen Lee, Ivan Guan, Ling Ryerson Univ Dept Elect & Comp Engn Toronto ON M5B 2K3 Canada Univ S Australia Sch Comp & Informat Sci Adelaide SA 5095 Australia

In peer-to-peer (P2P) video-on-demand (VoD) systems, a scalable source coding is a promising solution to provide heterogeneous peers with different video quality. In this paper, we present a systematic study on the throughput maximization problem in P2P VoD applications. We apply network coding to scalable P2P systems to eliminate the delivery redundancy. Since each peer receives distinct packets, a peer with a higher throughput can reconstruct the video at a higher quality. We maximize the throughput in the existing buffer-forwarding P2P VoD systems using a fully distributed algorithm. We demonstrate in the simulations that the proposed distributed algorithm achieves a higher throughput compared to the proportional allocation scheme or the equal allocation scheme. The existing buffer-forwarding architecture has a limitation in total upload capacity. Therefore we propose a hybrid-forwarding P2P VoD architecture to improve the throughput by combining the buffer-forwarding approach with the storage-forwarding approach. The throughput maximization problem in the hybrid-forwarding architecture is also solved using a fully distributed algorithm. We demonstrate that the proposed hybrid-forwarding architecture greatly improves the throughput compared to the existing buffer-forwarding architecture. In addition, by adjusting the priority weight at each peer, we can implement the differentiated throughput among different users within a video session in the buffer-forwarding architecture, and the differentiated throughput among different video sessions in the hybrid-forwarding architecture.

关键词： Convex optimization distributed algorithm hybrid-forwarding architecture peer-to-peer (P2P) video-on-demand (VoD) throughput maximization

来源：评论

学校读者我要写书评

暂无评论

A Game-Theoretic Approach for distributed Power Control in Interference Relay Channels

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2009年第6期8卷 3151-3161页

作者： Shi, Yi Wang, Jiaheng Ben Letaief, Khaled Mallik, Ranjan K. Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Kowloon Hong Kong Peoples R China Indian Inst Technol Dept Elect Engn New Delhi 110016 India

This paper considers the multiuser power control problem in Gaussian frequency-flat interference relay channels using a game-theoretic framework. While a lot of attention has been paid to Gaussian interference games, where sufficient conditions for the uniqueness of the Nash equilibrium (NE) have been established, these types of games have not been studied in the context of interference relay channels. We consider here Gaussian interference relay games (GIRGs), where instead of allocating the power budget across a set of sub-channels, each player aims to decide the optimal power control strategy across a set of hops. We show that the GIRG always possesses a unique NE for a two-player version of the game, irrespective of any channel realization or initial system parameters such as power budgets and noise power. Furthermore, we derive explicitly a sufficient condition under which the NE achieves Pareto-optimality. To facilitate decentralized implementation, we propose a distributed and asynchronous algorithm. We also prove that the proposed algorithm always converges to the unique NE from an arbitrary starting point. We then conclude that the distributed game-theoretic approach exhibits great potential in the context of interference relay channels and qualifies as a practically appealing candidate for power control.

关键词： distributed algorithm game theory interference relay channels Pareto-optimality power control

来源：评论

学校读者我要写书评

暂无评论

Efficient Intelligent Localization Scheme for distributed Wireless Sensor Networks

引用

JOURNAL OF COMPUTERS 2009年第11期4卷 1159-1166页

作者： Chai, Chunlai Zhejiang GongShang Univ Coll Comp Sci & Informat Engn Hangzhou Zhejiang Peoples R China

To estimate location accurately in distributed wireless sensor networks (WSNs), an efficient intelligent position estimation scheme is proposed which needs fewer known nodes without calculating relative positions. The proposed intelligent localization scheme includes two phases. In the first phase, an initialization location algorithm is adopted, where known nodes broadcast their positions and one-hop distances, and then unknown nodes use the received information and operate weighted estimation algorithm to calculate their initial positions. In the second phase, an optimized location algorithm is employed. Unknown nodes exchange information with their neighbors and operate a modified weighted estimation algorithm to refine their positions repeatedly. Additionally, a location scheme also is proposed to solve the problem that a node only has two neighbors. Detailed simulation results show that, the proposed scheme can decrease the average position error down to 9% radio range, and increase the average number of located nodes up to 78% when connectivity is greater than 12 in 20% known node ratio.

关键词： intelligent localization wireless sensor networks distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Convergence of distributed Power Control with Full-Duplex Amplify-and-Forward Relays

Convergence of Distributed Power Control with Full-Duplex Am...

引用

International Conference on Wireless Communications and Signal Processing

作者： Song, Young-Keum Kim, Dongwoo Hanyang Univ Dept Elect Engn & Comp Sci Ansan 426791 South Korea

ISBN: (纸本)9781424448562

In this paper, we introduce a power control algorithm for cooperative cellular networks consisting of multiple sources, multiple full-duplex amplify-and-forward relays, and a destination. The objective of this algorithm is to allocate the available power of each source so that it can achieve the required transmission quality. The full-duplex relays receive the signal amplified by themselves and re-amplify it sequentially. We derive the SINR and interference function, and then a simplified analysis of convergence is given by using a standard techniques. We evaluate the power controlled system in terms of the outage probability as well as the average power consumption, and compare it with the system without a relay and with half-duplex relays, respectively. The simulation results illustrates potential advantages of the power controlled system with full-duplex relays, the performance of which is limited by an isolation factor.

关键词： Power control full duplex distributed algorithm standard techniques convergence interference functions

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：