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

On the optimal parameter of the composite Laplacian quadratics function

AUTOMATICA 2016年 72卷 1-10页

作者： Chen, Fei Feng, Gang Xiamen Univ Dept Automat Xiamen 361005 Fujian Peoples R China City Univ Hong Kong Dept Mech & Biomed Engn Kowloon Hong Kong Peoples R China

Recently, the composite quadratic Lyapunov function has been extended to study of multi-agent systems, leading to the so-called composite Laplacian quadratics (CLQs) function. Compared with quadratic Lyapunov functions, the CLQs function can yield a larger convergence region and is particularly useful in stabilization of multi-agent systems with complex dynamics, such as differential inclusions. In the definition of the CLQs function, an optimal vector parameter plays a critical role in determining the value of the CLQs function and in constructing stabilization laws derived from the CLQs function. This paper focuses on the properties of the optimal parameter of the CLQs function. The uniqueness of the optimal parameter is established. A distributed computation approach is further proposed, which is useful in computing the optimal parameter. The robustness issue of the optimal parameter is also investigated for a multi-agent system described by linear differential inclusions. Finally, a numerical example is provided to validate the proposed theoretical results. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Composite Laplacian quadratics Multi-agent systems Optimality distributed algorithm Robustness

来源：评论

学校读者我要写书评

暂无评论

Self-organising multiuser matching in cellular networks: a score-based mutually beneficial approach

引用

IET COMMUNICATIONS 2016年第15期10卷 1928-1937页

作者： Liu, Dianxiong Xu, Yitao Shen, Liang Xu, Yuhua PLA Univ Sci & Technol Coll Commun Engn Nanjing Jiangsu Peoples R China

In this study, the authors study the self-organising user assignment problem for the multi-user cooperation network. In the cellular network with user cooperation, idle users near the base station are seen as potential relay nodes, which can assist cell edge users to transmit data. Practically, the selfish nature of users is considered in the authors' model. They design a score-based system, where the strategies of relay assignment are affected by the historical behaviours of users. That means not only the transmission performance, but also the accumulative contributions of users are considered. The proposed score-based system sufficiently encourages idle users to assist active users. Furthermore, the multi-user assignment problem is formulated as a one-to-one matching game, in which idle users and active users rank one another individually based on their own preference. To address the issue, they propose a self-organising mutually beneficial matching algorithm, which is proven to converge to a stable matching. Simulation results show that the proposed distributed algorithm yields well matching performance between source users and relay users, which is close to the optimal centralised results.

关键词： cellular radio cooperative communication data communication relay networks (telecommunication) game theory distributed algorithms self-organising multiuser matching cellular networks score-based mutually beneficial approach self-organising user assignment problem multiuser cooperation network user cooperation base station relay nodes cell edge users data transmission score-based system design relay assignment transmission performance multiuser assignment problem one-to-one matching game idle users active users self-organising mutually beneficial matching algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Structured triangulation in multi-robot systems: Coverage, patrolling, Voronoi partitions, and geodesic centers

引用

INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH 2016年第10期35卷 1234-1260页

作者： Lee, Seoung Kyou Fekete, Sandor P. McLurkin, James Rice Univ Dept Comp Sci Houston TX 77251 USA TU Braunschweig Dept Comp Sci Muhlenpfordtstr 23 D-38106 Braunschweig Germany

We present a fundamental framework for organizing exploration, coverage, and surveillance by a swarm of robots with limited individual capabilities, based on triangulating an unknown environment with a multi-robot system. Locally, an individual triangle is easy for a single robot to manage and covers a small area;globally, the topology of the triangulation approximately captures the geometry of the entire environment. Combined, a multi-robot system can explore, map, navigate, and patrol. algorithms can store information in triangles that the robots can read and write as they run their algorithms. This creates a physical data structure ( PDS) that is both robust and versatile. We study distributed approaches to triangulating an unknown, two-dimensional Euclidean space using a multi-robot network. The resulting PDS is a compact representation of the workspace, contains distributed knowledge of each triangle, encodes the dual graph of the triangulation, and supports reads and writes of auxiliary data. The ability to store and process this auxiliary information enables the simple robots to solve complex problems. We develop distributed algorithms for dual-graph navigation, patrolling, construction of a topological Voronoi tessellation, and location of the geodesic centers in non-convex regions. We provide theoretical performance guarantees for the quality of constructed triangulation and the connectivity of a dual graph in the triangulation. In addition, we show that the path lengths of the physical navigation are within a constant factor of the shortest-path Euclidean distance. We validate these theoretical results with simulations and experiments with a dozen or more robots.

关键词： Multi-robot system distributed algorithm space coverage robotic network localization navigation

来源：评论

学校读者我要写书评

暂无评论

A Stable and distributed Community Detection algorithm Based on Maximal Cliques

A Stable and Distributed Community Detection Algorithm Based...

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Gui, Feng Ma, Yunlong Zhang, Feng Liu, Min Yin, Rong Shen, Weiming Tongji Univ Sch Elect & Informat Engn Shanghai 200092 Peoples R China Tongji Univ Key Lab Embedded Syst & Serv Shanghai 200092 Peoples R China

ISBN: (纸本)9781479986965

In the research area of community detection which aims at detecting some highly cohesive vertex subsets in social network, there mainly exist some problems, such as the algorithms with comparatively excellent quality of the final partitioning usually have high time complexity and some other fast algorithms often result in low quality of partitioning or other disadvantages. Nowadays, the increasing demands for community detection in large-scale social networks necessitate the use of distributed and scalable methods to detect communities in an effective and efficient manner. Label propagation algorithm (LPA), whose time complexity is O(m) on a network with m edges, is a near linear time algorithm to detect community effectively. Besides, owing to having good scalability, the parallel version of LPA (DLPA) is suitable for community detection in large-scale social networks. However, DLPA synchronously updates the vertices labels, which usually brings about label oscillations and results in low quality of partitioning. In this paper, we analyze the drawbacks of DLPA and propose a novel method C-DLPA, which combines DLPA with the notion of maximal cliques and at the same time utilizes a new updating mechanism that updating each node' label by probability of its adjacent nodes, to make final partitioning become more accurate and to avoid oscillations effectively. The experimental results show that C-DLPA has better performance is not only low time cost by as much to avoid oscillations but its community detection accuracy compared with DLPA.

关键词： community detection label propagation algorithm maximal cliques synchronous distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Modeling Dynamic Adaptive Streaming Over Information-Centric Networking

引用

IEEE ACCESS 2016年 4卷 8362-8374页

作者： Jia, Riheng Liu, Zhe Wang, Xiong Gan, Xiaoying Wang, Xinbing Xu, Jun (Jim) Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Georgia Inst Technol Coll Comp Atlanta GA 30332 USA

The dynamic adaptive streaming technique flexibly adapts the video bit-rate to link fluctuations, which can improve the quality of experience (QoE). In this paper, we present a systematic framework of video streaming in the context of information-centric networking, in order to facilitate the largescale deployment of the dynamic adaptive streaming technique. Specifically, we design the network as a two-layer coordinating structure, namely, the control layer and the transmission layer. The control layer employs the statistical data recorders to record the variations of the video popularity, link states, and user demands. On the other side, the network forwards user requests and caches data packets in the transmission layer, based on the statistical data which is obtained in the control layer. In addition, the network executes the real-time monitoring of link conditions in the transmission layer, and adjusts the video bit-rate accordingly. Under the above feedback circumstance, we first develop a distributed algorithm of joint dynamic forwarding and caching to theoretically maximize the total user demand rates within the network stability region. Then, we modify the distributed algorithm with a practical caching strategy to make the system applicable to real scenarios. Simulation results show the superior performance of the modified distributed algorithm in terms of low user delay and high QoE performance.

关键词： Information-centric networking (ICN) video streaming distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Device-to-Device-Assisted Communications in Cellular Networks: An Energy Efficient Approach in Downlink Video Sharing Scenario

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2016年第2期15卷 1575-1587页

作者： Shen, Yanyao Jiang, Chunxiao Quek, Tony Q. S. Ren, Yong Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Singapore Univ Technol & Design Singapore 487372 Singapore

Cellular network is widely used and device-to-device (D2D)-assisted approaches have been proposed for improving performance on spectrum efficiency, overall throughput and energy efficiency. However, few of them have considered the downlink transmission for multiple concurrent devices from an energy efficiency perspective. In this paper, we focus on a D2D-assisted cellular communication in video stream sharing scenario. Two energy saving solutions for downlink transmission are proposed with constraint on D2D cluster's energy consumption. We take peak signal-to-noise ratio (PSNR) as the measurement for video quality and consider both the downlink transmission energy and reception energy. In particular, we propose the D2D cluster formation approach and the D2D caching performance both for the purpose of energy saving, with distributed merge-and-split algorithm adopted from the perspective of coalition game theory and a relaxation factor defined to give constraints on total energy consumption for each cluster. Both D2D cluster and D2D caching approaches are effective for energy saving for the BS combined with all user devices;however, D2D cluster brings an unfairness problem between the cluster head and other cluster nodes. Therefore, we compare the two approaches on energy saving performance as well as fairness measurement. Moreover, a centralized algorithm for D2D cluster is also proposed as a benchmark for the distributed D2D cluster algorithm. Simulation result shows considerable amount of energy saving in the proposed D2D cluster and caching assisted cellular network for video stream sharing problem.

关键词： Downlink transmission energy saving D2D cluster D2D caching distributed algorithm video transmission

来源：评论

学校读者我要写书评

暂无评论

A New Approach for Stability Maintenance of Wireless Control Network

A New Approach for Stability Maintenance of Wireless Control...

引用

International Conference on Energy, Communication, Data Analytics and Soft Computing

作者： Bhagyashri Dhondiram Bhalekar Dilip K. Budhwant Department of computer science and engineering MGM'S JNEC

ISBN: (纸本)9781538618882

Problem of instability of wireless control network has been studying from many years using computation of in network method. Architecture known as "Wireless Control Network"(WCN) in which each node in network maintain its own state and simultaneously update combination of output of neighboring node and node's own state, but this network has been shown to have little computational overhead, information loss, inflexibility of network, delay while sending and receiving data, security problem, scheduling problem. To overcome these problems, this paper represents fundamental topological conditions of network. For achieving this goal, "Liner iterative strategy" is used. So that wireless control network acts as linear dynamic network and analyze coupling between plants dynamic and network dynamic. Control input calculated if connectivity of vertex of network is larger than Eigen value of network. This is similar to min-cut condition which is required to problem of dissemination of information. Paper also represent conditions for stability of point to point network.

关键词： Wireless control network Network coding Sensor Actuator Controller Linear iterative strategy Network dynamic distributed algorithm Internal state Eigen values In-network stabilization Stability of network Time step

来源：评论

学校读者我要写书评

暂无评论

Robust power optimization scheme for cooperative wireless relay system in smart city

引用

SOFTWARE-PRACTICE & EXPERIENCE 2017年第8期47卷 1045-1059页

作者： Liu, Zhixin Zhang, Peng Lam, Hak-Keung Chan, Kit Yan Ma, Kai Yanshan Univ Inst Elect Engn Qinhuangdao 066004 Peoples R China Kings Coll London Dept Informat London WC2R 2LS England Curtin Univ Dept Elect & Comp Engn Perth WA Australia

Ultra dense deployment of base stations is one of most significant features in smart city communication networks. Aiming at the large-scale wireless communication issue in smart city, we propose a distributed robust power allocation scheme with proportional fairness for cooperative orthogonal frequency-division-multiple-access relay network. With the amplify-and-forward relay mode, all of the relays assist the information transmission simultaneously on orthogonal subcarriers. Considering the uncertainty of channel gains, first we aim at achieving the maximum utility subject to the constraints of outage probability threshold and power bound. Subsequently, the problem is transformed to a solvable convex optimization problem with determination constraints. The dual-decomposition method is applied to solve the formulated optimization problem. To reduce the information exchange of the whole system, we propose a computationally efficient distributed iteration algorithm. Numerical results reveal the effectiveness of the proposed robust optimization algorithm. Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： smart city communication power allocation relay cooperation robust control distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Approaching Optimal Centralized Scheduling With CSMA-Based Random Access Over Fading Channels

引用

IEEE COMMUNICATIONS LETTERS 2016年第6期20卷 1183-1186页

作者： Karaca, Mehmet Landfeldt, Bjorn Lund Univ Dept Elect & Informat Technol S-22100 Lund Sweden

Carrier sense multiple access (CSMA) based distributed algorithms can attain the largest capacity region as the centralized Max-Weight policy does. Despite their capability of achieving throughput optimality, these algorithms can either incur large delay and have large complexity or only operate over non-fading channels. In this letter, by assuming arbitrary backoff time, we first propose a fully distributed randomized algorithm whose performance can be pushed to the performance of the centralized Max-Weight policy not only in terms of throughput but also in terms of delay for completely connected interference networks with fading channels. Then, inspired by the proposed algorithm, we introduce an implementable distributed algorithm for practical networks with a reservation scheme. We show that the proposed practical algorithm can still achieve the performance of the centralized Max-Weight policy.

关键词： Max-Weight scheduling CSMA queue stability distributed algorithm fading channels

来源：评论

学校读者我要写书评

暂无评论

From division of labor to the collective behavior of social insects

引用

BEHAVIORAL ECOLOGY AND SOCIOBIOLOGY 2016年第7期70卷 1101-1108页

作者： Gordon, Deborah M. Stanford Univ Dept Biol Stanford CA 94305 USA

'Division of labor' is a misleading way to describe the organization of tasks in social insect colonies, because there is little evidence for persistent individual specialization in task. Instead, task allocation in social insects occurs through distributed processes whose advantages, such as resilience, differ from those of division of labor, which are mostly based on learning. The use of the phrase 'division of labor' persists for historical reasons, and tends to focus attention on differences among individuals in internal attributes. This focus distracts from the main questions of interest in current research, which require an understanding of how individuals interact with each other and their environments. These questions include how colony behavior is regulated, how the regulation of colony behavior develops over the lifetime of a colony, what are the sources of variation among colonies in the regulation of behavior, and how the collective regulation of colony behavior evolves.

关键词： Task allocation distributed algorithm Social insects Collective behavior

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：